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 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.


I. INTRODUCTION
Quantum computers are expected to efficiently solve classically intractable problems.The realization of a large-scale quantum computer is challenging because the noise induced by the uncontrolled interactions of the computer's components with the environment destroys the fragile quantum features responsible for the expected speedup.Indeed, all algorithms with theoretically proven quantum speedup require some level of protection against decoherence.The theory of fault-tolerant quantum computation [1,2] precisely addresses this issue.Quantumerror-correcting codes (QECCs) are designed [3,4] such that errors induced by the environment do not affect the quantum information.These codes operate by the "fight entanglement with entanglement" mantra: Natural errors arising in physical systems being typically local, the quantum information to be protected is encoded in nonlocal entangled states such that it becomes unlikely that errors can corrupt it, the most popular being the surface code [5][6][7].The crux of the theory of quantum fault tolerance is the threshold theorem: Arbitrarily long quantum computations can be performed reliably provided the noise afflicting the computer's physical components is below a constant value called the accuracy threshold [8][9][10][11][12].
In theory, QECCs provide, when operated below the threshold, an arbitrarily good protection against the noise, thus solving the decoherence problem.However, their actual implementation comes at the price of tremendous physical resources to reach a sufficient level of protection.This trade-off between the degree of protection provided by a QECC versus the increase in physical components needed for its implementation is the resource overhead problem.Realistic approaches to quantum computation must deal with this issue.In this light, continuous-variable (CV) systems (such as a harmonic oscillator), in which an infinite-dimensional Hilbert space * jeremie.guillaud@inria.fr is readily available to protect and process quantum information, seem to have a head start over discrete-variable (DV) systems that have only a finite-dimensional Hilbert space.There are many different CV encodings, usually involving the superposition of certain specific states of a harmonic oscillator, such as position and momentum eigenstates [13][14][15], Fock states [16][17][18], or coherent states [19,20].
The latter encoding, known as cat codes, has been the subject of intensive theoretical and experimental research throughout the past years.A highlight of this research is the first realization of quantum error correction for a quantum memory at the break-even point [21].Some initial theoretical proposals [22][23][24][25][26] and a few experiments [27][28][29] indicate that this encoding can be extended to a logical qubit with the possibility of performing protected logical gates.However, the protection remains limited to first-order errors due to photon loss, the major decay channel of a superconducting cavity.Two major questions are in order.Can we extend this encoding to a fully fault-tolerant and universal quantum computation protocol?Can we benefit from the advantages of the infinite-dimensional Hilbert space of the harmonic oscillator to achieve a hardware-efficient scaling?This paper aims at answering these questions by putting forward a new direction toward fault tolerance with a highly economic hardware complexity.
The concatenation of a CV code, such as the singlemode Gottesman-Kitaev-Preskill code, with a DV one, such as the surface code, has been recently investigated by various groups [30][31][32].The main idea behind these proposals is that using CV codes as base qubits leads to important improvements in the accuracy threshold of the DV encoding.Note, however, that one can expect this improvement to be less significant in a realistic circuitbased noise model [2,32].Our approach is different: By employing a cat code as the base qubit, the noise structure is modified in such a way that quantum error correction becomes of similar complexity as classical error correction and can be performed using a simple repetition code.Importantly, this specific noise structure can be preserved for a set of fundamental operations which at the level of the repetition code lead to a universal set of protected logical gates.
The pumped (stabilized) cat qubits are known to benefit from a noise bias [22,24].More precisely, one effective error channel (the bit flips for the encoding of this paper) is suppressed exponentially with the "size" (the mean number of photons) of the Schrödinger cat states.This suppression is expected to be valid for a large class of physical noise processes with a local effect on the phase space of a harmonic oscillator [34].This class includes, but is not limited to, photon loss, thermal excitations, photon dephasing, and various nonlinearities induced by a coupling to a Josephson junction.Recent experiments, in the framework of quantum superconducting circuits, observe such an exponential suppression [35].
Previous works show that such a noise asymmetry increases the accuracy threshold of various encodings when it is correctly exploited [37,38].These theoretical proposals aim at physical qubits (e.g.NV centers in diamonds [39]) that naturally benefit from such a noise bias.In the case of pumped cat qubits, the noise bias is tunable and can reach extremely high values.Even more remarkably, the extra degree of freedom associated to the complex amplitude of the coherent states defining the cat qubit, can be exploited to overcome some no-go theorems (see the Appendix) for bias preserving operations.In other words, the infinite-dimensional Hilbert space of the harmonic oscillator that supports the cat qubit state can be exploited to perform various nontrivial gates (such as CNOT and Toffoli) while preserving the noise bias.This ability was first observed for the CNOT gate in Ref. [26] in the case of nondissipative pumped cats.These features lead to a change of paradigm that significantly simplifies the picture toward a universal set of protected logical gates.First, we obtain a universal set of protected logical gates at the level of a simple repetition code.Second, the circuits for implementing the Clifford gates are greatly simplified, and the overhead requirements are significantly reduced.Finally, there is no need for magic state preparation and distillation, even for non-Clifford gates.
In the next section, we overview the basics of encoding quantum information in two-photon pumped cat states, and we recall the reasons behind the exponential suppression of effective bit-flip errors.Next, in Sec.III, we present our approach toward hardware-efficient and fault-tolerant quantum computation based on encoding the information in a simple repetition code of cat qubits.We provide a detailed comparison with Ref. [37] to point out the new capabilities granted by the use of cat qubits as base qubits.In Sec.IV, we explain how to realize key fundamental operations that preserve the noise bias at the level of cat qubits.This set of fundamental operations includes nontrivial operations such as CNOT and Toffoli that are not achievable in a bias-preserving manner for regular qubits with biased noise.In Sec.V, we provide the details on how to combine the fundamental operations to obtain a universal set of protected logical gates at the level of the repetition code, thus providing a road map for hardware-efficient fully protected quantum computation.Next, in Sec.VI, we analyze the performance of the fundamental operations in the presence of a realistic noise model and discuss the fault tolerance.In Sec.VII, we provide a road map toward experimental realization of various components.We argue that all components or components of similar complexity are already been implemented separately and with efficiencies or fidelities at the level of the accuracy threshold for a realistic circuit-based error model.We conclude in Sec.VIII providing further research directions.

II. PUMPED/STABILIZED CATS AS QUBITS WITH BIASED NOISE
The proposal in this paper is focused on cat qubits stabilized by two-photon driven dissipation [22].All concepts can also be adapted to the so-called Kerr cats, where the protection is ensured through a Kerr-type Hamiltonian and two-photon drives [24].
Driving a nonlinear interaction Hamiltonian between a harmonic oscillator and its bath, it is possible to engineer a nonstandard situation where the oscillator dominantly gains or loses photons in pairs [22,27,28,35].The master equation governing the evolution of the oscillator is given by ρ with It has been shown [40] that this dynamics stabilizes a twodimensional Hilbert space spanned by the coherent states {|α , | − α }, where α is a complex number fixed by the ratio of the amplitude of the drive to the twophoton dissipation rate: α = 2 2ph /κ 2ph .Equivalently, this manifold is generated by the in-phase and outof-phase superpositions of these coherent states, known as Schrödinger cat states where N ± := [2(1±e −2|α| 2 )] −1/2 .Expanding the coherent states in the Fock state basis, one can note that the in-phase (respectively, out-ofphase) superposition spans even (respectively, odd) Fock states only; thus, the cat state |C + α (respectively, |C − α ) is referred to as the even cat (respectively, odd cat).The steady state of Eq.( 1), denoted ρ ∞ , can be computed from the initial state ρ 0 using the invariants of the dynamics [22]: where c ++ , c −− and c +− are conserved quantities that are entirely determined by the initial state ρ 0 .The cat qubit states are defined as (see Fig. 1) |± c = |C ± α , or, equivalently as Note that, with respect to our previous publications (e.g. Ref. [22]), we change the computational basis to the dual basis along the X axis.This choice is motivated by the simplifications in the presentation of the implemented logical gates.
< l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > Z < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > X < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > Y < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t >  In terms of quantum information processing, the interest of this cat qubit lies in the fact that its physical implementation endows it with a natural protection.As soon as the action of a noise process is local in the phase space of the harmonic oscillator, the effective bitflip errors (jumps between |0 c and |1 c ) are exponentially suppressed with 2|α| 2 [22,34].This protection is illustrated in Fig. 1(b), where the vector field associated to the semiclassical dynamics of a coherent state governed by Eq. ( 1) is plotted in the phase space of the oscillator.Any noise process that perturbs the coherent state | ± α locally in the phase space, keeps it in the attraction domain of the departing point | ± α .Such a protection is similar to the one achieved by topological qubits such as Majorana fermions, but the nonlocality of information in the phase space, is here engineered through the particular driven-dissipative process of the harmonic oscillator.In particular, the nonlocality can be tuned by modifying the cat "size," given by the mean number of photons |α| 2 .This mean number is itself easily modulated by controlling the strength, 2ph , of the two-photon drive.The local character of the noise processes is an omnipresent concept in information protection, and, in the case of superconducting oscillators, it includes various mechanisms such as photon loss, thermal excitations, photon dephasing and nonlinear interaction Hamiltonians induced by Josephson circuits.Indeed, the cosine Hamiltonian of a Josephson junction Ĥ = E J cos[ϕ a (â + â † )] represents a bounded operator in the phase space of a mode â.In this sense, and over short time steps, it can only lead to a local shift of the state of the harmonic oscillator in the phase space.Furthermore, the rate of diffusion remains bounded when the cat size increases.The bit flips due to such local shifts are exponentially suppressed in the presence of the two-photon process(see [34] for more details).
Note, however, that phase flips, or, equivalently, jumps between even-parity cat state |C + α and the odd-parity one |C − α , can be induced by noise mechanisms such as photon loss or thermal excitations.As a result, an increase of the mean photon number (in order to suppress the bit-flip errors) comes at the expense of higher phase-flip rates.This rate increase is, however, expected to be only linear with respect to |α| 2 .The noise bias exp(−2|α| 2 )/|α| 2 of cat qubits is therefore tunable with the cat size.Some experimental indications of such a tunable bias have been recently observed [35].
This protection can also be achieved through a nondissipative process using a strong Kerr-type nonlinearity and two-photon driving [24].Indeed, engineering a nonlinear Hamiltonian of the form with α = 2ph /K the ground states | ± α , are twofold degenerate.The system can be thought of as a double well potentiel, where the tunneling between the two wells is exponentially suppressed with |α| 2 .Note, however, that, with such a Hamiltonian protection, some type of friction needs to be added in order to avoid leakage errors (out of the encoded qubit subspace) due to excursions in each well.The natural photon loss of the harmonic oscillator, if it is stronger than the mechanisms leading to such an excursion, can compensate this leakage.Thus, a promising approach is a combination of the Kerr type Hamiltonian and two-photon dissipation, where the protection against leakage does not come at the expense of higher phase-flip rates.
In the next section, we show how to extend this halfprotection to a full protection against both phase flips and bit flips.More precisely, we design an economic encoding that suppresses the phase flips without reintroducing bit flips.

