Efficient discrete-time simulations of continuous-time quantum query algorithms

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 409-416

  Cleve, Richard ^a   Gottesman, Daniel ^b   Mosca, Michele ^a   Somma, Rolando D ^b   Yonge Mallo, David ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b PERIMETER INSTITUTE FOR THEORETICAL PHYSICS   (Canada)

Author keywords

Algorithms; Theory

Indexed keywords

CONTINUOUS TIME; DISCRETE-TIME; DISCRETE-TIME SIMULATION; DRIVING OPERATIONS; LOWER BOUNDS; QUANTUM ALGORITHMS; QUANTUM QUERY ALGORITHM; QUERY MODEL; QUERY TIME; THEORY; UPPER BOUND;

ALGORITHMS; CONTINUOUS TIME SYSTEMS; CONTROL THEORY; QUANTUM THEORY; SIMULATORS;

COMPUTATION THEORY;

EID: 70350700898     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536471     Document Type: Conference Paper

References (19)

1. A. Ambainis, Quantum walk algorithm for element distinctness, SIAM J. on Computing, 37 :210-239 (2007).
2. 1/2+o(1) on a quantum computer, In Proc. 48th IEEE Symposium on Foundations of Computer Science, pp. 363-372 (2007).
3. D. W. Berry, G. Ahokas, R. Cleve, and B. C. Sanders, Efficient quantum algorithms for simulating sparse Hamiltonians, Communications in Mathematical Physics, 270:359-371 (2007).
4. G. Brassard, P. Hoøyer, and A. Tapp, Quantum algorithm for the collision problem, ACM SIGACT News (Cryptology Column), 28:14-19 (1997).
5. A. M. Childs, Quantum Information Processing in Continuous Time, Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA (2004).
6. A. M. Childs, On the relationship between continuousand discrete-time quantum walk, arXiv:0810.0312 (2008).
7. A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman, Exponential algorithmic speedup by a quantum walk, In Proc. 35th ACM Symposium on Theory of Computing, pp. 59-68 (2003).
8. A. M. Childs, R. Cleve, S. P. Jordan, and D. Yeung, Discrete query quantum algorithm for NAND trees, arXiv:0702160 (2007).
9. W. van Dam, Quantum oracle interrogation: getting all information for almost half the price, In Proc. 39th IEEE Symposium on Foundations of Computer Science, pp. 362-369 (1998).
10. E. Farhi, J. Goldstone, and S. Gutmann, A quantum algorithm for the Hamiltonian NAND tree, Theory of Computing, 4(8):169-190 (2008).
11. E. Farhi and S. Gutmann, Analog analogue of a digital quantum computation, Physical Review A, 57:2403-2406 (1998).
12. E. Farhi and S. Gutmann, Quantum computation and decision trees, Physical Review A, 58:915-928 (1998).
13. L. K. Grover, Quantum mechanics helps in searching for a needle in a haystack, Physical Review Letters, 79:325-328 (1997).
14. J. Huyghebaert and H. De Raedt, Product formula methods for time-dependent Schrödinger problems, J. Physics A: Mathematical and General, 23:5777-5793 (1990).
15. P. Kaye, R. Laflamme, M. Mosca, An Introduction to Quantum Computation (Oxford University Press, Oxford, 2007).
16. C. Mochon, Hamiltonian oracles, Physical Review A, 75:042313 [15 pages] (2007).
17. L. Sheridan, D. Maslov, and M. Mosca, Approximating fractional time quantum evolution, arXiv:0810.3843 (2008).
18. P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Computing, 26:1484-1509 (1997).
19. M. Suzuki, Quantum Monte Carlo Methods in Condensed-Matter Physics (World Scientific, Singapore, 1993).