The power of quantum systems on a line
Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe

TL;DR
This paper demonstrates that one-dimensional quantum systems can perform universal adiabatic quantum computation and that approximating their ground state energy is QMA-complete, highlighting complex computational properties unlike classical counterparts.
Contribution
It proves universal adiabatic quantum computation in 1D systems and establishes QMA-completeness for ground state energy approximation with novel techniques.
Findings
Universal adiabatic quantum computation is possible in 1D systems with 9 states per particle.
Ground state energy approximation in 1D quantum systems is QMA-complete.
Some 1D quantum systems take exponential time to relax to their ground states, resembling spin glasses.
Abstract
We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic quantum computation using a one-dimensional quantum system (with 9 states per particle). This might have practical implications for experimentalists interested in constructing an adiabatic quantum computer. Building on the same construction, but with some additional technical effort and 12 states per particle, we show that the problem of approximating the ground state energy of a system composed of a line of quantum particles is QMA-complete; QMA is a quantum analogue of NP. This is in striking contrast to the fact that the analogous classical problem, namely, one-dimensional MAX-2-SAT with nearest neighbor constraints, is in P. The proof of the QMA-completeness result requires an additional idea beyond the usual…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
