Journal
PHYSICAL REVIEW LETTERS
Volume 116, Issue 25, Pages -Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevLett.116.250501
Keywords
-
Categories
Funding
- Institute for Quantum Information and Matter
- NSF Physics Frontiers Center (NFS) [PHY-1125565]
- Gordon and Betty Moore Foundation [GBMF-12500028]
Ask authors/readers for more resources
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 mild that the algorithm can be used in practice to simulate medium-sized quantum circuits dominated by Clifford gates. The first demonstrations of fault-tolerant quantum circuits based on 2D topological codes are likely to be dominated by Clifford gates due to a high implementation cost associated with logical T gates. Thus our algorithm may serve as a verification tool for near-term quantum computers which cannot in practice be simulated by other means. To demonstrate the power of the new method, we performed a classical simulation of a hidden shift quantum algorithm with 40 qubits, a few hundred Clifford gates, and nearly 50 T gates.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available