Invited Talk: Embedding Classical into Quantum Computation
From MaRDI portal
Publication:5504564
DOI10.1007/978-3-540-89994-5_5zbMATH Open1178.68259arXiv0812.4511OpenAlexW1562587519MaRDI QIDQ5504564FDOQ5504564
Authors: Richard Jozsa 
Publication date: 22 January 2009
Published in: Mathematical Methods in Computer Science (Search for Journal in Brave)
Abstract: We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits (Valiant's theorem) appear as two special cases. Viewing these simulatable classes as subsets of the space of all quantum computations, we may consider minimal extensions that suffice to regain full quantum computational power, which provides an approach to exploring the efficacy of quantum over classical computation.
Full work available at URL: https://arxiv.org/abs/0812.4511
Recommendations
- Classical simulation and complexity of quantum computations (invited talk)
- Classical simulation of quantum computation, the Gottesman-Knill theorem and slightly beyond
- Matchgates and classical simulation of quantum circuits
- Commuting quantum circuits with few outputs are unlikely to be classically simulatable
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time
Cited In (6)
- Classical simulation of quantum computation, the Gottesman-Knill theorem and slightly beyond
- Classical simulation and complexity of quantum computations (invited talk)
- Generalized Clifford groups and simulation of associated quantum circuits
- Clifford gates in the Holant framework
- Quantum advantage of unitary Clifford circuits with magic state inputs
- Exact and efficient simulation of concordant computation
This page was built for publication: Invited Talk: Embedding Classical into Quantum Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504564)
