Quantum computers often manipulate physical qubits encoded on two-level quantum systems. Bosonic qubit codes depart from this idea by encoding information in a well-chosen subspace of an infinite-dimensional Fock space. This larger physical space provides a natural protection against experimental imperfections and allows bosonic codes to circumvent no-go results that apply to states constrained by a 2-dimensional Hilbert space. A bosonic qubit is usually defined in a single bosonic mode but it makes sense to look for multimode versions that could exhibit better performance.In this work, building on the observation that the cat code lives in the span of coherent states indexed by a finite subgroup of the complex numbers, we consider a two-mode generalisation living in the span of 24 coherent states indexed by the binary tetrahedral group 2 T of the quaternions. The resulting 2 T -qutrit naturally inherits the algebraic properties of the group 2 T and appears to be quite robust in the low-loss regime. We initiate its study and identify stabilisers as well as some logical operators for this bosonic code.
Quantum computers often manipulate physical qubits encoded on two-level quantum systems. Bosonic qubit codes depart from this idea by encoding information in a well-chosen subspace of an infinite-dimensional Fock space. This larger physical space provides a natural protection against experimental imperfections and allows bosonic codes to circumvent no-go results that apply to states constrained by a 2-dimensional Hilbert space. A bosonic qubit is usually defined in a single bosonic mode but it makes sense to look for multimode versions that could exhibit better performance.In this work, building on the observation that the cat code lives in the span of coherent states indexed by a finite subgroup of the complex numbers, we consider a two-mode generalisation living in the span of 24 coherent states indexed by the binary tetrahedral group 2 T of the quaternions. The resulting 2 T -qutrit naturally inherits the algebraic properties of the group 2 T and appears to be quite robust in the low-loss regime. We initiate its study and identify stabilisers as well as some logical operators for this bosonic code.
Bosonic codes offer a promising approach towards hardware-efficient fault tolerance, with many leading examples such as the cat-code and the GKP code organized by an underlying symmetry. We build on a representation-theoretic framework of quantum error correction to formalize the construction and analysis of multimode symmetric bosonic codes, focusing on finite groups. Here, a physical, logical representation and an initial seed state together define the codewords via a covariant encoding. A central observation is that QEC matrices can be viewed as morphisms of group representations, so that Schur's lemma forces entire irreducible representations blocks to vanish. We recover several known single- and two-mode bosonic codes and build and analyze the error protection capabilities of three codes based on finite subgroups of SU(2). We analyze the impact of reducibility of the logical representation and optimize the seed state using the near-optimal fidelity.
While 2-level systems, aka qubits, are a natural choice to perform a logical quantum computation, the situation is less clear at the physical level. Encoding information in higher-dimensional physical systems can indeed provide a first level of redundancy and error correction that simplifies the overall fault-tolerant architecture. A challenge then is to ensure universal control over the encoded qubits. Here, we explore an approach where information is encoded in an irreducible representation of a finite subgroup of U ( 2 ) through an inverse quantum Fourier transform. We illustrate this idea by applying it to the real Pauli group ⟨ X , Z ⟩ in the bosonic setting. The resulting two-mode Fourier cat code displays good error correction properties and admits an experimentally-friendly universal gate set that we discuss in detail.
Bosonic codes offer a promising approach towards hardware-efficient fault tolerance, with many leading examples such as the cat-code and the GKP code organized by an underlying symmetry. We build on a representation-theoretic framework of quantum error correction to formalize the construction and analysis of multimode symmetric bosonic codes, focusing on finite groups. Here, a physical, logical representation and an initial seed state together define the codewords via a covariant encoding. A central observation is that QEC matrices can be viewed as morphisms of group representations, so that Schur's lemma forces entire irreducible representations blocks to vanish. We recover several known single- and two-mode bosonic codes and build and analyze the error protection capabilities of three codes based on finite subgroups of SU(2). We analyze the impact of reducibility of the logical representation and optimize the seed state using the near-optimal fidelity. Source: http://arxiv.org/abs/2 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
We introduce a chiral Schrödinger cat qubit, a bosonic quantum code generalizing Kerr cat qubits that exploits higher-order nonlinearities. Compared to standard Kerr cats, the chiral cat qubit allows additional correction of bit-flip errors within the Hilbert space of a single bosonic oscillator. This property results from optical bistability, i.e., the simultaneous presence of multiple long-lived states. Two of them define the code logical basis and two define an error manifold. Thanks to the chiral structure of the phase space of this system, the error manifold can be engineered to “capture” bit-flip events in the code space (a bit-flip trap), without affecting the quantum information stored in the system. Therefore, it is possible to perform detection and correction of errors. We demonstrate how this topological effect can be particularly efficient in the presence of large dephasing. We provide concrete examples of the performance of the code and show the possibility of applying quantum operations rapidly and efficiently. Beyond the interest in this single technological application, our work demonstrates how the topology of phase space can enhance the performance of bosonic codes.
Abstract We introduce a driven-dissipative two-mode bosonic system whose reservoir causes simultaneous loss of two photons in each mode and whose steady states are superpositions of pair-coherent/Barut-Girardello coherent states. We show how quantum information encoded in a steady-state subspace of this system is exponentially immune to phase drifts (cavity dephasing) in both modes. Additionally, it is possible to protect information from arbitrary photon loss in either (but not simultaneously both) of the modes by continuously monitoring the difference between the expected photon numbers of the logical states. Despite employing more resources, the two-mode scheme enjoys two advantages over its one-mode cat-qubit counterpart with regards to implementation using current circuit QED technology. First, monitoring the photon number difference can be done without turning off the currently implementable dissipative stabilizing process. Second, a lower average photon number per mode is required to enjoy a level of protection at least as good as that of the cat-codes. We discuss circuit QED proposals to stabilize the code states, perform gates, and protect against photon loss via either active syndrome measurement or an autonomous procedure. We introduce quasiprobability distributions allowing us to represent two-mode states of fixed photon number difference in a two-dimensional complex plane, instead of the full four-dimensional two-mode phase space. The two-mode codes are generalized to multiple modes in an extension of the stabilizer formalism to non-diagonalizable stabilizers. The M -mode codes can protect against either arbitrary photon losses in up to M − 1 modes or arbitrary losses and gains in any one mode.
The central question that this project tries to address is the following: Dominance of binary logic in classical computing emerged from deep physical and engineering constraints. I ask if similar constraints force quantum computing toward qubits, or whether today's qubit dominance is merely historical and a temporary technological contingency? Quantum computing today appears to be converging on an architectural choice that reminds us of the trajectory of classical computing: the qubit. Nearly all commercial quantum computing platforms — including those developed by IBM, Google, and Amazon — are built around controllable two-level quantum systems. Superconducting circuits, trapped ions, and photonic encodings are engineered so that a two-dimensional Hilbert space functions as the computational unit. Yet quantum theory does not privilege two-level systems. This contrast between what current devices use and what the theory allows motivates a closer look at the higher-dimensional structures already present in quantum mechanics. The mathematical structure of quantum mechanics naturally accommodates arbitrary-dimensional Hilbert spaces. Atoms possess multiple accessible energy levels. Photons carry orbital angular momentum in high-dimensional spaces. Ions and superconducting circuits inherently support more than two levels. In laboratory settings, three-level systems (qutrits) and higher-dimensional qudits have already been implemented and studied with notable success, and I take these results as evidence that the restriction to qubits is a contingent design preference rather than a theoretical necessity. The working hypothesis guiding this project has been that very little appears to transfer from the classical case. Quantum information theory, noise mechanisms, and error correction principles differ fundamentally from their classical counterparts, I focus on how qudits exploit these differences.Therefore, it's possible that dominance of qubits today may reflect temporary engineering convenience and early platform momentum rather than theoretical inevitability.