[PDF] Fault-Tolerant Quantum Computation Using Large Spin-Cat Codes | Semantic Scholar (2024)

[PDF] Semantic Reader

By following a scheme for concatenated error correction, it is shown that the availability of bias-preserving CX gates with moderately sized cats improves a rigorous lower bound on the fault-tolerant threshold by a factor of two and decreases the overhead in logical Clifford operations by a factors of five.

The question of fault tolerance (FT) for a measurement-free variant of the Steane code that leverages multi-qubit gates and redundant syndrome extraction is revisited, finding previously overlooked phase-flip errors that undermine FT.

A fault-tolerant, universal set of single- and two-qubits quantum gates is demonstrated between two instances of the seven-qubit colour code in a trapped-ion quantum computer and observes the hallmark feature of fault tolerance—a superior performance compared with a non-fault-tolerance implementation.

The results open a path for realizing hardware-efficient, fault-tolerant error syndrome extraction by using a bosonic-cat ancilla in a parametrically driven nonlinear cavity and illustrating the syndrome extraction process in a variety of codes.

A qubit encoding and gate protocol for 171Yb neutral atom qubits that converts the dominant physical errors into erasures, that is, errors in known locations, which should benefit any error correcting code.

This work identifies a new type of structured noise motivated by neutral atom qubits, biased erasure errors, which arises when qubit errors are dominated by detectable leakage from only one of the computational states of the qubit.

A 1D repetition code based on the so-called cat qubits as a viable approach toward hardware-efficient universal and fault-tolerant quantum computation, and builds a universal set of fully protected logical gates that avoids the costly magic state preparation, distillation, and injection.

This paper shows how to perform fault tolerant quantum computation when the error probability, q, is smaller than some constant threshold, q.. the cost is polylogarithmic in time and space, and no measurements are used during the quantum computation.

...

...