On the public citation graph
Simulating quantum circuit expectation values by Clifford perturbation theory
0 signed · 57 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.1021/acs.chemrev.9b00829openalex-snapshot
Quantum Algorithms for Quantum Chemistry and Quantum Materials Science
inferredcites →https://doi.org/10.1021/acs.jctc.3c00228openalex-snapshot
Hierarchical Clifford Transformations to Reduce Entanglement in Quantum Chemistry Wave Functions
inferredcites →https://doi.org/10.1021/acs.jctc.3c00335openalex-snapshot
Partitioning Quantum Chemistry Simulations with Clifford Circuits
inferredcites →https://doi.org/10.1021/acs.jctc.8b00932openalex-snapshot
Qubit Coupled Cluster Method: A Systematic Approach to Quantum Chemistry on a Quantum Computer
inferredcites →https://doi.org/10.1038/ncomms5213openalex-snapshot
A variational eigenvalue solver on a photonic quantum processor
inferredcites →https://doi.org/10.1038/s41534-021-00429-8openalex-snapshot
Avoiding coherent errors with rotated concatenated stabilizer codes
inferredcites →https://doi.org/10.1038/s41534-022-00583-7openalex-snapshot
6-qubit optimal Clifford circuits
inferredcites →https://doi.org/10.1038/s41534-024-00955-1openalex-snapshot
Classical simulations of noisy variational quantum circuits
inferredcites →https://doi.org/10.1038/s41567-020-01109-8openalex-snapshot
Classical algorithms for quantum mean values
inferredcites →https://doi.org/10.1038/s41586-023-06096-3openalex-snapshot
Evidence for the utility of quantum computing before fault tolerance
inferredcites →https://doi.org/10.1038/s42254-021-00348-9openalex-snapshot
Variational quantum algorithms
inferredcites →https://doi.org/10.1088/2058-9565/abda8eopenalex-snapshot
A posteriori corrections to the iterative qubit coupled cluster method to minimize the use of quantum resources in large-scale calculations
inferredcites →https://doi.org/10.1088/2058-9565/ac5d20openalex-snapshot
Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions
inferredcites →https://doi.org/10.1098/rspa.2019.0251openalex-snapshot
Quantifying magic for multi-qubit operations
inferredcites →https://doi.org/10.1103/fhc5-8sm6openalex-snapshot
Efficient Quantum-Enhanced Classical Simulation for Patches of Quantum Landscapes
inferredcites →https://doi.org/10.1103/lh6x-7rc3openalex-snapshot
Classically Estimating Observables of Noiseless Quantum Circuits
inferredcites →https://doi.org/10.1103/physreva.100.032328openalex-snapshot
Validating quantum computers using randomized model circuits
inferredcites →https://doi.org/10.1103/physreva.103.022428openalex-snapshot
Feynman-path-type simulation using stabilizer projector decomposition of unitaries
inferredcites →https://doi.org/10.1103/physreva.105.022409openalex-snapshot
Classical simulation of quantum circuits using a multiqubit Bloch vector representation of density matrices
inferredcites →https://doi.org/10.1103/physreva.108.032406openalex-snapshot
Fourier expansion in variational quantum algorithms
inferredcites →https://doi.org/10.1103/physreva.111.062413openalex-snapshot
Clifford circuit initialization for variational quantum algorithms
inferredcites →https://doi.org/10.1103/physreva.70.052328openalex-snapshot
Improved simulation of stabilizer circuits
inferredcites →https://doi.org/10.1103/physreva.95.062337openalex-snapshot
Unbiased simulation of near-Clifford quantum circuits
inferredcites →https://doi.org/10.1103/physreva.99.062337openalex-snapshot
Simulation of qubit quantum circuits via Pauli propagation
inferredcites →https://doi.org/10.1103/physrevlett.116.250501openalex-snapshot
Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates
inferredcites →https://doi.org/10.1103/physrevlett.133.120603openalex-snapshot
Simulating Noisy Variational Quantum Algorithms: A Polynomial Approach
inferredcites →https://doi.org/10.1103/physrevresearch.4.033012openalex-snapshot
Quadratic Clifford expansion for efficient benchmarking and initialization of variational quantum algorithms
inferredcites →https://doi.org/10.1103/prxquantum.3.020361openalex-snapshot
Fast Estimation of Outcome Probabilities for Quantum Circuits
inferredcites →https://doi.org/10.1103/xct1-7kf2openalex-snapshot
A Polynomial-Time Classical Algorithm for Noisy Quantum Circuits
inferredcites →https://doi.org/10.1126/sciadv.adk4321openalex-snapshot
Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
inferredcites →https://doi.org/10.1145/3564246.3585234openalex-snapshot
A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling
inferredcites →https://doi.org/10.22331/q-2019-08-05-170openalex-snapshot
Clifford recompilation for faster classical simulation of quantum circuits
inferredcites →https://doi.org/10.22331/q-2019-09-02-181openalex-snapshot
Simulation of quantum circuits by low-rank stabilizer decompositions
inferredcites →https://doi.org/10.22331/q-2020-01-13-223openalex-snapshot
From estimation of quantum probabilities to simulation of quantum circuits
inferredcites →https://doi.org/10.26421/qic10.3-4-6openalex-snapshot
Classical simulation of quantum computation, the gottesman-Knill theorem, and slightly beyond
inferredcites →https://doi.org/10.4230/lipics.tqc.2016.9openalex-snapshot
Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits
inferredcites →https://doi.org/10.48550/arxiv.1411.4028openalex-snapshot
A Quantum Approximate Optimization Algorithm
inferredcites →https://doi.org/10.48550/arxiv.1412.6062openalex-snapshot
A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
inferredcites →https://doi.org/10.48550/arxiv.1602.07674openalex-snapshot
Quantum Supremacy through the Quantum Approximate Optimization Algorithm
inferredcites →https://doi.org/10.48550/arxiv.2112.11151openalex-snapshot
Efficient Classical Computation of Quantum Mean Values for Shallow QAOA Circuits
inferredcites →https://doi.org/10.48550/arxiv.2308.09109openalex-snapshot
Classical surrogate simulation of quantum systems with LOWESA
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1038/s41467-025-63099-6openalex-snapshot
Does provable absence of barren plateaus imply classical simulability?
inferred← citeshttps://doi.org/10.1038/s41534-024-00955-1openalex-snapshot
Classical simulations of noisy variational quantum circuits
inferred← citeshttps://doi.org/10.1038/s42005-025-02423-4openalex-snapshot
Efficient online quantum circuit learning with no upfront training
inferred← citeshttps://doi.org/10.1088/1402-4896/ae67b5openalex-snapshot
Offline recovery of magic and entanglement from noisy Pauli product states
inferred← citeshttps://doi.org/10.1103/4kyq-n8jbopenalex-snapshot
Dual role of low-weight Pauli propagation: A flawed simulator but a powerful initializer for variational quantum algorithms
inferred← citeshttps://doi.org/10.1103/5g5b-5rrzopenalex-snapshot
Limits of Clifford disentangling in tensor network states
inferred← citeshttps://doi.org/10.1103/6vd7-l9bnopenalex-snapshot
Pauli Propagation: A Computational Framework for Simulating Quantum Systems
inferred← citeshttps://doi.org/10.1103/fb28-wlv2openalex-snapshot
Simulating Quantum Circuits with Arbitrary Local Noise Using Pauli Propagation
inferred← citeshttps://doi.org/10.1103/fhc5-8sm6openalex-snapshot
Efficient Quantum-Enhanced Classical Simulation for Patches of Quantum Landscapes
inferred← citeshttps://doi.org/10.1103/jj2r-y777openalex-snapshot
Classical simulation of noisy quantum circuits via locally entanglement-optimal unravelings
inferred← citeshttps://doi.org/10.1103/l9bp-dccfopenalex-snapshot
Gradient scalability and Taylor surrogation of quantum cost landscapes
inferred← citeshttps://doi.org/10.1103/physreva.111.042825openalex-snapshot
Exact closed-form unitary transformations of fermionic operators
inferred← citeshttps://doi.org/10.1103/ybnf-rjw8openalex-snapshot
Classical simulability of Clifford + T circuits with Clifford-augmented matrix product states
inferred← citeshttps://doi.org/10.2172/2229681openalex-snapshot
Quantum Optimization: Potential, Challenges, and the Path Forward
inferred← citeshttps://doi.org/10.22331/q-2025-06-24-1782openalex-snapshot
Stabilizer ground states for simulating quantum many-body physics: theory, algorithms, and applications
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.