DoritAharonovSchoolofComputerScienceand.pptVIP

Dorit Aharonov School of Computer Science and Engineering The Hebrew University, Jerusalem, Israel;Modern Church Turing Thesis;Quantum computation ? Physics;;?; ;;The Local Hamiltonian Problem Input: Output: ground energy of H a or a+1/poly(n). ;The Cook-Levin Theorem: Computation is local [Cook-Levin’79];The Circuit-to-Hamiltonian construction[Kitaev98, Following Feynman82];H(0);2D, 2-local Ham’s (6-states) [A’vanDamKempeLandauRegevLloyd’04] 2-local Ham’s, in general geometry (qubits) (using Gadgets) [KempeKitaevRegev’06] 2D, 2-local Ham’s (Using Gadgets) [OliveiraTerhal’05] 1D, 2-local Ham’s ! (using 12 states) [A’IraniKempeGottesman’07];Quantum Hamiltonian Complexity: ;3. How hard is local Hamiltonians for restricted Hamiltonians? For a 1/poly(n) gapped 1D system: QCMA hard [A’Ben-OrBrandaoSattath’08]. What if we know the ground state is an MPS? The classical analog (solving 1D CSPs) is easy… Quantumly: NP-hard [SchuchCiracVerstraete’08] ;The PCP theorem ;Quantum PCP theorem? ;Quantum Gap Amplification [A’AradLandauVazirani’09] (A proof of an important ingredient in Dinur’s proof, but without handling the no-cloning issue);Open problems: ;