We estimate and analyze the error rates and the resource overheads of the repetition cat qubit approach to universal and fault-tolerant quantum computation. The cat qubits stabilized by two-photon dissipation exhibit an extremely biased noise where the bit-flip error rate is exponentially suppressed with the mean number of photons. In a recent work, we suggested that the remaining phase-flip error channel could be suppressed using a 1D repetition code. Indeed, using only bias-preserving gates on the cat-qubits, it is possible to build a universal set of fault-tolerant logical gates at the level of the repetition cat qubit. In this paper, we perform Monte-Carlo simulations of all the circuits implementing the protected logical gates, using a circuit-level error model. Furthermore, we analyze two different approaches to implement a fault-tolerant Toffoli gate on repetition cat qubits. These numerical simulations indicate that very low logical error rates could be achieved with a reasonable resource overhead, and with parameters that are within the reach of near-term circuit QED experiments.
[1]
Kyungjoo Noh,et al.
Quantum information processing with bosonic qubits in circuit QED
,
2020
.
[2]
Josef Stoer,et al.
Numerische Mathematik 1
,
1989
.
[3]
Benjamin J. Brown,et al.
The XZZX Surface Code
,
2020
.
[4]
I. Chuang,et al.
Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition
,
2010
.
[5]
Proceedings of the Royal Society (London)
,
1906,
Science.
[6]
Kevin Barraclough,et al.
I and i
,
2001,
BMJ : British Medical Journal.
[7]
Aaas News,et al.
Book Reviews
,
1893,
Buffalo Medical and Surgical Journal.
[8]
Christopher Chamberland,et al.
Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
,
2020
.