On the public citation graph

Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games

0 signed · 125 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/11537311_5openalex-snapshot
Bounds on the Power of Constant-Depth Quantum Circuits
inferredcites →https://doi.org/10.1016/0020-0190(83)90044-3openalex-snapshot
BPP and the polynomial hierarchy
inferredcites →https://doi.org/10.1016/0020-0190(87)90053-6openalex-snapshot
One-way permutations in NC0
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1016/0022-0000(88)90028-1openalex-snapshot
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
inferredcites →https://doi.org/10.1038/35051009openalex-snapshot
A scheme for efficient quantum computation with linear optics
inferredcites →https://doi.org/10.1038/46503openalex-snapshot
Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations
inferredcites →https://doi.org/10.1098/rspa.1999.0485openalex-snapshot
Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy
inferredcites →https://doi.org/10.1103/physreva.64.012310openalex-snapshot
Encoding a qubit in an oscillator
inferredcites →https://doi.org/10.1103/physrevlett.70.1895openalex-snapshot
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
inferredcites →https://doi.org/10.1103/physrevlett.86.5188openalex-snapshot
A One-Way Quantum Computer
inferredcites →https://doi.org/10.1137/s0097539700377025openalex-snapshot
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
inferredcites →https://doi.org/10.1145/12130.12137openalex-snapshot
Private coins versus public coins in interactive proof systems
inferredcites →https://doi.org/10.1145/167088.167097openalex-snapshot
Quantum complexity theory
inferredcites →https://doi.org/10.1145/22145.22192openalex-snapshot
Trading group theory for randomness
inferredcites →https://doi.org/10.1145/380752.380785openalex-snapshot
Quantum computers that can be simulated classically in polynomial time
inferredcites →https://doi.org/10.26421/qic2.1-3openalex-snapshot
Counting, fanout and the complexity of quantum ACC
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0010002openalex-snapshot
Quantum Computation Relative to Oracles
inferredcites →https://doi.org/10.5860/choice.38-5623openalex-snapshot
Theory of computational complexity

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11537311_5openalex-snapshot
Bounds on the Power of Constant-Depth Quantum Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_18openalex-snapshot
Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_70openalex-snapshot
Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out Gates
inferred← citeshttps://doi.org/10.1007/s00220-022-04320-1openalex-snapshot
Classical Simulation of Quantum Circuits by Half Gauss Sums
inferred← citeshttps://doi.org/10.1007/s00220-023-04675-zopenalex-snapshot
Approximate Unitary t-Designs by Short Random Quantum Circuits Using Nearest-Neighbor and Long-Range Gates
inferred← citeshttps://doi.org/10.1016/j.cmpb.2026.109565openalex-snapshot
Applications of quantum AI in brain disorder diagnosis: A systematic review
inferred← citeshttps://doi.org/10.1021/acsengineeringau.1c00033openalex-snapshot
Quantum Computing and Simulations for Energy Applications: Review and Perspective
inferred← citeshttps://doi.org/10.1038/nature23458openalex-snapshot
Quantum computational supremacy
inferred← citeshttps://doi.org/10.1038/s41534-017-0018-2openalex-snapshot
Quantum sampling problems, BosonSampling and quantum supremacy
inferred← citeshttps://doi.org/10.1038/s41586-019-0980-2openalex-snapshot
Supervised learning with quantum-enhanced feature spaces
inferred← citeshttps://doi.org/10.1088/1367-2630/aa8fe3openalex-snapshot
Equivalence between contextuality and negativity of the Wigner function for qudits
inferred← citeshttps://doi.org/10.1088/1367-2630/aadfa8openalex-snapshot
Classical simulation of photonic linear optics with lost particles
inferred← citeshttps://doi.org/10.1088/1367-2630/ab3d88openalex-snapshot
Verifying commuting quantum computations via fidelity estimation of weighted graph states
inferred← citeshttps://doi.org/10.1088/1402-4896/ad4688openalex-snapshot
Faster classical boson sampling
inferred← citeshttps://doi.org/10.1088/1751-8121/aab9c4openalex-snapshot
Quantum simulation from the bottom up: the case of rebits
inferred← citeshttps://doi.org/10.1088/1751-8121/adcd15openalex-snapshot
Gaussianity and simulability of Cliffords and matchgates
inferred← citeshttps://doi.org/10.1088/2058-9565/aab822openalex-snapshot
Quantum optimization using variational algorithms on near-term quantum devices
inferred← citeshttps://doi.org/10.1088/2058-9565/aba03aopenalex-snapshot
Validating multi-photon quantum interference with finite data
inferred← citeshttps://doi.org/10.1088/2058-9565/acb56aopenalex-snapshot
Effects of quantum resources and noise on the statistical complexity of quantum circuits
inferred← citeshttps://doi.org/10.1090/noti1696openalex-snapshot
Three Puzzles on Mathematics, Computation, and Games
inferred← citeshttps://doi.org/10.1098/rspa.2005.1546openalex-snapshot
Quantum computing, postselection, and probabilistic polynomial-time
inferred← citeshttps://doi.org/10.1098/rspa.2008.0443openalex-snapshot
Temporally unstructured quantum computation
inferred← citeshttps://doi.org/10.1098/rspa.2010.0301openalex-snapshot
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
inferred← citeshttps://doi.org/10.1103/52xz-3hpcopenalex-snapshot
Random Regular Graph States Are Complex at Almost Any Depth
inferred← citeshttps://doi.org/10.1103/physreva.101.012350openalex-snapshot
Phase-space-simulation method for quantum computation with magic states on qubits
inferred← citeshttps://doi.org/10.1103/physreva.103.022428openalex-snapshot
Feynman-path-type simulation using stabilizer projector decomposition of unitaries
inferred← citeshttps://doi.org/10.1103/physreva.110.012422openalex-snapshot
Tight quantum depth lower bound for solving systems of linear equations
inferred← citeshttps://doi.org/10.1103/physreva.110.032604openalex-snapshot
Tomography-assisted noisy quantum circuit simulator using matrix product density operators
inferred← citeshttps://doi.org/10.1103/physreva.70.052328openalex-snapshot
Improved simulation of stabilizer circuits
inferred← citeshttps://doi.org/10.1103/physreva.74.022320openalex-snapshot
Classical simulation of quantum many-body systems with a tree tensor network
inferred← citeshttps://doi.org/10.1103/physreva.96.062320openalex-snapshot
Quantum supremacy in constant-time measurement-based computation: A unified architecture for sampling and verification
inferred← citeshttps://doi.org/10.1103/physreva.98.022113openalex-snapshot
Causal compatibility inequalities admitting quantum violations in the triangle structure
inferred← citeshttps://doi.org/10.1103/physrevapplied.20.044002openalex-snapshot
Efficient and quantum-adaptive machine learning with fermion neural networks
inferred← citeshttps://doi.org/10.1103/physrevb.111.024312openalex-snapshot
Quantum entanglement phase transitions and computational complexity: Insights from Ising models
inferred← citeshttps://doi.org/10.1103/physrevlett.112.130502openalex-snapshot
Hardness of Classically Simulating the One-Clean-Qubit Model
inferred← citeshttps://doi.org/10.1103/physrevlett.112.140505openalex-snapshot
Measurement-Based Classical Computation
inferred← citeshttps://doi.org/10.1103/physrevlett.120.200502openalex-snapshot
Impossibility of Classically Simulating One-Clean-Qubit Model with Multiplicative Error
inferred← citeshttps://doi.org/10.1103/physrevlett.121.030501openalex-snapshot
Dynamical Phase Transitions in Sampling Complexity
inferred← citeshttps://doi.org/10.1103/physrevlett.122.210502openalex-snapshot
Sample Complexity of Device-Independently Certified “Quantum Supremacy”
inferred← citeshttps://doi.org/10.1103/physrevlett.129.150604openalex-snapshot
Complexity Phase Diagram for Interacting and Long-Range Bosonic Hamiltonians
inferred← citeshttps://doi.org/10.1103/physrevlett.132.240601openalex-snapshot
Measurement-Based Infused Circuits for Variational Quantum Eigensolvers
inferred← citeshttps://doi.org/10.1103/physrevlett.134.010603openalex-snapshot
Compression of Quantum Shallow-Circuit States
inferred← citeshttps://doi.org/10.1103/physrevresearch.7.013334openalex-snapshot
Power of quantum measurement in simulating unphysical operations
inferred← citeshttps://doi.org/10.1103/physrevx.12.021021openalex-snapshot
Efficient Classical Simulation of Random Shallow 2D Quantum Circuits
inferred← citeshttps://doi.org/10.1103/physrevx.15.021059openalex-snapshot
Measurement-Induced Entanglement and Complexity in Random Constant-Depth 2D Quantum Circuits
inferred← citeshttps://doi.org/10.1103/physrevx.6.021043openalex-snapshot
Trading Classical and Quantum Computational Resources
inferred← citeshttps://doi.org/10.1103/physrevx.8.021010openalex-snapshot
Architectures for Quantum Simulation Showing a Quantum Speedup
inferred← citeshttps://doi.org/10.1103/physrevx.8.021060openalex-snapshot
Verification of Many-Qubit States
inferred← citeshttps://doi.org/10.1103/prxquantum.2.040325openalex-snapshot
Benchmarking a Novel Efficient Numerical Method for Localized 1D Fermi-Hubbard Systems on a Quantum Simulator
inferred← citeshttps://doi.org/10.1103/prxquantum.3.010333openalex-snapshot
Random Quantum Circuits Anticoncentrate in Log Depth
inferred← citeshttps://doi.org/10.1103/prxquantum.3.020328openalex-snapshot
Fermion Sampling: A Robust Quantum Computational Advantage Scheme Using Fermionic Linear Optics and Magic Input States
inferred← citeshttps://doi.org/10.1103/prxquantum.5.020347openalex-snapshot
Postselection-Free Learning of Measurement-Induced Quantum Dynamics
inferred← citeshttps://doi.org/10.1103/prxquantum.5.030332openalex-snapshot
Dynamical Magic Transitions in Monitored Clifford+ T Circuits
inferred← citeshttps://doi.org/10.1103/prxquantum.6.010356openalex-snapshot
Quantum Advantage from Measurement-Induced Entanglement in Random Shallow Circuits
inferred← citeshttps://doi.org/10.1103/prxquantum.6.020310openalex-snapshot
Computational Complexity of Isometric Tensor-Network States
inferred← citeshttps://doi.org/10.1103/revmodphys.95.035001openalex-snapshot
Computational advantage of quantum random sampling
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.2017.46openalex-snapshot
Local Hamiltonians Whose Ground States Are Hard to Approximate
inferred← citeshttps://doi.org/10.1109/focs.2019.00064openalex-snapshot
Quantum Advantage with Noisy Shallow Circuits in 3D
inferred← citeshttps://doi.org/10.1109/focs.2019.00065openalex-snapshot
Stoquastic PCP vs. Randomness
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00065openalex-snapshot
Quasi-polynomial Time Approximation of Output Probabilities of Geometrically-local, Shallow Quantum Circuits
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00126openalex-snapshot
Quantum supremacy and hardness of estimating output probabilities of quantum circuits
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00127openalex-snapshot
Noise and the Frontier of Quantum Supremacy
inferred← citeshttps://doi.org/10.1109/tpwrs.2022.3141794openalex-snapshot
Quantum Distributed Unit Commitment: An Application in Microgrids
inferred← citeshttps://doi.org/10.1126/science.aar3106openalex-snapshot
Quantum advantage with shallow circuits
inferred← citeshttps://doi.org/10.1126/science.abe8770openalex-snapshot
Quantum computational advantage using photons
inferred← citeshttps://doi.org/10.1137/050644756openalex-snapshot
Simulating Quantum Computation by Contracting Tensor Networks
inferred← citeshttps://doi.org/10.1140/epjqt/s40507-021-00107-wopenalex-snapshot
Accelerating quantum computer developments
inferred← citeshttps://doi.org/10.1145/3313276.3316404openalex-snapshot
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
inferred← citeshttps://doi.org/10.1145/3570637openalex-snapshot
On the Need for Large Quantum Depth
inferred← citeshttps://doi.org/10.1145/3717823.3718145openalex-snapshot
Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from #P Hardness
inferred← citeshttps://doi.org/10.1145/3729283openalex-snapshot
Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs
inferred← citeshttps://doi.org/10.1587/essfr.14.1_15openalex-snapshot
Development of Fast Quantum Algorithms
inferred← citeshttps://doi.org/10.17169/refubium-250openalex-snapshot
Anticoncentration theorems for schemes showing a quantum speedup
inferred← citeshttps://doi.org/10.17169/refubium-31445openalex-snapshot
Quantum advantage from energy measurements of many-body quantum systems
inferred← citeshttps://doi.org/10.17169/refubium-32392openalex-snapshot
Theory of Quantum System Certification
inferred← citeshttps://doi.org/10.22331/q-2018-05-22-65openalex-snapshot
Anticoncentration theorems for schemes showing a quantum speedup
inferred← citeshttps://doi.org/10.22331/q-2020-01-13-223openalex-snapshot
From estimation of quantum probabilities to simulation of quantum circuits
inferred← citeshttps://doi.org/10.22331/q-2021-03-15-410openalex-snapshot
Hyper-optimized tensor network contraction
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-2021-11-15-578openalex-snapshot
Efficient verification of Boson Sampling
inferred← citeshttps://doi.org/10.22331/q-2022-12-01-867openalex-snapshot
Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits
inferred← citeshttps://doi.org/10.22331/q-2023-01-13-893openalex-snapshot
Structural risk minimization for quantum linear classifiers
inferred← citeshttps://doi.org/10.22331/q-2024-01-15-1228openalex-snapshot
Parallel Quantum Algorithm for Hamiltonian Simulation
inferred← citeshttps://doi.org/10.22331/q-2024-02-06-1243openalex-snapshot
Efficient classical simulation of cluster state quantum circuits with alternative inputs
inferred← citeshttps://doi.org/10.22331/q-2024-03-28-1303openalex-snapshot
Heisenberg-limited metrology with perturbing interactions
inferred← citeshttps://doi.org/10.22331/q-2024-11-07-1519openalex-snapshot
Phase-space negativity as a computational resource for quantum kernel methods
inferred← citeshttps://doi.org/10.22331/q-2024-11-20-1530openalex-snapshot
Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
inferred← citeshttps://doi.org/10.22331/q-2024-12-04-1548openalex-snapshot
Single-qubit gate teleportation provides a quantum advantage
inferred← citeshttps://doi.org/10.22331/q-2026-02-10-2002openalex-snapshot
On Certified Randomness from Fourier Sampling or Random Circuit Sampling
inferred← citeshttps://doi.org/10.22331/q-2026-04-15-2068openalex-snapshot
Sampling (noisy) quantum circuits through randomized rounding
inferred← citeshttps://doi.org/10.26421/qic14.7-8-7openalex-snapshot
Classical simulation complexity of extended Clifford circuits
inferred← citeshttps://doi.org/10.26421/qic16.3-4-4openalex-snapshot
Commuting quantum circuits with few outputs are unlikely to be classically simulatable
inferred← citeshttps://doi.org/10.26421/qic17.13-14openalex-snapshot
Efficient rate-adaptive reconciliation for continuous-variable quantum key distribution
inferred← citeshttps://doi.org/10.26421/qic17.3-4-5openalex-snapshot
Further extensions of Clifford circuits and their classical simulation complexities
inferred← citeshttps://doi.org/10.26421/qic19.9-10-3openalex-snapshot
Impossibility of blind quantum sampling for classical client
inferred← citeshttps://doi.org/10.3390/app11146427openalex-snapshot
Variational Quantum Circuits for Machine Learning. An Application for the Detection of Weak Signals
inferred← citeshttps://doi.org/10.48550/arxiv.0906.5416openalex-snapshot
Non-Identity Check Remains QMA-Complete for Short Circuits
inferred← citeshttps://doi.org/10.48550/arxiv.1602.07674openalex-snapshot
Quantum Supremacy through the Quantum Approximate Optimization Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1610.06646openalex-snapshot
The Computational Complexity of Ball Permutations
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0603163openalex-snapshot
On the simulation of quantum circuits
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0608132openalex-snapshot
Computation with Unitaries and One Pure Qubit
inferred← citeshttps://doi.org/10.4995/thesis/10251/183029openalex-snapshot
Modelling of a System for the Detection of Weak Signals Through Text Mining and NLP. Proposal of Improvement by a Quantum Variational Circuit
inferred← citeshttps://doi.org/10.51983/ajes-2023.12.2.4118openalex-snapshot
Quantum Computing and AI: The Synergy of Two Revolutionary Technologies
inferred← citeshttps://doi.org/10.62056/a66c0l2hdopenalex-snapshot
Quantum Group Action
inferred← citeshttps://doi.org/10.7907/6hjb-mc69.openalex-snapshot
The Power of Quantum Fourier Sampling
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.