Quantum-circuit model of Hamiltonian search algorithms

Physical Review A - Atomic, Molecular, and Optical Physics

Volumn 68, Issue 6, 2003, Pages

  Roland, Jérémie ^a   Cerf, Nicolas J ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; HAMILTONIANS; INTEGRATION; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBABILITY; PROBLEM SOLVING; ROTATION; THEOREM PROVING; VELOCITY;

CAMPBELL-BAKER-HAUSDORFF APPROXIMATION; GROVER ITERATION; HAMILTONIAN SEARCH ALGORITHMS; QUANTUM-CIRCUIT MODEL;

QUANTUM THEORY;

EID: 1142280235     PISSN: 10502947     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. E. Farhi and S. Gutmann, Phys. Rev. A 57, 2403 (1998).
2. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, e-print quant-ph/0001106.
3. W. van Dam, M. Mosca, and U. Vazirani, in Proceedings of the 42nd Annual Symposium on the Foundations of Computer Science (IEEE Computer Society Press, New York, 2001), pp. 279-287.
4. J. Roland and N.J. Cerf, Phys. Rev. A 65, 042308 (2002).
5. L.K. Grover, in Proceedings of the 28th Annual Symposium on the Theory of Computing (ACM Press, New York, 1996), pp. 212-219.
6. L.K. Grover, Phys. Rev. Lett. 79, 325 (1997).
7. L.I. Schiff, Quantum Mechanics (McGraw-Hill, Singapore, 1955).
8. J. Roland and N.J. Cerf, following paper, Phys. Rev. A 68, 062312 (2003).