Algorithm for quantum simulation

Applied Mathematics and Information Sciences

Volumn 3, Issue 2, 2010, Pages 117-122

  Sanders, Barry C ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

Black box calls; Quantum simulation

Indexed keywords

EID: 67349105201     PISSN: 19350090     EISSN: 23250399     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. R. P. Feynman, Simulating physics with computers, Int. J. Th. Phys. 21 (1982), 467- 481.
2. D. Deutsch, Quantum theory, the Church-Turing principle, and the universal quantum computer, Proc. Roy. Soc. Lond. A 400 (1985), 97-117.
3. S. Lloyd, Universal quantum simulators, Science 273 (1996), 1073-1078.
4. D. S. Abrams and S. Lloyd, Simulations of many-body Fermi systems on a quantum computer, Phys Rev Lett. 79 (1997), 2586-2589.
5. A. Sørensen and K. Mølmer, Multiparticle entanglement in a hot ion trap, Phys. Rev. Lett. 82 (1999), 1971-1974.
6. D. Aharonov and A. Ta-Shma, Adiabatic quantum state generation and statistical zero knowledge, Proc. ACM STOC, (2003) 20-29.
7. M. Suzuki, Fractal decomposition of exponential operators with applications to manybody theories and Monte Carlo simulations, Phys. Lett. A 146 (1990), 319-323.
8. M. Suzuki, General theory of fractal path integrals with applications to many-body theories andstatistical physics, J. Math. Phys. 32 (1991), 400-407.
9. D. W. Berry, G. Ahokas, R. Cleve, and B. C. Sanders, Efficient quantum algorithms for simulating sparse Hamiltonians, Comm. Math. Phys. 270 (2007), 359-371.
10. R. Cole and U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking, Inform. and Control 70 (1986), 32-35.
11. N. Linial, Locality in distributed graph algorithms, SIAM J. Comp. 21 (1992), 193- 201.
12. N. Wiebe, D. W. Berry, P. Høyer. and B. C. Sanders, "Higher order decompositions of ordered operator exponentials", arXiv.org:0812.0562 (2008).