Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1709.05302 · Physical Review A

Hardware-efficient bosonic quantum error-correcting codes based on symmetry operators

Murphy Yuezhen Niu, Isaac L. Chuang, Jeffrey H. Shapiro

Published Mar 27, 2018• 39 citations
arXivHTMLPDF

Abstract

A family of bosonic quantum error-correcting codes is introduced to boost the reliability of quantum computation schemes against photon loss. These codes, which are based on symmetry properties of three-wave-mixing interactions, are hardware efficient for architectures involving microwave photons stored in superconducting resonators.
DOI
10.1103/physreva.97.032323

Related papers

Hardware-efficient quantum computation and error correction in bosonic systems

Murphy Yuezhen Niu

Quantum computing has the potential to eclipse its classical competitors, but only if the number of high-quality qubits can be scaled up. Large-scale quantum systems are impeded by the formidable hardware resources needed to combat growing amounts of errors from hardware imperfections. Previous efforts have mainly focused on either optimizing quantum hardware or finding new quantum algorithms. This thesis explores synergies between the system-specific hardware physics and algorithm design that together yield more than the sum of their parts in the quest for scalable quantum computation in bosonic systems. We present an algorithm for generating nonclassical states of light, using full-quantum X( 2 ) nonlinearities, that transcends previous limits on conversion efficiency. We show that such nonlinearities-which enable highly efficient three-wave mixing between quantized signal, idler, and pump fields-can be employed in two systematic frameworks for quantum computing. The first, which utilizes X(2) interactions' fundamental symmetries and recognizes that photon-loss is their dominant source of errors, provides a set of hardware-efficient quantum error-correction codes and their associated encoded universal gates. One of our codes achieves a constant rate of protected photons, a necessity for robust large-scale quantum computation. The second framework provides hardware-efficient universal quantum control facilitating plug-and-play application of machine learning algorithms. It takes constraints on the hardware resources and control-error models as inputs, and returns robust control pulse shapes for high-fidelity quantum gate execution. The transformative performance gains obtained from this hardware-efficient approach offer potential for scalable quantum computation using available quantum devices.

•Jan 1, 2019•0 citations

Hardware-Efficient Bosonic Quantum Computing with Photon-loss Detection Capability

Yuichiro Mori, Yuichiro Matsuzaki, Suguru Endo +1 more

Bosonic quantum systems offer the hardware-efficient construction of error detection/error correction codes by using the infinitely large Hilbert space. However, due to the encoding, arbitrary gate rotations usually require magic state teleportation or complicated optimized pulse sequences involving an ancilla qubit. Here, we propose a simple and hardware-efficient bosonic 02 error detection code that allows for the implementation of arbitrary X and Z rotations and a controlled phase gate by using a Kerr nonlinear resonator. Our code can detect a single photon loss, and we observe significant error suppression by simulating the frequently used hardware-efficient ansatz quantum circuit in near-term quantum computing.

arXiv:2403.00291•Mar 1, 2024•2 citations

Hardware-Efficient Fault Tolerant Quantum Computing with Bosonic Grid States in Superconducting Circuits

Marc-Antoine Lemonde, Dany Lachance-Quirion, Guillaume Duclos-Cianci +5 more

Quantum computing holds the promise of solving classically intractable problems. Enabling this requires scalable and hardware-efficient quantum processors with vanishing error rates. This perspective manuscript describes how bosonic codes, particularly grid state encodings, offer a pathway to scalable fault-tolerant quantum computing in superconducting circuits. By leveraging the large Hilbert space of bosonic modes, quantum error correction can operate at the single physical unit level, therefore reducing drastically the hardware requirements to bring fault-tolerant quantum computing to scale. Going beyond the well-known Gottesman-Kitaev-Preskill (GKP) code, we discuss how using multiple bosonic modes to encode a single qubit offers increased protection against control errors and enhances its overall error-correcting capabilities. Given recent successful demonstrations of critical components of this architecture, we argue that it offers the shortest path to achieving fault tolerance in gate-based quantum computing processors with a MHz logical clock rate.

arXiv:2409.05813•Sep 9, 2024•13 citations

Fault-Tolerant Quantum Computation by Hybrid Qubits with Bosonic Cat Code and Single Photons

Jaehak Lee, Nuri Kang, Seok-Hyung Lee +3 more

