Repetition Cat Qubits for Fault-Tolerant Quantum Computation

We present a 1D repetition code based on the so-called cat qubits as a viable approach toward hardware-efficient universal and fault-tolerant quantum computation. The cat qubits that are stabilized by a two-photon driven-dissipative process exhibit a tunable noise bias where the effective bit-flip e...

Full description

Bibliographic Details
Main Authors: Jérémie Guillaud, Mazyar Mirrahimi
Format: Article
Language:English
Published: American Physical Society 2019-12-01
Series:Physical Review X
Online Access:http://doi.org/10.1103/PhysRevX.9.041053
_version_ 1819117553182572544
author Jérémie Guillaud
Mazyar Mirrahimi
author_facet Jérémie Guillaud
Mazyar Mirrahimi
author_sort Jérémie Guillaud
collection DOAJ
description We present a 1D repetition code based on the so-called cat qubits as a viable approach toward hardware-efficient universal and fault-tolerant quantum computation. The cat qubits that are stabilized by a two-photon driven-dissipative process exhibit a tunable noise bias where the effective bit-flip errors are exponentially suppressed with the average number of photons. We propose a realization of a set of gates on the cat qubits that preserve such a noise bias. Combining these base qubit operations, we build, at the level of the repetition cat qubit, a universal set of fully protected logical gates. This set includes single-qubit preparations and measurements, not, controlled-not, and controlled-controlled-not (Toffoli) gates. Remarkably, this construction avoids the costly magic state preparation, distillation, and injection. Finally, all required operations on the cat qubits could be performed with slight modifications of existing experimental setups.
first_indexed 2024-12-22T05:34:48Z
format Article
id doaj.art-c71bd01ef87144f7a791480e641bd700
institution Directory Open Access Journal
issn 2160-3308
language English
last_indexed 2024-12-22T05:34:48Z
publishDate 2019-12-01
publisher American Physical Society
record_format Article
series Physical Review X
spelling doaj.art-c71bd01ef87144f7a791480e641bd7002022-12-21T18:37:21ZengAmerican Physical SocietyPhysical Review X2160-33082019-12-019404105310.1103/PhysRevX.9.041053Repetition Cat Qubits for Fault-Tolerant Quantum ComputationJérémie GuillaudMazyar MirrahimiWe present a 1D repetition code based on the so-called cat qubits as a viable approach toward hardware-efficient universal and fault-tolerant quantum computation. The cat qubits that are stabilized by a two-photon driven-dissipative process exhibit a tunable noise bias where the effective bit-flip errors are exponentially suppressed with the average number of photons. We propose a realization of a set of gates on the cat qubits that preserve such a noise bias. Combining these base qubit operations, we build, at the level of the repetition cat qubit, a universal set of fully protected logical gates. This set includes single-qubit preparations and measurements, not, controlled-not, and controlled-controlled-not (Toffoli) gates. Remarkably, this construction avoids the costly magic state preparation, distillation, and injection. Finally, all required operations on the cat qubits could be performed with slight modifications of existing experimental setups.http://doi.org/10.1103/PhysRevX.9.041053
spellingShingle Jérémie Guillaud
Mazyar Mirrahimi
Repetition Cat Qubits for Fault-Tolerant Quantum Computation
Physical Review X
title Repetition Cat Qubits for Fault-Tolerant Quantum Computation
title_full Repetition Cat Qubits for Fault-Tolerant Quantum Computation
title_fullStr Repetition Cat Qubits for Fault-Tolerant Quantum Computation
title_full_unstemmed Repetition Cat Qubits for Fault-Tolerant Quantum Computation
title_short Repetition Cat Qubits for Fault-Tolerant Quantum Computation
title_sort repetition cat qubits for fault tolerant quantum computation
url http://doi.org/10.1103/PhysRevX.9.041053
work_keys_str_mv AT jeremieguillaud repetitioncatqubitsforfaulttolerantquantumcomputation
AT mazyarmirrahimi repetitioncatqubitsforfaulttolerantquantumcomputation