III. FROM CAT QUBITS TO PROTECTED LOGICAL QUBITS
We see that cat qubits admit a biased noise where the bit-flip errors are suppressed exponentially with the cat size.In this section, we trace out a viable path toward full protection with minimal hardware overhead.
It is tempting to think that physical qubits suffering only from phase-flip errors can be protected through a

Physical qubits
Two-level systems with biased noise [37,41] Cat-qubits Fundamental bias-preserving operations Construction of a universal set of fault-tolerant gates that exploit the noise bias of the physical qubits.The middle column represents the case of regular two-level systems [37,41], and the right column represents the case of cat qubits.For regular qubits, only a few fundamental bias-preserving operations are allowed, leading to a limited set of C1-logical operations.
To achieve universality, it is necessary to concatenate with a second level of encoding C2, at which magic state preparation and distillation are appended.On the other hand, the set of fundamental biased-preserving operations for cat qubits contains extra gates.This extended set enables us to build a universal set of fault-tolerant gates already at the repetition code level, and this without requiring magic state preparations and distillations.Furthermore, the circuits for realization of protected logical gates are significantly simpler than regular two-level systems.
simple classical-error correction-scheme such as a repetition code.All that is required is the ability to perform parity-type measurements between neighboring qubits.Indeed, this idea can be explored to build a fully protected quantum memory, but performing protected logical gates comes with further complications.The main issue is that, the execution of a gate can in principle convert a phase-flip error into a bit-flip one, which is not suppressed by the simple error correction.One is therefore limited to only employ physical operations that preserve the noise bias (i.e.do not convert phase flips into bit flips).Such operations are called bias preserving.This idea is employed as a first level of encoding in Ref. [37,41].In these papers, the quantum information is protected by a concatenation of two codes C 1 C 2 , where denotes code concatenation.The code C 1 is a length-n repetition code that protects against phase flips errors, producing logical qubits that suffer from an effective unbiased noise of strength 1 .As soon as 1 is below the threshold of C 2 , arbitrarily low logical error rates 2 can be achieved by the concatenated code.This second level of encoding is required even if the qubits do not suffer from bit-flip errors at all, that is in the limit of an infinite noise bias.Indeed, even if the logical error rate 1 of the repetition code C 1 can be made arbitrarily low, it is not possible to build a universal gate set for the C 1 -encoded logical qubits, using only bias preserving operations.In this paper, we see that this no-go theorem is broken by using cat qubits (instead of regular two-level systems) as base qubits of the repetition code.
As discussed in Refs.[37,41], some operations are naturally bias preserving.In the case of dominant phase-flip errors, the preparation of |± = (|0 ± |1 )/ √ 2 states P |± , and the measurement of the X operator M X , are bias preserving because the eigenstates |± of the X operator (σ x Pauli operator) are fixed points for bit-flip errors.Also, the controlled phase gates CPHASE = with Z j being the Pauli σ z operator on qubit j), or more generally the twoqubit entangling gate CZ(θ) = exp(iθ/2Z 1 ⊗Z 2 ) [41], can be implemented in a bias-preserving manner.Indeed, it is enough to note that the Hamiltonians proportional to generate such unitary operations commute with phase-flip errors.However, a universal gate set will necessarily contain gates that do not commute with the dephasing errors, such as CNOT or Toffoli.
Note that, while these gates do not commute with the phase-flip errors, their action may still be compatible with noise bias.Considering the CNOT= 1  2 (I 1 + Z 1 ) ⊗ I 2 + 1 2 (I 1 − Z 1 ) ⊗ X 2 gate for instance, Z 1 errors commute with CNOT and Z 2 errors are converted into correlated phase-flip errors Z 1 Z 2 .This overall action does not to convert phase flips to bit flips and is therefore correctable by the repetition code.However, as correctly noted by [37], the same property is not necessarily satisfied during the execution of the gate.Indeed, we prove in the Appendix A that such a conversion of phase flips to bit flips necessarily occurs when implementing a CNOT gate with two-level systems.In other words, the CNOT operation cannot be performed in a bias-preserving manner with two-level systems.The same result also holds for a Toffoli gate.
In Ref. [37], the set of bias-preserving operations is therefore limited to {P |+ , M X , CPHASE}, which is not enough to build a universal gate set at the level of the repetition code C 1 .The concatenation with C 2 is therefore necessary to gain universality.At the C 1 C 2 -logical level, the full set of Clifford gates can be achieved by preparing the magic state |+i L := 1 √ 2 (|0 L +i|1 L ), and this set becomes universal with the addition of another magic state |T L := 1 √ 2 (|0 L + e iπ/4 |1 L ).In Ref. [41], with the addition of CZ(θ) to the set of bias-preserving . . .
Layout of a repetition cat qubit using high-Q 3D cylindrical postcavities [42].Each data cat qubit (in blue cavities) is connected to a pair of ancilla cat qubits (in green cavities) for the joint parity measurement.The results of the parity measurement are read out using the low-Q stripline resonators (in red) coupled to green cavities.Each cat qubit is continuously driven via the two-photon driven-dissipative scheme (arrows).The couplings between cavity modes are mediated by a Josephson circuit and extra microwave drives, required for bias preserving CNOT operations as detailed in Sec.IV and Fig. 11.The choice of cylindrical postcavities is to ensure high quality factors, but a similar layout could be thought of in a 2D architecture.
operations, the authors construct new gadgets to reduce the overhead for magic state preparation and distillation.The construction of Refs.[37,41] to exploit a noise bias in regular qubits (two-level systems) is summarized in Table I, in order to clarify the radical simplification due to the use of cat qubits.
In this paper, we show that the cat qubits have specific features which allow us to circumvent the aforementioned obstacles and significantly reduce the complexity of protected logical gates.These features rely on the infinitedimensional Hilbert space of the oscillator in which the two-dimensional Hilbert space of the cat qubit is embedded.More precisely, gates are performed by a continuous distortion of the two-dimensional manifold defining the cat qubit, in such a way that the exponential suppression of bit flips remains valid during the execution of the gate.The apparent "magic" comes from the fact that the Z component of the qubit is transformed continuously, which would not be possible using a DV system.Following this idea, we detail in Sec.IV how a universal set of bias preserving gates can be implemented at the cat qubit level.Even more remarkably, the realization of this set requires hardware-efficient operations, with no use of functional ancilla qubits, nor magic state preparation, distillation and injection.
In order to extend the protection to phase-flip errors, we propose to embed the cat qubits in a repetition code (Fig. 2).This repetition code C 1 is defined in the dual basis.The code space is defined as the +1 common eigenspace of the n − 1 stabilizers The logical operators for the repetition cat qubit are The logical |+ L and |− L states are given by Note that this definition leads to the following nontrivial logical computational states: where j is an n-bit string composed of 0's and 1's and |j| denotes the number of 1's, called the weight, of the string j.Recalling that |1 c ≈ | − α , one can note that the logical information is encoded in the parity of the number of oscillators in the | − α -state.This code, with phase-flip error correcting capacity of (n − 1)/2, does not detect nor correct physical bit-flip errors.Here, n is chosen such that the probabilities p Z L of logical phase-flip, and p X L of logical bit-flip errors, are of comparable strength, thus producing a C 1 -logical qubit suffering from an effective unbiased noise of strength L := p X L + p Z L .It is worth noting that the accuracy that can be achieved by C 1 is set by the size of the cat states.Indeed, the lower bound for this accuracy is given by p X L and decreases exponentially to zero as the cat size increases.Fixing a reasonable mean photon number of n = 10, this achievable accuracy could be as low as 10 −9 and reduces to 10 −13 for n = 15.Cat states of such sizes have been previously prepared in the context of superconducting circuits [43].If for unforeseeable reasons, the locality assumption on the noise processes breaks down for larger cats, one can consider a concatenation with a second code C 2 to achieve even better accuracies.Note, however, that this second level of concatenation could be done with any simple low-order code to go from already small error probabilities (e.g., 10 −9 ) down to the required precision for a given algorithm.
Let us now briefly present the picture for the construction of fault-tolerant gates at the level of the repetition cat qubits (see Fig. 3).As discussed earlier, the set of bias-preserving fundamental operations at the cat qubit level includes S = {P |± c , M X , X, Z, CNOT, Toffoli} (see Sec. IV for a detailed construction).The next step is to build fault-tolerant encoded operations at the level of the repetition code, using operations from this fundamental set.The set of fault-tolerant encoded operations acting on repetition cat qubits is given by S L = {P |± L , M X L , X L , CNOT, Toffoli}.It is worth noting that the logical CNOT can be implemented transversally from the fundamental CNOT, (see Sec. V for the details), leading to great hardware simplifications when compared to the logical CNOT construction of [37].The universality of S L is established by the fact that it contains the Toffoli gate in the computational basis, while state preparation and measurement are done in the dual basis.Indeed, we show in Sec.V how a logical Hadamard gate (single-qubit basis-changing operation) can be built out of the gates of the set S L , thus achieving universality [44,45].