Hybridizing different degrees of freedom or physical platforms potentially offers various advantages in building scalable quantum architectures. Here, we introduce a fault-tolerant hybrid quantum computation by building on the advantages of both discrete-variable (DV) and continuous-variable (CV) systems. In particular, we define a CV-DV hybrid qubit with a bosonic cat code and a single photon, which is implementable in current photonic platforms. Due to the cat code encoded in the CV part, the predominant loss errors are readily correctable without multiqubit encoding, while the logical basis is inherently orthogonal due to the DV part. We design fault-tolerant architectures by concatenating hybrid qubits and an outer DV quantum error-correction code such as a topological code, exploring their potential merit in developing scalable quantum computation. We demonstrate by numerical simulations that our scheme is at least an order of magnitude more resource efficient compared to all previous proposals in photonic platforms, allowing us to achieve a record-high loss threshold among existing CV and hybrid approaches. We discuss the realization of our approach not only in all-photonic platforms but also in other hybrid platforms including superconducting and trapped-ion systems, which allows us to find various efficient routes toward fault-tolerant quantum computing. Published by the American Physical Society 2024

arXiv:2401.00450•PRX Quantum•Aug 2, 2024•29 citations

Towards Practical Quantum Error Correction and Fault Tolerance

J. W. Soule

This thesis will explore quantum error correction from several different perspectives. We will examine both the tasks of how to implement quantum error correcting codes in hardware and how to develop error correcting codes with good properties. Firstly we will examine a specific, hardware-motivated computational scheme in which a class of bosonic code called rotation symmetric bosonic codes is concatenated with a well-known topological error correcting code, the surface code. We study this scheme subject to realistic noisy measurement and noise due to photon loss. We envision realising this scheme with superconducting qubit technology. The overhead in terms of number of qubits and time required for this scheme is significant however, motivating an alternative approach of investigating better error correcting codes. With this is mind, we then examine error correction approach that features condensed matter models at its core with the aim of finding more resource-efficient codes. We begin by studying a method of code construction called fractalization, which we apply to the Raussendorf model. Our novel contribution is to fractalize the code in both space and time and demonstrate the existence, for specific values of the generating parameters, of fracton excitations that are immobile in both space and time. Finally, we further pursue new code constructions by exploring the self-correction properties of classical hyperbolic codes. We study a family of classical hyperbolic codes for which we find numerical evidence consistent with a polynomial energy barrier. This would indicate that they are likely to display self-correcting behaviour. By studying such a simple classical model we not only gain intuition about hyperbolic codes in general, but also suggest that classical hyperbolic codes are likely to be good candidates for the construction of quantum codes via a product construction.

•Jan 1, 2023•0 citations

Quantum Computing With Rotation-Symmetric Bosonic Codes

Arne L. Grimsmo, Joshua Combes, Ben Q. Baragiola

Bosonic rotation codes, introduced here, are a broad class of bosonic error-correcting codes based on phase-space rotation symmetry. We present a universal quantum computing scheme applicable to a subset of this class-number-phase codes-which includes the well-known cat and binomial codes, among many others. The entangling gate in our scheme is code agnostic and can be used to interface different rotation-symmetric encodings. In addition to a universal set of operations, we propose a teleportation-based error-correction scheme that allows recoveries to be tracked entirely in software. Focusing on cat and binomial codes as examples, we compute average gate fidelities for error correction under simultaneous loss and dephasing noise and show numerically that the error-correction scheme is close to optimal for error-free ancillae and ideal measurements. Finally, we present a scheme for fault-tolerant, universal quantum computing based on the concatenation of number-phase codes and Bacon-Shor subsystem codes.

