REVIEW 6 cited by
Simulation of quantum circuits by low-rank stabilizer decompositions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Recent work has explored using the stabilizer formalism to classically simulate quantum circuits containing a few non-Clifford gates. The computational cost of such methods is directly related to the notion of stabilizer rank, which for a pure state $\psi$ is defined to be the smallest integer $\chi$ such that $\psi$ is a superposition of $\chi$ stabilizer states. Here we develop a comprehensive mathematical theory of the stabilizer rank and the related approximate stabilizer rank. We also present a suite of classical simulation algorithms with broader applicability and significantly improved performance over the previous state-of-the-art. A new feature is the capability to simulate circuits composed of Clifford gates and arbitrary diagonal gates, extending the reach of a previous algorithm specialized to the Clifford+T gate set. We implemented the new simulation methods and used them to simulate quantum algorithms with 40-50 qubits and over 60 non-Clifford gates, without resorting to high-performance computers. We report a simulation of the Quantum Approximate Optimization Algorithm in which we process superpositions of $\chi\sim10^6$ stabilizer states and sample from the full n-bit output distribution, improving on previous simulations which used $\sim 10^3$ stabilizer states and sampled only from single-qubit marginals. We also simulated instances of the Hidden Shift algorithm with circuits including up to 64 T gates or 16 CCZ gates; these simulations showcase the performance gains available by optimizing the decomposition of a circuit's non-Clifford components.
Forward citations
Cited by 6 Pith papers
-
Learning Clifford-structured quantum unitaries and Hamiltonians
A quasipolynomial-time algorithm finds the closest Clifford unitary to an unknown unitary, enabling tomography of unitaries and Hamiltonians with bounded Clifford decomposition size.
-
Taming Trotter Errors with Quantum Resources
Higher entanglement entropy reduces variance of Trotter errors and higher magic reduces kurtosis, making error distributions more robust in quantum simulation.
-
Magic-protected entanglement and Clifford-irreducible structure in magic state space
Quantum states are classified by how much bipartite entanglement survives optimal simplification by classically easy Clifford operations, yielding a split into weakly protected T-magic and strongly protected W-magic regimes.
-
Plaquette: A hardware-aware design platform for fault-tolerant quantum computers
Plaquette compiles realistic quantum hardware noise models into multiple sampler representations, showing that Pauli-twirled approximations can misestimate logical error rates by an order of magnitude compared to leak...
-
Efficient simulation of logical magic state preparation protocols
A classical simulation method that propagates circuit-level Pauli noise to a Clifford error makes logical magic-state preparation protocols simulable in time polynomial in qubits and the target state's stabilizer rank.
-
Delay-Independent Stability of Nonlinear Delay Differential Equations via Isospectral Reduction
Claims a delay-independent global exponential stability criterion for a broad class of nonlinear nonautonomous delay differential equations using isospectral reduction of an associated sequence of matrices.
Discussion (0). Continue with ORCID to comment.