Logical channel for heralded and pure loss with the Gottesman-Kitaev-Preskill code
- URL: http://arxiv.org/abs/2504.13497v2
- Date: Wed, 23 Apr 2025 06:26:26 GMT
- Title: Logical channel for heralded and pure loss with the Gottesman-Kitaev-Preskill code
- Authors: Tom B. Harris, Takaya Matsuura, Ben Q. Baragiola, Nicolas C. Menicucci,
- Abstract summary: Even low levels of loss can generate uncorrectable errors that anotherd code must handle.<n>In this work, we characterize these errors by deriving analytic expressions for a logical channel.<n>Unlike random displacement noise, we find that the loss-induced logical channel is not a Pauli channel.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Photon loss is the dominant source of noise in optical quantum systems. The Gottesman-Kitaev-Preskill (GKP) bosonic code provides significant protection; however, even low levels of loss can generate uncorrectable errors that another concatenated code must handle. In this work, we characterize these errors by deriving analytic expressions for the logical channel that arises from pure loss acting on approximate GKP qubits. Unlike random displacement noise, we find that the loss-induced logical channel is not a stochastic Pauli channel. We also provide analytic expressions for the logical channel for "heralded loss," when the light scattered out of the signal mode is measured either by photon number counting -- i.e., photon subtraction -- or heterodyne detection. These offer a pathway to intentionally inducing non-Pauli channels for, e.g., magic-state production.
Related papers
- Logical channels in approximate Gottesman-Kitaev-Preskill error correction [0.0]
The GKP encoding is a top contender among bosonic codes for fault-tolerant quantum computation.<n>We analyze a variant of the GKP stabilizer measurement circuit using damped, approximate GKP states.<n>We show that SB decoding is suboptimal for finite-energy GKP states.
arXiv Detail & Related papers (2025-04-18T00:13:42Z) - Performance and achievable rates of the Gottesman-Kitaev-Preskill code for pure-loss and amplification channels [2.955647071443854]
We analytically obtain the near-optimal performance of any Gottesman-Kitaev-Preskill code under pure loss and pure amplification.<n>Our results establish GKP code as the first structured bosonic code family that achieves the capacity of loss and amplification.
arXiv Detail & Related papers (2024-12-09T18:03:31Z) - Improving Continuous-variable Quantum Channels with Unitary Averaging [37.69303106863453]
We present a scheme of passive linear optical unitary averaging for protecting unknown Gaussian states transmitted through an optical channel.
The scheme reduces the effect of phase noise on purity, squeezing and entanglement, thereby enhancing the channel via a probabilistic error correcting protocol.
arXiv Detail & Related papers (2023-11-17T10:10:19Z) - The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
We introduce a data efficient neural decoder that exploits the symmetries of the problem.
We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
arXiv Detail & Related papers (2023-04-14T19:46:39Z) - Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing.
In this work, we efficiently train novel emphend-to-end deep quantum error decoders.
The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z) - Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
This paper studies the study of fault-tolerant channel coding for quantum channels.
We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario.
We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
arXiv Detail & Related papers (2022-10-06T14:09:16Z) - Denoising Diffusion Error Correction Codes [92.10654749898927]
Recently, neural decoders have demonstrated their advantage over classical decoding techniques.
Recent state-of-the-art neural decoders suffer from high complexity and lack the important iterative scheme characteristic of many legacy decoders.
We propose to employ denoising diffusion models for the soft decoding of linear codes at arbitrary block lengths.
arXiv Detail & Related papers (2022-09-16T11:00:50Z) - Quantum capacity and codes for the bosonic loss-dephasing channel [5.560545784372178]
Bosonic qubits encoded in continuous-variable systems provide a promising alternative to two-level qubits for quantum computation and communication.
A detailed understanding of the combined photon loss and dephasing channel is lacking.
We show that, unlike its constituent parts, the combined loss-dephasing channel is non-degradable.
arXiv Detail & Related papers (2022-04-30T20:44:11Z) - Analysis of loss correction with the Gottesman-Kitaev-Preskill code [0.0]
The Gottesman-Kitaev-Preskill (GKP) code is a promising bosonic quantum error-correcting code.
We show that amplification is not required to perform GKP error correction.
arXiv Detail & Related papers (2021-12-02T17:15:21Z) - Performance of teleportation-based error correction circuits for bosonic
codes with noisy measurements [58.720142291102135]
We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit.
We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
arXiv Detail & Related papers (2021-08-02T16:12:13Z) - Engineering fast bias-preserving gates on stabilized cat qubits [64.20602234702581]
bias-preserving gates can significantly reduce resource overhead for fault-tolerant quantum computing.
In this work, we apply a derivative-based leakage suppression technique to overcome non-adiabatic errors.
arXiv Detail & Related papers (2021-05-28T15:20:21Z) - Hardware-Encoding Grid States in a Non-Reciprocal Superconducting
Circuit [62.997667081978825]
We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code.
We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
arXiv Detail & Related papers (2020-02-18T16:45:09Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.