Squeezed-vacuum bosonic codes
- URL: http://arxiv.org/abs/2511.06108v1
- Date: Sat, 08 Nov 2025 19:21:00 GMT
- Title: Squeezed-vacuum bosonic codes
- Authors: Nir Gutman, Eliya Blumenthal, Shay Hacohen-Gourgy, Ariel Orda, Ido Kaminer,
- Abstract summary: We introduce a family of bosonic quantum error-correcting codes built as a rotation-symmetric superposition of squeezed vacuum states.<n>The robustness of these "squeezed-vacuum codes" arises from being arranged at evenly spaced angles in phase-space.
- Score: 2.9142589137065507
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We introduce a family of bosonic quantum error-correcting codes built as a rotation-symmetric superposition of squeezed vacuum states, which promise protection against both loss and dephasing noise channels. The robustness of these "squeezed-vacuum codes" arises from being arranged at evenly spaced angles in phase-space, and simultaneously in evenly spaced photon-number support $n \equiv {2k} \! \pmod {2m}$. We present simple preparation circuits: a two-legged code using a Hadamard-conditional-squeezing-Hadamard sequence on an ancilla qubit, and for general "$m$-legged" codewords using sequences of conditional rotations. The performance of these codes is evaluated against loss and dephasing noises using the Knill-Laflamme violation function and benchmarked against cat codes. As the number $m$ of squeezed-vacuum states in a code increases, the code exhibits improved loss tolerance at the cost of higher dephasing sensitivity. We outline implementations in circuit QED and trapped-ion platforms, where high-fidelity Gaussian operations and conditional controls are available or under active development. These results help establish squeezed-vacuum codes as practical, hardware-ready, members of the bosonic codes class.
Related papers
- Towards self-correcting quantum codes for neutral atom arrays [2.1874189959020427]
"ZSZ codes" are low-overhead quantum error-correcting codes based on the group $mathbbZ_ell rtimes mathbbZ_m$.<n>We benchmark the performance of this code family under local "self-correcting" decoders.<n>These results suggest that ZSZ codes are promising candidates for scalable self-correcting quantum memories.
arXiv Detail & Related papers (2025-07-29T00:08:26Z) - Abelian multi-cycle codes for single-shot error correction [0.013727765507558195]
We construct a family of quantum low-density parity-check codes locally equivalent to higher-dimensional quantum hypergraph-product (QHP) codes.<n>The proposed codes have highly redundant sets of low-weight stabilizer generators, which improves decoding accuracy in a fault-tolerant regime.<n>We derive simple expressions for the dimension of the proposed codes in two important special cases, give bounds on the distances, and explicitly construct some relatively short codes.
arXiv Detail & Related papers (2025-06-20T11:05:32Z) - Romanesco codes: Bias-tailored qLDPC codes from fractal codes [0.0]
We introduce and analyze a family of Clifford-deformed bicycle codes that are tailored for biased noise.<n>Our qLDPC codes are defined on a bipartite hexagonal lattice with limited-range gates and low-weight stabilizers.<n>We find small examples with high encoding rate that perform well for a large range of bias.
arXiv Detail & Related papers (2025-05-30T18:06:24Z) - Existence and Characterisation of Bivariate Bicycle Codes [0.0]
We show that BB codes provide compact quantum memory with low overhead and enhanced error correcting capabilities.<n>We explore these codes by leveraging their ring structure and predict their dimension as well as conditions on their existence.
arXiv Detail & Related papers (2025-02-24T11:04:15Z) - Threshold Selection for Iterative Decoding of $(v,w)$-regular Binary Codes [84.0257274213152]
Iterative bit flipping decoders are an efficient choice for sparse $(v,w)$-regular codes.<n>We propose concrete criteria for threshold determination, backed by a closed form model.
arXiv Detail & Related papers (2025-01-23T17:38:22Z) - Estimating the Decoding Failure Rate of Binary Regular Codes Using Iterative Decoding [84.0257274213152]
We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder.<n>We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
arXiv Detail & Related papers (2024-01-30T11:40:24Z) - Neural Belief Propagation Decoding of Quantum LDPC Codes Using
Overcomplete Check Matrices [60.02503434201552]
We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix.
This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
arXiv Detail & Related papers (2022-12-20T13:41:27Z) - Tailored XZZX codes for biased noise [60.12487959001671]
We study a family of codes having XZZX-type stabilizer generators.
We show that these XZZX codes are highly qubit efficient if tailored to biased noise.
arXiv Detail & Related papers (2022-03-30T17:26:31Z) - 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) - Avoiding coherent errors with rotated concatenated stabilizer codes [6.85316573653194]
We integrate stabilizer codes with constant-excitation codes by code concatenation.
We analyze this code's potential as a quantum memory.
arXiv Detail & Related papers (2020-10-01T16:39:21Z)
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.