Simulating sparse Hamiltonians with star decompositions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6519 LNCS, Issue , 2011, Pages 94-103

  Childs, Andrew M ^a   Kothari, Robin ^a,b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED COMPONENT; EFFICIENT ALGORITHM; MAXIMUM DEGREE; SIMULATION ALGORITHMS; STAR DECOMPOSITIONS; TIME EVOLUTIONS;

ALGORITHMS; COMPUTATIONAL LINGUISTICS; QUANTUM COMPUTERS; QUANTUM CRYPTOGRAPHY; QUANTUM THEORY; CRYPTOGRAPHY; QUANTUM COMMUNICATION; STARS;

HAMILTONIANS;

EID: 79251566757     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18073-6_8     Document Type: Conference Paper

References (15)

1. Lloyd, S.: Universal quantum simulators. Science 273(5278), 1073-1078 (1996)
2. Aharonov, D., Ta-Shma, A.: Adiabatic quantum state generation and statistical zero knowledge. In: Proc. 35th STOC, pp. 20-29. ACM, New York (2003)
3. Berry, D., Ahokas, G., Cleve, R., Sanders, B.: Efficient quantum algorithms for simulating sparse Hamiltonians. Commun. Math. Phys. 270(2), 359-371 (2007)
4. Feynman, R.: Simulating physics with computers. Int. J. Theor. Phys. 21(6), 467-488 (1982)
5. Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum computation by adiabatic evolution (2000), ArXiv preprint quant-ph/0001106
6. Farhi, E., Gutmann, S.: Analog analogue of a digital quantum computation. Phys. Rev. A 57(4), 2403-2406 (1998)
7. Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by a quantum walk. In: Proc. 35th STOC, pp. 59-68. ACM, New York (2003)
8. Farhi, E., Goldstone, J., Gutmann, S.: A Quantum Algorithm for the Hamiltonian NAND Tree. Theory of Computing 4, 169-190 (2008)
9. Childs, A.M.: Quantum information processing in continuous time. PhD thesis, Massachusetts Institute of Technology (2004)
10. Childs, A.M.: On the Relationship Between Continuous- and Discrete-Time Quantum Walk. Commun. Math. Phys. 294(2), 581-603 (2010)
11. Berry, D.W., Childs, A.M.: The quantum query complexity of implementing black-box unitary transformations (2009), ArXiv preprint arXiv:0910.4157
12. Panconesi, A., Rizzi, R.: Some simple distributed algorithms for sparse networks. Distrib. Comput. 14(2), 97-100 (2001)
13. Cole, R., Vishkin, U.: Deterministic coin tossing with applications to optimal parallel list ranking. Inf. Control 70(1), 32-53 (1986) (Pubitemid 17511516)
14. Goldberg, A.V., Plotkin, S.A., Shannon, G.E.: Parallel symmetry-breaking in sparse graphs. SIAM J. Discrete Math. 1(4), 434-446 (1988)
15. Childs, A., Kothari, R.: Limitations on the simulation of non-sparse Hamiltonians. Quantum Information and Computation 10, 669-684 (2010)