Classical simulation of quantum computation, the Gottesman-Knill theorem and slightly beyond
From MaRDI portal
Publication:3172431
zbMATH Open1234.81064arXiv0811.0898MaRDI QIDQ3172431FDOQ3172431
Authors: Maarten Van den Nest 
Publication date: 5 October 2011
Full work available at URL: https://arxiv.org/abs/0811.0898
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
Quantum computation (81P68) Nonselfadjoint operator theory in quantum theory including creation and destruction operators (81Q12)
Cited In (26)
- Quantum circuits and low-degree polynomials over \(\mathbb{F}_2\)
- (Pseudo) random quantum states with binary phase
- Complexity of quantum circuits via sensitivity, magic, and coherence
- A little bit of classical magic to achieve (super-)quantum speedup
- Classical simulation of quantum circuits by half Gauss sums
- A non-commuting stabilizer formalism
- Quantum simulation of generalized Hardy's paradox and corresponding Hardy's inequality via quantum programming
- Invited Talk: Embedding Classical into Quantum Computation
- Classical simulation and complexity of quantum computations (invited talk)
- Generalized Clifford groups and simulation of associated quantum circuits
- Interpolating parametrized quantum circuits using blackbox queries
- Classical simulability, entanglement breaking, and quantum computation thresholds
- Clifford gates in the Holant framework
- Global Synthesis of CNOT Circuits with Holes
- The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
- Quantum advantage of unitary Clifford circuits with magic state inputs
- Generators and relations for real stabilizer operators
- The digital computer as a metaphor for the perfect laboratory experiment: loophole-free Bell experiments
- Commuting quantum circuits and complexity of Ising partition functions
- Dual-code quantum computation model
- Quantifying magic resource via quantum Jensen-Shannon divergence
- Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?
- Exact and efficient simulation of concordant computation
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time
- Matchgates and classical simulation of quantum circuits
- On the significance of the Gottesman-Knill theorem
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)
