메뉴 건너뛰기




Volumn 8572 LNCS, Issue PART 1, 2014, Pages 308-319

The Bose-Hubbard model is QMA-complete

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BOSONS; HUBBARD MODEL; PHYSICAL OPTICS;

EID: 84904181743     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-43948-7_26     Document Type: Conference Paper
Times cited : (35)

References (25)
  • 4
    • 0141640891 scopus 로고    scopus 로고
    • 3-Local Hamiltonian is QMA-complete
    • Kempe, J., Regev, O.: 3-Local Hamiltonian is QMA-complete. Quantum Inf. Comput. 3(3), 258-264 (2003)
    • (2003) Quantum Inf. Comput. , vol.3 , Issue.3 , pp. 258-264
    • Kempe, J.1    Regev, O.2
  • 5
    • 33750165209 scopus 로고    scopus 로고
    • The complexity of the local Hamiltonian problem
    • Kempe, J., Kitaev, A., Regev, O.: The complexity of the local Hamiltonian problem. SIAM J. Comput. 35(5), 1070-1097 (2006)
    • (2006) SIAM J. Comput. , vol.35 , Issue.5 , pp. 1070-1097
    • Kempe, J.1    Kitaev, A.2    Regev, O.3
  • 6
    • 55049139520 scopus 로고    scopus 로고
    • The complexity of quantum spin systems on a twodimensional square lattice
    • Oliveira, R., Terhal, B.M.: The complexity of quantum spin systems on a twodimensional square lattice. Quantum Inf. Comput. 8(10), 900-924 (2008)
    • (2008) Quantum Inf. Comput. , vol.8 , Issue.10 , pp. 900-924
    • Oliveira, R.1    Terhal, B.M.2
  • 8
    • 85162775574 scopus 로고    scopus 로고
    • The quantum and classical complexity of translationally invariant tiling and Hamiltonian problems
    • Gottesman, D., Irani, S.: The quantum and classical complexity of translationally invariant tiling and Hamiltonian problems. Theory Comput. 9(2), 31-116 (2013)
    • (2013) Theory Comput , vol.9 , Issue.2 , pp. 31-116
    • Gottesman, D.1    Irani, S.2
  • 9
    • 49049115187 scopus 로고    scopus 로고
    • Efficient algorithm for a quantum analogue of 2-SAT
    • Bravyi, S.: Efficient algorithm for a quantum analogue of 2-SAT. Contemp. Math. 536, 33-48 (2011)
    • (2011) Contemp. Math. , vol.536 , pp. 33-48
    • Bravyi, S.1
  • 10
    • 84893439857 scopus 로고    scopus 로고
    • Quantum 3-SAT is QMA1-complete
    • Gosset, D., Nagaj, D.: Quantum 3-SAT is QMA1-complete. In: 54th FOCS,pp. 756-765 (2013)
    • (2013) 54th FOCS , pp. 756-765
    • Gosset, D.1    Nagaj, D.2
  • 12
    • 77950293916 scopus 로고    scopus 로고
    • Complexity of stoquastic frustration-free Hamiltonians
    • Bravyi, S., Terhal, B.: Complexity of stoquastic frustration-free Hamiltonians. SIAM J. Comput. 39(4), 1462-1485 (2009)
    • (2009) SIAM J. Comput. , vol.39 , Issue.4 , pp. 1462-1485
    • Bravyi, S.1    Terhal, B.2
  • 13
    • 75749145090 scopus 로고    scopus 로고
    • Interacting boson problems can be QMA hard
    • Wei, T.C., Mosca, M., Nayak, A.: Interacting boson problems can be QMA hard. Phys. Rev. Lett. 104(4), 040501 (2010)
    • (2010) Phys. Rev. Lett. , vol.104 , Issue.4 , pp. 040501
    • Wei, T.C.1    Mosca, M.2    Nayak, A.3
  • 14
    • 33947266941 scopus 로고    scopus 로고
    • Quantum computational complexity of the N -representability problem: QMA complete
    • Liu, Y.K., Christandl, M., Verstraete, F.: Quantum computational complexity of the N -representability problem: QMA complete. Phys. Rev. Lett. 98(11), 110503 (2007)
    • (2007) Phys. Rev. Lett. , vol.98 , Issue.11 , pp. 110503
    • Liu, Y.K.1    Christandl, M.2    Verstraete, F.3
  • 15
    • 70350125578 scopus 로고    scopus 로고
    • Computational complexity of interacting electrons and fundamental limitations of density functional theory
    • Schuch, N., Verstraete, F.: Computational complexity of interacting electrons and fundamental limitations of density functional theory. Nature Phys. 5(10), 732-735 (2009)
    • (2009) Nature Phys. , vol.5 , Issue.10 , pp. 732-735
    • Schuch, N.1    Verstraete, F.2
  • 18
    • 84873654494 scopus 로고    scopus 로고
    • Universal computation by multiparticle quantum walk
    • Childs, A.M., Gosset, D., Webb, Z.: Universal computation by multiparticle quantum walk. Science 339(6121), 791-794 (2013)
    • (2013) Science , vol.339 , Issue.6121 , pp. 791-794
    • Childs, A.M.1    Gosset, D.2    Webb, Z.3
  • 19
    • 0002433737 scopus 로고
    • Quantum mechanical computers
    • Feynman, R.P.: Quantum mechanical computers. Optics News 11, 11-20 (1985)
    • (1985) Optics News , vol.11 , pp. 11-20
    • Feynman, R.P.1
  • 21
    • 0037770172 scopus 로고    scopus 로고
    • Adiabatic quantum state generation and statistical zero knowledge
    • Aharonov, D., Ta-Shma, A.: Adiabatic quantum state generation and statistical zero knowledge. In: 35th STOC, pp. 20-29 (2003)
    • (2003) 35th STOC , pp. 20-29
    • Aharonov, D.1    Ta-Shma, A.2
  • 22
    • 45749104091 scopus 로고    scopus 로고
    • Perturbative gadgets at arbitrary orders
    • Jordan, S.P., Farhi, E.: Perturbative gadgets at arbitrary orders. Phys. Rev. A 77(6), 062329 (2008)
    • (2008) Phys. Rev. A , vol.77 , Issue.6 , pp. 062329
    • Jordan, S.P.1    Farhi, E.2
  • 23
    • 34548080068 scopus 로고    scopus 로고
    • Simple proof of equivalence between adiabatic quantum computation and the circuit model
    • Mizel, A., Lidar, D.A., Mitchell, M.: Simple proof of equivalence between adiabatic quantum computation and the circuit model. Phys. Rev. Lett. 99(7), 070502 (2007)
    • (2007) Phys. Rev. Lett. , vol.99 , Issue.7 , pp. 070502
    • Mizel, A.1    Lidar, D.A.2    Mitchell, M.3
  • 25
    • 34547609329 scopus 로고    scopus 로고
    • New construction for a QMA complete three-local Hamiltonian
    • Nagaj, D., Mozes, S.: New construction for a QMA complete three-local Hamiltonian. J. Math. Phys. 48(7), 072104 (2007)
    • (2007) J. Math. Phys. , vol.48 , Issue.7 , pp. 072104
    • Nagaj, D.1    Mozes, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.