IV. BIAS-PRESERVING OPERATIONS
In this section, we first explain how the set of operations S = {P |± c , M X , X, Z, CNOT, Toffoli} can be realized at the cat qubit level in a bias-preserving manner.The operations in S are sufficient to build the universal set of logical gates for the repetition code (see Sec. V).In addition, we recall at the end of the section how arbitrary rotations around the Z axis Z(θ) (proposal [22], experimental realization [28]) and the two-qubit entangling gate CZ(θ) = exp(iθ/2Z 1 ⊗ Z 2 ) [22] can also be realized.Even if these operations are not needed for the theoretical construction of this paper, they may prove useful for an optimized implementation of quantum algorithms.
Preparation of |± c .First, we note that the states |± c are eigenstates of the logical X operator which make their preparation compatible with the noise bias (suppressed bit flips) [37].The preparation of the even cat state |+ c = |C + α is performed merely by turning on the driven two-photon dissipation (1), when the system is initialized in the vacuum state ρ(0) = |0 0| [22].Indeed, the conservation of photon-number parity due to the twophoton driven dissipation ensures that the steady state of the system is given by the even cat state.Such a state preparation has already been realized experimentally [27] and the fidelity of the operation is set by the ratio between the two-photon dissipation rate κ 2ph , setting the rate of convergence to the cat state, and the undesired single-photon loss rate κ 1ph , setting the parity jump rates (equivalent to phase-flip errors) mixing the even cat with the odd one.In the latest experiments a ratio of about κ 1ph /κ 2ph = 10 −2 has been achieved between these two rates [28] and further improvements seem to be within the reach of the current experiments.
A systematic way to prepare the odd cat state |− c = |C − α is to start with preparing the even cat state and then performing a Z operation.A bias preserving rotation around the Z axis is proposed in Ref. [22] and experimentally realized in Ref. [28].For the sake of completeness, we recall the idea behind this realization at the end of this section.While this proves the feasibility of the physical preparation of |− c , at the end of Sec.V, we show that, in practice, one can replace such a Z operation by a simple Z operation in classical software [46].This process reduces the number of physically implemented logical gates in an algorithm.
Finally, we also note that such a state preparation can be performed through other strategies as well.In particular, in many recent experiments (e.g., Ref. [28]), these states are generated using optimal control techniques which can significantly improve the fidelity with respect to a passive preparation with two-photon driven dissipation.
Measurement of X.For the purpose of our scheme, the measurement of X (photon-number parity measurement) could be either destructive or quantum nondemolition (QND) as it is always used on ancilla qubits which can be discarded after each measurement.However, a QND protocol allows us to achieve a better fidelity by repeating the measurements.The QND parity measurement proposed in Ref. [47] and realized in Refs.[48,49] is a perfectly valid protocol for our scheme.For the sake of completeness, we recall the main idea behind this measurement protocol.The cavity whose parity is to be measured is coupled to an ancilla qubit via the dispersive interaction Hamiltonian Ĥdisp = −χ|e e|â † â.
The evolution on a time interval T = π/χ is given by the unitary Û = |g g|I + |e e|e iπâ † â entangling the state of the ancilla with the parity of the state of the cavity.Preparing the ancilla qubit in a superposition state |+ = 1 √ 2 (|g +|e ), the effect of the unitary CNOT < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > M X < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > P |±i < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > QEC < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > Hadamard < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > CNOT < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > M X L < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > Bias preserving operations < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > Fault-tolerant operations < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > P |±i L < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > X L < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > 0 e z i y 7 C e 3 g H O d J g r < / l a t e x i t > Universal < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " ( n u l l ) " > ( n u l l ) < / l a t e x i t >

CZ(✓)
< l a t e x i t s h a 1 _ b a s e 6 4 = " Overall scheme for achieving fault-tolerant universal quantum computation using cat qubits.The fundamental operations (left-hand side) are performed on the cat qubits, in a bias-preserving manner.Fault-tolerant logical operations acting on the repetition cat qubits (right-hand side) are built out of these operations, as depicted by the arrows.This construction is detailed in Sec.V .
Û is to flip the ancilla to the state |− = 1 √ 2 (|g − |e ) when the cavity contains an odd number of photons and to leave it unchanged otherwise.A measurement of the σx operator of the qubit thus reveals the parity of the cavity state.
Note that, in order to perform such a parity measurement, we need to turn off the two-photon driven dissipation on the measured system.However, as stated earlier, these measurements are performed on ancilla cavities that are thrown out after each measurement.So the absence of protection during the measurement affects merely the measurement fidelity and does not have any consequence on the rest of the circuit.Rather high parity-measurement fidelities of about 98.5% have been previously achieved using this protocol [21].
X gate.Our realization of the X gate is based on an adiabatic deformation of the code space.As discussed in Sec.II, the effective dissipation channel κ 2 D[â 2 − α 2 ] stabilizes the two-dimensional subspace span{|±α }.It is possible to perform nontrivial operations on the encoded information by varying the complex number α in time.When the variations of α(t) are sufficiently slow with respect to κ −1 2 , the dissipator κ 2 D[â 2 − α(t) 2 ] stabilizes span{|α(t) , | − α(t) } at all times t.This stabilization should be thought of as a slow motion of the fixed points of the dynamics in the phase space.
Remarkably, such a deformation preserves the quantum information, provided the two states |α(t) and | − α(t) remain sufficiently separated in phase space at all times: The state An X operation can be realized in such a manner by choosing a "path" function α(t) such that |α and | − α are exchanged, e.g α(t) = αe iπt/T , t ∈ [0, T ] where T κ −1 2 is the gate time [33].Indeed, the swap |α ↔ | − α corresponds to the map which is an X operation for the cat qubit.In addition to such a topological phase, there is a geometric phase accumulated due to the particular path taken by α(t).However, this phase is the same for the two states | ± α and corresponds to a global phase.
In the ideal case of a lossless harmonic oscillator and in the limit where the gate time T = +∞, the fidelity of this operation with respect to the X operator is 1.This operation is bias preserving, as the errors caused by the finite gate time are only of the phase-flip type, but the bit flips remain exponentially suppressed in the size of the cat n.Intuitively, this result is not surprising, as the two-photon pumping is never turned off during the gate execution.We depict in Fig. 4 a schematic representation of this evolution in the phase space.
To reduce the phase-flip error rate due to the finite gate time (nonadiabaticity) , the Hamiltonian Ĥ = − π T â † â is turned on while the pumping is being rotated.This Hamiltonian generates the unitary R(t) = e i π T â † ât which rotates deterministically the qubit state R(t)|ψ 0 = c 0 |α(t) + c 1 | − α(t) so that it remains at all times a pointer state of the time-dependent dissipative channel: Re(α) In the presence of this Hamiltonian, there is no need to proceed adiabatically; that is, the gate time T can be arbitrarily short.
CNOT gate.The idea described above can be adapted to realize a CNOT = 1 2 (I 1 +Z 1 )I 2 + 1 2 (I 1 −Z 1 )X 2 .The CNOT for the cat qubits is given by The approximation is exponentially precise in |α| 2 .Inspired by the proposal of Ref. [33] for the Kerr cats, this operation is realized by making the rotation of the pumping of the target qubit (implementing X α ; see the previous paragraph) conditional to the state of the control qubit.In our case, this operation is realized in time T by the two dissipation channels where we denote by â (respectively, b) the mode of the control cat qubit (respectively, target cat qubit).The dissipation channel on the control qubit L â is the twophoton pumping scheme stabilizing the control cat qubit.
The second dissipation channel, however, acts on the target cat qubit but also depends on the first mode â.It should be understood as follows: When the control qubit â is in the state |α , the operator Lb (t) acts on the target mode as b2 − α 2 , stabilizing the idle code space, but when the control qubit is in the state | − α , the pumping becomes b2 − (αe i π T t ) 2 , thus implementing the timedependent two-photon pumping dissipation used for the X α operation.Again, the pumping is never turned off and the bit-flip errors remain exponentially suppressed at all times, thus ensuring that the CNOT gate preserves the biased structure of the noise.In Sec.VII, we explain how the experimental realization of such a time-dependent dissipation operator is a straightforward modification of the regular two-photon driven dissipation [27].
We now explain how to deal with two undesired effects that limit the fidelity of the operation: the geometric phase due to the path taken by the states | ± α(t) in the phase space, and the phase-flip errors induced by the finite gate time (nonadiabaticity).In the case of the X gate, the geometric phase corresponded to a physically meaningless global phase, but here this phase is conditioned on the state of the control qubit.As a consequence, the geometric phase induces a deterministic rotation around the Z axis of the control qubit.The rotation angle is given by This deterministic geometric phase can be compensated by applying a local Z(θ) operation (see below).A second option is to ensure that the rotation angle ϑ is a multiple of 2π, either by setting the number of photons to be an even integer or by choosing a path α(t) such that the result of the integral is a multiple of 2π.Even in this case, the fluctuations along the chosen path inevitably lead to a certain imprecision in the final value of the geometric phase.This situation is not an issue, as it can lead only to phase-flip errors, accounted for by the repetition code.A major part of the phase-flip errors induced by nonadiabatic effects can be compensated in the same way as the X operation, by adding a Hamiltonian evolution of the form while rotating the pumping.In the presence of twophoton pumping, this Hamiltonian is an approximation of π/T | − α −α| ⊗ ( b †b − n), rotating the target cat qubit conditional to the control cat qubit being in the state | − α .Such Hamiltonians have been already realized using parametric methods [50], similar to those used in driven two-photon dissipation.
Toffoli gate.The Toffoli gate is the three-qubit gate corresponding to a "controlled-controlled-NOT": This unitary does not belong to the Clifford group.In fact, this gate, together with any set of gates generating the Clifford group, is universal.In the vast majority of schemes achieving universality, the non-Clifford operation is by far the most difficult operation to be realized.A remarkable feature of our scheme is that the physical implementation of the Toffoli at the cat qubit level is very much like the CNOT gate and, thus, of similar complexity.Three dissipation channels are realized, Here, L â and L b keep stabilizing the two control modes â and b in manifolds spanned by | ± α , and L ĉ rotates the two-photon pumping on the target mode ĉ only when the control cat qubits are in the state | − α, −α .As for the CNOT gate, two effects (the geometric phase and the nonadiabaticity) limit the gate fidelity.The deterministic geometric phase associated to the path taken by the target cat qubit can also be eliminated by tailoring the path followed in the phase space by the cat states during the execution of the gate, or by physically applying Z(θ) and CZ(θ) operations.To reduce the phase-flip errors induced by non adiabaticity, the Hamiltonian is added.We analytically analyze the performance of this gate in Sec.VI, and in Sec.VII, we discuss an experimental implementation.
From a theoretical point of view, assuming the required couplings between any number of modes are available, the mechanism presented above could be straightforwardly extended to realize the n-qubit entangling gate C n−1 X where C n−1 denotes the controls on the first n − 1 qubits (the CNOT being CX and the Toffoli, C 2 X).
Rotation around Z of an angle θ.As discussed in Ref. [22] and experimentally realized in Ref. [28], the quantum Zeno effect can be used to perform a rotation of an arbitrary angle θ around the Z axis in a biaspreserving manner: where To do so, a weak resonant drive Ĥ = Z (â+â † ) is applied in the presence of the two-photon driven dissipation.When the single-photon drive is much weaker than the two-photon dissipation, Z κ 2ph , it induces effective oscillations in the equatorial plane of the Bloch sphere whose frequency is given by Ω Z = 2 Z |α|.
Two-qubit entangling gate CZ(θ).In the same spirit, a bias preserving two-qubit entangling gate can be implemented using a weak beam-splitter Hamiltonian Ĥ = ZZ (â ) in the presence of the twophoton driven dissipation (see Ref. [22] for more details).

