Fault-tolerant preparation of arbitrary logical states in the cat code

1. Problem Statement

High-fidelity preparation of logical quantum states is a fundamental bottleneck in fault-tolerant quantum computing (FTQC).

• The Dilemma: Existing methods struggle to balance control complexity with resource overhead.
  • Quantum Optimal Control (e.g., GRAPE): Effective for small systems but suffers from intractable optimization complexity as system size grows.
  • State Distillation: Scalable but resource-intensive and typically restricted to specific states (e.g., T-states), lacking flexibility for arbitrary state preparation.
  • Flag-Qubit Protocols: Reduce hardware resources but impose strict connectivity constraints difficult to meet in current architectures.
• The Gap: While bosonic error correction (specifically the cat code) has enabled error-transparent and error-detectable gates, a complete framework for preparing arbitrary logical states with all dominant errors suppressed (including spontaneous decay and dephasing) has not yet been realized.

2. Methodology

The authors propose a complete fault-tolerant (FT) framework for preparing arbitrary logical states encoded in the four-legged cat code using error-detectable operations and post-selection.

System Platform

• Hardware: 3D superconducting circuit QED platform.
• Components: High-quality microwave cavities (bosonic modes) dispersively coupled to three-level ancilla qubits ($|g\rangle, |e\rangle, |f\rangle$).
• Encoding: The logical qubit is encoded in the four-legged cat code:
  $$|0_L\rangle, |1_L\rangle \propto |\alpha\rangle \pm |-\alpha\rangle \pm |i\alpha\rangle \pm |-i\alpha\rangle$$
  This encoding protects against single-photon loss via parity measurements.

Core Protocol: Error-Detectable Operations

The protocol engineers interactions to map dominant hardware errors (photon loss, dephasing, ancilla relaxation) to a detectable state of the ancilla ($|e\rangle$ or $|f\rangle$). By post-selecting on specific measurement outcomes, errors are filtered out, suppressing the logical error rate from linear ($O(p)$) to quadratic ($O(p^2)$) or higher.

Key Components of the Universal Gate Set:

1. Parity Measurement ($M_P$): Uses dispersive coupling to project the bosonic mode into even or odd parity subspaces. It is naturally error-detectable.
2. Error-Detectable Pauli-$X_c$ Measurement ($M_X$):
   • Challenge: Standard cat code operations preserve photon number, inhibiting rotations that move population between different parity sectors (e.g., $n \equiv 0 \pmod 4$ to $n \equiv 2 \pmod 4$).
   • Solution: A new coherent state discrimination protocol ($M_{|\beta\rangle}$) is proposed. It involves:
     1. Displacement to the origin ($D(-\beta)$).
     2. Photon-number selective ancilla flip (mapping $|0\rangle$ and $|1\rangle$ to ancilla state $|f\rangle$).
     3. Reverse displacement.
   • Outcome: If the ancilla measures $|f\rangle$, the state is confirmed; if $|e\rangle$, an error occurred (discard); if $|g\rangle$, the result is inconclusive (retry).
3. Universal Gate Set: The authors construct a complete set of error-detectable operations: $\{M_P, Z_c(\theta), ZZ_c(\theta), M_X, H_c\}$.
   • The Hadamard gate ($H_c$) is realized via teleportation using an ancillary $|+_L\rangle$ state prepared via $M_P$.
   • Pauli corrections are handled virtually via frame tracking to avoid feedback latency.

3. Key Contributions

• First FT Framework for Arbitrary States: Establishes a protocol to prepare any arbitrary logical state in the cat code, not just specific basis states or magic states.
• Novel Error-Detectable Discrimination: Introduces a method to perform unambiguous quantum state discrimination of coherent state components ($|\pm \alpha\rangle, |\pm i\alpha\rangle$) that is robust against dominant hardware errors.
• Resource Efficiency: The protocol avoids complex Hamiltonian engineering or engineered dissipation. It relies on post-selection, where failed preparations are simply discarded, making the approach highly resource-efficient compared to distillation.
• Scalability: The scheme is compatible with current 3D cavity hardware and can be extended to multiple bosonic modes for joint measurements (e.g., $M_{XX}$).

4. Results

Numerical simulations were performed using realistic experimental parameters from a 3D superconducting cavity platform (based on recent experimental demonstrations).

• Logical Infidelity:
  • The protocol achieves logical infidelities on the order of $10^{-4}$ (specifically $2.74 \times 10^{-4}$ for a two-qubit entangled state).
  • Success probability remains high (>95% for optimal parameters).
• Error Suppression Scaling:
  • A scaling analysis was conducted by varying the physical error rate ($s$).
  • Result: The logical infidelity scales as $f_L \propto s^{2.12}$.
  • Significance: The exponent $>1$ confirms that first-order errors are fully suppressed. In contrast, traditional control methods (without error detection) showed linear scaling ($f_L \propto s^{0.96}$).
• Arbitrary State Robustness:
  • The protocol successfully prepared a continuous family of two-qubit logical states $|\psi_L(\theta, \phi)\rangle$.
  • Infidelity remained stable ($\approx 5.0 \times 10^{-4}$) regardless of the target state parameters ($\theta, \phi$), demonstrating robustness against circuit depth variations.

5. Significance

• Foundation for Magic State Injection: High-fidelity preparation of arbitrary logical states is a prerequisite for "magic state distillation," which enables universal gate sets in fault-tolerant quantum computing. This protocol significantly reduces the resource overhead (potentially up to 90% in some proposals) associated with state preparation.
• Hardware Compatibility: The method works with current 3D cavity QED technology without requiring new hardware architectures or complex dissipation engineering.
• Path to Concatenated Codes: By providing a reliable "gadget" for preparing arbitrary states with suppressed first-order errors, this work lays the groundwork for higher-level concatenated quantum error correction schemes, moving the field closer to scalable, fault-tolerant quantum computation.