Error rates and resource overheads of encoded three-qubit gates
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 T...
Main Authors: | , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
American Physical Society
2018
|
Online Access: | http://hdl.handle.net/1721.1/114466 https://orcid.org/0000-0001-9614-2836 https://orcid.org/0000-0001-7296-523X |
_version_ | 1811093245768237056 |
---|---|
author | Takagi, Ryuji Yoder, Theodore J. Chuang, Isaac L. Yoder, Theodore James Chuang, Isaac |
author2 | Massachusetts Institute of Technology. Department of Physics |
author_facet | Massachusetts Institute of Technology. Department of Physics Takagi, Ryuji Yoder, Theodore J. Chuang, Isaac L. Yoder, Theodore James Chuang, Isaac |
author_sort | Takagi, Ryuji |
collection | MIT |
description | 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. |
first_indexed | 2024-09-23T15:42:11Z |
format | Article |
id | mit-1721.1/114466 |
institution | Massachusetts Institute of Technology |
language | English |
last_indexed | 2024-09-23T15:42:11Z |
publishDate | 2018 |
publisher | American Physical Society |
record_format | dspace |
spelling | mit-1721.1/1144662022-09-29T15:36:48Z Error rates and resource overheads of encoded three-qubit gates Takagi, Ryuji Yoder, Theodore J. Chuang, Isaac L. Yoder, Theodore James Chuang, Isaac Massachusetts Institute of Technology. Department of Physics Takagi, Ryuji Yoder, Theodore James Chuang, Isaac 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. 2018-03-29T19:51:17Z 2018-03-29T19:51:17Z 2017-10 2017-07 2017-11-14T22:45:07Z Article http://purl.org/eprint/type/JournalArticle 2469-9926 2469-9934 http://hdl.handle.net/1721.1/114466 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 https://orcid.org/0000-0001-9614-2836 https://orcid.org/0000-0001-7296-523X en http://dx.doi.org/10.1103/PhysRevA.96.042302 Physical Review A 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. American Physical Society application/pdf American Physical Society American Physical Society |
spellingShingle | Takagi, Ryuji Yoder, Theodore J. Chuang, Isaac L. Yoder, Theodore James Chuang, Isaac Error rates and resource overheads of encoded three-qubit gates |
title | Error rates and resource overheads of encoded three-qubit gates |
title_full | Error rates and resource overheads of encoded three-qubit gates |
title_fullStr | Error rates and resource overheads of encoded three-qubit gates |
title_full_unstemmed | Error rates and resource overheads of encoded three-qubit gates |
title_short | Error rates and resource overheads of encoded three-qubit gates |
title_sort | error rates and resource overheads of encoded three qubit gates |
url | http://hdl.handle.net/1721.1/114466 https://orcid.org/0000-0001-9614-2836 https://orcid.org/0000-0001-7296-523X |
work_keys_str_mv | AT takagiryuji errorratesandresourceoverheadsofencodedthreequbitgates AT yodertheodorej errorratesandresourceoverheadsofencodedthreequbitgates AT chuangisaacl errorratesandresourceoverheadsofencodedthreequbitgates AT yodertheodorejames errorratesandresourceoverheadsofencodedthreequbitgates AT chuangisaac errorratesandresourceoverheadsofencodedthreequbitgates |