On the public citation graph

On Physical Problems that are Slightly More Difficult than QMA

0 signed · 69 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-16486-3_93openalex-snapshot
The boolean hierarchy: Hardware over NP
inferredcites →https://doi.org/10.1007/978-3-540-24587-2_21openalex-snapshot
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
inferredcites →https://doi.org/10.1007/978-3-642-31594-7_33openalex-snapshot
Hardness of Approximation for Quantum Problems
inferredcites →https://doi.org/10.1007/978-3-662-03088-2_3openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1007/bfb0009651openalex-snapshot
Two remarks on the power of counting
inferredcites →https://doi.org/10.1007/bfb0028832openalex-snapshot
On the boolean closure of NP
inferredcites →https://doi.org/10.1007/bfb0036487openalex-snapshot
Two remarks on the power of counting
inferredcites →https://doi.org/10.1007/s00037-005-0194-xopenalex-snapshot
Quantum Arthur–Merlin games
inferredcites →https://doi.org/10.1016/0022-0000(84)90068-0openalex-snapshot
The complexity of facets (and some facets of complexity)
inferredcites →https://doi.org/10.1016/0022-0000(88)90039-6openalex-snapshot
The complexity of optimization problems
inferredcites →https://doi.org/10.1016/0022-0000(88)90042-6openalex-snapshot
The complexity of facets resolved
inferredcites →https://doi.org/10.1016/0304-3975(86)90135-0openalex-snapshot
NP is as easy as detecting unique solutions
inferredcites →https://doi.org/10.1016/0304-3975(87)90049-1openalex-snapshot
More complicated questions about maxima and minima, and some closures of NP
inferredcites →https://doi.org/10.1016/0890-5401(91)90075-dopenalex-snapshot
On truth-table reducibility to SAT
inferredcites →https://doi.org/10.1017/cbo9780511810817openalex-snapshot
Matrix Analysis
inferredcites →https://doi.org/10.1088/0034-4885/75/2/022001openalex-snapshot
Hamiltonian complexity
inferredcites →https://doi.org/10.1090/gsm/047openalex-snapshot
Classical and Quantum Computation
inferredcites →https://doi.org/10.1090/memo/0066openalex-snapshot
The undecidability of the domino problem
inferredcites →https://doi.org/10.1103/physreva.78.012352openalex-snapshot
Realizable Hamiltonians for universal adiabatic quantum computers
inferredcites →https://doi.org/10.1103/physrevlett.107.040501openalex-snapshot
Computational Difficulty of Computing the Density of States
inferredcites →https://doi.org/10.1109/ccc.2008.5openalex-snapshot
The Power of Unentanglement
inferredcites →https://doi.org/10.1109/ccc.2014.12openalex-snapshot
On Physical Problems that are Slightly More Difficult than QMA
inferredcites →https://doi.org/10.1109/focs.2004.53openalex-snapshot
Quantum Speed-Up of Markov Chain Based Algorithms
inferredcites →https://doi.org/10.1109/focs.2010.66openalex-snapshot
An Efficient Test for Product States with Applications to Quantum Merlin-Arthur Games
inferredcites →https://doi.org/10.1109/sfcs.2000.892141openalex-snapshot
Succinct quantum proofs for properties of finite groups
inferredcites →https://doi.org/10.1137/0216022openalex-snapshot
Graph Minimal Uncolorability is ${\text{D}}^{\text{p}} $-Complete
inferredcites →https://doi.org/10.1137/0217078openalex-snapshot
The Boolean Hierarchy I: Structural Properties
inferredcites →https://doi.org/10.1137/0218007openalex-snapshot
The Boolean Hierarchy II: Applications
inferredcites →https://doi.org/10.1137/0219058openalex-snapshot
Bounded Query Classes
inferredcites →https://doi.org/10.1137/s0097539704445226openalex-snapshot
The Complexity of the Local Hamiltonian Problem
inferredcites →https://doi.org/10.1137/s0097539799362639openalex-snapshot
The Minimization Problem for Boolean Formulas
inferredcites →https://doi.org/10.1145/2432622.2432625openalex-snapshot
Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization
inferredcites →https://doi.org/10.1145/268999.269002openalex-snapshot
Exact analysis of Dodgson elections
inferredcites →https://doi.org/10.22331/q-2022-03-17-668openalex-snapshot
The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings
inferredcites →https://doi.org/10.26421/qic3.3-7openalex-snapshot
3-Local Hamiltonian is QMA-complete
inferredcites →https://doi.org/10.26421/qic8.10-2openalex-snapshot
The complexity of quantum spin systems on a two-dimensional square lattice
inferredcites →https://doi.org/10.4086/toc.2012.v008a017openalex-snapshot
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0001106openalex-snapshot
Quantum Computation by Adiabatic Evolution
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0210077openalex-snapshot
Quantum NP - A Survey
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/9610012openalex-snapshot
Quantum Randomness and Nondeterminism
inferredcites →https://doi.org/10.5555/2016985.2016987openalex-snapshot
The complexity of quantum spin systems on a two-dimensional square lattice

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-3-662-47672-7_50openalex-snapshot
Ground State Connectivity of Local Hamiltonians
inferred← citeshttps://doi.org/10.1007/s00037-021-00214-1openalex-snapshot
Lower Bounds for Arithmetic Circuits via the Hankel Matrix
inferred← citeshttps://doi.org/10.1007/s00037-022-00231-8openalex-snapshot
Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
inferred← citeshttps://doi.org/10.1038/s41467-024-51439-xopenalex-snapshot
Efficient learning of ground & thermal states within phases of matter
inferred← citeshttps://doi.org/10.1038/s41467-024-51592-3openalex-snapshot
Certified algorithms for equilibrium states of local quantum Hamiltonians
inferred← citeshttps://doi.org/10.1039/d5dd00377fopenalex-snapshot
Chemically motivated simulation problems are efficiently solvable on a quantum computer
inferred← citeshttps://doi.org/10.1103/fm8m-kz13openalex-snapshot
Energy Gap of Quantum Spin Glasses: A Projection Quantum Monte Carlo Study
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.1109/tai.2022.3187676openalex-snapshot
Retracted: Quantum-Assisted Activation for Supervised Learning in Healthcare-Based Intrusion Detection Systems
inferred← citeshttps://doi.org/10.1142/s0219749925500352openalex-snapshot
Quantum detection of recurrent dynamics
inferred← citeshttps://doi.org/10.1145/3186587openalex-snapshot
Ground State Connectivity of Local Hamiltonians
inferred← citeshttps://doi.org/10.1145/3519935.3519991openalex-snapshot
Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture
inferred← citeshttps://doi.org/10.1145/3519935.3520052openalex-snapshot
Computational complexity of the ground state energy density problem
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/3769108openalex-snapshot
Hamiltonian Complexity in the Thermodynamic Limit
inferred← citeshttps://doi.org/10.1561/0400000068openalex-snapshot
Quantum Proofs
inferred← citeshttps://doi.org/10.22331/q-2019-09-30-189openalex-snapshot
The complexity of simulating local measurements on quantum systems
inferred← citeshttps://doi.org/10.22331/q-2020-12-14-372openalex-snapshot
Near-optimal ground state preparation
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-2022-07-11-761openalex-snapshot
Computing Ground State Properties with Early Fault-Tolerant Quantum Computers
inferred← citeshttps://doi.org/10.22331/q-2023-11-06-1167openalex-snapshot
Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.75openalex-snapshot
On Polynomially Many Queries to NP or QMA Oracles
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2020.20openalex-snapshot
Oracle Complexity Classes and Local Measurements on Physical 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.48550/arxiv.1910.01481openalex-snapshot
Detailed Analysis of Circuit-to-Hamiltonian Mappings
inferred← citeshttps://doi.org/10.48550/arxiv.2311.18706openalex-snapshot
Certified algorithms for equilibrium states of local quantum Hamiltonians
showing the first 27 of 28 · page through all 28
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.