Related papers: Good Gottesman-Kitaev-Preskill codes from the NTRU…
We give a short proof that the coherent information is an achievable rate for the transmission of quantum information through a noisy quantum channel. Our method is to produce random codes by performing a unitarily covariant projective…
We propose a new partial decoding algorithm for $h$-interleaved one-point Hermitian codes that can decode-under certain assumptions-an error of relative weight up to $1-(\tfrac{k+g}{n})^{\frac{h}{h+1}}$, where $k$ is the dimension, $n$ the…
Tree codes, introduced by Schulman, are combinatorial structures essential to coding for interactive communication. An infinite family of tree codes with both rate and distance bounded by positive constants is called asymptotically good.…
Robust quantum control is crucial for achieving operations below the quantum error correction threshold. Quantum Signal Processing (QSP) transforms a unitary parameterized by $\theta$ into one governed by a polynomial function $f(\theta)$,…
We analyze an experimentally accessible Lindblad master equation for a quantum harmonic oscillator. It approximately stabilizes finite-energy periodic grid states called Gottesman-Kitaev-Preskill (GKP) states, that can be used to encode and…
A high-rate continuous-variable quantum key distribution (CV-QKD) system based on high-order discrete modulation is experimentally investigated. With the help of the novel system scheme, effective digital signal processing algorithms and…
Twisted generalized Reed-Solomon (TGRS) codes were introduced to extend the algebraic capabilities of classical generalized Reed-Solomon (GRS) codes. This extension holds the potential for constructing new non-GRS maximum distance separable…
Geometrically local quantum codes, which are error correction codes embedded in $\mathbb{R}^D$ with checks acting only on qubits within a fixed spatial distance, have garnered significant interest. Recently, it has been demonstrated how to…
Quantum bits are more robust to noise when they are encoded non-locally. In such an encoding, errors affecting the underlying physical system can then be detected and corrected before they corrupt the encoded information. In 2001,…
Quantum error correction is essential for robust quantum information processing with noisy devices. As bosonic quantum systems play a crucial role in quantum sensing, communication, and computation, it is important to design error…
We quantify decoder dependence in surface-code threshold studies under two matched regimes: Pauli noise and native GKP-style Gaussian displacement digitization. Using LiDMaS+ v1.1.0, we benchmark MWPM, Union-Find (UF), Belief Propagation…
In this work, we use path integral techniques to predict the switching rate in a single-mode bistable open quantum system. While analytical expressions are well-known to be accessible for systems subject to Gaussian noise obeying classical…
The Kitaev honeycomb model is an approximate topological quantum error correcting code in the same phase as the toric code, but requiring only a 2-body Hamiltonian. As a frustrated spin model, it is well outside the commuting models of…
Post-quantum cryptography currently rests on a small number of hardness assumptions, posing significant risks should any one of them be compromised. This vulnerability motivates the search for new and cryptographically versatile assumptions…
In this paper we construct several new families of quantum codes with good and asymptotically good parameters. These new quantum codes are derived from (classical) algebraic geometry (AG) codes by applying the Calderbank-Shor-Steane (CSS)…
Gaussian random field is a ubiquitous model for spatial phenomena in diverse scientific disciplines. Its approximation is often crucial for computational feasibility in simulation, inference, and uncertainty quantification. The…
We develop finite-dimensional versions of the quantum error-correcting codes proposed by Albert, Covey, and Preskill (ACP) for continuous-variable quantum computation on configuration spaces with nonabelian symmetry groups. Our codes can be…
We study the advantages to be gained in quantum key distribution (QKD) protocols by combining the techniques of local randomization, or noisy preprocessing, and structured (nonrandom) block codes. Extending the results of [Smith, Renes, and…
This article defines multi-twisted Goppa (MTG) codes as subfield subcodes of duals of multi-twisted Reed-Solomon (MTRS) codes and examines their properties. We show that if $t$ is the degree of the MTG polynomial defining an MTG code, its…
We show that quantum expander codes, a constant-rate family of quantum LDPC codes, with the quasi-linear time decoding algorithm of Leverrier, Tillich and Z\'emor can correct a constant fraction of random errors with very high probability.…