V. UNIVERSAL SET OF LOGICAL GATES
In this section, we construct the faulttolerant logical operations of the set S L = {P |± L , M X L , X L , CNOT L , Toffoli L } for the repetition code, using the fundamental set of bias-preserving operations S = {P |± c , M X , X, Z, CNOT, Toffoli} for individual cat qubits.The universality of S L is established by building a Hadamard gate out of operations in this set, which, together with the Toffoli gate, is universal [44,45].We start by explaining how the quantum error correction of the repetition code is realized.
Quantum error correction for repetition code.A prerequisite for using a repetition code is the ability to measure the value of the n − 1 stabilizers of the code, also called the parity-check operators.In our setup, these stabilizers are the joint-parity operators of any two pairs of neighboring cat qubits X j X j+1 .The measurement of these operators can be achieved using operations in S, with the circuit in Fig. 5.
Joint-parity measurement between two neighboring cat qubits j and j + 1 of a repetition cat qubit, using one ancilla cat qubit.Note that the error propagation from ancilla cat qubit to data ones is exponentially suppressed by the cat size.
In order to make these measurements fault tolerant, they are repeated r times, where r is optimized, taking into account the CNOT and measurement errors.We depict in Fig. 6 the full circuit for QEC on the repetition cat qubit.An optimal decoding, based on the outcome of the (n−1)r ancilla measurements, is then used to correct the effective phase-flip errors (see Ref. [51] for a practical implementation of such an optimal decoding).
Preparation of |+ L and measurement of X L .The preparation of |± L = |± ⊗n c can be performed transversally from the preparation of |± c : P |± L = (P |± c ) ⊗n .A subsequent step of quantum error correction enables us to reduce the preparation infidelity according to the distance of the repetition code.
Similarly, the measurement of only one cat qubit from the repetition cat qubit using M X already implements a measurement of X L .However, to ensure fault tolerance, M X L is implemented by measuring M X on all the cat . . .    . . .
m t g l j U 9 5 I W G 1 m q n j s a 6 s 2 J 9 q j 3 V N t b c R / e 2 k 1 p B Y i U t i / 9 J N M / + r U 1 4 k e j j S H g R 5 C j S j 3 D l J l V i f i t q 5 + c m FIG. 6.Quantum error correction circuit for a repetition cat qubit.One repetition cat qubit, composed of data cat qubits and ancilla cat qubits (in green), is protected from errors by performing r rounds of error detection.
qubits and then making a majority vote.Logical CNOT gate.This gate is not required in our set of universal gates and can be suppressed from the set S L .However, its implementation is easy and can lead to more economical circuits for the realization of certain algorithms.Indeed, the logical CNOT gate is simply obtained from the physical one by performing n CNOT gates in a transversal manner, as depicted in Fig. 7.

• • •
< l a t e x i t s h a 1 _ b a s e 6 4 = " / H 3 s j z R 3 H r n 9 J J c y 0 r 9 The fault tolerance of the logical CNOT comes from the transversal construction of the circuit, which prevents the forward propagation of errors that could lead to an uncorrectable logical error.For instance, a phase-flip error occurring on the kth cat qubit of the logical target qubit error on two different blocks, but it cannot induce an error on a qubit j = k.Such errors are detected and corrected by the QEC stage performed after the Toffoli gate's execution.Furthermore, each CNOT gate at the level of cat qubits is bias preserving, and, therefore, the bit-flip errors remain exponentially suppressed at the repetition code level.
Logical Toffoli gate.The transversal application of n physical Toffoli gates in a similar fashion as Fig. 7 does not yield a Toffoli gate at the logical level.Instead, the logical Toffoli requires n2 physical Toffoli gates, stacked as shown in Fig. 8.
q + E + t V K z 6 p q k 2 g V 9 L p / N 0 f h + x X H o y Q + y u J h k i q z y p c + e T H L w 9 j e x d y Y P j Z r 3 R q j e P 2 t X O f n q P t u E 5 v I T X e F f e Q w c + w i F 0 g R p l 4 4 3 R M t r m v n l t h u Z w I t 0 q p T n P 4 N Z j f v s N e s 7 u m A = = < / l a t e x i t > QEC < l a t e x i t s h a 1 _ b a s e 6 4 = " J 6 q 5 H b O X Q J U W 7 w g X 3 U 3 w H 5 + z    The circuit can be understood as follows.Since the CNOT gate is transversal, the group of three physical Toffoli gates on the left-hand side of the circuit execute a logical CNOT between the logical qubits 2 and 3 (middle and lower blocks) conditioned on the first physical cat qubit of the first logical qubit being in the state |1 c .Similarly, the group of three Toffoli gates in the middle (respectively, on the right) of the circuit also execute a CNOT on logical qubits 2 and 3 when the second (respectively, third) physical cat qubit of the first logical qubit is in the state |1 c .Now, recall from Sec. II that the logical computational states of the first block are given by: The circuit works in this way: When the first logical qubit is in the |0 L state, an even number of logical CNOTs is performed on the second and third logical qubits, which amounts to the identity operation.On the other hand, the input |1 L state results in an odd number of logical CNOTs being performed, thus actually performing one logical CNOT.In other words, this circuit implements a logical "controlled-CNOT", that is, a Toffoli gate.We now discuss the fault tolerance of this circuit.First, as in the case of the CNOT gate, we note that each Toffoli gate at the level of the cat qubits is bias preserving, and, therefore, the bit-flip errors remain exponentially suppressed for the logical gate.Now, a phase-flip error occurring on any cat qubit of the first two logical qubit Z 1,2 (we omit the superscript for clarity) commutes with the successive physical Toffoli gates of the circuit: As a result, an error acting on any qubit of the first two logical qubits does not spread through the circuit and is corrected by the QEC stage performed after the gate's execution.Unfortunately, phase-flip errors on cat qubits of the third logical qubit do not commute with the Toffoli unitary and produce an extra error As the circuit is transversal for the second and third blocks of physical qubits (that is, the kth cat qubit of logical qubit 2 is only connected to the kth cat qubit of logical qubit 3), the forward propagation of an error from the third block to the second one cannot cause a logical error.On the other hand, because of the nontransversality of operations between the first and third logical qubits, a Z 3 error spreads on all qubits of the first logical qubit, resulting in an uncorrectable logical Z L error.Though this result means that the full circuit is not fault tolerant, a logical error can arise only if a majority of the qubits of the first logical qubit have been contaminated.To prevent this error, we perform two stages of QEC during the execution of the circuit, after one-third and two-thirds of the full circuit are executed, as shown in Fig. 8.In this manner, any physical error propagating from the third logical qubit is corrected before it spreads beyond the code distance.The exploited idea here is that, while a nontransversal circuit might not be fault-tolerant, pieces of the circuit could still be, thus, adding extra stages of error correction at carefully chosen locations in between these pieces can provide full fault tolerance.This idea is introduced and studied in Ref. [52], and these circuits are called pieceable fault tolerant.
Note that while the above analysis ensures that the errors do not propagate in an uncontrolled manner, one also needs to prevent an accumulation of the nonpropagating errors (above the threshold of the repetition code) between two rounds of QEC.Indeed, Fig. 8 represents the Toffoli circuit for a 3-qubit repetition code, and whenever we increase the code distance, we also need to add new blocks of QEC at appropriate places to avoid an accumulation of nonpropagating errors on the first repetition cat qubit.There are various ways to achieve this addition.The most straightforward one is inspired by the fact that a concatenation of repetition codes is still a repetition code.More precisely, the measurements of the stabilizers of the lowest level repetition code are enough to reconstruct the value of the stabilizers at any higher level of encoding.One can, therefore, extend the logical Toffoli circuit of Fig. 8 to a k m -qubit repetition code, where each data qubit meets at most k gates between two rounds of QEC.A thorough numerical study and benchmarking of the accuracy threshold for such circuits is topic of current research and will appear in a forthcoming paper.
Construction of Hadamard gate.In order to establish the universality of the set {P |± L , M X L , X L , Toffoli}, we show in Fig. 9 how a Hadamard gate can be built out of this set.Its fault tolerance is trivially derived from the fault tolerance of each logical gate in the circuit.
We end this section by mentioning that while we have the possibility of correcting errors after the realization of each gate, it is enough to keep the record of errors by measuring the error syndromes and only apply an error correction before the Toffoli gates.Indeed, the Clifford operations map Pauli operators to Pauli operators and therefore it is only needed to keep track of the errors to update the Pauli frame in software [46].On the other hand, the Toffoli gate is not a Clifford gate and does not map Pauli operators to Pauli operators.One therefore needs to perform error correction before the application of such a gate [53].

