On the public citation graph
Computational quantum-classical boundary of noisy commuting quantum circuits
0 signed · 74 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/3-540-09510-1_42openalex-snapshot
On the power of random access machines
inferredcites →https://doi.org/10.1007/978-3-7643-7808-0_1openalex-snapshot
Decoherence and the Transition from Quantum to Classical — Revisited
inferredcites →https://doi.org/10.1007/978-981-287-996-7openalex-snapshot
Quantum Computation with Topological Codes
inferredcites →https://doi.org/10.1007/s00453-008-9168-0openalex-snapshot
A Polynomial Quantum Algorithm for Approximating the Jones Polynomial
inferredcites →https://doi.org/10.1007/s11128-005-7654-8openalex-snapshot
Quantum Universality from Magic States Distillation Applied to CSS Codes
inferredcites →https://doi.org/10.1016/j.aop.2006.01.012openalex-snapshot
A fault-tolerant one-way quantum computer
inferredcites →https://doi.org/10.1038/35051009openalex-snapshot
A scheme for efficient quantum computation with linear optics
inferredcites →https://doi.org/10.1038/509552aopenalex-snapshot
Theoretical physics: Complexity on the horizon
inferredcites →https://doi.org/10.1038/nature03350openalex-snapshot
Quantum computing with realistically noisy devices
inferredcites →https://doi.org/10.1038/nature10012openalex-snapshot
Quantum annealing with manufactured spins
inferredcites →https://doi.org/10.1038/nature12035openalex-snapshot
Classical command of quantum systems
inferredcites →https://doi.org/10.1038/nature13460openalex-snapshot
Contextuality supplies the ‘magic’ for quantum computation
inferredcites →https://doi.org/10.1038/ncomms2043openalex-snapshot
Blind topological measurement-based quantum computation
inferredcites →https://doi.org/10.1038/nphys2900openalex-snapshot
Evidence for quantum annealing with more than one hundred qubits
inferredcites →https://doi.org/10.1088/1367-2630/9/6/199openalex-snapshot
Topological fault-tolerance in cluster state quantum computation
inferredcites →https://doi.org/10.1088/1367-2630/aa5fdbopenalex-snapshot
Commuting quantum circuits and complexity of Ising partition functions
inferredcites →https://doi.org/10.1098/rspa.2005.1546openalex-snapshot
Quantum computing, postselection, and probabilistic polynomial-time
inferredcites →https://doi.org/10.1098/rspa.2008.0443openalex-snapshot
Temporally unstructured quantum computation
inferredcites →https://doi.org/10.1098/rspa.2010.0301openalex-snapshot
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
inferredcites →https://doi.org/10.1103/physreva.70.060302openalex-snapshot
Valence-bond states for quantum computation
inferredcites →https://doi.org/10.1103/physreva.71.022316openalex-snapshot
Universal quantum computation with ideal Clifford gates and noisy ancillas
inferredcites →https://doi.org/10.1103/physreva.71.042322openalex-snapshot
Scalable quantum computing in the presence of large detected-error rates
inferredcites →https://doi.org/10.1103/physreva.71.062313openalex-snapshot
Long-range quantum entanglement in noisy cluster states
inferredcites →https://doi.org/10.1103/physreva.72.052326openalex-snapshot
Standard forms of noisy quantum operations via depolarization
inferredcites →https://doi.org/10.1103/physreva.76.022304openalex-snapshot
Measurement-based quantum computation with the toric code states
inferredcites →https://doi.org/10.1103/physreva.80.062328openalex-snapshot
Transitions in the computational power of thermal states for measurement-based quantum computation
inferredcites →https://doi.org/10.1103/physreva.81.042324openalex-snapshot
Cluster-based architecture for fault-tolerant quantum computation
inferredcites →https://doi.org/10.1103/physreva.82.060301openalex-snapshot
Topological one-way quantum computation on verified logical cluster states
inferredcites →https://doi.org/10.1103/physreva.85.010304openalex-snapshot
Topologically protected measurement-based quantum computation on the thermal state of a nearest-neighbor two-body Hamiltonian with spin-3/2 particles
inferredcites →https://doi.org/10.1103/physreva.90.022304openalex-snapshot
Quantum algorithm for an additive approximation of Ising partition functions
inferredcites →https://doi.org/10.1103/physrevlett.105.250502openalex-snapshot
Fault Tolerant Quantum Computation with Nondeterministic Gates
inferredcites →https://doi.org/10.1103/physrevlett.105.250503openalex-snapshot
Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates
inferredcites →https://doi.org/10.1103/physrevlett.107.060501openalex-snapshot
Thermal States as Universal Resources for Quantum Computation with Always-On Interactions
inferredcites →https://doi.org/10.1103/physrevlett.110.120502openalex-snapshot
Measurement-Based Quantum Computation on Symmetry Breaking Thermal States
inferredcites →https://doi.org/10.1103/physrevlett.112.130502openalex-snapshot
Hardness of Classically Simulating the One-Clean-Qubit Model
inferredcites →https://doi.org/10.1103/physrevlett.117.080501openalex-snapshot
Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations
inferredcites →https://doi.org/10.1103/physrevlett.67.661openalex-snapshot
Quantum cryptography based on Bell’s theorem
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.80.2245openalex-snapshot
Entanglement of Formation of an Arbitrary State of Two Qubits
inferredcites →https://doi.org/10.1103/physrevlett.81.5672openalex-snapshot
Power of One Bit of Quantum Information
inferredcites →https://doi.org/10.1103/physrevlett.96.020501openalex-snapshot
Noise Thresholds for Optical Quantum Computers
inferredcites →https://doi.org/10.1103/revmodphys.75.715openalex-snapshot
Decoherence, einselection, and the quantum origins of the classical
inferredcites →https://doi.org/10.1126/science.1252319openalex-snapshot
Defining and detecting quantum speedup
inferredcites →https://doi.org/10.1137/s0097539700377025openalex-snapshot
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
inferredcites →https://doi.org/10.1140/epjp/i2014-14001-yopenalex-snapshot
Bound states of spatially dependent mass Dirac equation with the Eckart potential including Coulomb tensor interaction
inferredcites →https://doi.org/10.1140/epjp/i2014-14152-9openalex-snapshot
Diagonal quantum circuits: Their computational power and applications
inferredcites →https://doi.org/10.1145/1052796.1052804openalex-snapshot
Guest Column: NP-complete problems and physical reality
inferredcites →https://doi.org/10.1145/1993636.1993682openalex-snapshot
The computational complexity of linear optics
inferredcites →https://doi.org/10.1145/276698.276708openalex-snapshot
Quantum circuits with mixed states
inferredcites →https://doi.org/10.4230/lipics.tqc.2018.6openalex-snapshot
Polynomial Quantum Algorithms for Additive approximations of the Potts model and other Points of the Tutte Plane
inferredcites →https://doi.org/10.48550/arxiv.1107.2148openalex-snapshot
An introduction to reliable quantum computation
inferredcites →https://doi.org/10.48550/arxiv.1401.2199openalex-snapshot
Will boson-sampling ever disprove the Extended Church-Turing thesis?
inferredcites →https://doi.org/10.7907/rzr7-dt72.openalex-snapshot
Stabilizer Codes and Quantum Error Correction
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-981-13-1687-6_18openalex-snapshot
Quantum Reservoir Computing: A Reservoir Approach Toward Quantum Machine Learning on Near-Term Quantum Devices
inferred← citeshttps://doi.org/10.1007/978-981-96-0668-9_18openalex-snapshot
On the Simulation and Verification of Noisy Quantum Circuits
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.07.025openalex-snapshot
Classically simulating quantum circuits with local depolarizing noise
inferred← citeshttps://doi.org/10.1038/s41534-017-0018-2openalex-snapshot
Quantum sampling problems, BosonSampling and quantum supremacy
inferred← citeshttps://doi.org/10.1088/1367-2630/aa5fdbopenalex-snapshot
Commuting quantum circuits and complexity of Ising partition functions
inferred← citeshttps://doi.org/10.1088/2058-9565/ab54a4openalex-snapshot
Methods for classically simulating noisy networked quantum architectures
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.1103/physreva.111.012622openalex-snapshot
Dissipation-induced quantum homogenization for temporal information processing
inferred← citeshttps://doi.org/10.1103/physreva.95.042336openalex-snapshot
Power of one nonclean qubit
inferred← citeshttps://doi.org/10.1103/physreva.96.030301openalex-snapshot
Verifiable fault tolerance in measurement-based quantum computation
inferred← citeshttps://doi.org/10.1103/physreva.99.012344openalex-snapshot
Probabilistic fault-tolerant universal quantum computation and sampling problems in continuous variables
inferred← citeshttps://doi.org/10.1103/physrevapplied.8.024030openalex-snapshot
Harnessing Disordered-Ensemble Quantum Dynamics for Machine Learning
inferred← citeshttps://doi.org/10.1103/physrevlett.118.040502openalex-snapshot
Quantum Supremacy for Simulating a Translation-Invariant Ising Spin Model
inferred← citeshttps://doi.org/10.22331/q-2017-04-25-8openalex-snapshot
Achieving quantum supremacy with sparse and noisy commuting quantum computations
inferred← citeshttps://doi.org/10.22331/q-2025-02-10-1627openalex-snapshot
Quantum complexity phase transitions in monitored random circuits
inferred← citeshttps://doi.org/10.22331/q-2026-01-22-1981openalex-snapshot
Gibbs Sampling gives Quantum Advantage at Constant Temperatures with O(1)-Local Hamiltonians
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2019.21openalex-snapshot
Average-Case Quantum Advantage with Shallow Circuits
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2021.59openalex-snapshot
Test of Quantumness with Small-Depth Quantum Circuits
inferred← citeshttps://doi.org/10.7498/aps.70.20211428openalex-snapshot
Review on quantum advantages of sampling problems
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.