On the public citation graph
Quantum versus Classical Proofs and Advice
0 signed · 67 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.1006/jabr.1996.6980openalex-snapshot
Short Presentations for Finite Groups
inferredcites →https://doi.org/10.1006/jabr.2000.8650openalex-snapshot
Enumerating Boundedly Generated Finite Groups
inferredcites →https://doi.org/10.1006/jabr.2001.8943openalex-snapshot
Short Presentations for Three-Dimensional Unitary Groups
inferredcites →https://doi.org/10.1007/978-3-540-27821-4_25openalex-snapshot
Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions
inferredcites →https://doi.org/10.1007/978-3-642-55566-4_10openalex-snapshot
Covering the Sphere by Equal Spherical Balls
inferredcites →https://doi.org/10.1007/bf02806383openalex-snapshot
Probabilistic methods in group theory
inferredcites →https://doi.org/10.1007/s00037-005-0194-xopenalex-snapshot
Quantum Arthur–Merlin games
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50020-5openalex-snapshot
Computational methods in the study of permutation groups††This research was supported in part by the National Science Foundation.
inferredcites →https://doi.org/10.1016/j.ipl.2004.01.024openalex-snapshot
The quantum query complexity of the hidden subgroup problem is polynomial
inferredcites →https://doi.org/10.1016/s0304-0208(08)73487-xopenalex-snapshot
Representation of Group Elements as Short Products
inferredcites →https://doi.org/10.1090/conm/305/05215openalex-snapshot
Quantum amplitude amplification and estimation
inferredcites →https://doi.org/10.1093/qmath/20.1.395openalex-snapshot
AN ENUMERATION THEOREM FOR FINITE GROUPS
inferredcites →https://doi.org/10.1109/ccc.2004.1313849openalex-snapshot
On the power of quantum proofs
inferredcites →https://doi.org/10.1109/group4.2006.1708231openalex-snapshot
Low-Loss Amorphous Silicon Channel Waveguides for Integrated Photonics
inferredcites →https://doi.org/10.1109/sfcs.1984.715919openalex-snapshot
On The Complexity Of Matrix Group Problems I
inferredcites →https://doi.org/10.1109/sfcs.2000.892141openalex-snapshot
Succinct quantum proofs for properties of finite groups
inferredcites →https://doi.org/10.1137/0405008openalex-snapshot
Bounded Round Interactive Proofs in Finite Groups
inferredcites →https://doi.org/10.1137/s009753970139450xopenalex-snapshot
The Hidden Subgroup Problem and Quantum Computation Using Group Representations
inferredcites →https://doi.org/10.1137/s0097539704445226openalex-snapshot
The Complexity of the Local Hamiltonian Problem
inferredcites →https://doi.org/10.1137/s0097539796300933openalex-snapshot
Strengths and Weaknesses of Quantum Computing
inferredcites →https://doi.org/10.1145/103418.103440openalex-snapshot
Local expansion of vertex-transitive graphs and random generation in finite groups
inferredcites →https://doi.org/10.1145/1198513.1198525openalex-snapshot
Generic quantum Fourier transforms
inferredcites →https://doi.org/10.1145/22145.22192openalex-snapshot
Trading group theory for randomness
inferredcites →https://doi.org/10.1145/276698.276712openalex-snapshot
A framework for fast quantum mechanical algorithms
inferredcites →https://doi.org/10.2307/2946623openalex-snapshot
Enumerating Finite Groups of Given Order
inferredcites →https://doi.org/10.4230/lipics.isaac.2021.31openalex-snapshot
Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0005055openalex-snapshot
Quantum Amplitude Amplification and Estimation
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0210077openalex-snapshot
Quantum NP - A Survey
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-031-30545-0_5openalex-snapshot
Non-uniformity and Quantum Advice in the Quantum Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-031-78020-2_8openalex-snapshot
Unclonable Cryptography with Unbounded Collusions and Impossibility of Hyperefficient Shadow Tomography
inferred← citeshttps://doi.org/10.1007/978-3-032-06754-8_10openalex-snapshot
The Role of Piracy in Quantum Proofs
inferred← citeshttps://doi.org/10.1007/978-3-032-12296-4_1openalex-snapshot
Untelegraphable Encryption and its Applications
inferred← citeshttps://doi.org/10.1007/978-3-032-23341-7_22openalex-snapshot
Comprehensive Review of Quantum Complexity Theory Classes in Formal Verification
inferred← citeshttps://doi.org/10.1007/978-3-032-35409-9_10openalex-snapshot
Separating Non-interactive Classical Verification of Quantum Computation from Falsifiable Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-032-35409-9_13openalex-snapshot
On Scalable Pseudorandom Unitaries and the Unitary Synthesis Problem
inferred← citeshttps://doi.org/10.1098/rspa.2007.0113openalex-snapshot
The learnability of quantum states
inferred← citeshttps://doi.org/10.1103/physreva.96.052308openalex-snapshot
Finding resource states of measurement-based quantum computing is harder than quantum computing
inferred← citeshttps://doi.org/10.1103/physrevresearch.4.023237openalex-snapshot
Tight bound for estimating expectation values from a system of linear equations
inferred← citeshttps://doi.org/10.1109/ccc.2006.36openalex-snapshot
QMA/qpoly \subseteq PSPACE/poly: De-Merlinizing Quantum Protocols
inferred← citeshttps://doi.org/10.1109/ccc.2009.42openalex-snapshot
Quantum Copy-Protection and Quantum Money
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/isit63088.2025.11195326openalex-snapshot
Improved Classical Shadow Tomography Using Quantum Computation
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/3618260.3649650openalex-snapshot
A One-Query Lower Bound for Unitary Synthesis and Breaking Quantum Cryptography
inferred← citeshttps://doi.org/10.1145/3639528.3639535openalex-snapshot
Guest Column: The 7 faces of quantum NP
inferred← citeshttps://doi.org/10.1145/3717823.3718226openalex-snapshot
Uncloneable Quantum States Are Necessary as Proofs and Advice
inferred← citeshttps://doi.org/10.1145/3717823.3718296openalex-snapshot
QMA vs QCMA and Pseudorandomness
inferred← citeshttps://doi.org/10.22331/q-2022-10-13-834openalex-snapshot
Quantum Proofs of Proximity
inferred← citeshttps://doi.org/10.22331/q-2024-06-17-1377openalex-snapshot
A distribution testing oracle separation between QMA and QCMA
inferred← citeshttps://doi.org/10.22331/q-2024-12-09-1552openalex-snapshot
State preparation by shallow circuits using feed forward
inferred← citeshttps://doi.org/10.4018/978-1-7998-9522-0.ch003openalex-snapshot
Quantum Key Distribution Protocols
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2018.91openalex-snapshot
Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground States
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.6openalex-snapshot
Complexity-Theoretic Limitations on Blind Delegated Quantum Computation
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2018.22openalex-snapshot
Quantum vs Classical Proofs and Subset Verification
inferred← citeshttps://doi.org/10.48550/arxiv.1909.03787openalex-snapshot
2-Local Hamiltonian with Low Complexity is QCMA
inferred← citeshttps://doi.org/10.48550/arxiv.2009.07450openalex-snapshot
On the Hardness of Detecting Macroscopic Superpositions
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0611021openalex-snapshot
Merlin-Arthur Games and Stoquastic Complexity
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.