On the public citation graph

Classical simulation of quantum computation, the gottesman-Knill theorem, and slightly beyond

0 signed · 79 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.1090/conm/482/09419openalex-snapshot
Contraction of matchgate tensor networks on non-planar graphs
inferredcites →https://doi.org/10.1137/050644756openalex-snapshot
Simulating Quantum Computation by Contracting Tensor Networks
inferredcites →https://doi.org/10.3254/978-1-61499-018-5-115openalex-snapshot
Entanglement in graph states and its applications
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0205115openalex-snapshot
Both Toffoli and Controlled-NOT need little help to do universal quantum computation
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0603163openalex-snapshot
On the simulation of quantum circuits

What points at this work

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

inferred← citeshttps://doi.org/10.1002/qute.202500702openalex-snapshot
Analyzing the Free States of one Quantum Resource Theory as Resource States of Another
inferred← citeshttps://doi.org/10.1007/978-3-030-36030-6_10openalex-snapshot
(Pseudo) Random Quantum States with Binary Phase
inferred← citeshttps://doi.org/10.1007/978-3-030-41753-6_4openalex-snapshot
Overview
inferred← citeshttps://doi.org/10.1007/978-3-031-66149-5_6openalex-snapshot
Automated Reasoning in Quantum Circuit Compilation
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/s11128-025-04682-0openalex-snapshot
Characterization of non-adaptive Clifford channels
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.010openalex-snapshot
Clifford gates in the Holant framework
inferred← citeshttps://doi.org/10.1038/srep01235openalex-snapshot
Solving search problems by strongly simulating quantum circuits
inferred← citeshttps://doi.org/10.1063/5.0269149openalex-snapshot
Simulating quantum circuit expectation values by Clifford perturbation theory
inferred← citeshttps://doi.org/10.1088/1367-2630/aa61baopenalex-snapshot
Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?
inferred← citeshttps://doi.org/10.1088/1751-8121/aa565fopenalex-snapshot
Quantum circuits and low-degree polynomials over F 2
inferred← citeshttps://doi.org/10.1088/1751-8121/adcbf6openalex-snapshot
Wigner function for N-ququarts systems
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.1088/2058-9565/adfd0dopenalex-snapshot
A nonstabilizerness monotone from stabilizerness asymmetry
inferred← citeshttps://doi.org/10.1103/1csn-x1cxopenalex-snapshot
Role of Coherence for Quantum Computational Advantage
inferred← citeshttps://doi.org/10.1103/92ky-ln8fopenalex-snapshot
Quantum Advantage via Efficient Postprocessing on Qudit Classical Shadow Tomography
inferred← citeshttps://doi.org/10.1103/lhv6-6t1ropenalex-snapshot
Computational complexity and simulability of non-Hermitian quantum dynamics
inferred← citeshttps://doi.org/10.1103/mgy3-kr71openalex-snapshot
Unveiling a Hidden Percolation Transition in Monitored Clifford Circuits: Inroads from ZX Calculus
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.104.012602openalex-snapshot
Principle of majorization: Application to random quantum circuits
inferred← citeshttps://doi.org/10.1103/physreva.106.062430openalex-snapshot
Possibilistic simulation of quantum circuits by classical circuits
inferred← citeshttps://doi.org/10.1103/physreva.108.042406openalex-snapshot
Protocols for classically training quantum generative models on probability distributions
inferred← citeshttps://doi.org/10.1103/physrevapplied.23.014069openalex-snapshot
Faster computation of nonstabilizerness
inferred← citeshttps://doi.org/10.1103/physrevb.109.174207openalex-snapshot
Magic of random matrix product states
inferred← citeshttps://doi.org/10.1103/physrevlett.112.130402openalex-snapshot
Likelihood-Free Methods for Quantum Parameter Estimation
inferred← citeshttps://doi.org/10.1103/physrevlett.116.250501openalex-snapshot
Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates
inferred← citeshttps://doi.org/10.1103/physrevlett.123.080503openalex-snapshot
All Pure Fermionic Non-Gaussian States Are Magic States for Matchgate Computations
inferred← citeshttps://doi.org/10.1103/physrevlett.134.160801openalex-snapshot
Qudit Shadow Estimation Based on the Clifford Group and the Power of a Single Magic Gate
inferred← citeshttps://doi.org/10.1103/physrevx.12.021037openalex-snapshot
Enhancing Generative Models via Quantum Correlations
inferred← citeshttps://doi.org/10.1103/physrevx.6.021043openalex-snapshot
Trading Classical and Quantum Computational Resources
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834452openalex-snapshot
Learning quantum circuits of T -depth one
inferred← citeshttps://doi.org/10.1109/pacet.2017.8259984openalex-snapshot
Design and implementation of quantum circuits for fault-tolerant architectures
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00056openalex-snapshot
A Formalization of Measurement-Commuting Unitaries
inferred← citeshttps://doi.org/10.1109/sci68648.2025.11333848openalex-snapshot
QARN: A Python based High-Performance Quantum Circuit Simulator
inferred← citeshttps://doi.org/10.1109/tit.2020.3004427openalex-snapshot
Explicit Lower Bounds on Strong Quantum Simulation
inferred← citeshttps://doi.org/10.1109/tit.2022.3151760openalex-snapshot
Learning Quantum Circuits of Some T Gates
inferred← citeshttps://doi.org/10.1109/tit.2024.3433550openalex-snapshot
Semidefinite Programming Bounds on the Size of Entanglement-Assisted Codeword Stabilized Quantum Codes
inferred← citeshttps://doi.org/10.1126/sciadv.aau1946openalex-snapshot
Experimental learning of quantum states
inferred← citeshttps://doi.org/10.1145/3618260.3649733openalex-snapshot
Quadratic Lower Bounds on the Approximate Stabilizer Rank: A Probabilistic Approach
inferred← citeshttps://doi.org/10.1145/3717823.3718228openalex-snapshot
Improved Bounds for Testing Low Stabilizer Complexity States
inferred← citeshttps://doi.org/10.1145/3763066openalex-snapshot
qblaze: An Efficient and Scalable Sparse Quantum Simulator
inferred← citeshttps://doi.org/10.14778/3725688.3725701openalex-snapshot
Quantum Data Management in the NISQ Era
inferred← citeshttps://doi.org/10.2168/lmcs-11(2:10)2015openalex-snapshot
Generators and relations for n-qubit Clifford operators
inferred← citeshttps://doi.org/10.2172/2280557openalex-snapshot
Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
inferred← citeshttps://doi.org/10.22331/q-2019-09-02-181openalex-snapshot
Simulation of quantum circuits by low-rank stabilizer decompositions
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-2020-06-04-279openalex-snapshot
Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
inferred← citeshttps://doi.org/10.22331/q-2021-07-05-496openalex-snapshot
Quantum machine learning with adaptive linear optics
inferred← citeshttps://doi.org/10.22331/q-2021-12-20-606openalex-snapshot
Improved upper bounds on the stabilizer rank of magic states
inferred← citeshttps://doi.org/10.22331/q-2022-02-15-652openalex-snapshot
Lower Bounds on Stabilizer Rank
inferred← citeshttps://doi.org/10.22331/q-2022-04-20-692openalex-snapshot
New techniques for bounding stabilizer rank
inferred← citeshttps://doi.org/10.22331/q-2022-06-13-734openalex-snapshot
The Classification of Clifford Gates over Qubits
inferred← citeshttps://doi.org/10.22331/q-2022-09-15-803openalex-snapshot
Fast Stabiliser Simulation with Quadratic Form Expansions
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-2024-02-06-1243openalex-snapshot
Efficient classical simulation of cluster state quantum circuits with alternative inputs
inferred← citeshttps://doi.org/10.22331/q-2024-02-12-1251openalex-snapshot
Fast simulation of planar Clifford circuits
inferred← citeshttps://doi.org/10.22331/q-2024-09-11-1470openalex-snapshot
The Hadamard gate cannot be replaced by a resource state in universal quantum computation
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-2025-01-14-1589openalex-snapshot
A graph-state based synthesis framework for Clifford isometries
inferred← citeshttps://doi.org/10.26421/qic11.9-10-5openalex-snapshot
Simulating quantum computers with probabilistic methods
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.4204/eptcs.343.2openalex-snapshot
Generators and Relations for Real Stabilizer Operators
inferred← citeshttps://doi.org/10.4204/eptcs.384.13openalex-snapshot
The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
inferred← citeshttps://doi.org/10.4204/eptcs.384.5openalex-snapshot
Global Synthesis of CNOT Circuits with Holes
inferred← citeshttps://doi.org/10.4204/eptcs.394.17openalex-snapshot
Symbolic Synthesis of Clifford Circuits and Beyond
inferred← citeshttps://doi.org/10.48550/arxiv.1005.1425openalex-snapshot
Quantum Complexity: restrictions on algorithms and architectures
inferred← citeshttps://doi.org/10.48550/arxiv.1201.3306openalex-snapshot
Simulating Special but Natural Quantum Circuits
inferred← citeshttps://doi.org/10.48550/arxiv.1509.05806openalex-snapshot
Abelian Hypergroups and Quantum Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1904.00101openalex-snapshot
Stabilizer Circuits, Quadratic Forms, and Computing Matrix Rank
inferred← citeshttps://doi.org/10.48550/arxiv.2103.00693openalex-snapshot
High-performance parallel classical scheme for simulating shallow quantum circuits
inferred← citeshttps://doi.org/10.48550/arxiv.2312.09733openalex-snapshot
Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
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.