Error rates and resource overheads of encoded three-qubit gates
Name
PhysRevA.96.042302.pdf
Size
757.58 KB
Format
Adobe PDF
Checksum (MD5)
0b1e70197d074e34a68dbe04de4a60ea
Author(s)
Takagi, Ryuji
Yoder, Theodore J.
Chuang, Isaac L.
Yoder, Theodore James
Chuang, Isaac
Date Issued
October 2017
Journal
Physical Review A
Publisher
American Physical Society
Citation
Takagi, Ryuji et al. "Error rates and resource overheads of encoded three-qubit gates." Physical Review A 96, 4 (October 2017): 042302 © 2017 American Physical Society
Version
Final published version
Abstract
A non-Clifford gate is required for universal quantum computation, and, typically, this is the most error-prone and resource-intensive logical operation on an error-correcting code. Small, single-qubit rotations are popular choices for this non-Clifford gate, but certain three-qubit gates, such as Toffoli or controlled-controlled-Z (ccz), are equivalent options that are also more suited for implementing some quantum algorithms, for instance, those with coherent classical subroutines. Here, we calculate error rates and resource overheads for implementing logical ccz with pieceable fault tolerance, a nontransversal method for implementing logical gates. We provide a comparison with a nonlocal magic-state scheme on a concatenated code and a local magic-state scheme on the surface code. We find the pieceable fault-tolerance scheme particularly advantaged over magic states on concatenated codes and in certain regimes over magic states on the surface code. Our results suggest that pieceable fault tolerance is a promising candidate for fault tolerance in a near-future quantum computer.
MIT Department
Massachusetts Institute of Technology. Department of Physics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1103/PhysRevA.96.042302
