quantum 3-sat is qma 1 -complete
DESCRIPTION
Quantum 3-SAT is QMA 1 -complete. David Gosset (Institute for Quantum Computing, University of Waterloo) Daniel Nagaj ( University of Vienna) Long version: arXiv : 1302.0290 Short version : Proceedings of FOCS 2013. Quantum k-SAT ( Bravyi 2006). - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/1.jpg)
Quantum 3-SAT is QMA1-complete
David Gosset (Institute for Quantum Computing, University of Waterloo)
Daniel Nagaj (University of Vienna)
Long version: arXiv: 1302.0290
Short version : Proceedings of FOCS 2013
![Page 2: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/2.jpg)
Quantum k-SAT (Bravyi 2006)Each clause is a k-local projector and is satisfied by a state if .
The amount that violates a clause is
![Page 3: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/3.jpg)
Quantum k-SAT (Bravyi 2006)Each clause is a k-local projector and is satisfied by a state if .
The amount that violates a clause is
Quantum k-SATGiven k-local projectors {. We are promised that either
(YES) There is a state which satisfies for each
(NO) for all states
and asked to decide which is the case.
![Page 4: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/4.jpg)
Quantum k-SAT (Bravyi 2006)Each clause is a k-local projector and is satisfied by a state if .
The amount that violates a clause is
Quantum k-SATGiven k-local projectors {. We are promised that either
(YES) There is a state which satisfies for each
(NO) for all states
and asked to decide which is the case.
Exactly satisfies eachclause
![Page 5: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/5.jpg)
Quantum k-SAT (Bravyi 2006)Each clause is a k-local projector and is satisfied by a state if .
The amount that violates a clause is
Quantum k-SATGiven k-local projectors {. We are promised that either
(YES) There is a state which satisfies for each
(NO) for all states
and asked to decide which is the case.
Exactly satisfies eachclause
Total violation is at least 1. Can be obtained from by repeating each term
![Page 6: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/6.jpg)
Quantum k-SAT (Bravyi 2006)Each clause is a k-local projector and is satisfied by a state if .
The amount that violates a clause is
Quantum k-SATGiven k-local projectors {. We are promised that either
(YES) There is a state which satisfies for each
(NO) for all states
and asked to decide which is the case.
Exactly satisfies eachclause
Total violation is at least 1. Can be obtained from by repeating each term
Classical k-SAT is the special case where all projectors are diagonal
Quantum k-SAT is a special case of k-local Hamiltonian where the Hamiltonian is frustration-free for yes instances
![Page 7: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/7.jpg)
k
k-local Hamiltonian problem
Quantum k-SAT
Classical k-SAT
Yes instances are frustration-free
All constraints are diagonal
![Page 8: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/8.jpg)
k
k-local Hamiltonian problem
Quantum k-SAT
Classical k-SAT
Yes instances are frustration-free
All constraints are diagonal
Complexity of quantum k-SAT
k=2
𝑘≥4
Contained in P
QMA1-complete
𝒌=𝟐𝒌=𝟑
4
[Bravyi 2006]
also follows from [Kitaev 99])
![Page 9: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/9.jpg)
k
k-local Hamiltonian problem
Quantum k-SAT
Classical k-SAT
Yes instances are frustration-free
All constraints are diagonal
Complexity of quantum k-SAT
k=2
𝑘≥4
Contained in P
QMA1-complete
Contained in QMA1
NP-hard
𝒌=𝟐𝒌=𝟑
4
[Bravyi 2006]
also follows from [Kitaev 99])
![Page 10: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/10.jpg)
k
k-local Hamiltonian problem
Quantum k-SAT
Classical k-SAT
Yes instances are frustration-free
All constraints are diagonal
Complexity of quantum k-SAT
We prove quantum 3-SAT is QMA1-hard (and therefore QMA1-complete).
k=2
𝑘≥4
Contained in P
QMA1-complete
Contained in QMA1
NP-hard
𝒌=𝟐𝒌=𝟑
4
[Bravyi 2006]
also follows from [Kitaev 99])
![Page 11: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/11.jpg)
k
k-local Hamiltonian problem
Quantum k-SAT
Classical k-SAT
Yes instances are frustration-free
All constraints are diagonal
Complexity of quantum k-SAT
k=2
𝑘≥4
Contained in P
QMA1-complete
𝒌=𝟐𝒌≥𝟑
![Page 12: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/12.jpg)
[Ambainis Kempe Sattath 2010][Arad Sattath 2013][Schwarz Cubitt Verstraete 2013]
Many authors have studied quantum SAT since Bravyi’s work
Quantum Lovász Local Lemma
[Laumann Läuchli Moessner Scardicchio Sondhi 2010][Laumann Moessner Scardicchio Sondhi 2010][Bravyi Moore Russell 2010][Hsu Laumann Läuchli Moessner Sondhi 2013][Bardoscia Nagaj Scardicchio 2013]
Ensembles of randominstances of quantum k-SAT
[Eldar Regev 2008] Complexity of quantum 2-SAT with higher dimensional particles (qudits)
[Ji Wei Zeng 2011] Characterization of the groundspace of yes instances of quantum 2-SAT
[Sattath 2013] “An almost sudden jump in quantum complexity”
![Page 13: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/13.jpg)
QMA1
If is a yes instance there exists (a witness) which is accepted with probability exactly 1.If is a no instance every state is accepted with probability at most
Wm-1Wm-2…W0
¿𝜓 ⟩¿0 ⟩⊗𝑛𝑎
QMA1 verification circuit
Because of the perfect completeness, the definition of QMA1 is gate-set dependent.It is not known whether or not QMA=QMA1; see
[Aaronson 2009] [Jordan, Kobayashi, Nagaj, Nishimura 2012][Kobayashi, Le Gall, Nishimura 2013] [Pereszlenyi 2013]
QMA1 is a one-sided error version of QMA. This is the relevant class becausequantum k-SAT is defined with one-sided error.
![Page 14: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/14.jpg)
Bravyi proved quantum k-SAT is contained in QMA1 (verification circuit: choose one projector at random and measure it).
![Page 15: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/15.jpg)
Bravyi proved quantum k-SAT is contained in QMA1 (verification circuit: choose one projector at random and measure it).
To prove QMA1-hardness of quantum 3-SAT we use a circuit-to-Hamiltonian mapping, i.e., we reduce from quantum circuit satisfiability.
![Page 16: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/16.jpg)
If x is a yes instance there is an input state (witness) which makes the circuit output 1 with certainty. Ground energy of is zero.
If x is a no instance no input state makes the circuit output 1 with probability greater than Ground energy of is at least .
QMA1-hardness via circuit-to-Hamiltonian mapping
Wm-1Wm-2…W0¿𝜓 ⟩
¿0 ⟩⊗𝑛𝑎 𝐻 𝑥=∑𝑖Π 𝑖
QMA1 Verification circuit for Quantum 3-SAT Hamiltonian
![Page 17: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/17.jpg)
Wm-1Wm-2…W0¿𝜓 ⟩¿0 ⟩⊗𝑛𝑎
Hilbert space
QMA1 verification circuit (n qubits, m gates)
|𝑧 ⟩|𝑡 ⟩ 𝑧∈ {0,1 }𝑛 , 𝑡∈{0,1,2 ,…,𝑚 }
Example part 1 [Kitaev 99]
![Page 18: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/18.jpg)
Wm-1Wm-2…W0¿𝜓 ⟩¿0 ⟩⊗𝑛𝑎
Hilbert space
QMA1 verification circuit (n qubits, m gates)
|𝑧 ⟩|𝑡 ⟩ 𝑧∈ {0,1 }𝑛 , 𝑡∈{0,1,2 ,…,𝑚 }
𝐻𝑡 ,𝑡+1 (𝑊 𝑡 )=12 ¿Transitionoperators
Example part 1 [Kitaev 99]
![Page 19: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/19.jpg)
Wm-1Wm-2…W0¿𝜓 ⟩¿0 ⟩⊗𝑛𝑎
Hilbert space
Transitionoperators
QMA1 verification circuit (n qubits, m gates)
|𝑧 ⟩|𝑡 ⟩ 𝑧∈ {0,1 }𝑛 , 𝑡∈{0,1,2 ,…,𝑚 }
𝐻𝑡 ,𝑡+1 (𝑊 𝑡 )=12 ¿
𝐻 𝐹𝑒𝑦𝑛𝑚𝑎𝑛=∑𝑖=1
𝑛𝑎|1 ⟩ ⟨1|𝑖⊗∨0⟩⟨ 0∨¿+∑
𝑡=0
𝑚−1
𝐻𝑡 ,𝑡+1(𝑊 𝑡)+|0 ⟩ ⟨0|𝑜𝑢𝑡⊗∨𝑚⟩⟨𝑚∨¿¿Hamiltonian
Example part 1 [Kitaev 99]
![Page 20: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/20.jpg)
Wm-1Wm-2…W0¿𝜓 ⟩¿0 ⟩⊗𝑛𝑎
Hilbert space
Transitionoperators
QMA1 verification circuit (n qubits, m gates)
|𝑧 ⟩|𝑡 ⟩ 𝑧∈ {0,1 }𝑛 , 𝑡∈{0,1,2 ,…,𝑚 }
𝐻𝑡 ,𝑡+1 (𝑊 𝑡 )=12 ¿
Hamiltonian
1√𝑚+1
(|𝜙 ⟩|0 ⟩+𝑊 0|𝜙 ⟩|1 ⟩+𝑊 1𝑊 0|𝜙 ⟩|2 ⟩+…+𝑊𝑚−1𝑊𝑚−2…𝑊 0∨𝜙 ⟩∨𝑚⟩)Nullspace consists of “history states”
𝐻 𝐹𝑒𝑦𝑛𝑚𝑎𝑛=∑𝑖=1
𝑛𝑎|1 ⟩ ⟨1|𝑖⊗∨0⟩⟨ 0∨¿+∑
𝑡=0
𝑚−1
𝐻𝑡 ,𝑡+1(𝑊 𝑡)+|0 ⟩ ⟨0|𝑜𝑢𝑡⊗∨𝑚⟩⟨𝑚∨¿¿
Example part 1 [Kitaev 99]
![Page 21: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/21.jpg)
Wm-1Wm-2…W0¿𝜓 ⟩¿0 ⟩⊗𝑛𝑎
Hilbert space
Transitionoperators
QMA1 verification circuit (n qubits, m gates)
|𝑧 ⟩|𝑡 ⟩ 𝑧∈ {0,1 }𝑛 , 𝑡∈{0,1,2 ,…,𝑚 }
𝐻𝑡 ,𝑡+1 (𝑊 𝑡 )=12 ¿
Hamiltonian
1√𝑚+1
(|𝜙 ⟩|0 ⟩+𝑊 0|𝜙 ⟩|1 ⟩+𝑊 1𝑊 0|𝜙 ⟩|2 ⟩+…+𝑊𝑚−1𝑊𝑚−2…𝑊 0∨𝜙 ⟩∨𝑚⟩)Nullspace consists of “history states”
To have zero energy for the other two terms, we must have|𝜙 ⟩=|0 ⟩𝑛𝑎∨𝜓 ⟩A witness accepted with probability 1
𝐻 𝐹𝑒𝑦𝑛𝑚𝑎𝑛=∑𝑖=1
𝑛𝑎|1 ⟩ ⟨1|𝑖⊗∨0⟩⟨ 0∨¿+∑
𝑡=0
𝑚−1
𝐻𝑡 ,𝑡+1(𝑊 𝑡)+|0 ⟩ ⟨0|𝑜𝑢𝑡⊗∨𝑚⟩⟨𝑚∨¿¿
Example part 1 [Kitaev 99]
![Page 22: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/22.jpg)
Wm-1Wm-2…W0¿𝜓 ⟩¿0 ⟩⊗𝑛𝑎
Hilbert space
QMA1 verification circuit (n qubits, m gates)
|𝑧 ⟩|𝑡 ⟩ 𝑧∈ {0,1 }𝑛 , 𝑡∈{0,1,2 ,…,𝑚 }
𝐻𝑡 ,𝑡+1 (𝑊 𝑡 )=12 ¿
has a zero energy ground state if and only if the QMA1 verification circuit accepts a witness with probability 1. However, it’s not local.
Example part 1 [Kitaev 99]
Kitaev used a clock construction to convert it to a local Hamiltonian…
Transitionoperators
Hamiltonian 𝐻 𝐹𝑒𝑦𝑛𝑚𝑎𝑛=∑𝑖=1
𝑛𝑎|1 ⟩ ⟨1|𝑖⊗∨0⟩⟨ 0∨¿+∑
𝑡=0
𝑚−1
𝐻𝑡 ,𝑡+1(𝑊 𝑡)+|0 ⟩ ⟨0|𝑜𝑢𝑡⊗∨𝑚⟩⟨𝑚∨¿¿
![Page 23: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/23.jpg)
Hilbert space Hcomp⊗Hclock
m qubitsn qubits
Example part 2: Clock construction [Kitaev 99]
![Page 24: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/24.jpg)
𝐻 𝐾𝑖𝑡𝑎𝑒𝑣=1⊗∑𝑖=1
𝑚−1
|01 ⟩ ⟨ 01¿𝑖 ,𝑖+1+𝐻𝑠𝑖𝑚
Hilbert space Hcomp⊗Hclock
m qubitsn qubits
Hamiltonian
Example part 2: Clock construction [Kitaev 99]
A sum of 5-local projectors
![Page 25: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/25.jpg)
𝐻 𝐾𝑖𝑡𝑎𝑒𝑣=1⊗∑𝑖=1
𝑚−1
|01 ⟩ ⟨ 01¿𝑖 ,𝑖+1+𝐻𝑠𝑖𝑚
Nullspace spanned by
Hilbert space Hcomp⊗Hclock
m qubitsn qubits
|t ⟩𝑢=|111…1000…0 ⟩ ,t=0 ,…,m
𝑡 𝑚−𝑡
Hamiltonian
Example part 2: Clock construction [Kitaev 99]
A sum of 5-local projectors
![Page 26: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/26.jpg)
𝐻 𝐾𝑖𝑡𝑎𝑒𝑣=1⊗∑𝑖=1
𝑚−1
|01 ⟩ ⟨ 01¿𝑖 ,𝑖+1+𝐻𝑠𝑖𝑚
𝐻 𝑠𝑖𝑚|Hcomp⊗Sclock=𝐻 𝐹𝑒𝑦𝑛𝑚𝑎𝑛
Nullspace spanned by
is designed so that
This implies has the same nullspace as
Hilbert space Hcomp⊗Hclock
m qubitsn qubits
|t ⟩𝑢=|111…1000…0 ⟩ ,t=0 ,…,m
𝑡 𝑚−𝑡
Hamiltonian
Example part 2: Clock construction [Kitaev 99]
A sum of 5-local projectors
![Page 27: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/27.jpg)
h𝑡 ,𝑡+1 (𝑊 𝑡 ) |Hcomp⊗S clock=𝐻𝑡 ,𝑡+1(𝑊 𝑡)
𝑃0|Sclock=|0 ⟩ ⟨ 0∨¿
𝑃𝑚|Sclock=|𝑚 ⟩ ⟨𝑚∨¿
This is achieved “term by term”, by exhibiting projectors (acting on ) and projectors acting on such that
Example part 2: Clock construction [Kitaev 99]
![Page 28: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/28.jpg)
h𝑡 ,𝑡+1 (𝑊 𝑡 ) |Hcomp⊗S clock=𝐻𝑡 ,𝑡+1(𝑊 𝑡)
𝑃0|Sclock=|0 ⟩ ⟨ 0∨¿
𝑃𝑚|Sclock=|𝑚 ⟩ ⟨𝑚∨¿
This is achieved “term by term”, by exhibiting projectors (acting on ) and projectors acting on such that
Example part 2: Clock construction [Kitaev 99]
𝐻 𝐾𝑖𝑡𝑎𝑒𝑣=1⊗∑𝑖=1
𝑚−1
|01 ⟩ ⟨ 01¿𝑖 ,𝑖+1+∑𝑖=1
𝑛𝑎|1 ⟩ ⟨1|𝑖⊗𝑃0+∑
𝑡=0
𝑚−1
h𝑡 , 𝑡+1(𝑊 𝑡)+|0 ⟩ ⟨0|𝑜𝑢𝑡⊗𝑃𝑚
![Page 29: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/29.jpg)
h𝑡 ,𝑡+1 (𝑊 𝑡 ) |Hcomp⊗S clock=𝐻𝑡 ,𝑡+1(𝑊 𝑡)
𝑃0|Sclock=|0 ⟩ ⟨ 0∨¿
𝑃𝑚|Sclock=|𝑚 ⟩ ⟨𝑚∨¿
This is achieved “term by term”, by exhibiting projectors (acting on ) and projectors acting on such that
Example part 2: Clock construction [Kitaev 99]
𝐻 𝐾𝑖𝑡𝑎𝑒𝑣=1⊗∑𝑖=1
𝑚−1
|01 ⟩ ⟨ 01¿𝑖 ,𝑖+1+∑𝑖=1
𝑛𝑎|1 ⟩ ⟨1|𝑖⊗𝑃0+∑
𝑡=0
𝑚−1
h𝑡 , 𝑡+1(𝑊 𝑡)+|0 ⟩ ⟨0|𝑜𝑢𝑡⊗𝑃𝑚
A -local projector if is j-local
1-local projectors
![Page 30: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/30.jpg)
h𝑡 ,𝑡+1 (𝑊 𝑡 ) |Hcomp⊗S clock=𝐻𝑡 ,𝑡+1(𝑊 𝑡)
𝑃0|Sclock=|0 ⟩ ⟨ 0∨¿
𝑃𝑚|Sclock=|𝑚 ⟩ ⟨𝑚∨¿
This is achieved “term by term”, by exhibiting projectors (acting on ) and projectors acting on such that
Kitaev’s Hamiltonian is a sum of k-local projectors with for circuits made from 1- and 2-qubit gates.
Kitaev’s construction can be used to prove that quantum 5-SAT is QMA1-hard.
Example part 2: Clock construction [Kitaev 99]
𝐻 𝐾𝑖𝑡𝑎𝑒𝑣=1⊗∑𝑖=1
𝑚−1
|01 ⟩ ⟨ 01¿𝑖 ,𝑖+1+∑𝑖=1
𝑛𝑎|1 ⟩ ⟨1|𝑖⊗𝑃1+∑
𝑡=0
𝑚 −1
h𝑡 ,𝑡+1(𝑊 𝑡)+|0 ⟩ ⟨0|𝑜𝑢𝑡⊗𝑃𝑚
A -local projector if is j-local
1-local projectors
![Page 31: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/31.jpg)
The first ingredient in our QMA1-hardness proof is a new clock construction (with different locality from Kitaev’s)…
![Page 32: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/32.jpg)
Properties of the new clock construction
𝐻𝑐𝑙𝑜𝑐𝑘𝑁
.
Hc lockSum of 3-local projectors Hamiltonian acting on
7N-3 qubits
Nullspace
ClockHamiltonian
![Page 33: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/33.jpg)
Properties of the new clock construction
𝐻𝑐𝑙𝑜𝑐𝑘𝑁
.
Hc lockSum of 3-local projectors Hamiltonian acting on
Hcomp⊗Hclock
7N-3 qubits
Nullspace
ClockHamiltonian
Transitionoperators
act on
A -local projector if U is j-local
![Page 34: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/34.jpg)
Properties of the new clock construction
𝐻𝑐𝑙𝑜𝑐𝑘𝑁
.
Hc lockSum of 3-local projectors Hamiltonian acting on
Hcomp⊗Hclock
7N-3 qubits
Nullspace
ClockHamiltonian
Transitionoperators
act on
Greater than/Less than operators 𝐶≤ 𝑖
𝐶≤ 𝑖|Sclock = ∑1≤ 𝑗<𝑖
|𝐶 𝑗 ⟩⟨ 𝐶 𝑗∨+¿12|𝐶𝑖 ⟩⟨ 𝐶𝑖∨¿¿ 𝐶≥ 𝑖|Sclock =
12|𝐶𝑖 ⟩⟨ 𝐶𝑖∨+ ∑
𝑖< 𝑗 ≤𝑁|𝐶 𝑗 ⟩⟨ 𝐶 𝑗∨¿¿
act on Hclock
A -local projector if U is j-local
1-local projectors
![Page 35: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/35.jpg)
3-local 2-local 4-local 2-local
Like Kitaev’s clock construction, ours could be used to emulate Feynman’s Hamiltonian
This isn’t good enough for our purposes—it only shows that quantum 4-SAT is QMA1-hard (already known).
Instead, we use our clock construction in a different way…
1⊗𝐻𝑐𝑙𝑜𝑐𝑘𝑚+ 1 +∑
𝑖=1
𝑛𝑎|1 ⟩⟨ 1∨𝑖⊗𝐶≤ 1+∑
𝑡h𝑡 ,𝑡+1 (𝑊 𝑡 )+|0 ⟩ ⟨ 0∨𝑜𝑢𝑡⊗𝐶≥𝑚+1
![Page 36: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/36.jpg)
Two clock registers
We map the verification circuit to a Hamiltonian acting on a Hilbert space with one n-qubit computational register and two clock registers:
2D grid of zero energy clock states
1⊗𝐻𝑐𝑙𝑜𝑐𝑘𝑁 ⊗1+1⊗1⊗𝐻𝑐𝑙𝑜𝑐𝑘
𝑁
“Initial” “Final”
![Page 37: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/37.jpg)
Two clock registers
We map the verification circuit to a Hamiltonian acting on a Hilbert space with one n-qubit computational register and two clock registers:
1⊗𝐻𝑐𝑙𝑜𝑐𝑘𝑁 ⊗1+1⊗1⊗𝐻𝑐𝑙𝑜𝑐𝑘
𝑁 +𝐻 𝑝𝑟𝑜𝑝
Every zero energy groundstate encodes the history ofa computation
![Page 38: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/38.jpg)
Two clock registers
We map the verification circuit to a Hamiltonian acting on a Hilbert space with one n-qubit computational register and two clock registers:
for 1-local U
1⊗𝐻𝑐𝑙𝑜𝑐𝑘𝑁 ⊗1+1⊗1⊗𝐻𝑐𝑙𝑜𝑐𝑘
𝑁 +𝐻 𝑝𝑟𝑜𝑝
is built out of 3-local projectors such as
h 𝑖 ,𝑖+1 (𝑈 )⊗1
1⊗𝐶≥𝑘⊗𝐶≤ 𝑗
|0 ⟩ ⟨ 0∨𝑎⊗h 𝑖 ,𝑖+1⊗11⊗h𝑖 , 𝑖+1⊗𝐶≤ 𝑘
Every zero energy groundstate encodes the history ofa computation
(writing )
![Page 39: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/39.jpg)
Two clock registers
We map the verification circuit to a Hamiltonian acting on a Hilbert space with one n-qubit computational register and two clock registers:
1⊗𝐻𝑐𝑙𝑜𝑐𝑘𝑁 ⊗1+1⊗1⊗𝐻𝑐𝑙𝑜𝑐𝑘
𝑁 +𝐻 𝑝𝑟𝑜𝑝+∑𝑖=1
𝑛𝑎|1 ⟩ ⟨ 1∨𝑖⊗𝐶≤ 1⊗𝐶≤ 1+|0 ⟩ ⟨ 0∨𝑜𝑢𝑡⊗𝐶≥𝑁⊗𝐶≥𝑁
Enforce initialization of ancillasand correct output of circuit
for 1-local U
is built out of 3-local projectors such as
h 𝑖 ,𝑖+1 (𝑈 )
1⊗𝐶≥𝑘⊗𝐶≤ 𝑗
|0 ⟩ ⟨ 0∨𝑎⊗h 𝑖 ,𝑖+1⊗11⊗h𝑖 , 𝑖+1⊗𝐶≤ 𝑘 (writing )
![Page 40: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/40.jpg)
Two clock registers
We map the verification circuit to a Hamiltonian acting on a Hilbert space with one n-qubit computational register and two clock registers:
1⊗𝐻𝑐𝑙𝑜𝑐𝑘𝑁 ⊗1+1⊗1⊗𝐻𝑐𝑙𝑜𝑐𝑘
𝑁 +𝐻 𝑝𝑟𝑜𝑝+∑𝑖=1
𝑛𝑎|1 ⟩ ⟨ 1∨𝑖⊗𝐶≤ 1⊗𝐶≤ 1+|0 ⟩ ⟨ 0∨𝑜𝑢𝑡⊗𝐶≥𝑁⊗𝐶≥𝑁
Enforce initialization of ancillasand correct output of circuit
I will now show you how to construct for the case where the verification circuit is a specific two-qubit gate (warning: gadgetry ahead)…
for 1-local U
is built out of 3-local projectors such as
h 𝑖 ,𝑖+1 (𝑈 )
1⊗𝐶≥𝑘⊗𝐶≤ 𝑗
|0 ⟩ ⟨ 0∨𝑎⊗h 𝑖 ,𝑖+1⊗11⊗h𝑖 , 𝑖+1⊗𝐶≤ 𝑘 (writing )
![Page 41: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/41.jpg)
Zero energy ground states
1 2 3 4 5 6 7 8 91
2
3
4
5
6
7
8
9
1⊗1⊗𝐻 𝑐𝑙𝑜𝑐𝑘9 +1⊗𝐻𝑐𝑙𝑜𝑐𝑘
9 ⊗1
Two clock registers: Example
![Page 42: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/42.jpg)
Zero energy ground states is a vertex in the above graph
1 2 3 4 5 6 7 8 91
2
3
4
5
6
7
8
9
Two clock registers: Example
1⊗1⊗𝐻 𝑐𝑙𝑜𝑐𝑘9 +1⊗𝐻𝑐𝑙𝑜𝑐𝑘
9 ⊗1+1⊗𝐶≥ 3⊗𝐶≤1
![Page 43: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/43.jpg)
Zero energy ground states
1 2 3 4 5 6 7 8 91
2
3
4
5
6
7
8
9
is a vertex in the above graph
Two clock registers: Example
+1⊗𝐶≤ 1⊗𝐶≥ 3+1⊗𝐶≥ 3⊗𝐶≤11⊗1⊗𝐻 𝑐𝑙𝑜𝑐𝑘9 +1⊗𝐻𝑐𝑙𝑜𝑐𝑘
9 ⊗1
![Page 44: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/44.jpg)
1 2 3 4 5 6 7 8 91
2
3
4
5
6
7
8
9
|𝜙 ⟩𝑎𝑏|Γ ⟩=|𝜙 ⟩𝑎𝑏 ∑𝑖 , 𝑗∈ Γ
|𝐶𝑖 ⟩∨𝐶 𝑗⟩ where is a connected component of the graph
Zero energy ground states
Two clock registers: Example
+1⊗h12⊗𝐶≤2+1⊗𝐶≤ 1⊗𝐶≥ 3+1⊗𝐶≥ 3⊗𝐶≤11⊗1⊗𝐻 𝑐𝑙𝑜𝑐𝑘9 +1⊗𝐻𝑐𝑙𝑜𝑐𝑘
9 ⊗1
![Page 45: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/45.jpg)
1 2 3 4 5 6 7 8 91
2
3
4
5
6
7
8
9
|𝜙 ⟩𝑎𝑏|Γ ⟩=|𝜙 ⟩𝑎𝑏 ∑𝑖 , 𝑗∈ Γ
|𝐶𝑖 ⟩∨𝐶 𝑗⟩ where is a connected component of the graph
Zero energy ground states
Two clock registers: Example
+1⊗h12⊗𝐶≤2+1⊗𝐶≤ 1⊗𝐶≥ 3+1⊗𝐶≥ 3⊗𝐶≤11⊗1⊗𝐻 𝑐𝑙𝑜𝑐𝑘9 +1⊗𝐻𝑐𝑙𝑜𝑐𝑘
9 ⊗1
Continuing in this way,we can design a Hamiltonian with ground states described by a more complicated graph…
![Page 46: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/46.jpg)
Built out of terms likeh 𝑖 ,𝑖+1⊗𝐶≤𝑘
𝐶≤𝑘⊗ h𝑖 ,𝑖+1𝐶≥ 𝑘⊗𝐶≤ 𝑗
|𝜙 ⟩𝑎𝑏|Γ ⟩=|𝜙 ⟩𝑎𝑏 ∑𝑖 , 𝑗∈ Γ
|𝐶𝑖 ⟩∨𝐶 𝑗⟩ where is a connected component of the graph
1 2 3 4 5 6 7 8 91
2
3
4
5
6
7
8
9
Zero energy ground states
Two clock registers: Example
![Page 47: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/47.jpg)
Commutes with
1 2 3 4 5 6 7 8 91
2
3
4
5
6
7
8
9
Zero energy ground states
+¿ 0⟩⟨ 0∨𝑎⊗ (h34+h67 )⊗1+¿1⟩⟨ 1∨𝑎⊗1⊗ (h34+h67 )
Two clock registers: Example
![Page 48: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/48.jpg)
sector1 2 3 4 5 6 7 8 9
1
2
3
4
5
6
7
8
9
1 2 3 4 5 6 7 8 91
2
3
4
5
6
7
8
9
sector
|0⟩𝑎∨𝜓 ⟩𝑏|Γ ⟩ is a connected component
|1⟩𝑎∨𝜓 ⟩𝑏|Γ ⟩ is a connected component
Zero energy ground states Zero energy ground states
+¿ 0⟩⟨ 0∨𝑎⊗ (h34+h67 )⊗1+¿1⟩⟨ 1∨𝑎⊗1⊗ (h34+h67 )
Two clock registers: Example
![Page 49: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/49.jpg)
sector1 2 3 4 5 6 7 8 9
1
2
3
4
5
6
7
8
9
1 2 3 4 5 6 7 8 91
2
3
4
5
6
7
8
9
sector
|0⟩𝑎∨𝜓 ⟩𝑏|Γ ⟩ is a connected component
|1⟩𝑎∨𝜓 ⟩𝑏|Γ ⟩ is a connected component
Zero energy ground states Zero energy ground states
+¿ 0⟩⟨ 0∨𝑎⊗ (h34+h67 )⊗1+¿1⟩⟨ 1∨𝑎⊗1⊗ (h34+h67 )
Two clock registers: Example
![Page 50: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/50.jpg)
sector1 2 3 4 5 6 7 8 9
1
2
3
4
5
6
7
8
9
|0 ⟩𝑎|𝜓 ⟩𝑏|⟩
1 2 3 4 5 6 7 8 91
2
3
4
5
6
7
8
9
sector
|0 ⟩𝑎|𝜓 ⟩𝑏|⟩ |1 ⟩𝑎|𝜓 ⟩𝑏|⟩ |1 ⟩𝑎|𝜓 ⟩𝑏|⟩+ others + others
Zero energy ground states Zero energy ground states
+¿ 0⟩⟨ 0∨𝑎⊗ (h34+h67 )⊗1+¿1⟩⟨ 1∨𝑎⊗1⊗ (h34+h67 )
Two clock registers: Example
![Page 51: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/51.jpg)
sector1 2 3 4 5 6 7 8 9
1
2
3
4
5
6
7
8
9
1 2 3 4 5 6 7 8 91
2
3
4
5
6
7
8
9
sector
𝑉 𝑏
𝑈𝑏 𝑈𝑏
𝑉 𝑏
Zero energy ground states Zero energy ground states
+h45 (𝑈𝑏)⊗1+h45¿
Acts on first clock register and qubit b
Acts on second clock register and qubit b
[𝑈 ,𝑉 ]≠0
+¿ 0⟩⟨ 0∨𝑎⊗ (h34+h67 )⊗1+¿1⟩⟨ 1∨𝑎⊗1⊗ (h34+h67 )
Two clock registers: Example
![Page 52: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/52.jpg)
sector1 2 3 4 5 6 7 8 9
1
2
3
4
5
6
7
8
9
1 2 3 4 5 6 7 8 91
2
3
4
5
6
7
8
9
sector
+h45 (𝑈𝑏)⊗1+h45¿
𝑉 𝑏
𝑈𝑏 𝑈𝑏
𝑉 𝑏
Acts on first clock register and qubit b
Acts on second clock register and qubit b
[𝑈 ,𝑉 ]≠0
Zero energy ground states Zero energy ground states
+¿ 0⟩⟨ 0∨𝑎⊗ (h34+h67 )⊗1+¿1⟩⟨ 1∨𝑎⊗1⊗ (h34+h67 )
Two clock registers: Example
![Page 53: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/53.jpg)
The point is that every zero energy ground state encodes the history of a two-qubit computation
|𝜙 ⟩𝑎𝑏|𝐶1 ⟩|𝐶1 ⟩+…+𝑊|𝜙 ⟩𝑎𝑏∨𝐶9 ⟩∨𝐶9⟩
where 𝑊=|0 ⟩ ⟨ 0∨⊗𝑉𝑈+¿1⟩⟨ 1∨⊗𝑈𝑉
(An entangling two-qubit unitary for suitably chosen )
+h45 (𝑈𝑏)⊗1+h45¿
Acts on first clock register and qubit b
Acts on second clock register and qubit b
[𝑈 ,𝑉 ]≠0
+¿ 0⟩⟨ 0∨𝑎⊗ (h34+h67 )⊗1+¿1⟩⟨ 1∨𝑎⊗1⊗ (h34+h67 )
Two clock registers: Example
This was achieved without using the transition operator
![Page 54: Quantum 3-SAT is QMA 1 -complete](https://reader036.vdocument.in/reader036/viewer/2022081507/568163c8550346895dd4fdf1/html5/thumbnails/54.jpg)
Remarks and open questions
• Are there simpler “clause-by-clause” reductions for quantum k-SAT? In the classical case there is a clause-by-clause way to map a (k+1)-SAT instance to a k-SAT instance, for .
• Other applications for our new clock construction?
• “Frustration-free” gadgetry has the advantage over perturbation theory methods that one can avoid large (system size dependent) terms in the Hamiltonian.