The performance of random bosonic rotation codes
- URL: http://arxiv.org/abs/2311.16089v2
- Date: Wed, 29 Nov 2023 20:54:26 GMT
- Title: The performance of random bosonic rotation codes
- Authors: Saurabh Totey, Akira Kyle, Steven Liu, Pratik J. Barge, Noah Lordi,
and Joshua Combes
- Abstract summary: Bosonic rotation codes are characterized by a discrete rotation symmetry in their Wigner functions.
We numerically explore their performance against loss and dephasing.
- Score: 2.0231400696052506
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Bosonic error correcting codes utilize the infinite dimensional Hilbert space
of a harmonic oscillator to encode a qubit. Bosonic rotation codes are
characterized by a discrete rotation symmetry in their Wigner functions and
include codes such as the cat and binomial codes.We define two different
notions of random bosonic rotation codes and numerically explore their
performance against loss and dephasing. We find that the best random rotation
codes can outperform cat and binomial codes in a certain parameter regime where
loss is large and dephasing errors are small.
Related papers
- High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory [0.6144680854063939]
We present a new family of quantum low-density parity-check codes, which we call radial codes.
In simulations of circuit-level noise, we observe comparable error suppression to surface codes of similar distance.
Their error correction capabilities, tunable parameters and small size make them promising candidates for implementation on near-term quantum devices.
arXiv Detail & Related papers (2024-06-20T16:08:06Z) - Learning Linear Block Error Correction Codes [62.25533750469467]
We propose for the first time a unified encoder-decoder training of binary linear block codes.
We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
arXiv Detail & Related papers (2024-05-07T06:47:12Z) - Concatenating Binomial Codes with the Planar Code [0.0]
Rotation bosonic codes are attractive encodings for qubits in superconducting qubit experiments.
We investigate concatenating these codes with the planar code in a measurement-based scheme for fault-tolerant quantum computation.
We find that it is necessary to implement adaptive phase measurements, maximum likelihood quantum state inference, and weighted minimum weight decoding to obtain good performance for a planar code using binomial code qubits.
arXiv Detail & Related papers (2023-12-22T02:34:56Z) - Explicit error-correction scheme and code distance for bosonic codes
with rotational symmetry [0.0]
We show that codes with rotation symmetry have a distance of $(d_n, d_theta)=(N, pi/N)$ with respect to number and rotation errors.
We also prove that codes with an $N$-fold rotation symmetry have a distance of $(d_n, d_theta)=(N, pi/N)$ with respect to number and rotation errors.
arXiv Detail & Related papers (2023-11-22T19:48:34Z) - Tailoring quantum error correction to spin qubits [0.0]
State-of-the-art error correction codes require only nearest-neighbour connectivity.
Spin-qubit layout required for each of these error correction codes.
arXiv Detail & Related papers (2023-06-30T16:40:37Z) - 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) - Experimental realization of deterministic and selective photon addition
in a bosonic mode assisted by an ancillary qubit [50.591267188664666]
Bosonic quantum error correcting codes are primarily designed to protect against single-photon loss.
Error correction requires a recovery operation that maps the error states -- which have opposite parity -- back onto the code states.
Here, we realize a collection of photon-number-selective, simultaneous photon addition operations on a bosonic mode.
arXiv Detail & Related papers (2022-12-22T23:32:21Z) - Improved decoding of circuit noise and fragile boundaries of tailored
surface codes [61.411482146110984]
We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes.
Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC.
We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
arXiv Detail & Related papers (2022-03-09T18:48:54Z) - 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) - Cellular automaton decoders for topological quantum codes with noisy
measurements and beyond [68.8204255655161]
We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes.
For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold.
We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
arXiv Detail & Related papers (2020-04-15T18:00:01Z)
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.