REVIEW 9 cited by
The complexity of quantum spin systems on a two-dimensional square lattice
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
The problem 2-LOCAL HAMILTONIAN has been shown to be complete for the quantum computational class QMA, see quant-ph/0406180. In this paper we show that this important problem remains QMA-complete when the interactions of the 2-local Hamiltonian are between qubits on a two-dimensional (2-D) square lattice. Our results are partially derived with novel perturbation gadgets that employ mediator qubits which allow us to manipulate k-local interactions. As a side result, we obtain that quantum adiabatic computation using 2-local interactions restricted to a 2-D square lattice is equivalent to the circuit model of quantum computation. Our perturbation method also shows how any stabilizer space associated with a k-local stabilizer (for constant k) can be generated as an approximate ground-space of a 2-local Hamiltonian.
Forward citations
Cited by 9 Pith papers
-
Hamilton-Zero: A Neural Tensor-Network Foundation Model for Ground States of Arbitrary Quadratic Qubit Hamiltonians
A neural foundation model trained on hundreds of thousands of quadratic qubit Hamiltonians produces variational ground-state energy bounds that transfer across system sizes and topologies, though large-scale extrapola...
-
Convergence rates of Sum-of-Hermitian-Squares Hierarchies for the Pauli algebra
Explicit convergence rates for noncommutative SOS hierarchies on the Pauli algebra are bounded using smallest roots of Krawtchouk polynomials.
-
Quantum Differential Equation Solvers with Low State Preparation Cost: Eliminating the Time Dependence in Dissipative Equations
For strictly dissipative linear ODEs, quantum solvers based on time-marching or LCHS achieve query complexity O(polylog(1/ε)) that is independent of the evolution time T.
-
Provable learning separation for predicting time-evolution of quantum many-body systems
A provable exponential quantum-classical learning separation is established for predicting expectation values of time-evolved quantum states under unknown low-intersection Hamiltonians, assuming BQP ⊄ P/poly.
-
Solving Classical and Quantum Spin Glasses with Deep Boltzmann Quantum States
Deep Boltzmann Quantum States with natural-gradient optimization and annealing-like training match exact or best-known solutions for large infinite-range Ising spin glasses and solve job shop scheduling instances.
-
On the Complexity of the Succinct State Local Hamiltonian Problem
The succinct state 2-local Hamiltonian problem for qubit Hamiltonians is promise-MA-complete.
-
Sandwich test for Quantum Phase Estimation
The Sandwich test estimates <ψ|U^k|ψ> with total run time O(k^2 ln k / ε^2 s_min^6), skipping small-amplitude steps via a random binary sum tree, but the key assumption that s_min stays large is unproven.
-
Observable Geometry for Effective Quantum Circuits
A stabilizer-overlap score built from a Hamiltonian's eigenspaces predicts which variational circuit generators are redundant and should be removed.
-
Adaptive Non-local Observable on Quantum Neural Networks
Trainable non-local Hermitian observables are more expressive than fixed Pauli measurements and yield higher classification accuracy in simulation, though the comparison is confounded by unequal parameter counts and a...
Discussion (0). Continue with ORCID to comment.