Finding cliques by quantum adiabatic evolution

Quantum Information and Computation

Volumn 2, Issue 3, 2002, Pages 181-191

  Childs, Andrew M ^a   Farhi, Edward ^a   Goldstone, Jeffrey ^a   Gutmann, Sam ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Adiabatic evolution; Quantum algorithms; Quantum computation

Indexed keywords

GRAPH ALGORITHMS; GRAPH STRUCTURES; QUANTUM COMPUTERS; QUANTUM THEORY;

ADIABATIC EVOLUTION; COMBINATORIAL SEARCH; CONNECTED SUBGRAPH; HIGH PROBABILITY; QUANTUM ALGORITHMS; RANDOM GRAPHS; RUNTIMES; TIME POLYNOMIALS;

GRAPH THEORY;

EID: 0011497393     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Quantum computation by adiabatic evolution, quant-ph/0001106.
2. For a related technique, see T. Kadowaki and H. Nishimori, Quantum annealing and the transverse Ising model, cond-mat/9804280; Phys. Rev. E 58, 5355 (1998).
3. For a related technique, see T. Kadowaki and H. Nishimori, Quantum annealing and the transverse Ising model, cond-mat/9804280; Phys. Rev. E 58, 5355 (1998).
4. E. Farhi, J. Goldstone, and S. Gutmann, A numerical study of the performance of a quantum adiabatic evolution algorithm for satisfiability, quant-ph/0007071.
5. E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem, quant-ph/0104129; Science 292, 472 (2001).
6. E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem, quant-ph/0104129; Science 292, 472 (2001).
7. M. Jerrum, Large cliques elude the Metropolis process, Random Struct. Alg. 3, 347 (1992).
8. A. Messiah, Quantum Mechanics, Vol. II (Wiley, New York, 1976).
9. P. Erdos and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci. 8, 455 (1964).
10. B. Bollobás, Random Graphs (Academic, New York, 1985).
11. A. Frieze and C. McDiarmid, Algorithmic theory of random graphs, Random Struct. Alg. 10, 5 (1997).
12. D. W. Matula, The employee party problem, Notices Amer. Math. Soc. 19, A-382 (1972).
13. A. Juels and M. Peinado, Hiding cliques for cryptographic security, Proc. 9th Annual ACM-SIAM SODA, 678 (1998).
14. R. Cleve and D. P. DiVincenzo, Schumacher's quantum data compression as a quantum computation, Phys. Rev. A 54, 2636 (1996).
15. I. L. Chuang and D. S. Modha, Reversible arithmetic coding for quantum data compression, IEEE Trans. Inf. Theory 46, 1104 (2000).