VI. ERROR ANALYSIS
We now study the performance of the physical gates of Sec.IV in a realistic setup.We note that, while the bias preserving character of the state preparation P |± c and the measurement M X is ensured by their definition, the error analysis of our implementation of rotations around the Z axis has been previously discussed in Ref. [22].Therefore, we focus our analysis to the case of X, CNOT and Toffoli gates.First, we analyze a model with two main sources of errors: the errors caused by single-photon loss in the cavity, which is the principal "physical" source of decoherence, and the errors induced by the finite gate time (nonadiabaticity).Then, we give numerical evidence that similar performance can be expected in the presence of other sources of errors, such as thermal excitations and dephasing.
In our implementation of the X, CNOT and Toffoli gates, the loss of a single photon in the cavity changes the parity of the number of photons.As a result, the effect of photon loss on cat qubits is mostly to induce phase flips < l a t e x i t s h a 1 _ b a s e 6 4 = " E 3 Z / j P w Y   u R e E c m 6 Y G y Z p i w + j q / N w l M 6 e i d 2 5 / q U r R I S a n c Y P x h N g 3 y s 9 z t o 0 m N b X r s 3 V N / N V k a l b P / T w 3 w 1 v f 6 j y j b x G r v j f T 4 e q 6 k g 5 Z v S d 9 7 / J D w + 6 p / O y V X l B b L V f W y q v 7 6 6 W t 7 b y P R r G A R S y z V z a w h V 3 s o U r f J m 5 w i z v r 3 n q w H q 2 n j 1 S r k G v m 8 W 1 Y L + / M 7 6 M 0 < / l a t e x i t > FIG. 9. Logical Hadamard circuit (a).The circuits (b,c,d) are equivalent circuits that help to understand why the circuit (a) implements a logical Hadamard gate.In circuit (b), the "CNOT" gate between the repetition cat qubits 2 and 3 is replaced by the equivalent circuit where the control and target roles are switched with the addition of Hadamard gates before and after the gate.It becomes clear in circuit (b) that the second repetition cat qubit plays no role: It is initialized in |− L, transformed to |1 L after the first Hadamard, thus always triggers the corresponding part of the control of the Toffoli, before being converted to |− L by the second Hadamard.Actually, the second repetition cat qubit is needed only because we do not readily have a controlled-phase gate available at the repetition cat qubit level (but here we show that it can be done with the Toffoli gate plus one ancilla repetition cat qubit).The idle role of the second repetition cat qubit is represented more simply in circuit (c), where again the "CNOT" between the repetition cat qubit 1 and 3 is replaced by its equivalent circuit where the control and target roles are exchanged with the addition of Hadamard gates.Finally, in circuit (d) (where we omit the second repetition cat qubit for clarity), the first Hadamard of the first line and the preparation of |+ L are replaced by the equivalent preparation of |0 L and the second Hadamard is commuted through the XL, producing a ZL gate.The remaining circuit in the dashed box is just a teleportation of the state |ψ L of the second repetition cat qubit to the first one.After the state is teleported, the remaining Hadamard gate HL is applied, thus establishing the equivalence between circuit (a) and a logical Hadamard.
|1 c .Mathematically, this difference can be understood by looking at the matrix elements coupling these states, If the only source of phase-flip errors is the photon loss, the noise bias, defined as the ratio of the phase-flip rate to the bit-flip rate η = p Z /p X scales as η ∼ e −2|α| 2 for large values of |α| 2 .This situation is the case for the X gate: As explained in Sec.IV, the phase-flip errors due to the adiabatic approximation disappear as soon as the Hamiltonian −π/T â † â is added.Furthermore, the precision of the gate is ensured by the fact that the rotation of the cat states leads to a topological phase This phase is not affected by the imprecisions in the rotation angle.Indeed, the phase of the coherent states | ± α is locked to the phase of the pump drives.In this sense, each cat qubit is defined with respect to its own pumps.Therefore, even if the rotation angle is not precisely π, which could happen, e.g., because of the amplitude and phase fluctuations of the pumping drive, the state still accumulates a topological π phase with respect to its local oscillator.The same argument on the gate precision holds for the CNOT and Toffoli gates, and is discussed further in Sec.VII.In the rest of this section, we will analyze the errors induced by photon loss and nonadiabatic effects on the CNOT and Toffoli gates.
CNOT gate corrupted by photon loss.In order to understand the effect of a loss of photon during the execution of the CNOT, let us consider the unitary operation approximately generated by the two dissipation channels L â, L b(t) of Sec.IV.Indeed, in the presence of the above driven dissipations where the dynamics is confined in the cat qubit subspace, we approximately implement a unitary operation of the form: First, we investigate the effect of a loss of a photon of the control mode â.Denote by E â the noisy quantum operation performed instead of the CNOT when the control mode is lossy, and by t ∈ [0, T ] the random time at which such a loss occurs.We have: The resulting error induced by the propagation of the photon loss can be expressed in terms of the Pauli operators of cat qubits as where θ = −iπ(1 − t/T ) is a random phase.The time of the jump being uniformly distributed over the interval [0, T ], the noisy operation E b can be written where ρ = CNOTρCNOT is the image of ρ by a perfect CNOT operation and nκ 1ph T is the average number of photons lost in each mode during the gate's execution.Written in this form, it is clear that the operation E b is a perfect CNOT gate followed by some noise given by the operators appearing in the equation above.
The first two terms indicate that the effect of photon loss on the target cat qubit produces two types of error of the same strength: phase flips on the target cat qubit 1 2 Z 2 ρZ 2 as well as a correlated phase flips on both qubits 1  2 Z 1 Z 2 ρZ 1 Z 2 , with some degree of coherence between these two errors.
When losses on both modes are taken into account, the noisy CNOT E â, b can be expressed as a Kraus sum: Errors induced by nonadiabaticity.The Hamiltonian compensates most of the errors induced by the finite gate time T .Using the adiabatic elimination techniques of Ref. [54], it is possible to characterize the remaining error and show that it is composed only of phase flips on the control cat qubit Z 1 , with a rate proportional to (nκ 2ph T 2 ) −1 .The exact coefficient of proportionality can be estimated by a numerical fit and is well approximated by 2π, giving the phase-flip probability: A more thorough study of the errors induced by the approximate Hamiltonian will be given in a forthcoming paper.
Numerical simulations.In order to check the validity of this error model, we perform a numerical process tomography of the CNOT gate [Figs.10(a,b,c)].This process is done by simulating the full master equation of the system in the presence of photon loss.The process matrix χ plotted in Fig. 10 where U = CNOT is the perfect CNOT operation and the right-hand side represents the minimum over all twoqubit state fidelities.The unitary of the perfect CNOT is factored out in order to obtain the process error matrix χ err (real part in (b), imaginary part in (c)), which characterizes the noise alone: We further investigate our theoretical model for errors caused by photon loss by plotting (Fig. 10(g,h,i)) the values of the coefficients of the error matrix χ err (marked by colored squares) as a function of the gate duration.Here, the blue dots correspond to phase-flip errors on the control cat qubit Z 1 induced by a combination of nonadiabatic errors and the photon loss.The plain blue line corresponds to our analytical formula which is found through the analysis above together with second-order perturbation techniques following Ref.[54].The red dots represent the phase-flip errors on target qubit Z 2 and the correlated phase-flip errors Z 1 Z 2 (red dots).These values coincide, and, following our analysis, they are given by This result is represented by the plain line in red.The off-diagonal term representing the coherence between Z 2 and Z 1 Z 2 errors (green dots) also fits very well our expectation from Eq. ( 3).The pale purple dots correspond to the off-diagonal term representing the coherence between I and Z 1 errors.In order to capture such a coherence, one needs to push the nonadiabatic perturbation techniques [54] up to third order, which will be subject of future work.Most importantly, the remaining errors (namely, the ones that contain an X or Y Pauli operator) represented by the black lines are exponentially suppressed by the cat size.This result proves the bias preserving aspect of the gate.
Gate fidelity and optimal gate time.The phase-flip errors occurring on the control mode are caused by two sources that are very different in essence: When the gate time is increased, the "environment"-induced errors, caused by photon loss, are also increased, whereas phaseflip errors caused by nonadiabaticity are reduced.This opposite behavior gives rise to a finite optimal gate time T * for which the gate infidelity is minimal.
More precisely, taking into account phase-flip errors caused by photon loss and by non-adiabicity, the total phase-flip error probability on the control cat qubit is given by The gate fidelity F of the implemented CNOT operation, defined by Eq. ( 4), is given by The highest value of the fidelity that can be achieved is set by the ratio κ 1ph /κ 2ph achieved for the optimal gate time For the ratio κ 2ph = 10 −3 considered in Fig. 10, this theoretical formula predicts a gate fidelity of F = 98.2%, in agreement with the numerical simulation.
Addition of new noise processes.As discussed in Ref. [34], in the presence of the two-photon pumping scheme, any physical noise process with a local effect in the phase space of the harmonic oscillator causes bit flips that are exponentially suppressed in the size of the cat qubits, thus preserving the biased structure of the noise.We now provide a numerical evidence of this fact for a more elaborate set of physical noise processes for the superconducting cavity: photon loss â , thermal excitation â † with a non-zero temperature, and photon dephasing â † â.
In Fig. 10, we characterize the performed operation by plotting the process matrix χ (d), and the real part (e) and imaginary part (f) of the error matrix.In this simulation, κ 1ph /κ 2ph = 10 −3 , the photon loss is given by κ 1ph (1 + n th )D[â] and thermal excitations by κ 1ph n th D[â † ] with n th = 10%, and the dephasing on the cavity is given by κ φ D[â † â] with κ φ = κ 1ph .
Note that the resulting error matrix and gate fidelity are barely affected by the added thermal excitations and photon dephasing.The addition of thermal noise and dephasing slightly decrease the fidelity of the operation, from 98.2% to 97.8%, but as expected, this decrease is caused by an increased rate of phase-flip errors, while all bit-flip errors remain exponentially suppressed.
Numerical considerations.The numerical study of the CNOT gate in the presence of noise (Fig. 10) requires the simulation over a time T of the Lindblad master equation for 16 different initial states, where Ĥ, Lâ and Lb (t) are defined in Sec.IV.The numerical computations were performed in parallel using the cluster of Inria Paris, composed of 68 nodes for a total of 1244 cores.The nodes are divided in a few hardware generations: 28 biprocessors Intel Xeon X5650 of 6 cores, 12 biprocessors E5-2650v4 2.20 of 12 cores, 16 biprocessors XeonE5-2670 of 10 cores, 8 biprocessors E5-2695 v4 of 18 cores, 4 biprocessors E5-2695 v3 of 14 cores.The simulation of the CNOT gate for cat qubits of n = 10 and a gate time of T = 3κ −1 2ph takes about 13 h on the cluster.The simulation of the Toffoli gate with the same parameters would be about 2000 times longer, for this reason, we do not provide numerical simulations for the Toffoli gate in this paper.However, the analytical discussion that follows explains, in a similar manner to the CNOT gate (plain lines in Figs.10(g,h,i)), the expected error mechanisms and rates.
Toffoli gate corrupted by photon loss.The effect induced by photon loss during the execution of the Toffoli gate can be derived in the same way as for the CNOT.A photon loss occurring on one of the two control modes â, b does not propagate to the other modes and results in a dephasing error Z 1 and Z 2 , respectively.When the target mode ĉ loses a photon, it gives rise to a correlated error between the three modes.More precisely, the noisy Toffoli operation E â, b,ĉ can be decomposed into a perfect Toffoli operation, again denoted by ρ = Toffoli ρ Toffoli followed by a noise process expressed in Kraus form as acts on the two control cat qubits.
Nonadiabatic effects on Toffoli implementation.Because of the analogies in the way the CNOT and the Toffoli gates are implemented, it is useful to think of the Toffoli gate as a CNOT where the control state | − α is replaced by | − α, −α .In particular, the methods of [54] that we use to characterize the effect of nonadiabaticity predict similar results for the Toffoli gate.The analysis of the errors induced by the approximate Hamiltonians is not the subject of this paper.However, we anticipate that the effect of the finite gate time is to dephase the "trigger" state | − α, −α with respect to the other three possible states of the pair of control cat qubits.In terms of Pauli operator, this effect results only in phase-flip errors Z 1 , Z 2 and Z 1 Z 2 on the two control cat qubits with equal probability p = (4πnκ 2ph T ) −1 but it does not cause any error on the target cat qubit, or bit-flip-type errors.
Optimal gate time and gate fidelity.Taking into account phase-flip errors caused by photon loss and nonadiabaticity, the gate fidelity F of the implemented Toffoli operation is given by This fidelity is maximum for the same gate time 2ph optimizing the CNOT gate, producing a gate fidelity of The ratio κ 1ph κ 2ph = 10 −3 considered in Fig. 10 corresponds to a gate fidelity F = 97.3% with respect to a perfect Toffoli.Note that the optimal gate time for the CNOT and the Toffoli gate decreases with the mean number of photons n.

