Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates

We present a new algorithm for classical simulation of quantum circuits over the Clifford+T gate set. The runtime of the algorithm is polynomial in the number of qubits and the number of Clifford gates in the circuit but exponential in the number of T gates. The exponential scaling is sufficiently m...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Physical review letters 2016-06, Vol.116 (25), p.250501-250501, Article 250501
Hauptverfasser:	Bravyi, Sergey, Gosset, David
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Circuits Computer simulation Fault tolerance Gates (circuits) Polynomials Quantum computers Qubits (quantum computing)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!