Ph CS 219, 4 March 2009 "Quantum Merlin-Arthur and the local Hamiltonian problem" As we have discussed, we expect that quantum computers can compute the ground state energy of local Hamiltonians in cases where the proble - Cook–Levin theorem - Document - PDFSEARCH.IO

First Page	Meta Content
	Ph/CS 219, 4 March 2009 "Quantum Merlin-Arthur and the local Hamiltonian problem" As we have discussed, we expect that quantum computers can compute the ground state energy of local Hamiltonians in cases where the proble Add to Reading List Document Date: 2009-03-11 19:28:20 Open Document File Size: 1,83 MB Share Result on Facebook IndustryTerm ground state energy / / SocialTag Complexity classes Mathematical optimization Quantum complexity theory Structural complexity theory P versus NP problem QMA Boolean satisfiability problem NP Cook–Levin theorem Theoretical computer science

Ph/CS 219, 4 March 2009 "Quantum Merlin-Arthur and the local Hamiltonian problem" As we have discussed, we expect that quantum computers can compute the ground state energy of local Hamiltonians in cases where the probleAdd to Reading List