VII. TOWARD EXPERIMENTAL IMPLEMENTATION
The ideas behind our proposal could be applied to qubits possessing an extra degree of freedom, for which one type of error (bit flips or phase flips) is suppressed as soon as the noise processes are local in this degree of freedom (here the locality is in the phase space, but one can also consider the locality in the actual space as in Majorana fermions).The pumped (driven-dissipative or Kerr-type) cat qubits are prototypes of such qubits where the information is encoded and stabilized in a non-local manner in the phase space of harmonic oscillators.The stabilization of cat qubits can, for instance, be implemented in the context of the vibrational degree of freedom of an ion, by engineering two-phonon dissipation and drive [56].Throughout the past years, this idea has attracted a lot of attention in the context of superconducting circuits where such a two-photon driven dissipation can be systematically achieved using the four-wave mixing property of Josephson junctions and applying parametric methods [22,27,28,35] (see also Refs.[24,36,57] for the nondissipative approach known as the Kerr cat).We therefore pursue this trend by proposing a possible implementation of various dissipation and Hamiltonian operators involved in our scheme using parametric methods for superconducting circuits.
We summarize in Table II the dissipation operators and Hamiltonians required for the implementation of various bias preserving gates at the level of cat qubits.We note that, in this table some of the dissipation operators and Hamiltonians are crucial as their realization enables us to achieve bias preserving gates where the bit flips remain exponentially suppressed with the cat size.Some other Hamiltonians are optional and enable us to reduce the phase-flip-type errors due to nonadiabatic effects.The implementation of the optional Hamiltonians can put the phase-flip error probability of cat qubits well below the accuracy threshold of the repetition code and therefore reduce the number of required cat qubits in this code.
First, we note that the two-photon driven dissipation required to stabilize the cat qubits is realized by parametrically coupling a high-Q superconducting cavity mode â (frequency ω a ), called the storage mode, to a low-Q one d (frequency ω d ), called the dump mode [27,28,35].Here, we recall the approach in these implementations.Coupling the two modes â and d via a nonlinear element (a Josephson junction), and driving the system at frequency 2ω a − ω d , one can engineer a nonlinear interaction of the form In particular, the amplitude and phase of the coupling, given by the complex value g 2ph , is modulated by the pump (drive at frequency 2ω   Here κ 2ph is roughly given by 4|g 2ph | 2 /κ d and α is given by − d /g 2ph [22].The two-photon dissipation rate κ 2ph is modulated by the pump power, and the cat amplitude and phase (given by the complex number α) are modulated by the resonant drive's amplitude and phase.Strong couplings g 2ph , leading to strong 2-photon dissipation rates κ 2ph , have been achieved in recent experiments [27,28].Remarkably in Ref. [28], the authors engineer a two-photon dissipation rate κ 2ph of about 100 times larger than the natural single-photon loss rate and there seems to be room for extra improvements.Finally, the latest experiments [35] have illustrated signatures of the promised exponential bit-flip suppression (with the cat size) for the induced cat qubits.
One important question to answer is whether the bitflip suppression induced by the two-photon process is affected by higher order terms in this adiabatic elimination approximation?The answer, fortunately, is not in a significant manner.In order to see this result, one can note that the states {| ± α ⊗ |0 } are precise steady states of the two-mode system before adiabatic elimination.Indeed, the protection of the coherent states | ± α against local shifts is ensured at all orders because of this stability.The rate of convergence to these states (which can be seen as the rate of protection against such excursions in the phase space) can, however, be modified when considering higher-order terms.However, if these corrections to the two-photon dissipation rate are not too large, the associated protection rate remains larger than the diffusion rate induced by local error mechanisms and, therefore, the bit-flip suppression remains valid.
In parallel to these experiments, the measurement operation M X , which is equivalent to measuring the photon-number parity of the cat qubits has been performed in Refs.[21,49].Following the approach presented in Sec.IV, a measurement fidelity of 98.5% has been achieved in Ref. [21].Finally, quantum Zeno dynamics can be applied to perform bias preserving rotations around the Z axis of the cat qubit.As explained in Sec.IV, it is enough to turn on a weak resonant drive at the frequency of the storage mode ω a in the presence of the two-photon driven dissipation.This experiment was performed in Ref. [28].
The realization of the X-operation consists in taking the same approach as the two-photon driven dissipation and simply varying the phase of the resonant drive d between 0 and 2π in a time T .This leads to a dissipation operator κ 2ph D[â 2 − exp(2iπt/T )α 2 ] which implements a bias preserving X operation.In order to remove the < l a t e x i t s h a 1 _ b a s e 6 4 = " V F + M 8 j S z O J 4 y u q B A g 8 J f j i s C h a phase-flip errors induced by the nonadiabaticity of this variation, one can additionally implement a Hamiltonian of the form −∆â † â with ∆ = π/T .This is simply done by taking the pump at frequency 2ω a − ω b − 2∆ instead of 2ω a − ω b and furthermore detuning the drive d from resonance by value ∆.These are all simple modifications of the experiments in Refs.[27,28,35] and should be straightforward.
Let us now discuss the realization of the CNOT and Toffoli gates.For the CNOT gate between two cat qubits encoded in storage modes â and b, further to a two-photon driven dissipation modeled by the dissipator κ 2ph D[â 2 − α 2 ], one requires to also implement a timedependent dissipator given by κ 2ph D[ b2 − α 2 − α 2 (1 − e 2iπt T )(â − α)].In order to implement such a dissipation operator, we propose to couple the two storage modes â and b to a dump mode d, using a Y-shape transmon similar to [58] (see Fig.Here again, it should be noted that the functions c ab , c a , c b vanish at the beginning and at the end of the gate execution, so that each cat qubit gets back to being defined by its own local oscillators.Similarly to the CNOT gate, the pump fluctuations during the gate result only in a slight increase in the rate of phase-flip type errors, but do not lead to unsuppressed bit-flip-type ones.
In order to reduce the phase-flip probability induced by the nonadiabaticity, we use an additional Hamiltonian )+ H.c..Such a Hamiltonian can also be implemented in a similar manner to H CNOT .A more detailed discussion of such a Hamiltonian synthesis together with the error probability enhancements is out of the scope of the present paper and will be the subject of a forthcoming paper.
Finally, we note that the bias preserving gate CZ(θ) is not required in the fundamental set of bias-preserving operations but may be useful for optimizing the realization of certain quantum algorithms.Such an operation can also be achieved following an approach based on quantum Zeno dynamics, in a similar manner to Z(θ) [22].The required beam-splitter Hamiltonian ZZ (â b † + bâ † ) can be engineered by applying a pump at frequency (ω b − ω a )/2.The exchange of the photons between the two modes is therefore mediated by the 4-wave mixing property of the Josephson junction via two pump photons.
All the above implementations appear to be rather straightforward extensions of the existing parametric methods, for instance, for two-photon driven dissipation.We expect that the experiments with similar devices and similar parameter regimes as those in the cited references lead to bias preserving gates with phase-flip error probabilities below the threshold of the repetition code.For instance following the error analysis in Sec.VI, we anticipate that a ratio of 1000 between the engineered twophoton decay rate κ 2ph and the natural single-photon loss rate κ 1ph will put us well below the threshold of the repetition code [59], such that with a cat size of |α| 2 = 10 and with a few tens of repetition modes per logical qubit, we achieve logical error probabilities of the order 10 −9 for a universal gate set.This appears to be a huge overhead reduction with respect to state of art quantum error correction approaches.

VIII. CONCLUSIONS
Fault-tolerant computation with protected logical qubits represents a major experimental challenge.The surface code provides a viable solution as it exhibits relatively high accuracy thresholds.However, this property comes at the cost of a tremendous experimental overhead.Indeed, in a realistic implementation of quantum algorithms, the vast majority of operations serve to protect the information rather than performing the computation itself.Furthermore, while certain operations can be performed in a topologically protected manner, certain others (e.g.non-Clifford gates) require magic states preparation, distillation and injection adding further complexity.In this paper, we have proposed an alternative approach by replacing the 2D surface code with a 1D repetition code where the physical two-level systems are replaced by cat qubits.Remarkably, we obtain a universal set of topologically protected logical gates with no need for magic states.The apparent trick lies in the fact that the 2D phase space of the cat qubits are exploited to perform nontrivial operations.In this sense a line of cat qubits has the same properties as an effective 3D system.
Furthermore, we show that this approach is readily exploitable at an experimental level and requires only minor modifications of previous realizations.A numerical analysis indicates that the parameter regimes close to the ones achieved in the field of superconducting circuits, result in effective error probabilities below the accuracy threshold of the repetition code.Therefore, this scheme is a promising candidate for a first demonstration of a universal set of fully protected logical quantum gates.Encouragingly, we expect that small logical error rates of 10 −9 could be achieved with a few tens of cat qubits and a mean photon number of about 10.A more thorough error analysis based on a mathematical analysis of the effective error mechanisms and the numerical implementation of an optimal decoding strategy will be subject of a forthcoming paper.
Appendix A: A no-go theorem for bias preserving quantum gates As we see in the paper, the extra degree freedom associated to the complex amplitude α in the cat qubits enables us to perform a set of nontrivial operations such as the CNOT or the Toffoli gate in bias-preserving manner.In this appendix, we show the crucial role played by this extra degree of freedom.Indeed, we will prove that such gates cannot be performed in a bias-preserving manner with two-level systems.The analysis of this appendix Noting that D is necessarily a linear combination to twoqubit Pauli operators, it is the same for [D, Z j ] and therefore The only possibility for such a combination is that all the coefficients vanish.Therefore [D, Z 1,2 ] = 0, or equivalently Therefore, the Lie algebra c is spanned by I, Z 1 , Z 2 , Z 1 Z 2 , which means that the associated Lie group does not include CNOT.
t e x i t s h a 1 _ b a s e 6 4 = " G y w W g W D p I o k l p 6 8 c e x T D i b r Q FIG. 1.(a) Bloch sphere representation of a cat qubit.(b) Vector field associated to the semiclassical dynamics behind the master equation (1) represented in the phase space of the harmonic oscillator.This vector field governs the dynamics of coherent states.It admits two stable equilibria | ± α and one saddle point at zero.The exponential suppression of the bit-flip errors can be understood by the fact that any local perturbation of the state |0 c ≈ |α (respectively, |1 c ≈ |−α ) keeps the state in the domain of attraction of |α (respectively, | − α ).

FIG. 4 .
FIG. 4. Wigner function of the state of a cat qubit during the execution of an X operation.The green dots are the Wigner functions of the instantaneous steady states of the dynamics ρ = κ2D[â 2 − α(t) 2 ].These attractive points are slowly rotated from ±α to ∓α on the dashed circle, as shown by the green arrows.When this rotation is performed slowly, the cat follows the attractors (red arrows).
|+i c < l a t e x i t s h a 1 _ b a s e 6 4 = " h T / N 8 3 L A 8 r C N 4 I b N t v Z M d 3 e O t s 0 r b 9 H B B 3 T R o + 8 c 3 / A d 5 9 4 P 7 8 L 7 6 f 1 a p n q V U v M C / w z v 6 g / A a a d h < / l a t e x i t > |+i c < l a t e x i t s h a 1 _ b a s e 6 4 = " h T / N 8 3 L A 8 r C N 4 I b N t v Z M d 3 e O t s 0 D S 9 e D w p 5 K x 1 B 3 w m e p 3 a n Q z t k v X V n M U C J H + A z 9 B r F w y t U 5 M 6 e p X O 9 0 t t z 5 v 7 l I Y s k W P r a G 7 9 d 2 l z r 9 D L G 9 9 m b m W J 0 6 m S N L e 6 J 7 V 0 s N T k 9 8 e V a u g q z j b b 9 g U 5 5 S z c G 6 B V T S + B p 0 M H qM n Q 5 1 B T N W Y i 5 c u M 7 F / y 1 2 5 n L S 2 E / z H T a 4 E W Q v H y P 7 L N 1 N e 1 0 e 9 W D i C F 6 4 H h T 3 l j q H u R J O l d L t C K 2 f n u r K Y I U e O 8 C H G D W L h n L N 9 Z s 5 T u N 5 p b 7 m L f 3 V K Y m k u G m 0 J 3 6 7 s L n b + M W J 7 5 c l M s D p 1 M k G W 1 k T nr q Y e v D 3 h 7 3 f l M t h d 7 4 Z P u + s 7 z z q 9 l 8 0 9 W o A V e A R P 8 K 4 8 h x 5 s w T b 0 Q X j v v Q / e R + + T f + p / 8 b / 7 P 6 b S O a / x P I A L w / / 5 C y q C 8 4 o = < / l a t e x i t > D S 9 e D w p 5 K x 1 B 3 w m e p 3 a n Q z t k v X V n M U C J H + A z 9 B r F w y t U 5 M 6 e p X O 9 0 t t z 5 v 7 l I Y s k W P r a G 7 9 d 2 l z r 9 D L G 9 9 m b m W J 0 6 m S N L e 6 J 7 V 0 s N T k 9 8 e V a u g q z j b b 9 g U 5 5 S z c G 6 B V T S + B p 0 M H qM n Q 5 1 B T N W Y i 5 c u M 7 F / y 1 2 5 n L S 2 E / z H T a 4 E W Q v H y P 7 L N 1 N e 1 0 e 9 W D i C F 6 4 H h T 3 l j q H u R J O l d L t C K 2 f n u r K Y I U e O 8 C H G D W L h n L N 9 Z s 5 T u N 5 p b 7 m L f 3 V K Y m k u G m 0 J 3 6 7 s L n b + M W J 7 5 c l M s D p 1 M k G W 1 k T nr q Y e v D 3 h 7 3 f l M t h d 7 4 Z P u + s 7 z z q 9 l 8 0 9 W o A V e A R P 8 K 4 8 h x 5 s w T b 0 Q X j v v Q / e R + + T f + p / 8 b / 7 P 6 b S O a / x P I A L w / / 5 C y q C 8 4 o = < / l a t e x i t > . . .
t e x i t s h a 1 _ b a s e 6 4 = " h T / N 8 3 L A 8 r C N 4 I b N t v Z M d 3 e O t s 0

r b 9 H
B B 3 T R o + 8 c 3 / A d 5 9 4 P 7 8 L 7 6 f 1 a p n q V U v M C / w z v 6 g / A a a d h < / l a t e x i t > |+i c < l a t e x i t s h a 1 _ b a s e 6 4 = " h T / N 8 3 L A 8 r C N 4 I b N t v Z M d 3 e O t s 0

r b 9 H
B B 3 T R o + 8 c 3 / A d 5 9 4 P 7 8 L 7 6 f 1 a p n q V U v M C / w z v 6 g / A a a d h < / l a t e x i t > |+i c < l a t e x i t s h a 1 _ b a s e 6 4 = " h T / N 8 3 L A 8 r C N 4 I b N t v Z M d 3 e O t s 0 X c 1 3 8 c I 5 W / Y 2 7 4 X z t H s 7 5 T 8 q v W Z k D T 6 T v U u 3 y r y v z t Z i cI J 3 r g b F m j L H 2 O p E 6 V K 4 U 7 E 7 9 / + q y t A h I 2 f x m H F N L J x y d c 6 + 0 + S u d n u 2 o Y t f u 0 z L 2 r k o c w v 8 X l t d 5 P R T Y r P 2 Z u Z c 3 V Y y J 2 v 3 Z O 9 d L T X s n t b / v X I T 9 N v N 1 l 6 z / X G / 0 X l f 9 l E V L / E K r 9 kr b 9 H B B 3 T R o + 8 c 3 / A d 5 9 4 P 7 8 L 7 6 f 1 a p n q V U v M C / w z v 6 g / A a a d h < / l a t e x i t > r measurements < l a t e x i t s h a 1 _ b a s e 6 4 = " 3 Y m y f B g P g a n Y p u e e q 4 e L h 5 l o 7 m 8= " > A A A C / X i c j V L L S g M x F D 0 d 3 / U 1 6 t L N Y B V c l W l d 6 L L o x q W C 1 Y I W y c R U h 8 6 L J F M o R f w R t 3 U l b v 0 W / 0 D x J7 y J U / C B j w w z c 3 L u P T c 5 u Q m y K F T a 9 5 9 K z t j 4 x O T U 9 E x 5 d m 5 + Y d F d W j 5 W a S 6 5 a P I 0 r G / a n 2 g N b 0 + y t T / + g q B U T q 3 F F 7 F + 6 U e Z / d c a L R g c 71 k N I n j L L G H e 8 q J L b U z E 7 9 z 6 4 0 l Q h I 8 7 g C 4 p L w t w q R + f s W Y 2 y 3 s 3 Z M h t / t p m G N X N e 5 O Z 4 + d V d Y P V d w t p 0 h i 5 C 7 W v b v 4 P j e r W 2 V a 0 f 1 i u N 3 e J K T G M V a 9 i k v m + j g X 0 c o E n r9 H C L I e 6 c G 2 f o 3 D s P 7 6 l O q d C s 4 N N w H t 8 A 9 9 6 e j Q = = < / l a t e x i t > n data cat-qubits < l a t e x i t s h a 1 _ b a s e 6 4 = " U 9 M f 7 i L / O U 2 j x t / b p X t Y W d L 9 w I Q = " > A A A D A H i c j V L L T s J A F D 3 U F + I L Z e m m E U z c S A o u d E l 0 4 x I T e S R I y L Q M O K G 0 t Z 2 a E O L G H 3 G L K + P W P / E P N P 6 E d 8 a S q M T H N G 3 P n H v P n T l z x w 5 c E U n L e k 4 Z c / M L i 0 v p 5 c z K 6 t r 6 R n Z z q x 7 5 c e j w m u O 7 f t i 0 W c R d 4 f G a F N L l z S D k b G i 7 v G E P T l S 8 c c 3 D S P j e u R w F r h z b p y e c + 8 8 v K c 6 A 7 l m H p + G 8 / g G 5 A S h D w = = < / l a t e x i t >

FIG. 7 .
FIG. 7. Transversal implementation of the logical CNOT.For clarity, the number of cat qubits per repetition cat qubit is n = 3.Here the three upper lines represent the control repetition cat qubit and the three bottom ones represent the target one.
e 9 y O e x t O 0 f p a 1 7 Z e O + u f 3 A e v j o 8 Z O n O 5 X d 4 z h M B G V d G v q h O P X c m P k 8 Y F 3 J p c 9 O I 8 H c g e e z E 6 9 / o O I n X 5 i I e R h 8 l j c R O x + 4 v Y B f c e p K p C 4 q 5 e / O E e W C J l y S z s E H u 9 5 g A 9 L 5 N A p 2 4 c e F e / 8 I z 0 w g + s D o h y Z l z 7 z k z d + Z 6 c S B T 5 T j P B W t o e G R 0 b H x i c m p 6 Z n a u O L / Q S K M s 8 U X d j 4 I o a X p u K g I Z i r q S K h D N O B F u 1 w v E o d e p 6 f j h p U h S G Y U H q h e L k 6 7 b D m V L + q 4 i t b + 3 X T s t l p y y Y 4 b 9 E 1 R y U E I + d q P 5 w g i O c Y Y I P j J 0 p 2 4 c e F e / 8 I z 0 w g + s D o h y Z l z 7 z k z d + Z 6 c S B T 5 T j P B W t o e G R 0 b H x i c m p 6 Z n a u O L / Q S K M s 8 U X d j 4 I o a X p u K g I Z i r q S K h D N O B F u 1 w v E o d e p 6 f j h p U h S G Y U H q h e L k 6 7 b D m V L + q 4 i t b + 3 X T s t l p y y Y 4 b 9 E 1 R y U E I + d q P 5 w g i O c Y Y I P j J 0 p 2 4 c e F e / 8 I z 0 w g + s D o h y Z l z 7 z k z d + Z 6 c S B T 5 T j P B W t o e G R 0 b H x i c m p 6 Z n a u O L / Q S K M s 8 U X d j 4 I o a X p u K g I Z i r q S K h D N O B F u 1 w v E o d e p 6 f j h p U h S G Y U H q h e L k 6 7 b D m V L + q 4 i t b + 3 X T s t l p y y Y 4 b 9 E 1 R y U E I + d q P 5 w g i O c Y Y I P j J 0 5 0 y M p j S 7 6 7 O l p v 7 N d G p W 5 8 z 2 V v D 9 0 u 0 i o 4 8 R q 0 v f z B i n 6 0 3 G y O p n 0 u 9 d T D R 4 e 4 L Z u z I P 9 t a 7 w d P u + u 6 z T u + l v U f L c B 9 W 4 T H e l e f Q g 2 3 Y g T 4 w 5 6 P z y f n i f F 3 8 4 b b c u + 6 9 S e u C Y z k 5 j U 8 Y T 4 k D o + y e s 2 0 0 m a l d n 6 1 n 4 q 8 m U 7 N 6 H h S 5 O d 5 6 V u c b f Z t Y 9 b y Z c 6 6 u K z k n q / e k 7 1 1 + a N g 9 7 v d e + Q l 2 F + v u U n 1 x a 7 m 6 t l 7 0 U R m z m E O N v b K C N W y i g S Z 9 W 7 j B L e 6 s e + v B e r S e P l K t U q G Z w Z d h v b w D x 3 O j M g = = < / l a t e x i t > (c) < l a t e x i t s h a 1 _ b a s e 6 4 = " T 5 l I U d 5 n J S L 6 X p l l d X s L c Y y d + y R F 0 N t v e e + 4 9 5 8 6 Z n S C L Z K 5 9 / 6 e z s O g u 3 b q 9 f M e 7 e + / + g 4 c r j U c 7 e V o o L v o 8 j V I 1 C F g u I p m I v p Y 6 E o N M C R Y H k d g N w n V T 3 / 0 m V C 7 T 5 K s + y c R + z E a J P J S c a Y S G D W e b b n G p e C E 1 6 a 2 v + S I m v e 2 1 l t 9 + b 6 J n r 2 a b e K Z c d b s b 9 5 d 4 6 n 3 d s W / l 3 u 1 y S p c k P 1 L 9 5 n 5 X 5 2

FF
which can be written in terms of Pauli operators for the II IX IY IZ XI XX XY XZ YI YX YY YZ ZI ZX ZY = 98.2%II IX IY IZ XI XX XY XZ YI YX YY YZ ZI ZX ZY II IX IY IZ XI XX XY XZ YI YX YY YZ ZI ZX ZY II IX IY IZ XI XX XY XZ YI YX YY YZ ZI ZX ZY ZZ = 97.8%II IX IY IZ XI XX XY XZ YI YX YY YZ ZI ZX ZY ZZ II IX IY IZ XI XX XY XZ YI YX YY YZ ZI ZX ZY ZZ (a)  completely characterizes the quantum operation E performed via the relationE(ρ) = mn χ mn P m ρP † nwhere {P j } is the set of two-qubit Pauli operators.The gate fidelity F is defined as[55] mn χ err mn P m ρP † n with ρ = CNOTρCNOT the image of ρ by a perfect CNOT.In other words, we decompose the noisy CNOT into a perfect CNOT followed by some noise process, characterized by the process error matrix χ err .As can be seen in the real part of χ err (Figure 10-b), photon loss and nonadiabaticity cause only phase-flip errors Z 1 , Z 2 or Z 1 Z 2 .
two-photon exchange between the storage mode â and its bath.More precisely, by adiabatically eliminating the dump mode (assuming κ d > |g 2ph | and | d |), the effective dynamics of the storage mode can be modeled by a two-photon driven-dissipation κ 2ph D[â 2 − α 2 ].
t e x i t s h a 1 _ b a s e 6 4 = " G y w W g W D p I o k l p 6 8 c e x T D i b r QE I U = " > A A A C 7 n i c j V L L S s N A F D 2 N r 1 p f V Z d u g k W o m 5 L U h S 6 L b l x W t A + o R Z J 0 W o f m R T I R S v E T 3 N a V u P W X / A P F n / D O O A W 1 + J i Q 5 My 5 9 9 y Z M 3 f c 2 O e p s K z n n D E 3 v 7 C 4 l F 8 u r K y u r W 8 U N 7 e a a Z Q l H m t 4 k R 8 l b d d J m c 9 D 1 h B c + K w d J 8 w J

..
). Driving the dump mode at three different frequencies ω 1 = 2ω b −ω d , ω 2 = (ω a −ω d )/2, and ω 3 = ω d , one can engineer an interaction Hamiltonian of the form H CNOT = (g bd b2 d † + g * bd b2 † d) + (g ad â d † + g * ad â † d) + ( d d † + * d d).In this interaction Hamiltonian, the first term (g bd b2 d † + g * bd b2 † d) models the exchange of two storage photons at frequency ω b with one dump photon at frequency ω d via a pump photon at frequency ω 1 .The second term (g ad â d † + g * ad â † d) models the exchange of one storage photon at frequency ω a with one dump photon at frequency ω d via two pump photons at frequency ω 2 .The amplitudes and phases of g bd and g ad are modulated by the amplitude and phase of the corresponding pumps.Finally, the last term ( d d † + * d d) models the resonant interaction of the drive at frequency ω d with the dump mode.Similarly to the driven two-photon dissipation, one can adiabatically eliminate the highly dissipative dump mode to achieve an effective dissipation operatorκ 2ph D[ b2 + c a â + c]where the dissipation rate κ 2ph is roughly given by 4|g bd | 2 /κ d (κ d being the loss rate of the dump mode), the complex constant c a is given by g ad /g bd and the complex constant c by d /g bd .Similarly to the X-operation, it is clear that by varying the amplitudes and phases of the pump at frequency ω 2 and the resonant drive at frequency ω d , one can engineer a dissipation operator with time-varying constants c a and c is given, respectively, byc a (t) = − αThis result corresponds to the dissipator required for the bias preserving CNOT operation.Importantly, the timedependent function c a takes the value 0 at times t = 0 and t = T .For this reason, before and after the gate, the two cat qubits involved in the CNOT are defined by their own local oscillators.The fluctuations of the pumps during the execution of the gate merely result in a slight modification of the geometric paths taken.This modification can lead only to small fluctuations of the geometric phase and therefore an effective phase-flip type error.The phase-flip probability induced by the nonadiabaticity of the evolution can be reduced by adding the effective HamiltonianH CNOT = 1 2 π T â−α 2α ⊗ ( b †b − |α| 2 )+ H.c..Such a Hamiltonian has also been recently implemented using a detuned parametric pumping method[50].In order to realize a bias preserving Toffoli gate between three cat qubits encoded in storage modes â, b and ĉ, further to two-photon driven dissipations modeled byκ 2ph D[â 2 − α 2 ] and κ 2ph D[ b2 − α 2 ], we require to implement a time-dependent dissipator given by κ 2ph D[ĉ 2 −α 2 + 1 4 (1−e 2iπt T )(â b−α(â+ b)+α 2 )].Similarly to the CNOT gate, we propose to couple the three modes to a highly dissipative dump mode as shown in Fig.11.By driving the dump mode at five different frequenciesω 1 = 2ω c − ω d , ω 2 = ω a + ω b − ω d , ω 3 = (ω a − ω d )/2, ω 4 = (ω b − ω d )/2, and ω 5 = ω d , one can engineer an effective interaction Hamiltonian of the form H Toffoli = (g cd ĉ2 d † + g * cd ĉ †2 d) + (g abd âb d † + g * abd â † b † d) + (g ad â d † + g * ad â † d) + (g bd b d † + g * bd b † d) + ( d d † + * d d).Once again, all these effective terms are achieved in a parametric manner and using the 4-wave mixing property of the Josephson junction.The amplitude and phase of each interaction term can be modulated by the amplitude and phase of the associated pump.After the adiabatic elimination of the dump mode, we achieve a dissipation operatorκ 2ph D[ĉ 2 + c ab âb + c a â + c b b + c],where κ 2ph is given by 4g 2 cd /κ d , and the complex constants c ab = g abd /g cd , c a = g ad /g cd , c b = g bd /g cd , c = d /g cd .By varying the amplitudes and phases of the pumps in time, we obtain time-varying constants c ab (tThis implements a bias preserving Toffoli gate between the cat qubits encoded in the three modes â, b and ĉ. a − ω d ) amplitude and phase and one can turn off such a coupling simply by turning off the pump.One can additionally, consider a resonant drive at frequency ω d , modeled by the Hamiltonian H d = * d d, ρ]+κ d D[ d]ρ.In this master equation, the dump mode d mediates a

TABLE II .
Dissipation operators and Hamiltonians required for universal and fault-tolerant quantum computation with cat qubits.The mandatory Hamiltonians and dissipators are required to achieve bias-preserving operations at the level of cat qubits which, embedded in a repetition code, lead to a universal set of fault-tolerant logical gates.The optional Hamiltonians reduce the phase-flip error rate induced by the nonadiabatic effects of the bias-preserving operations.Such an improvement can lead to drastic reduction of the number of the required cat qubits in a repetition code, in order to reach a certain desired error level.While some of the operations in the table have already been implemented in experiments with superconducting circuits, all the other ones should be simple modifications or extensions of the current experiments.