{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T03:23:08Z","timestamp":1778556188839,"version":"3.51.4"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T00:00:00Z","timestamp":1183248000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sc. China"],"published-print":{"date-parts":[[2007,7]]},"DOI":"10.1007\/s11704-007-0026-z","type":"journal-article","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T15:36:08Z","timestamp":1188401768000},"page":"247-271","source":"Crossref","is-referenced-by-count":28,"title":["Search an unsorted database with quantum mechanics"],"prefix":"10.1007","volume":"1","author":[{"given":"Guilu","family":"Long","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5300","key":"26_CR1","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1126\/science.275.5300.627","volume":"275","author":"G. Brassard","year":"1997","unstructured":"Brassard G. Searching a quantum phone book. Science, 1997, 275(5300): 627\u2013628","journal-title":"Science"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Brassard G, Hoyer P. An exact quantum polynomial-time algorithm for Simon\u2019s problem. In: Proceedings of 35th Annual Symposium on the Foundations of Computer Sciences. 1997, 116\u2013123","DOI":"10.1109\/ISTCS.1997.595153"},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1007\/BFb0055105","volume":"1443","author":"G. Brassard","year":"1998","unstructured":"Brassard G, Hoyer P, Tapp A. Quantum counting. Lecture Notes in Computer Science, 1998, 1443: 820\u2013831","journal-title":"Lecture Notes in Computer Science"},{"key":"26_CR4","first-page":"1","volume-title":"Quantum computation and information","author":"P. Benioff","year":"2000","unstructured":"Benioff P. Space searches with a quantum robot. In: Quantum computation and information. Washington DC: AMS Series on Contemporary Mathematics, 2000, 305: 1\u201312. See also in e-print quant-ph\/0003006"},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"8973","DOI":"10.1088\/0305-4470\/33\/48\/325","volume":"33","author":"J. J. Twamley","year":"2000","unstructured":"Twamley J J. A hidden shift quantum algorithm. J. Phys. A, 2000, 33: 8973\u20138979","journal-title":"J. Phys. A"},{"issue":"4","key":"26_CR6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1088\/0253-6102\/35\/4\/385","volume":"35","author":"H. Guo","year":"2001","unstructured":"Guo H, Long G L, Sun Y. A quantum Algorithm for Finding a Hamilton Circuit. Commun. Theor. Phys., 2001, 35(4): 385\u2013388","journal-title":"Commun. Theor. Phys."},{"issue":"4","key":"26_CR7","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1088\/0253-6102\/37\/4\/424","volume":"37","author":"H. Guo","year":"2002","unstructured":"Guo H, Long G L, Li F, Quantum algorithms for some well-known NP problems. Commun. Theor. Phys. 2002, 37(4): 424\u2013426","journal-title":"Commun. Theor. Phys."},{"key":"26_CR8","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0020-0190(76)90071-5","volume":"5","author":"A. C. Yao","year":"1976","unstructured":"Yao A C, Bentley J. An almost optimal algorithm for unbounded searching. Information Processing Letters, 1976, 5: 82\u201387","journal-title":"Information Processing Letters"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Yao A C, Yao F F. The complexity of searching an ordered random table. In: Proceedings of 17th IEEE Symposium on Foundations of Computer Science. Houston, Texas: 1976, 222\u2013227","DOI":"10.1109\/SFCS.1976.32"},{"key":"26_CR10","first-page":"124","volume-title":"Proceedings of the Symposium on the Foundations of computer Science","author":"P. W. Shor","year":"1994","unstructured":"Shor P W. Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the Symposium on the Foundations of computer Science. New York: IEEE Computer Society Press, 1994, 124\u2013134"},{"key":"26_CR11","first-page":"212","volume-title":"Proceedings of 28th Annual ACM Symposium on Theory of Computing","author":"L. K. Grover","year":"1996","unstructured":"Grover L K. A fast quantum mechanical algorithm for database search. In: Proceedings of 28th Annual ACM Symposium on Theory of Computing. New York: ACM, 1996, 212\u2013219"},{"issue":"2","key":"26_CR12","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"L. K. Grover","year":"1997","unstructured":"Grover L K. Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett., 1997, 79(2): 325\u2013328","journal-title":"Phys. Rev. Lett."},{"issue":"1907","key":"26_CR13","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"D. Deutsch","year":"1992","unstructured":"Deutsch D, Jozsa R. Rapid Solution of Problems by Quantum Computation. Proc. R. Soc. London A, 1992, 439(1907): 553\u2013558","journal-title":"Proc. R. Soc. London A"},{"key":"26_CR14","unstructured":"Sun X M, Yao A C, Zhang S Y. Graph properties and circular functions: how low can quantum query complexity go? In: Proceedings of 19th IEEE Conference on Computational Complexity. Amherst, Massachusetts: 2004, 286\u2013293"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Sun X M, Yao A C. On the quantum query complexity of local search in two and three dimensions. In: Proceedings of 47th Annual IEEE Symposium on Foundations of Computer Science. Berkeley, CA: 2006, 429\u2013438","DOI":"10.1109\/FOCS.2006.57"},{"issue":"1\u20132","key":"26_CR16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0020-0190(00)00069-7","volume":"75","author":"Y. Y. Shi","year":"2000","unstructured":"Shi Y Y. Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables. Information Processing Letters, 2000, 75(1\u20132):79\u201383","journal-title":"Information Processing Letters"},{"issue":"4","key":"26_CR17","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s00453-002-0976-3","volume":"34","author":"P. Hoyer","year":"2002","unstructured":"Hoyer P, Neerbek J, Shi Y Y. Quantum complexities of ordered searching, sorting, and element distinctness. Algorithmica, 2002, 34(4): 429\u2013448","journal-title":"Algorithmica"},{"issue":"3","key":"26_CR18","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1088\/0253-6102\/32\/3\/335","volume":"32","author":"G. L. Long","year":"1999","unstructured":"Long G L, Zhang W L, Li Y S, et al. Arbitrary phase rotation of the marked state can not be used for Grover\u2019s quantum search algorithm. Commun. Theor. Phys., 1999, 32(3): 335\u2013338","journal-title":"Commun. Theor. Phys."},{"key":"26_CR19","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0375-9601(99)00631-3","volume":"262","author":"G. L. Long","year":"1999","unstructured":"Long G L, Li Y S, Zhang W L, et al. Phase matching in quantum searching. Phys. Lett. A, 1999, 262: 27\u201334","journal-title":"Phys. Lett. A"},{"key":"26_CR20","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1088\/0305-4470\/34\/4\/312","volume":"34","author":"G. L. Long","year":"2001","unstructured":"Long G L, Tu C C, Li Y S, et al. An S0(3) picture for quantum searching. Journal of Physics A, 2001, 34: 861\u2013866. See also in e-print quant-ph\/9911004","journal-title":"Journal of Physics A"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Long G L. Grover algorithm with zero theoretical failure rate. Phys. Rev. A, 2002, 64(2): 022307","DOI":"10.1103\/PhysRevA.64.022307"},{"issue":"19","key":"26_CR22","doi-asserted-by":"crossref","first-page":"4330","DOI":"10.1103\/PhysRevLett.80.4329","volume":"80","author":"L. K. Grover","year":"1998","unstructured":"Grover L K. Quantum computers can search rapidly by using almost any transformation. Phys. Rev. Lett., 1998, 80(19): 4330\u20134332","journal-title":"Phys. Rev. Lett."},{"key":"26_CR23","first-page":"36","volume-title":"Proceedings of the Fourth Workshop on Physics and Computation","author":"M. Boyer","year":"1996","unstructured":"Boyer M, Brassard G, Hoyer P, et al. Tight bounds on quantum searching. In: Proceedings of the Fourth Workshop on Physics and Computation. New England: Complex Systems Institute, 1996, 36\u201343. See also in e-print quant-ph\/9605034"},{"key":"26_CR24","doi-asserted-by":"crossref","unstructured":"Brassard G, Hoyer P, Mosca M, et al. Quantum amplitude amplification and estimation. AMS Contemporary Mathematics Series, eds. S. J. Lomonaco and H. E. Brandt, AMS(Providence), 2002, 305: 53\u201384. See also in e-print quant-ph\/0005055","DOI":"10.1090\/conm\/305\/05215"},{"key":"26_CR25","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0375-9601(02)00055-5","volume":"294","author":"G. L. Long","year":"2002","unstructured":"Long G L, Xiao L and Sun Y. Phase matching condition for quantum search with a generalized quantum database. Phys. Lett. A, 2002, 294: 143\u2013152. See also in e-print quant-ph\/0107013","journal-title":"Phys. Lett. A"},{"key":"26_CR26","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/3-540-49208-9_10","volume":"1509","author":"D. Biron","year":"1999","unstructured":"Biron D, Biham O, Biham E, et al. Generalized Grover search algorithm for arbitrary initial amplitude distribution. Lecture Notes in Computer Science, 1999, 1509: 140\u2013147. See also in e-print quart-ph\/9801066","journal-title":"Lecture Notes in Computer Science"},{"issue":"2","key":"26_CR27","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1088\/0253-6102\/48\/2\/013","volume":"48","author":"B. Shang","year":"2007","unstructured":"Shang B. Query complexity for searching multiple marked states from an unsorted database. Commun. Theor. Phys. 2007, 48(2): 264\u2013266. See also in e-print quart-ph\/0604059","journal-title":"Commun. Theor. Phys."},{"key":"26_CR28","doi-asserted-by":"crossref","unstructured":"Biron E, Biham O, Biron D, et al. Analysis of generalized Grover quantum search algorithms using recursion equations. Phys. Rev. A, 2001, 63(1): 012310","DOI":"10.1103\/PhysRevA.63.012310"},{"key":"26_CR29","unstructured":"Zalka C. A Grover-based quantum search of optimal order for an unknown number of marked elements. e-print quart-ph\/9902049"},{"key":"26_CR30","volume-title":"Group theory","author":"Q. Z. Han","year":"1987","unstructured":"Han Q Z, Sun H Z. Group theory. Beijing: Peking University Press, 1987"},{"key":"26_CR31","doi-asserted-by":"crossref","unstructured":"Long G L, Sun Y. Efficient scheme for initializing a quantum register with an arbitrary superposed state. Phys. Rev. A, 2001, 64(1): 014303","DOI":"10.1103\/PhysRevA.64.014303"},{"key":"26_CR32","doi-asserted-by":"crossref","unstructured":"Hoyer P. Arbitrary phases in quantum amplitude amplification. Phys. Rev. A, 2000, 62(5): 052304","DOI":"10.1103\/PhysRevA.62.052304"},{"key":"26_CR33","doi-asserted-by":"crossref","unstructured":"Long G L, Li Y S, Zhang W L, et al. Dominant gate imperfection in Grover\u2019s quantum search algorithm. Phys. Rev. A, 2000, 61(4): 042305","DOI":"10.1103\/PhysRevA.61.042305"},{"key":"26_CR34","doi-asserted-by":"crossref","unstructured":"Niwa J, Matsumoto K, Imai H. General-purpose parallel simulator for quantum computing. Phys. Rev. A, 2002, 66(6): 062317","DOI":"10.1103\/PhysRevA.66.062317"},{"key":"26_CR35","doi-asserted-by":"crossref","unstructured":"Shenvi N, Brown K R, Whaley K B. Effects of a random noisy oracle on search algorithm complexity. Phys. Rev. A, 2003, 68(5): 052313","DOI":"10.1103\/PhysRevA.68.052313"},{"key":"26_CR36","doi-asserted-by":"crossref","unstructured":"Li D F, Li X X, Huang H T, et al. Invariants of Grovers algorithm and the rotation in space, Phys. Rev. A, 2002, 66(4): 044304","DOI":"10.1103\/PhysRevA.66.044304"},{"key":"26_CR37","first-page":"304","volume":"287","author":"D. F. Li","year":"2001","unstructured":"Li D F, Li X X. More general quantum search algorithm Q = \u2212 I \u03b3 VI \u03c4 U and the precise formula for the amplitude and the non-symmetric effects of different rotating angles. Phys. Rev. A, 2001, 287:304\u2013316","journal-title":"Phys. Rev. A"},{"key":"26_CR38","doi-asserted-by":"crossref","unstructured":"Wu X D, Long G L. Verifier-based algorithm for unsorted database search problem. Int. J. Quant. Inf. (to appear)","DOI":"10.1142\/S0219749907003067"},{"key":"26_CR39","doi-asserted-by":"crossref","first-page":"1689","DOI":"10.1016\/S0960-0779(98)00224-0","volume":"10","author":"D. P. Chi","year":"1999","unstructured":"Chi D P, Kim J. Quantum database search with certainty by a single query. Chaos Solitons Fractals, 1999, 10: 1689\u20131693. See also in e-print quant-ph\/9708005","journal-title":"Chaos Solitons Fractals"},{"issue":"5","key":"26_CR40","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1088\/0253-6102\/45\/5\/013","volume":"45","author":"G. L. Long","year":"2006","unstructured":"Long G L. General quantum interference principle and duality computer. Commun. Theor. Phys., 2006, 45(5): 825\u2013844","journal-title":"Commun. Theor. Phys."},{"issue":"1","key":"26_CR41","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s11128-006-0040-3","volume":"6","author":"S. Gudder","year":"2007","unstructured":"Gudder S. Mathematical theory of duality quantum computers. Quantum Information Processing, 2007, 6(1): 49\u201354","journal-title":"Quantum Information Processing"},{"issue":"1","key":"26_CR42","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s11128-006-0040-3","volume":"6","author":"G. L. Long","year":"2007","unstructured":"Long G L. Mathematical theory of duality computer in the density matrix formalism. Quantum Information Processing, 2007, 6(1): 37\u201348","journal-title":"Quantum Information Processing"},{"key":"26_CR43","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1098\/rspa.1989.0099","volume":"425","author":"D. Deutsch","year":"1989","unstructured":"Deutsch D. Quantum computational networks. Proc. R. Soc. Lond. A, 1989, 425: 73\u201390","journal-title":"Proc. R. Soc. Lond. A"},{"issue":"5","key":"26_CR44","doi-asserted-by":"crossref","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A. Barenco","year":"1996","unstructured":"Barenco A, Bennett C H, Cleve R, et al. Elementary gates for quantum computation. Phys. Rev. A, 1996, 52(5): 3457\u20133467","journal-title":"Phys. Rev. A"},{"key":"26_CR45","unstructured":"Gudder S. Duality quantum computers and quantum operations. University of Denver, 2006, M06\/11"},{"issue":"15","key":"26_CR46","doi-asserted-by":"crossref","first-page":"150501","DOI":"10.1103\/PhysRevLett.95.150501","volume":"95","author":"L. K. Grover","year":"2005","unstructured":"Grover L K. Fixed-point quantum search. Phys. Rev. Lett., 2005, 95(15): 150501","journal-title":"Phys. Rev. Lett."},{"issue":"4","key":"26_CR47","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.physleta.2006.10.030","volume":"362","author":"D. F. Li","year":"2007","unstructured":"Li D F, Li X R, Huang H T, et al. Fixed-point quantum search for different phase shifts. Phys. Lett. A 2007, 362(4): 260\u2013264","journal-title":"Phys. Lett. A"},{"key":"26_CR48","unstructured":"Long G L and Liu Y. Duality mode and recycling computing in a quantum computer. to be submitted"},{"issue":"3","key":"26_CR49","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1088\/0253-6102\/47\/3\/019","volume":"47","author":"W. Y. Wang","year":"2007","unstructured":"Wang W Y, Shang B, Wang C, et al. Prime factorization in the duality computer. Commun. Theor.Phys., 2007, 47(3): 471\u2013473","journal-title":"Commun. Theor.Phys."},{"issue":"5","key":"26_CR50","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"C. H. Bennett","year":"1997","unstructured":"Bennett C H, Bernstein E, Brassard G, et al. Strengths and weaknesses of quantum computing. SIAM J. Comput., 1997, 26(5): 1510\u20131523","journal-title":"SIAM J. Comput."},{"issue":"4","key":"26_CR51","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1002\/jccs.200100067","volume":"48","author":"H. Guo","year":"2001","unstructured":"Guo H, Long G L, Sun Y. Effects of imperfect gate operations in Shor\u2019s prime factorization algorithm. J. Chin. Chem. Soc., 2001, 48(4): 449\u2013454","journal-title":"J. Chin. Chem. Soc."},{"key":"26_CR52","doi-asserted-by":"crossref","unstructured":"Wei L F, Li Xiao, Hu X D, et al. Effects of dynamical phases in Shor\u2019s factoring algorithm with operational delays. Phys. Rev. A, 2005, 71(3): 022317","DOI":"10.1103\/PhysRevA.71.022317"},{"issue":"2","key":"26_CR53","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1140\/epjd\/e2006-00046-x","volume":"38","author":"O. V. Zhirov","year":"2006","unstructured":"Zhirov O V, Shepelyansky D L. Dissipative decoherence in the Grover algorithm. Eur. Phys. J. D, 2006, 38(2): 405\u2013408","journal-title":"Eur. Phys. J. D"},{"issue":"6","key":"26_CR54","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1007\/s11390-006-0927-6","volume":"21","author":"Q. Ai","year":"2006","unstructured":"Ai Q, Li Y S, Long G L. Influence of gate operation errors in the quantum counting algorithm. J. Comput. Sci. and Technol., 2006(6), 21: 927\u2013932","journal-title":"J. Comput. Sci. and Technol."},{"issue":"22","key":"26_CR55","doi-asserted-by":"crossref","first-page":"4815","DOI":"10.1103\/PhysRevLett.85.4815","volume":"85","author":"R. Bruschweiler","year":"2000","unstructured":"Bruschweiler R. Novel strategy for database searching in spin Liouville space by NMR ensemble computing. Phys. Rev. Lett., 2000, 85(22): 4815\u20134818","journal-title":"Phys. Rev. Lett."},{"key":"26_CR56","doi-asserted-by":"crossref","unstructured":"Xiao L, Long G L. Fetching marked items from an unsorted database using NMR ensemble computing. Phys. Rev. A, 2002, 66(5): 052320","DOI":"10.1103\/PhysRevA.66.052320"},{"key":"26_CR57","doi-asserted-by":"crossref","unstructured":"Long G L, Xiao L. Parallel quantum computing in a single ensemble quantum computer. Phys. Rev. A, 2004, 69(6): 052303","DOI":"10.1103\/PhysRevA.69.052303"},{"issue":"16","key":"26_CR58","doi-asserted-by":"crossref","first-page":"8473","DOI":"10.1063\/1.1611177","volume":"119","author":"G. L. Long","year":"2003","unstructured":"Long G L, Xiao L. Experimental realization of a fetching algorithm in a 7-qubit NMR Liouville space computer. J. Chem. Phys., 2003, 119(16): 8473\u20138481","journal-title":"J. Chem. Phys."},{"issue":"23","key":"26_CR59","doi-asserted-by":"crossref","first-page":"4709","DOI":"10.1103\/PhysRevLett.79.4709","volume":"79","author":"L. K. Grover","year":"1997","unstructured":"Grover L K. Quantum computers can search arbitrarily large databases by a single query. Phys. Rev. Lett., 1997, 79(23): 4709\u20134712","journal-title":"Phys. Rev. Lett."},{"key":"26_CR60","doi-asserted-by":"crossref","unstructured":"Gingrich R M, Williams C P and Cerf N J. Generalized quantum search with parallelism. Phys. Rev. A, 2000, 61(5): 052313","DOI":"10.1103\/PhysRevA.61.052313"},{"key":"26_CR61","doi-asserted-by":"crossref","unstructured":"Collins D. Modified Grover\u2019s algorithm for an expectation-value quantum computer. Phys. Rev. A, 2002, 65(5): 052321","DOI":"10.1103\/PhysRevA.65.052321"},{"issue":"24","key":"26_CR62","doi-asserted-by":"crossref","first-page":"L399","DOI":"10.1088\/0305-4470\/36\/24\/104","volume":"36","author":"V. Protopopescu","year":"2003","unstructured":"Protopopescu V, D\u2019Helon C, Barhen J, Constant-time solution to the global optimization problem using Bruschweiler\u2019s ensemble search algorithm. Journal of Physics A-Mathematical and General 2003, 36(24): L399\u2013L407","journal-title":"Journal of Physics A-Mathematical and General"},{"issue":"7","key":"26_CR63","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1002\/prop.200510300","volume":"54","author":"C. C. Hsueh","year":"2006","unstructured":"Hsueh C C, Chen C Y, Constant-time solution to database searching by NMR ensemble computing. Fortschritte der Physik-Progress of Physics 2006, 54(7): 519\u2013524","journal-title":"Fortschritte der Physik-Progress of Physics"},{"key":"26_CR64","doi-asserted-by":"crossref","unstructured":"SaiToh A, Kitagawa M, Matrix-product-state simulation of an extended Bruschweiler bulk-ensemble database search. Phys. Rev. A 2006, 73(6): 062332","DOI":"10.1103\/PhysRevA.73.062332"},{"key":"26_CR65","doi-asserted-by":"crossref","unstructured":"Mehring M, Muller K, Averbukh I S, et al. NMR experiment factors numbers with Gauss sums. Phys. Rev. Lett. 2007, 98(12): 120502","DOI":"10.1103\/PhysRevLett.98.120502"},{"issue":"12","key":"26_CR66","doi-asserted-by":"crossref","first-page":"3039","DOI":"10.1088\/1009-1963\/15\/12\/044","volume":"15","author":"C. Y. Pang","year":"2006","unstructured":"Pang C Y, Zhou Z W, Guo G C. A hybrid quantum encoding algorithm of vector quantization for image compression. Chinese Physics, 2006, 15(12): 3039\u20133043","journal-title":"Chinese Physics"},{"issue":"2","key":"26_CR67","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1016\/j.amc.2005.05.051","volume":"174","author":"C. Y. Chen","year":"2006","unstructured":"Chen C Y, Hsueh C C. Quantum factorization algorithm by NMR ensemble computers. Applied Mathematics and Computation, 2006, 174(2): 1363\u20131369","journal-title":"Applied Mathematics and Computation"},{"issue":"6683","key":"26_CR68","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1038\/30687","volume":"393","author":"J. A. Jones","year":"1998","unstructured":"Jones J A, Mosca M, Hansen R H. Implementation of a quantum search algorithm on a quantum computer. Nature, 1998, 393(6683): 344\u2013346","journal-title":"Nature"},{"issue":"15","key":"26_CR69","doi-asserted-by":"crossref","first-page":"3408","DOI":"10.1103\/PhysRevLett.80.3408","volume":"80","author":"I. L. Chuang","year":"1998","unstructured":"Chuang I L, Gershenfeld N, Kubinec M. Experimental implementation of fast quantum searching. Phys. Rev. Lett., 1998, 80(15): 3408\u20133411","journal-title":"Phys. Rev. Lett."},{"issue":"5","key":"26_CR70","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1063\/1.125846","volume":"76","author":"L. M. K. Vandersypen","year":"2000","unstructured":"Vandersypen L M K, Steffen M, Sherwood M H, et al. Implementation of a three-quantum-bit search algorithm. Appl. Phys. Lett., 2000, 76(5): 646\u2013648","journal-title":"Appl. Phys. Lett."},{"issue":"7","key":"26_CR71","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1088\/1009-1963\/12\/7\/302","volume":"12","author":"J. F. Zhang","year":"2003","unstructured":"Zhang J F, Lu Z H, Deng Z W, et al. NMR analogue of the generalized Grovers algorithm of multiple marked states and its application. Chinese Physics, 2003, 12(7): 700\u2013707","journal-title":"Chinese Physics"},{"key":"26_CR72","doi-asserted-by":"crossref","unstructured":"Zhang J F, Lu Z H, Shan L, et al. Synthesizing NMR analogs of Einstein-Podolsky-Rosen states using the generalized Grover\u2019s algorithm. Phys. Rev. A, 2002, 66(4): 044308","DOI":"10.1103\/PhysRevA.66.044308"},{"issue":"2\u20133","key":"26_CR73","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1080\/09500340008244040","volume":"47","author":"P. G. Kwiat","year":"2000","unstructured":"Kwiat P G, Mitchell J R, Schwindt P D D, et al. Grover\u2019s search algorithm: an optical approach. J. Mod. Optics, 2000, 47(2\u20133): 257\u2013266","journal-title":"J. Mod. Optics"},{"issue":"2\u20133","key":"26_CR74","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0375-9601(01)00416-9","volume":"286","author":"G. L. Long","year":"2001","unstructured":"Long G L, Yan H Y, Li Y S, et al. Experimental NMR realization of a generalized quantum search algorithm. Phys. Lett. A, 2001, 286(2\u20133): 121\u2013126","journal-title":"Phys. Lett. A"},{"key":"26_CR75","doi-asserted-by":"crossref","unstructured":"Bhattacharya N, van den Heuvell HBV, Spreeuw RJC. Implementation of quantum search algorithm using classical Fourier optics. Phys. Rev. Lett., 2002, 88(13): 137901","DOI":"10.1103\/PhysRevLett.88.137901"},{"issue":"7","key":"26_CR76","doi-asserted-by":"crossref","first-page":"3310","DOI":"10.1063\/1.1494784","volume":"117","author":"L. Xiao","year":"2002","unstructured":"Xiao L, Long G L, Yan H Y, et al. Experimental realization of the Bruschweiler\u2019s algorithm in a homonuclear system. J. Chem. Phys., 2002, 117(7): 3310\u20133315","journal-title":"J. Chem. Phys."},{"key":"26_CR77","doi-asserted-by":"crossref","unstructured":"Yang X D, Wei D X, Luo J, et al. Modification and realization of Bruschweiler\u2019s search. Phys. Rev. A, 2002, 66(4): 042305","DOI":"10.1103\/PhysRevA.66.042305"}],"container-title":["Frontiers of Computer Science in China"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-007-0026-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-007-0026-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-007-0026-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T21:00:44Z","timestamp":1559422844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-007-0026-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7]]},"references-count":77,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,7]]}},"alternative-id":["26"],"URL":"https:\/\/doi.org\/10.1007\/s11704-007-0026-z","relation":{},"ISSN":["1673-7350","1673-7466"],"issn-type":[{"value":"1673-7350","type":"print"},{"value":"1673-7466","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7]]}}}