•Nov 2, 2024•133 citations
Quantum computing has the potential to eclipse its classical competitors, but only if the number of high-quality qubits can be scaled up. Large-scale quantum systems are impeded by the formidable hardware resources needed to combat growing amounts of errors from hardware imperfections. Previous efforts have mainly focused on either optimizing quantum hardware or finding new quantum algorithms. This thesis explores synergies between the system-specific hardware physics and algorithm design that together yield more than the sum of their parts in the quest for scalable quantum computation in bosonic systems. We present an algorithm for generating nonclassical states of light, using full-quantum X( 2 ) nonlinearities, that transcends previous limits on conversion efficiency. We show that such nonlinearities-which enable highly efficient three-wave mixing between quantized signal, idler, and pump fields-can be employed in two systematic frameworks for quantum computing. The first, which utilizes X(2) interactions' fundamental symmetries and recognizes that photon-loss is their dominant source of errors, provides a set of hardware-efficient quantum error-correction codes and their associated encoded universal gates. One of our codes achieves a constant rate of protected photons, a necessity for robust large-scale quantum computation. The second framework provides hardware-efficient universal quantum control facilitating plug-and-play application of machine learning algorithms. It takes constraints on the hardware resources and control-error models as inputs, and returns robust control pulse shapes for high-fidelity quantum gate execution. The transformative performance gains obtained from this hardware-efficient approach offer potential for scalable quantum computation using available quantum devices.
Bosonic quantum systems offer the hardware-efficient construction of error detection/error correction codes by using the infinitely large Hilbert space. However, due to the encoding, arbitrary gate rotations usually require magic state teleportation or complicated optimized pulse sequences involving an ancilla qubit. Here, we propose a simple and hardware-efficient bosonic 02 error detection code that allows for the implementation of arbitrary X and Z rotations and a controlled phase gate by using a Kerr nonlinear resonator. Our code can detect a single photon loss, and we observe significant error suppression by simulating the frequently used hardware-efficient ansatz quantum circuit in near-term quantum computing.
Quantum computing holds the promise of solving classically intractable problems. Enabling this requires scalable and hardware-efficient quantum processors with vanishing error rates. This perspective manuscript describes how bosonic codes, particularly grid state encodings, offer a pathway to scalable fault-tolerant quantum computing in superconducting circuits. By leveraging the large Hilbert space of bosonic modes, quantum error correction can operate at the single physical unit level, therefore reducing drastically the hardware requirements to bring fault-tolerant quantum computing to scale. Going beyond the well-known Gottesman-Kitaev-Preskill (GKP) code, we discuss how using multiple bosonic modes to encode a single qubit offers increased protection against control errors and enhances its overall error-correcting capabilities. Given recent successful demonstrations of critical components of this architecture, we argue that it offers the shortest path to achieving fault tolerance in gate-based quantum computing processors with a MHz logical clock rate.
Hybridizing different degrees of freedom or physical platforms potentially offers various advantages in building scalable quantum architectures. Here, we introduce a fault-tolerant hybrid quantum computation by building on the advantages of both discrete-variable (DV) and continuous-variable (CV) systems. In particular, we define a CV-DV hybrid qubit with a bosonic cat code and a single photon, which is implementable in current photonic platforms. Due to the cat code encoded in the CV part, the predominant loss errors are readily correctable without multiqubit encoding, while the logical basis is inherently orthogonal due to the DV part. We design fault-tolerant architectures by concatenating hybrid qubits and an outer DV quantum error-correction code such as a topological code, exploring their potential merit in developing scalable quantum computation. We demonstrate by numerical simulations that our scheme is at least an order of magnitude more resource efficient compared to all previous proposals in photonic platforms, allowing us to achieve a record-high loss threshold among existing CV and hybrid approaches. We discuss the realization of our approach not only in all-photonic platforms but also in other hybrid platforms including superconducting and trapped-ion systems, which allows us to find various efficient routes toward fault-tolerant quantum computing. Published by the American Physical Society 2024
This thesis will explore quantum error correction from several different perspectives. We will examine both the tasks of how to implement quantum error correcting codes in hardware and how to develop error correcting codes with good properties. Firstly we will examine a specific, hardware-motivated computational scheme in which a class of bosonic code called rotation symmetric bosonic codes is concatenated with a well-known topological error correcting code, the surface code. We study this scheme subject to realistic noisy measurement and noise due to photon loss. We envision realising this scheme with superconducting qubit technology. The overhead in terms of number of qubits and time required for this scheme is significant however, motivating an alternative approach of investigating better error correcting codes. With this is mind, we then examine error correction approach that features condensed matter models at its core with the aim of finding more resource-efficient codes. We begin by studying a method of code construction called fractalization, which we apply to the Raussendorf model. Our novel contribution is to fractalize the code in both space and time and demonstrate the existence, for specific values of the generating parameters, of fracton excitations that are immobile in both space and time. Finally, we further pursue new code constructions by exploring the self-correction properties of classical hyperbolic codes. We study a family of classical hyperbolic codes for which we find numerical evidence consistent with a polynomial energy barrier. This would indicate that they are likely to display self-correcting behaviour. By studying such a simple classical model we not only gain intuition about hyperbolic codes in general, but also suggest that classical hyperbolic codes are likely to be good candidates for the construction of quantum codes via a product construction.
Bosonic rotation codes, introduced here, are a broad class of bosonic error-correcting codes based on phase-space rotation symmetry. We present a universal quantum computing scheme applicable to a subset of this class-number-phase codes-which includes the well-known cat and binomial codes, among many others. The entangling gate in our scheme is code agnostic and can be used to interface different rotation-symmetric encodings. In addition to a universal set of operations, we propose a teleportation-based error-correction scheme that allows recoveries to be tracked entirely in software. Focusing on cat and binomial codes as examples, we compute average gate fidelities for error correction under simultaneous loss and dephasing noise and show numerically that the error-correction scheme is close to optimal for error-free ancillae and ideal measurements. Finally, we present a scheme for fault-tolerant, universal quantum computing based on the concatenation of number-phase codes and Bacon-Shor subsystem codes.