On the public citation graph
The complexity of quantum spin systems on a two-dimensional square lattice
0 signed · 98 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/s00037-005-0194-xopenalex-snapshot
Quantum Arthur–Merlin games
inferredcites →https://doi.org/10.1016/s0003-4916(02)00018-0openalex-snapshot
Fault-tolerant quantum computation by anyons
inferredcites →https://doi.org/10.1016/s0034-4877(06)80014-5openalex-snapshot
Cluster-state quantum computation
inferredcites →https://doi.org/10.1088/0305-4470/15/10/028openalex-snapshot
On the computational complexity of Ising spin glass models
inferredcites →https://doi.org/10.1103/physrevlett.86.5188openalex-snapshot
A One-Way Quantum Computer
inferredcites →https://doi.org/10.1137/s0097539704445226openalex-snapshot
The Complexity of the Local Hamiltonian Problem
inferredcites →https://doi.org/10.26421/qic3.3-7openalex-snapshot
3-Local Hamiltonian is QMA-complete
inferredcites →https://doi.org/10.48550/arxiv.cond-mat/0508428openalex-snapshot
Lower Bound for the Ground-State Energy Density of a 1D Quantum Spin System
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0305050openalex-snapshot
Identity check is QMA-complete
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0411152openalex-snapshot
An Elementary Proof of the Quantum Adiabatic Theorem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4939-9084-9_4openalex-snapshot
Local Hamiltonians and Ground States
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_50openalex-snapshot
Ground State Connectivity of Local Hamiltonians
inferred← citeshttps://doi.org/10.1007/jhep03(2022)052openalex-snapshot
Holographic duality between local Hamiltonians from random tensor networks
inferred← citeshttps://doi.org/10.1007/jhep11(2018)138openalex-snapshot
On the time dependence of holographic complexity in a dynamical Einstein-dilaton model
inferred← citeshttps://doi.org/10.1007/s00023-021-01111-7openalex-snapshot
Translationally Invariant Universal Quantum Hamiltonians in 1D
inferred← citeshttps://doi.org/10.1016/j.jcp.2021.110534openalex-snapshot
Two-dimensional local Hamiltonian problem with area laws is QMA-complete
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.031openalex-snapshot
Epsilon-net method for optimizations over separable states
inferred← citeshttps://doi.org/10.1063/1.3254321openalex-snapshot
Ground state entanglement in one-dimensional translationally invariant quantum systems
inferred← citeshttps://doi.org/10.1063/1.5011338openalex-snapshot
The complexity of translationally invariant low-dimensional spin lattices in 3D
inferred← citeshttps://doi.org/10.1063/5.0069530openalex-snapshot
Three-Josephson junctions flux qubit couplings
inferred← citeshttps://doi.org/10.1073/pnas.1804949115openalex-snapshot
Universal quantum Hamiltonians
inferred← citeshttps://doi.org/10.1088/1367-2630/10/9/093004openalex-snapshot
A single-shot measurement of the energy of product states in a translation invariant spin chain can replace any quantum computation
inferred← citeshttps://doi.org/10.1088/1367-2630/16/11/113070openalex-snapshot
Adiabatic graph-state quantum computation
inferred← citeshttps://doi.org/10.1088/1367-2630/16/12/123056openalex-snapshot
Perturbative 2-body parent Hamiltonians for projected entangled pair states
inferred← citeshttps://doi.org/10.1088/1367-2630/16/4/045006openalex-snapshot
Max 2-SAT with up to 108 qubits
inferred← citeshttps://doi.org/10.1088/1367-2630/18/2/023042openalex-snapshot
Adiabatic and Hamiltonian computing on a 2D lattice with simple two-qubit interactions
inferred← citeshttps://doi.org/10.1088/1751-8113/45/50/505305openalex-snapshot
Relationship between minimum gap and success probability in adiabatic quantum computing
inferred← citeshttps://doi.org/10.1088/1751-8113/47/19/195304openalex-snapshot
Space-time circuit-to-Hamiltonian construction and its applications
inferred← citeshttps://doi.org/10.1088/2058-9565/ab18ddopenalex-snapshot
Hamiltonian quantum computing with superconducting qubits
inferred← citeshttps://doi.org/10.1098/rspa.2007.0026openalex-snapshot
Why should anyone care about computing with anyons?
inferred← citeshttps://doi.org/10.1103/29qw-bssxopenalex-snapshot
Beating the Natural Grover Bound for Low-Energy Estimation and State Preparation
inferred← citeshttps://doi.org/10.1103/clj1-v2zzopenalex-snapshot
Physically motivated guiding states for local Hamiltonians
inferred← citeshttps://doi.org/10.1103/physreva.103.012604openalex-snapshot
Pinned quantum Merlin-Arthur: The power of fixing a few qubits in proofs
inferred← citeshttps://doi.org/10.1103/physreva.75.012307openalex-snapshot
Spin- 1∕2 particles moving on a two-dimensional lattice with nearest-neighbor interactions can realize an autonomous quantum computer
inferred← citeshttps://doi.org/10.1103/physreva.77.052331openalex-snapshot
Nonperturbative k -body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins
inferred← citeshttps://doi.org/10.1103/physreva.78.042324openalex-snapshot
Stability of quantum concatenated-code Hamiltonians
inferred← citeshttps://doi.org/10.1103/physrevb.109.224410openalex-snapshot
Sample complexity of matrix product states at finite temperature
inferred← citeshttps://doi.org/10.1103/physrevlett.101.070503openalex-snapshot
Quantum Simulation of Many-Body Hamiltonians Using Perturbation Theory with Bounded-Strength Interactions
inferred← citeshttps://doi.org/10.1103/physrevlett.102.220501openalex-snapshot
Gapped Two-Body Hamiltonian Whose Unique Ground State Is Universal for One-Way Quantum Computation
inferred← citeshttps://doi.org/10.1103/physrevlett.103.067201openalex-snapshot
Engineering Giant Nonlinearities in Quantum Nanosystems
inferred← citeshttps://doi.org/10.1103/physrevlett.103.090502openalex-snapshot
Holonomic Quantum Computation in Subsystems
inferred← citeshttps://doi.org/10.1103/physrevlett.103.120504openalex-snapshot
Adiabatic Gate Teleportation
inferred← citeshttps://doi.org/10.1103/physrevlett.104.040501openalex-snapshot
Interacting Boson Problems Can Be QMA Hard
inferred← citeshttps://doi.org/10.1103/physrevlett.105.170405openalex-snapshot
Preparing Thermal States of Quantum Systems by Dimension Reduction
inferred← citeshttps://doi.org/10.1103/physrevlett.107.040501openalex-snapshot
Computational Difficulty of Computing the Density of States
inferred← citeshttps://doi.org/10.1103/physrevlett.107.170402openalex-snapshot
Quantum Simulation of Classical Thermal States
inferred← citeshttps://doi.org/10.1103/physrevlett.108.010501openalex-snapshot
Ramsey Numbers and Adiabatic Quantum Computing
inferred← citeshttps://doi.org/10.1103/physrevlett.110.260408openalex-snapshot
Fibonacci topological order from quantum nets
inferred← citeshttps://doi.org/10.1103/physrevlett.114.140501openalex-snapshot
Universal Adiabatic Quantum Computation via the Space-Time Circuit-to-Hamiltonian Construction
inferred← citeshttps://doi.org/10.1103/physrevlett.117.010403openalex-snapshot
Characterizing Ground and Thermal States of Few-Body Hamiltonians
inferred← citeshttps://doi.org/10.1103/physrevresearch.6.l022041openalex-snapshot
Quadratic acceleration of multistep probabilistic algorithms for state preparation
inferred← citeshttps://doi.org/10.1103/physrevx.15.021017openalex-snapshot
Accuracy Guarantees and Quantum Advantage in Analog Open Quantum Simulation with and without Noise
inferred← citeshttps://doi.org/10.1103/physrevx.3.021015openalex-snapshot
Adiabatic Quantum Transistors
inferred← citeshttps://doi.org/10.1103/physrevx.4.041028openalex-snapshot
Local Convertibility and the Quantum Simulation of Edge States in Many-Body Systems
inferred← citeshttps://doi.org/10.1103/physrevx.5.041040openalex-snapshot
Parafermions in a Kagome Lattice of Qubits for Topological Quantum Computation
inferred← citeshttps://doi.org/10.1103/prxquantum.3.020322openalex-snapshot
Intractability of Electronic Structure in a Fixed Basis
inferred← citeshttps://doi.org/10.1103/prxquantum.3.040327openalex-snapshot
Importance of the Spectral gap in Estimating Ground-State Energies
inferred← citeshttps://doi.org/10.1103/revmodphys.90.015002openalex-snapshot
Adiabatic quantum computation
inferred← citeshttps://doi.org/10.1109/ccc.2011.15openalex-snapshot
Approximation Algorithms for QMA-Complete Problems
inferred← citeshttps://doi.org/10.1109/ccc.2014.12openalex-snapshot
On Physical Problems that are Slightly More Difficult than QMA
inferred← citeshttps://doi.org/10.1109/date.2010.5457217openalex-snapshot
Spinto: High-performance energy minimization in spin glasses
inferred← citeshttps://doi.org/10.1109/focs.2014.21openalex-snapshot
Complexity Classification of Local Hamiltonian Problems
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00027openalex-snapshot
QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174029openalex-snapshot
2D Local Hamiltonian with Area Laws Is QMA-Complete
inferred← citeshttps://doi.org/10.1109/qce52317.2021.00026openalex-snapshot
Optimizing Parameterized Quantum Circuits with Free-Axis Selection
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00206openalex-snapshot
Adaptive Non-Local Observable on Quantum Neural Networks
inferred← citeshttps://doi.org/10.1109/tqe.2023.3286411openalex-snapshot
Optimizing Parameterized Quantum Circuits With Free-Axis Single-Qubit Gates
inferred← citeshttps://doi.org/10.1126/sciadv.aat9004openalex-snapshot
A quantum machine learning algorithm based on generative models
inferred← citeshttps://doi.org/10.1137/21m140729xopenalex-snapshot
QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
inferred← citeshttps://doi.org/10.1145/3519935.3520067openalex-snapshot
Hamiltonian complexity in the thermodynamic limit
inferred← citeshttps://doi.org/10.1145/3639528.3639535openalex-snapshot
Guest Column: The 7 faces of quantum NP
inferred← citeshttps://doi.org/10.1145/3717823.3718268openalex-snapshot
Efficient Thermalization and Universal Quantum Computing with Quantum Gibbs Samplers
inferred← citeshttps://doi.org/10.1145/3759156openalex-snapshot
Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis
inferred← citeshttps://doi.org/10.1201/9781315153551-33openalex-snapshot
Nanosilicon for quantum information
inferred← citeshttps://doi.org/10.15488/385openalex-snapshot
Perturbative 2-body parent Hamiltonians for projected entangled pair states
inferred← citeshttps://doi.org/10.17169/refubium-31445openalex-snapshot
Quantum advantage from energy measurements of many-body quantum systems
inferred← citeshttps://doi.org/10.2200/s00596ed1v01y201409qmc009openalex-snapshot
Approximability of Optimization Problems through Adiabatic Quantum Computation
inferred← citeshttps://doi.org/10.22331/q-2017-07-14-16openalex-snapshot
QCMA hardness of ground space connectivity for commuting Hamiltonians
inferred← citeshttps://doi.org/10.22331/q-2018-01-31-50openalex-snapshot
Bond dimension witnesses and the structure of homogeneous matrix product states
inferred← citeshttps://doi.org/10.22331/q-2021-06-02-465openalex-snapshot
Quantum advantage from energy measurements of many-body quantum systems
inferred← citeshttps://doi.org/10.22331/q-2022-03-17-668openalex-snapshot
The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings
inferred← citeshttps://doi.org/10.22331/q-2025-09-11-1857openalex-snapshot
Expanding Hardware-Efficiently Manipulable Hilbert Space via Hamiltonian Embedding
inferred← citeshttps://doi.org/10.22331/q-2026-01-08-1960openalex-snapshot
Resource-Dependent Complexity of Quantum Channels
inferred← citeshttps://doi.org/10.26421/qic17.9-10openalex-snapshot
Efficient optimization of perturbative gadgets
inferred← citeshttps://doi.org/10.26421/qic8.5-1openalex-snapshot
The complexity of stoquastic local Hamiltonian problems
inferred← citeshttps://doi.org/10.48550/arxiv.0705.4067openalex-snapshot
The Complexity of Quantum Systems on a One-dimensional Chain
inferred← citeshttps://doi.org/10.48550/arxiv.0802.1207openalex-snapshot
Universal quantum walks and adiabatic algorithms by 1D Hamiltonians
inferred← citeshttps://doi.org/10.48550/arxiv.0803.1447openalex-snapshot
Quantum computation, quantum state engineering, and quantum phase transitions driven by dissipation
inferred← citeshttps://doi.org/10.48550/arxiv.0806.1746openalex-snapshot
Complexity of stoquastic frustration-free Hamiltonians
inferred← citeshttps://doi.org/10.48550/arxiv.1607.01374openalex-snapshot
Efficient estimation of perturbative error with cellular automata
inferred← citeshttps://doi.org/10.48550/arxiv.2111.05461openalex-snapshot
Reflection-Based Adiabatic State Preparation
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0606229openalex-snapshot
Estimating diagonal entries of powers of sparse symmetric matrices is BQP-complete
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0611021openalex-snapshot
Merlin-Arthur Games and Stoquastic Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0703082openalex-snapshot
On the Quantum Circuit Complexity Equivalence
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.