A fast quantum mechanical algorithm for database search

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A fast quantum mechanical algorithm for database search

Full text

Pdf (660 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-eighth annual ACM symposium on Theory of computing table of contents

Philadelphia, Pennsylvania, United States

Pages: 212 - 219

Year of Publication: 1996

ISBN:0-89791-785-5

Author

Lov K. Grover

3C-404A, AT&T Bell Labs, 600 Mountain Avenue, Murray Hill, NJ

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 24, Downloads (12 Months): 205, Citation Count: 155

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/237814.237866 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	BBBV94	C.H. Bennett, E. Bemstein, G. Brassard and U.Vazirani, Strengths and weaknesses of quantum computing, preprint, 1994.
	BB92	A. Berthiaume and G. Brassard, The quantum challenge to structural complexity theory, Proceedings 7th IEEE Conference on Structure in Complexity Theory, 1992, pp. 132-137.
	Benioff80	P. Benioff, The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines, Journal of Statistical Physics, 22, pp. 563-591.
	BV93	Ethan Bernstein , Umesh Vazirani, Quantum complexity theory, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.11-20, May 16-18, 1993, San Diego, California, United States [doi>10.1145/167088.167097]
	Deutsch85	D. Deutsch, Quantum Theory, the Church-Turing principle and the universal quantum computer, Proceedings Royal Society London Ser. A, 400, pp. 96-117.
	DJ92	D. Deutsch and R. Jozsa, Rapid solution of problems by quantum computation, Proceedings Royal Society of London, A400, pp. 73-90.
	MVV87	K. Mulmuley , U. V. Vazirani , V. V. Vazirani, Matching is as easy as matrix inversion, Combinatorica, v.7 n.1, p.105-113, Jan. 1987 [doi>10.1007/BF02579206]
	Penrose89	Roger Penrose, The emperor's new mind: concerning computers, minds, and the laws of physics, Oxford University Press, Inc., New York, NY, 1989
	Penrose94	R. Penrose, Shadows of the mind,. Oxford University Press, 1994, pp. 348- 388.
	Shor94	P.W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proceedings, 35th Annual Symposium on Fundamentals of Computer Science (FOCS), 1994, pp. 124- 134.
	Shor95	P.W. Shot, Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A, Vol. 52, October 1995, pp. 2493-2496.
	Simon94	D. Simon, On the power of quantum computation, Proceedings, 35th Annual Symposium on Fundamentals of Computer Science (FOCS), 1994, pp. 116- 123.
	VV86	L. G. Valiant , V. V. Vazirani, NP is as easy as detecting unique solutions, Theoretical Computer Science, v.47 n.1, p.85-93, Nov. 1986
	Yao93	A. Yao, Quantum circuit complexity, Proceedings 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993, pp. 352-361.

CITED BY 155

	Mark Oskin , Frederic T. Chong , Isaac L. Chuang , John Kubiatowicz, Building quantum wires: the long and the short of it, ACM SIGARCH Computer Architecture News, v.31 n.2, May 2003
	An introduction to quantum computing for non-physicists, ACM Computing Surveys (CSUR), v.32 n.3, p.300-335, Sept. 2000
	Masami Amano , Kazuo Iwama, Undecidability on quantum finite automata, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.368-375, May 01-04, 1999, Atlanta, Georgia, United States
	Leslie G. Valiant, Quantum computers that can be simulated classically in polynomial time, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.114-123, July 2001, Hersonissos, Greece
	Lov K. Grover, A framework for fast quantum mechanical algorithms, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.53-62, May 24-26, 1998, Dallas, Texas, United States
	Robert Beals , Harry Buhrman , Richard Cleve , Michele Mosca , Ronald de Wolf, Quantum lower bounds by polynomials, Journal of the ACM (JACM), v.48 n.4, p.778-797, July 2001
	Harry Buhrman , Ronald de Wolf, Complexity measures and decision tree complexity: a survey, Theoretical Computer Science, v.288 n.1, p.21-43, 9 October 2002
	Ashwin Nayak , Felix Wu, The quantum query complexity of approximating the median and related statistics, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.384-393, May 01-04, 1999, Atlanta, Georgia, United States
	Hartmut Klauck, On quantum and probabilistic communication: Las Vegas and one-way protocols, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.644-651, May 21-23, 2000, Portland, Oregon, United States
	Harry Buhrman , Lance Fortnow , Ilan Newman , Hein Röhrig, Quantum property testing, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14, 2003, Baltimore, Maryland
	Lov K. Grover, Rapid sampling though quantum computing, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.618-626, May 21-23, 2000, Portland, Oregon, United States
	Dean Copsey , Mark Oskin , Tzvetan Metodiev , Frederic T. Chong , Isaac Chuang , John Kubiatowicz, The effect of communication costs in solid-state quantum computing architectures, Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, June 07-09, 2003, San Diego, California, USA
	Michele Mosca, Counting by quantum eigenvalue estimation, Theoretical Computer Science, v.264 n.1, p.139-153, 08/06/2001
	Tetsuro Nishino, Mathematical models of quantum computation, New Generation Computing, v.20 n.4, p.317-337, October 2002
	Andris Ambainis, Quantum lower bounds by quantum arguments, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.636-643, May 21-23, 2000, Portland, Oregon, United States
	Andris Ambainis , Eric Bach , Ashwin Nayak , Ashvin Vishwanath , John Watrous, One-dimensional quantum walks, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.37-49, July 2001, Hersonissos, Greece
	Andris Ambainis , John Watrous, Two-way finite automata with quantum and classical states, Theoretical Computer Science, v.287 n.1, p.299-311, 25 September 2002
	Ronald de Wolf, Quantum communication and complexity, Theoretical Computer Science, v.287 n.1, p.337-353, 25 September 2002
	Hartmut Klauck, Quantum time-space tradeoffs for sorting, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 09-11, 2003, San Diego, CA, USA
	Andris Ambainis, Quantum lower bounds by quantum arguments, Journal of Computer and System Sciences, v.64 n.4, p.750-767, June 2002
	Jerzy Karczmarczuk, Structure and interpretation of quantum mechanics: a functional framework, Proceedings of the 2003 ACM SIGPLAN workshop on Haskell, p.50-61, August 28-28, 2003, Uppsala, Sweden
	Davide Anguita , Sandro Ridella , Fabio Rivieccio , Rodolfo Zunino, Quantum optimization for training support vector machines, Neural Networks, v.16 n.5-6, p.763-770, June 2003
	Arvid J. Bessen, The power of various real-valued quantum queries, Journal of Complexity, v.20 n.5, p.699-712, October 2004
	Kazuo Iwama , Shigeru Yamashita, Transformation rules for CNOT-based quantum circuits and their applications, New Generation Computing, v.21 n.4, p.297-317, April 2003
	Takashi Mihara, Splitting information securely with entanglement, Information and Computation, v.187 n.1, p.110-122, November 25, 2003
	Mark Oskin , Frederic T. Chong , Isaac L. Chuang, A Practical Architecture for Reliable Quantum Computers, Computer, v.35 n.1, p.79-87, January 2002
	Mark Oskin , Frederic T. Chong , Isaac L. Chuang, A Practical Architecture for Reliable Quantum Computers, Computer, v.35 n.1, p.79-87, January 2002
	Harry Buhrman , Richard Cleve , Avi Wigderson, Quantum vs. classical communication and computation, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.63-68, May 24-26, 1998, Dallas, Texas, United States
	Stefan Heinrich , Erich Novak, On a problem in quantum summation, Journal of Complexity, v.19 n.1, p.1-18, February 2003
	Mika Hirvensalo, Quantum computing – Facts and folklore, Natural Computing: an international journal, v.1 n.1, p.135-155, May 2002
	S. Heinrich, Quantum summation with an application to integration, Journal of Complexity, v.18 n.1, p.1-50, March 2002
	Joshua J. Arulanandham , Cristian S. Calude , Michael J. Dinneen, A fast natural algorithm for searching, Theoretical Computer Science, v.320 n.1, p.3-13, 12 June 2004
	Miklos Santha , Mario Szegedy, Quantum and classical query complexities of local search are polynomially related, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, June 13-16, 2004, Chicago, IL, USA
	Andrew M. Steane , Eleanor G. Rieffel, Beyond Bits: The Future of Quantum Information Processing, Computer, v.33 n.1, p.38-45, January 2000
	Andris Ambainis, Quantum algorithms a decade after shor, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, p.111-111, June 13-16, 2004, Chicago, IL, USA
	A. Ambainis, Quantum search algorithms, ACM SIGACT News, v.35 n.2, June 2004
	Bryan C. Jacobs , Todd B. Pittman , James D. Franson, Incremental information extraction from Grover's algorithm, Proceedings of the winter international synposium on Information and communication technologies, January 05-08, 2004, Cancun, Mexico
	Edith Hemaspaandra , Lane A. Hemaspaandra , Marius Zimand, Almost-everywhere superiority for Quantum polynomial time, Information and Computation, v.175 n.2, p.171-181, June 15, 2002
	Howard Barnum , Michael Saks, A lower bound on the quantum query complexity of read-once functions, Journal of Computer and System Sciences, v.69 n.2, p.244-258, September 2004
	Takashi Mihara , Shao Chin Sung, Deterministic polynomial-time quantum algorithms for Simon's problem, Computational Complexity, v.12 n.3-4, p.162-175, September 2004
	Marek Kwas , Henryk Woźniakowski, Sharp error bounds on quantum Boolean summation in various settings, Journal of Complexity, v.20 n.5, p.669-698, October 2004
	Frédéric Magniez , Miklos Santha , Mario Szegedy, Quantum algorithms for the triangle problem, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, January 23-25, 2005, Vancouver, British Columbia
	Richard J. Hughes , Colin P. Williams, Quantum Computing: The Final Frontier?, IEEE Intelligent Systems, v.15 n.5, p.10-18, September 2000
	Mika Hirvensalo, Computing with quanta-impacts of quantum theory on computation, Theoretical Computer Science, v.287 n.1, p.267-298, 25 September 2002
	Bolesław Kacewicz, Randomized and quantum algorithms yield a speed-up for initial-value problems, Journal of Complexity, v.20 n.6, p.821-834, December 2004
	Mihai Udrescu , Lucian Prodan , Mircea Vlǎdutiu, Using HDLs for describing quantum circuits: a framework for efficient quantum algorithm simulation, Proceedings of the 1st conference on Computing frontiers, April 14-16, 2004, Ischia, Italy
	Paul Massey , John A. Clark , Susan Stepney, Evolution of a human-competitive quantum fourier transform algorithm using genetic programming, Proceedings of the 2005 conference on Genetic and evolutionary computation, June 25-29, 2005, Washington DC, USA
	H. Ramesh , V. Vinay, String matching in Õ(√n + √m) quantum time, Journal of Discrete Algorithms, v.1 n.1, p.103-110, February 2003
	Daowen Qiu, Automata theory based on quantum logic: some characterizations, Information and Computation, v.190 n.2, p.179-195, 1 May 2004
	Richard Cleve, The query complexity of order-finding, Information and Computation, v.192 n.2, p.162-171, August 1, 2004
	Colin P. Williams, Quantum Search Algorithms in Science and Engineering, IEEE MultiMedia, v.3 n.2, p.44-51, March 1996
	Kazuo Iwama , Yahiko Kambayashi , Shigeru Yamashita, Transformation rules for designing CNOT-based quantum circuits, Proceedings of the 39th conference on Design automation, June 10-14, 2002, New Orleans, Louisiana, USA
	Kazuo Iwama , Akinori Kawachi, A new quantum claw-finding algorithm for three functions, New Generation Computing, v.21 n.4, p.319-327, April 2003
	Yaoyun Shi, Quantum and classical tradeoffs, Theoretical Computer Science, v.344 n.2-3, p.335-345, 17 November 2005
	Lov K. Grover , Jaikumar Radhakrishnan, Is partial quantum search of a database any easier?, Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, July 18-20, 2005, Las Vegas, Nevada, USA
	Andris Ambainis , Julia Kempe , Alexander Rivosh, Coins make quantum walks faster, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, January 23-25, 2005, Vancouver, British Columbia
	Scott Aaronson , Yaoyun Shi, Quantum lower bounds for the collision and the element distinctness problems, Journal of the ACM (JACM), v.51 n.4, p.595-605, July 2004
	Lance Fortnow, One complexity theorist's view of quantum computing, Theoretical Computer Science, v.292 n.3, p.597-610, 31 January 2003
	Matthias Klusch, Coordination of quantum internet agents, Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, July 25-29, 2005, The Netherlands
	Akinori Kawachi , Hirotada Kobayashi , Takeshi Koshiba , Raymond H. Putra, Universal test for quantum one-way permutations, Theoretical Computer Science, v.345 n.2-3, p.370-385, 22 November 2005
	Harry Buhrman , Robert Špalek, Quantum verification of matrix products, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, p.880-889, January 22-26, 2006, Miami, Florida
	Holger Spakowski , Mayur Thakur , Rahul Tripathi, Quantum and classical complexity classes: separations, collapses, and closure properties, Information and Computation, v.200 n.1, p.1-34, 1 July 2005
	Damien Woods , Thomas J. Naughton, An optical model of computation, Theoretical Computer Science, v.334 n.1-3, p.227-258, 11 April 2005
	Stefan Heinrich, From Monte Carlo to quantum computation, Mathematics and Computers in Simulation, v.62 n.3-6, p.219-230, 3 March 2003
	Scott Aaronson, Guest Column: NP-complete problems and physical reality, ACM SIGACT News, v.36 n.1, March 2005
	Evgeny Dantsin , Vladik Kreinovich , Alexander Wolpert, On quantum versions of record-breaking algorithms for SAT, ACM SIGACT News, v.36 n.4, p.103-108, December 2005
	Mingsheng Ying, A theory of computation based on quantum logic (I), Theoretical Computer Science, v.344 n.2-3, p.134-207, 17 November 2005
	Diana Franklin , Frederic T. Chong, Challenges in reliable quantum computing, Nano, quantum and molecular computing: implications to high level design and validation, Kluwer Academic Publishers, Norwell, MA, 2004
	Mark Adcock , Richard Cleve , Kazuo Iwama , Raymond Putra , Shigeru Yamashita, Quantum lower bounds for the Goldreich-Levin problem, Information Processing Letters, v.97 n.5, p.208-211, 16 March 2006
	Andris Ambainis, Polynomial degree vs. quantum query complexity, Journal of Computer and System Sciences, v.72 n.2, p.220-238, March 2006
	Scott Aaronson, Quantum lower bound for the collision problem, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada
	Paul Massey , John A. Clark , Susan A. Stepney, Human-Competitive Evolution of Quantum Computing Artefacts by Genetic Programming, Evolutionary Computation, v.14 n.1, p.21-40, March 2006
	Alberto Bertoni , Carlo Mereghetti , Beatrice Palano, Some formal tools for analyzing quantum automata, Theoretical Computer Science, v.356 n.1, p.14-25, 5 May 2006
	Byung-Soo Choi , Vladimir E. Korepin, Quantum Partial Search of a Database with Several Target Items, Quantum Information Processing, v.6 n.4, p.243-254, August 2007
	Arti Chamoli , C. M. Bhandari, Groverian Entanglement Measure and Evolution of Entanglement in Search Algorithm for n(= 3, 5)-Qubit Systems with Real Coefficients, Quantum Information Processing, v.6 n.4, p.255-271, August 2007
	Bao Rong Chang , Hsiu-Fen Tsai, Composite of adaptive support vector regression and nonlinear conditional heteroscedasticity tuned by quantum minimization for forecasts, Applied Intelligence, v.27 n.3, p.277-289, December 2007
	Ben W. Reichardt , Robert Spalek, Span-program-based quantum algorithm for evaluating formulas, Proceedings of the 40th annual ACM symposium on Theory of computing, May 17-20, 2008, Victoria, British Columbia, Canada
	Michael Lampis , Kyriakos G. Ginis , Michalis A. Papakyriakou , Nikolaos S. Papaspyrou, Quantum Data and Control Made Easier, Electronic Notes in Theoretical Computer Science (ENTCS), 210, p.85-105, July, 2008
	John Watrous, Zero-knowledge against quantum attacks, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, May 21-23, 2006, Seattle, WA, USA
	Arvid J. Bessen, A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer, Journal of Complexity, v.22 n.5, p.660-675, October 2006
	Lvzhou Li , Daowen Qiu, Determination of equivalence between quantum sequential machines, Theoretical Computer Science, v.358 n.1, p.65-74, 31 July 2006
	Harumichi Nishimura , Masanao Ozawa, Uniformity of quantum circuit families for error-free algorithms, Theoretical Computer Science, v.332 n.1-3, p.487-496, 28 February 2005
	Shengyu Zhang, On the power of Ambainis lower bounds, Theoretical Computer Science, v.339 n.2, p.241-256, 12 June 2005
	Shengyu Zhang, New upper and lower bounds for randomized and quantum local search, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, May 21-23, 2006, Seattle, WA, USA
	Evgeny Dantsin , Alexander Wolpert , Vladik Kreinovich, Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems, Proceedings of the 2006 ACM symposium on Applied computing, April 23-27, 2006, Dijon, France
	Andris Ambainis , Robert Špalek , Ronald de Wolf, A new quantum lower bound method,: with applications to direct product theorems and time-space tradeoffs, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, May 21-23, 2006, Seattle, WA, USA
	François Le Gall, Exponential separation of quantum and classical online space complexity, Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, July 30-August 02, 2006, Cambridge, Massachusetts, USA
	Sean Hallgren , Cristopher Moore , Martin Rötteler , Alexander Russell , Pranab Sen, Limitations of quantum coset states for graph isomorphism, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, May 21-23, 2006, Seattle, WA, USA
	Rodney Van Meter , Mark Oskin, Architectural implications of quantum computing technologies, ACM Journal on Emerging Technologies in Computing Systems (JETC), v.2 n.1, p.31-63, January 2006
	Zhou Rigui , Jiang Nan , Ding Qiulin, Model and Training of QNN with Weight, Neural Processing Letters, v.24 n.3, p.261-269, December 2006
	Fariel Shafee, Information in entangled dynamic quantum networks, Microelectronics Journal, v.37 n.11, p.1321-1324, November, 2006
	Marco Lanzagorta , Jeffrey K. Uhlmann, Hybrid quantum-classical computing with applications to computer graphics, ACM SIGGRAPH 2005 Courses, July 31-August 04, 2005, Los Angeles, California
	Sheng-Tzong Cheng , Ming-Hung Tao, Quantum cooperative search algorithm for 3-SAT, Journal of Computer and System Sciences, v.73 n.1, p.123-136, February, 2007
	Frederic Magniez , Ashwin Nayak , Jeremie Roland , Miklos Santha, Search via quantum walk, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, June 11-13, 2007, San Diego, California, USA
	Peter Hoyer , Troy Lee , Robert Spalek, Negative weights make adversaries stronger, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, June 11-13, 2007, San Diego, California, USA
	Takashi Mihara, Quantum protocols for untrusted computations, Journal of Discrete Algorithms, v.5 n.1, p.65-72, March, 2007
	Nikola Kasabov, Integrative connectionist learning systems inspired by nature: current models, future trends and challenges, Natural Computing: an international journal, v.8 n.2, p.199-218, June 2009
	Yuan Feng , Runyao Duan , Zhengfeng Ji , Mingsheng Ying, Probabilistic bisimulations for quantum processes, Information and Computation, v.205 n.11, p.1608-1639, November, 2007
	Mingsheng Ying , Jianxin Chen , Yuan Feng , Runyao Duan, Commutativity of quantum weakest preconditions, Information Processing Letters, v.104 n.4, p.152-158, November, 2007
	Mark Whitney , Nemanja Isailovic , Yatish Patel , John Kubiatowicz, Automated generation of layout and control for quantum circuits, Proceedings of the 4th international conference on Computing frontiers, May 07-09, 2007, Ischia, Italy
	Andris Ambainis , Kazuo Iwama , Akinori Kawachi , Rudy Raymond , Shigeru Yamashita, Improved algorithms for quantum identification of Boolean oracles, Theoretical Computer Science, v.378 n.1, p.41-53, June, 2007
	Mozammel H. A. Khan , Marek A. Perkowski, Quantum ternary parallel adder/subtractor with partially-look-ahead carry, Journal of Systems Architecture: the EUROMICRO Journal, v.53 n.7, p.453-464, July, 2007
	Tzvetan S. Metodi , Darshan D. Thaker , Andrew W. Cross, A Quantum Logic Array Microarchitecture: Scalable Quantum Data Movement and Computation, Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture, p.305-318, November 12-16, 2005, Barcelona, Spain
	Feng Lu , Dan C. Marinescu, An R \|\| C_max Quantum Scheduling Algorithm, Quantum Information Processing, v.6 n.3, p.159-178, June 2007
	Daowen Qiu , Sheng Yu, Hierarchy and equivalence of multi-letter quantum finite automata, Theoretical Computer Science, v.410 n.30-32, p.3006-3017, August, 2009
	Alp Atici , Rocco A. Servedio, Improved Bounds on Quantum Learning Algorithms, Quantum Information Processing, v.4 n.5, p.355-386, November 2005
	Rodney Van Meter , Kae Nemoto , W. J. Munro , Kohei M. Itoh, Distributed Arithmetic on a Quantum Multicomputer, ACM SIGARCH Computer Architecture News, v.34 n.2, p.354-365, May 2006
	Maciej Goćwin, On the Complexity of Searching for a Maximum of a Function on a Quantum Computer, Quantum Information Processing, v.5 n.1, p.31-41, February 2006
	Dorit Aharonov , Andris Ambainis , Julia Kempe , Umesh Vazirani, Quantum walks on graphs, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.50-59, July 2001, Hersonissos, Greece
	Ellie D'hondt , Prakash Panangaden, Quantum weakest preconditions, Mathematical Structures in Computer Science, v.16 n.3, p.429-451, June 2006
	Simon J. Gay, Quantum programming languages: survey and bibliography, Mathematical Structures in Computer Science, v.16 n.4, p.581-600, August 2006
	Peter Selinger, Towards a quantum programming language, Mathematical Structures in Computer Science, v.14 n.4, p.527-586, August 2004
	Bao Rong Chang , Hsiu Fen Tsai , Chung-Ping Young, Diversity of quantum optimizations for training adaptive support vector regression and its prediction applications, Expert Systems with Applications: An International Journal, v.34 n.4, p.2612-2621, May, 2008
	Yuan Feng , Runyao Duan , Zhengfeng Ji , Mingsheng Ying, Proof rules for the correctness of quantum programs, Theoretical Computer Science, v.386 n.1-2, p.151-166, October, 2007
	Matthias Klusch, Toward Intelligent Agents on Quantum Computers, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, p.1518-1519, July 19-23, 2004, New York, New York
	Byung-Soo Choi , Thomas A. Walker , Samuel L. Braunstein, Sure Success Partial Search, Quantum Information Processing, v.6 n.1, p.1-8, February 2007
	Markus Hunziker , David A. Meyer, Quantum Algorithms for Highly Structured Search Problems, Quantum Information Processing, v.1 n.3, p.145-154, June 2002
	Frédéric Magniez , Ashwin Nayak , Peter C. Richter , Miklos Santha, On the hitting times of quantum versus random walks, Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, p.86-95, January 04-06, 2009, New York, New York
	Dave Bacon , Debbie Leung, Toward a world with quantum computers, Communications of the ACM, v.50 n.9, September 2007
	Mehdi Saeedi , Morteza Saheb Zamani , Mehdi Sedighi, Moving forward: a non-search based synthesis method toward efficient CNOT-based quantum circuit synthesis algorithms, Proceedings of the 2008 conference on Asia and South Pacific design automation, January 21-24, 2008, Seoul, Korea
	Pranab Sen , S. Venkatesh, Lower bounds for predecessor searching in the cell probe model, Journal of Computer and System Sciences, v.74 n.3, p.364-385, May, 2008
	Rodney Van Meter , W. J. Munro , Kae Nemoto , Kohei M. Itoh, Arithmetic on a distributed-memory quantum multicomputer, ACM Journal on Emerging Technologies in Computing Systems (JETC), v.3 n.4, p.1-23, January 2008
	Matthias Klusch , René Schubotz, Programming and simulation of quantum search agents, Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, May 14-18, 2007, Honolulu, Hawaii
	Daowen Qiu, Automata theory based on quantum logic: Reversibilities and pushdown automata, Theoretical Computer Science, v.386 n.1-2, p.38-56, October, 2007
	Viv Kendon, Decoherence in quantum walks – a review, Mathematical Structures in Computer Science, v.17 n.6, p.1169-1220, December 2007
	Hsiu Fen Tsai , Bao Rong Chang, Timing of resources exploration in the behavior of firm - Innovative approach and empirical simulation, Expert Systems with Applications: An International Journal, v.34 n.4, p.2656-2663, May, 2008
	Rajesh Krishnan , Carla C. Purdy, Circuit development using biological components: Principles, models and experimental feasibility, Analog Integrated Circuits and Signal Processing, v.56 n.1-2, p.153-161, August 2008
	Mozammel H. A. Khan, Synthesis of quaternary reversible/quantum comparators, Journal of Systems Architecture: the EUROMICRO Journal, v.54 n.10, p.977-982, October, 2008
	Mozammel H. A. Khan, A recursive method for synthesizing quantum/reversible quaternary parallel adder/subtractor with look-ahead carry, Journal of Systems Architecture: the EUROMICRO Journal, v.54 n.12, p.1113-1121, December, 2008
	Paulo Benicio Sousa , Rubens Viana Ramos, Multiplayer quantum games and its application as access controller in architecture of quantum computers, Quantum Information Processing, v.7 n.2-3, p.125-135, June 2008
	Peter Hines, Machine semantics, Theoretical Computer Science, v.409 n.1, p.1-23, December, 2008
	Sandor Imre, Quantum Existence Testing and Its Application for Finding Extreme Values in Unsorted Databases, IEEE Transactions on Computers, v.56 n.5, p.706-710, May 2007
	Bao Rong Chang, Resolving the forecasting problems of overshoot and volatility clustering using ANFIS coupling nonlinear heteroscedasticity with quantum tuning, Fuzzy Sets and Systems, v.159 n.23, p.3183-3200, December, 2008
	Hong Guo , Juheng Zhang , Gary J. Koehler, A survey of quantum games, Decision Support Systems, v.46 n.1, p.318-332, December, 2008
	Vasil S. Denchev , Gopal Pandurangan, Distributed quantum computing: a new frontier in distributed systems or science fiction?, ACM SIGACT News, v.39 n.3, September 2008
	Rod Van Meter , Kae Nemoto , W. Munro, Communication Links for Distributed Quantum Computation, IEEE Transactions on Computers, v.56 n.12, p.1643-1653, December 2007
	Lvzhou Li , Daowen Qiu, Determining the equivalence for one-way quantum finite automata, Theoretical Computer Science, v.403 n.1, p.42-51, August, 2008
	Xiangping Meng , Jianzhong Wang , Yuzhen Pi , Quande Yuan, A novel Artificial Neural Network training method combined with Quantum Computational Multi-Agent System theory, International Journal of Intelligent Systems Technologies and Applications, v.6 n.1/2, p.50-60, January 2009
	Lian-Ao Wu , Mark S. Byrd, Self-protected quantum algorithms based on quantum state tomography, Quantum Information Processing, v.8 n.1, p.1-12, February 2009
	Ellie DHondt, Quantum approaches to graph colouring, Theoretical Computer Science, v.410 n.4-5, p.302-309, February, 2009
	David Emms , Richard C. Wilson , Edwin R. Hancock, Graph matching using the interference of continuous-time quantum walks, Pattern Recognition, v.42 n.5, p.985-1002, May, 2009
	Ray A. Perlner , David A. Cooper, Quantum resistant public key cryptography: a survey, Proceedings of the 8th Symposium on Identity and Trust on the Internet, April 14-16, 2009, Gaithersburg, Maryland
	Richard J. Hughes, Quantum computing, Encyclopedia of Computer Science, 4th edition, John Wiley and Sons Ltd., Chichester, 2003
	Adrian Gepp , Phil Stocks, A review of procedures to evolve quantum algorithms, Genetic Programming and Evolvable Machines, v.10 n.2, p.181-228, June 2009
	Lvzhou Li , Daowen Qiu, Note: A note on quantum sequential machines, Theoretical Computer Science, v.410 n.26, p.2529-2535, June, 2009
	Ling Wang , Xiuting Wang , Minrui Fei, A novel quantum-inspired pseudorandom proportional evolutionary algorithm for the multidimensional knapsack problem, Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, June 12-14, 2009, Shanghai, China
	David Emms , Simone Severini , Richard C. Wilson , Edwin R. Hancock, Coined quantum walks lift the cospectrality of graphs and trees, Pattern Recognition, v.42 n.9, p.1988-2002, September, 2009
	Zhiyong Li , Günter Rudolph , Kenli Li, Convergence performance comparison of quantum-inspired multi-objective evolutionary algorithms, Computers & Mathematics with Applications, v.57 n.11-12, p.1843-1854, June, 2009
	Shiou-An Wang , Chin-Yung Lu , I-Ming Tsai , Sy-Yen Kuo, An XQDD-Based Verification Method for Quantum Circuits, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, v.E91-A n.2, p.584-594, February 2008
	Kazuto Oshima, Schmidt Decomposition for Quantum Entanglement in Quantum Algorithms, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, v.E90-A n.5, p.1012-1013, May 2007
	Bao Rong Chang , Hsiu Fen Tsai, Quantum-minimized BWGC/NGARCH approach to financial time series forecast, Neurocomputing, v.72 n.10-12, p.2525-2535, June, 2009
	Bao Rong Chang , Hsiu Fen Tsai, Novel hybrid approach to data-packet-flow prediction for improving network traffic analysis, Applied Soft Computing, v.9 n.3, p.1177-1183, June, 2009
	David Emms , Richard C. Wilson , Edwin R. Hancock, Graph matching using the interference of discrete-time quantum walks, Image and Vision Computing, v.27 n.7, p.934-949, June, 2009
	Simona Caraiman , Vasile I. Manta, New applications of quantum algorithms to computer graphics: the quantum random sample consensus algorithm, Proceedings of the 6th ACM conference on Computing frontiers, May 18-20, 2009, Ischia, Italy
	Bao Rong Chang , Hsiu-Fen Tsai, Quantum minimization for adapting ANFIS outputs to its nonlinear generalized autoregressive conditional heteroscedasticity, Applied Intelligence, v.31 n.1, p.31-46, August 2009