Classical simulation of peaked shallow quantum circuits

An $n$-qubit quantum circuit is said to be peaked if it has an output probability that is at least inverse-polynomially large as a function of $n$. We describe a classical algorithm with quasipolynomial runtime $n^{O(\log{n})}$ that approximately samples from the output distribution of a peaked cons...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Bravyi, Sergey, Gosset, David, Liu, Yinchen
Format:	Artikel
Sprache:	eng
Schlagworte:	Physics - Quantum Physics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!