Classical simulation of quantum computation, the Gottesman-Knill theorem and slightly beyond
From MaRDI portal
Publication:3172431
Recommendations
- Generalized Clifford groups and simulation of associated quantum circuits
- Invited Talk: Embedding Classical into Quantum Computation
- Classical simulation and complexity of quantum computations (invited talk)
- Matchgates and classical simulation of quantum circuits
- Commuting quantum circuits with few outputs are unlikely to be classically simulatable
Cited in
(29)- Commuting quantum circuits and complexity of Ising partition functions
- Interpolating parametrized quantum circuits using blackbox queries
- Generalized Clifford groups and simulation of associated quantum circuits
- Complexity of quantum circuits via sensitivity, magic, and coherence
- Dual-code quantum computation model
- Invited Talk: Embedding Classical into Quantum Computation
- Global Synthesis of CNOT Circuits with Holes
- The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
- Classical simulation and complexity of quantum computations (invited talk)
- Generators and relations for real stabilizer operators
- Exact and efficient simulation of concordant computation
- Quantum advantage of unitary Clifford circuits with magic state inputs
- scientific article; zbMATH DE number 7250161 (Why is no real title available?)
- Classical simulation of quantum circuits by half Gauss sums
- A non-commuting stabilizer formalism
- A little bit of classical magic to achieve (super-)quantum speedup
- The digital computer as a metaphor for the perfect laboratory experiment: loophole-free Bell experiments
- Quantum circuits and low-degree polynomials over \(\mathbb{F}_2\)
- On the significance of the Gottesman-Knill theorem
- Classical simulability, entanglement breaking, and quantum computation thresholds
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time
- Quantum simulation of generalized Hardy's paradox and corresponding Hardy's inequality via quantum programming
- Comments on ``Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
- An Exact and Practical Classical Strategy for 2D Graph State Sampling
- Clifford gates in the Holant framework
- (Pseudo) random quantum states with binary phase
- Matchgates and classical simulation of quantum circuits
- Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?
- Quantifying magic resource via quantum Jensen-Shannon divergence
This page was built for publication: Classical simulation of quantum computation, the Gottesman-Knill theorem and slightly beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172431)
