Quantum circuit design for grover's algorithm

Details Quantum circuit design for grover's algorithm Quantum circuit design for grover's algorithm

2006-04-11

2006-04-11

Garbowski, Leigh M. (Department: 2825)

Computer-aided design and analysis of circuits and semiconductor

Nanotechnology related integrated circuit design

C703S002000

Reexamination Certificate

active

07028275

ABSTRACT:
A method for performing a data search includes initializing a collection of qubits by generating a superposition of quantum states in of the qubits, inverting the sign of a target quantum state, and calculating an inversion about the average for each qubit using one-bit unitary gates and two-bit quantum phase gates. The method further include iterating the inverting and calculating steps to determine a search result corresponding to the target quantum state according to Grover's algorithm.

REFERENCES:
patent: 5917322 (1999-06-01), Gershenfeld et al.
patent: 6317766 (2001-11-01), Grover
patent: 6635898 (2003-10-01), Williams et al.
patent: 09-058295 (1997-03-01), None
patent: 11-318001 (1999-11-01), None
patent: 2001-177909 (2001-06-01), None
J. Ahn et al., “Fast Quantum search using coherent electron states of Ryderg atoms,” Monday Morning/QELS '99, pp. 5-6.
A. Barenco, “A Universal Tw-Bit Gate for Quantum Computation,” Proc. R. Soc. London A, Jun. 1995, 4 pages.
T. Beth, “Quantum Computing: An Introduction,” ISCAS 2000—IEEE Int'l Symposium on Circuits and Systems, pp. 735-736.
I.L. Chang et al., “Experimental Implementation of Fast Quantum Searching,” Physical Review Letters, vol. 80, No. 15, Apr. 1998, pp. 3408-3411.
D.P. DiVincenzo et al., “Results on two-bit gate design for quantum computers,” 1994 Procs. Workshop on Physics and Computation, pp. 14-23.
D.P. DiVincenzo, “Two-bit gates are universal for quantum computation,” Physical Review A, vol. 51, No. 2, Feb. 1995, pp. 1015-1022.
L.K. Grover, “A fast quantum mechanical algorithm for database search,” STOC '96, pp. 212-219.
L.K. Grover, “Quantum Mechanics Helps in Searching for a Needle in a Haystack,” Physical Review Letters, vol. 79, No. 2, Jul. 1997, pp. 325-328.
L.K. Grover, “Quantum Computation,” Int'l Conference on VLSI Design, Jan. 1999, pp. 548-553.
L.K. Grover, “Quantum Mechanical Searching,” Proc. of 1999 Congress on Evolutionary Computation, pp. 2255-2261.
T. Hey, “Quantum computing an introduction,” Computing & Control Engineering Journal, Jun. 1999, pp. 105-112.
J.A. Jones et al., “Implementation of a quantum search algorithm on a quantum computer,” Nature, vol. 393, May 1999, pp. 344-346.
S. Lloyd, “Almost Any Quantum Logic Gate is Universal,” Physical Review Letters, vol. 75, No. 2, Jul. 1995, pp. 346-349.
A. Rauschenbeutel et al., “Coherent Operation of a Tunable Quantum Phase Gate in Cavity QED,” Physical Review Letters, vol. 83, No. 24, Dec. 1999, pp. 5166-5169.
Q.A. Turchette et al., “Measurement of Conditional Phase Shifts for Quantum Logic,” Physical Review Letters, vol. 75, No. 25, Dec. 1995, pp. 4710-4713.
W. Wang et al., “Multibit Gates for Quantum Computing,” Physical Review Letters, vol. 86, No. 17, pp. 3907-3910.
Barenco, Adriano, et al., “Elementary gates for quantum computation,” The American Physical Society, Physical Review A, vol. 52, No. 5, © Nov. 1995, pp. 3457-3467.
Shor, Peter W., “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer,” Proceedings of the 35th Annual Symposium on Foundations of Computer Science,IEEE Computer Society Press,SIAM Journal of Computing, © 1997, Copyright by the Society for Industrial and Applied Mathematics, pp. 1-25.
Grover, Lov K., “Quantum Mechanics Helps in Searching for a Needle in a Haystack,” The American Physical Society, Physical Review Letters, vol. 79, No. 2, © Jul. 14, 1997, pp. 325-328.
Farhi, Edward, “Analog analogue of a digital quantum computation,” The American Physical Society, Physical Review, A, vol. 57, No. 4, © Apr. 1998, pp. 2403-2406.
Jones, Jonathan A., “Quantum Computing: Fast Searches with Nuclear Magnetic Resonance Computers,” Science Magazine, vol. 280, Issue 5361, http://www.sciencemag.org/cgi/content/full/280/5361/229,7 pages, Apr. 10, 1998.
Chuang, Isaac, L., et al, “Experimental Implementation of Fast Quantum Searching,” The American Physical Society, Physical Review Letters, vol. 80, No. 15, © Apr. 13, 1998, pp. 3408-3411.
Jones, Jonathan A., et al., “Implementation of a quantum search algorithm on a quantum computer,” Nature, vol. 393, Nature © Macmillan Publishers Ltd May 28,1998, pp. 344-346.
Lloyd, Seth, “Quantum search without entanglement,” The American Physical Society, Physical Review A, Rapid Communications, vol. 61, © Dec. 8, 1999, pp. 010301-1-010301-4.
Rauschenbeutel, A., et al., “Coherent Operation of a Tunable Quantum Phase Gate in Cavity QED,” The American Physical Society, Physical Review Letters, vol. 83, No. 24, © Dec. 13, 1999, pp. 5166-5169.
Kwiat, P.G., et al, “Grover's search algorithm: an optical approach,” Journal of Modern Optics, 2000, ISSN 0950-0340; © 2000 Taylor & Francis Ltd., vol. 47, No. 2/3, pp. 257-266.
Ahn, J., et al, “Information Storage and Retrieval Through Quantum Phase,” Science Magazine, Reports, vol. 287, www.sciencemag.org, pp. 463-465, Jan. 21, 2000.
Knight, Peter, “Quantum Computing: Enhanced: Quantum Information Processing Without Entanglement,” Science Magazine, vol. 287, Issue 5452, http://www.sciencemag.org/cgi/content/full/287/5452/441, 15 pages, Jan. 21, 2000.
Scully, Marlan O., et al, “Quantum optical implementation of Grover's algorithm,” PNAS, vol. 98, No. 17, pp. 9490-9493, Aug. 14, 2001.

Affiliated with

Also associated with

Rating

Quantum circuit design for grover's algorithm does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Quantum circuit design for grover's algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum circuit design for grover's algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3590844