On the public citation graph
Commutative version of the local Hamiltonian problem and common eigenspace problem
0 signed · 76 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/978-1-4612-0265-3openalex-snapshot
Polynomial and Matrix Computations
inferredcites →https://doi.org/10.1007/978-3-662-10451-4openalex-snapshot
Theory of Operator Algebras II
inferredcites →https://doi.org/10.1007/978-94-010-1795-4_17openalex-snapshot
The Problem of Hidden Variables in Quantum Mechanics
inferredcites →https://doi.org/10.1088/0305-4470/24/4/003openalex-snapshot
Two simple proofs of the Kochen-Specker theorem
inferredcites →https://doi.org/10.1103/physrevlett.78.405openalex-snapshot
Quantum Error Correction and Orthogonal Geometry
inferredcites →https://doi.org/10.1103/physrevlett.84.2525openalex-snapshot
Theory of Quantum Error Correction for General Noise
inferredcites →https://doi.org/10.1103/physrevlett.86.910openalex-snapshot
Persistent Entanglement in Arrays of Interacting Particles
inferredcites →https://doi.org/10.1109/sfcs.2000.892141openalex-snapshot
Succinct quantum proofs for properties of finite groups
inferredcites →https://doi.org/10.1109/sfcs.2003.1238195openalex-snapshot
A lattice problem in quantum NP
inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot
Quantum Computation and Quantum Information
inferredcites →https://doi.org/10.1137/s0097539704445226openalex-snapshot
The Complexity of the Local Hamiltonian Problem
inferredcites →https://doi.org/10.1142/s021974990300022xopenalex-snapshot
THE 2-LOCAL HAMILTONIAN PROBLEM ENCOMPASSES NP
inferredcites →https://doi.org/10.26421/qic3.3-7openalex-snapshot
3-Local Hamiltonian is QMA-complete
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0210077openalex-snapshot
Quantum NP - A Survey
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0305050openalex-snapshot
Identity check is QMA-complete
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11830924_40openalex-snapshot
Consistency of Local Density Matrices Is QMA-Complete
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_31openalex-snapshot
The Complexity of the Local Hamiltonian Problem
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/s00023-025-01637-0openalex-snapshot
Quasi-optimal Sampling from Gibbs States via Non-commutative Optimal Transport Metrics
inferred← citeshttps://doi.org/10.1007/s00220-016-2575-1openalex-snapshot
Product-State Approximations to Quantum States
inferred← citeshttps://doi.org/10.1007/s11128-014-0877-9openalex-snapshot
The commuting local Hamiltonian problem on locally expanding graphs is approximable in $$\mathsf{{NP}}$$ NP
inferred← citeshttps://doi.org/10.1016/j.aop.2016.12.030openalex-snapshot
Matrix product density operators: Renormalization fixed points and boundary theories
inferred← citeshttps://doi.org/10.1063/1.2748377openalex-snapshot
New construction for a QMA complete three-local Hamiltonian
inferred← citeshttps://doi.org/10.1073/pnas.1804949115openalex-snapshot
Universal quantum Hamiltonians
inferred← citeshttps://doi.org/10.1088/1751-8113/45/2/025306openalex-snapshot
Classification of the phases of 1D spin chains with commuting Hamiltonians
inferred← citeshttps://doi.org/10.1103/bq28-r2r7openalex-snapshot
Classical and Quantum Algorithms for Characters of the Symmetric Group
inferred← citeshttps://doi.org/10.1103/physreva.102.032418openalex-snapshot
Classical simulation of noncontextual Pauli Hamiltonians
inferred← citeshttps://doi.org/10.1103/physreva.82.012314openalex-snapshot
Matrix product state and mean-field solutions for one-dimensional systems can be found efficiently
inferred← citeshttps://doi.org/10.1103/physreva.82.012315openalex-snapshot
Efficient algorithm for approximating one-dimensional ground states
inferred← citeshttps://doi.org/10.1103/physreva.96.032321openalex-snapshot
Nonunitary quantum computation in the ground space of local Hamiltonians
inferred← citeshttps://doi.org/10.1103/physrevlett.104.050503openalex-snapshot
Tradeoffs for Reliable Quantum Information Storage in 2D Systems
inferred← citeshttps://doi.org/10.1103/physrevlett.107.210501openalex-snapshot
Topological Order at Nonzero Temperature
inferred← citeshttps://doi.org/10.1103/physrevlett.113.260504openalex-snapshot
Quantum Error Suppression with Commuting Hamiltonians: Two Local is Too Local
inferred← citeshttps://doi.org/10.1103/physrevlett.125.210504openalex-snapshot
Projected Entangled Pair States: Fundamental Analytical and Numerical Limitations
inferred← citeshttps://doi.org/10.1103/physrevresearch.4.023161openalex-snapshot
Preparation and verification of tensor network states
inferred← citeshttps://doi.org/10.1109/ccc.2011.15openalex-snapshot
Approximation Algorithms for QMA-Complete Problems
inferred← citeshttps://doi.org/10.1109/cdc.2017.8264477openalex-snapshot
Distributed finite-time stabilization of entangled quantum states on tree-like hypergraphs
inferred← citeshttps://doi.org/10.1109/focs.2011.58openalex-snapshot
On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems
inferred← citeshttps://doi.org/10.1109/focs.2014.21openalex-snapshot
Complexity Classification of Local Hamiltonian Problems
inferred← citeshttps://doi.org/10.1109/focs.2017.46openalex-snapshot
Local Hamiltonians Whose Ground States Are Hard to Approximate
inferred← citeshttps://doi.org/10.1109/focs.2017.47openalex-snapshot
On Preparing Ground States of Gapped Hamiltonians: An Efficient Quantum Lovász Local Lemma
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00069openalex-snapshot
Sample-efficient learning of quantum many-body systems
inferred← citeshttps://doi.org/10.1145/3186587openalex-snapshot
Ground State Connectivity of Local Hamiltonians
inferred← citeshttps://doi.org/10.17863/cam.46264openalex-snapshot
Perturbation Gadgets: Arbitrary Energy Scales from a Single Strong Interaction
inferred← citeshttps://doi.org/10.2140/gtm.2012.18.115openalex-snapshot
Matrix product operators and central elements: classical description of a quantum state
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-2025-08-05-1821openalex-snapshot
Families of d=2 2D subsystem stabilizer codes for universal Hamiltonian quantum computation with two-body interactions
inferred← citeshttps://doi.org/10.22331/q-2026-02-06-1996openalex-snapshot
Quantum Circuit Optimization by Graph Coloring
inferred← citeshttps://doi.org/10.25365/thesis.31407openalex-snapshot
On the computational power of quantum computers
inferred← citeshttps://doi.org/10.26421/qic11.11-12-1openalex-snapshot
Complexity of commuting Hamiltonians on a square lattice of qubits
inferred← citeshttps://doi.org/10.26421/qic11.11-12-10openalex-snapshot
A note about a partial no-go theorem for quantum PCP
inferred← citeshttps://doi.org/10.26421/qic13.1-2-5openalex-snapshot
Commuting quantum circuits: efficiently classical simulations versus hardness results
inferred← citeshttps://doi.org/10.26421/qic15.11-12-7openalex-snapshot
A constructive quantum Lovasz local lemma for commuting projectors
inferred← citeshttps://doi.org/10.3934/math.20261115openalex-snapshot
Equivariant quantum Boolean functions and quantum locality tests
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2019.2openalex-snapshot
Hamiltonian Sparsification and Gap-Simulation
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.6openalex-snapshot
Circuit Lower Bounds for Low-Energy States of Quantum Code Hamiltonians
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2023.54openalex-snapshot
The Complexity of Translationally Invariant Problems Beyond Ground State Energies
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2025.12openalex-snapshot
Commuting Local Hamiltonians on Expanders, Locally Testable Quantum codes, and the qPCP conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.0712.3041openalex-snapshot
The Complexity of the Consistency and N-representability Problems for Quantum States
inferred← citeshttps://doi.org/10.48550/arxiv.0808.2117openalex-snapshot
Local Hamiltonians in Quantum Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1112.1413openalex-snapshot
A constructive commutative quantum Lovasz Local Lemma, and beyond
inferred← citeshttps://doi.org/10.48550/arxiv.1204.4570openalex-snapshot
Commuting quantum circuits: efficient classical simulations versus hardness results
inferred← citeshttps://doi.org/10.48550/arxiv.1206.0755openalex-snapshot
Quantum Markov Networks and Commuting Hamiltonians
inferred← citeshttps://doi.org/10.48550/arxiv.1301.2632openalex-snapshot
Approximation, Proof Systems, and Correlations in a Quantum World
inferred← citeshttps://doi.org/10.48550/arxiv.1311.3161openalex-snapshot
Complexity classification of local Hamiltonian problems
inferred← citeshttps://doi.org/10.48550/arxiv.1311.7378openalex-snapshot
The commuting local Hamiltonian on locally-expanding graphs is in NP
inferred← citeshttps://doi.org/10.48550/arxiv.1406.5279openalex-snapshot
Tensor network non-zero testing
inferred← citeshttps://doi.org/10.48550/arxiv.1810.03912openalex-snapshot
Quantum Circuit Depth Lower Bounds For Homological Codes
inferred← citeshttps://doi.org/10.48550/arxiv.2009.11817openalex-snapshot
The modified logarithmic Sobolev inequality for quantum spin systems: classical and commuting nearest neighbour interactions
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.