Related papers: Gottesman-Kitaev-Preskill codes: A lattice perspec…
To implement fault-tolerant quantum computation with continuous variables, Gottesman-Kitaev-Preskill (GKP) qubits have been recognized as an important technological element. However, the analog outcome of GKP qubits, which includes…
We introduce tile codes, a simple yet powerful way of constructing quantum codes that are local on a planar 2D-lattice. Tile codes generalize the usual surface code by allowing for a bit more flexibility in terms of locality and stabilizer…
Fault-tolerant quantum computation (FTQC) is expected to address a wide range of computational problems. To realize large-scale FTQC, it is essential to encode logical qubits using quantum error-correcting codes. High-rate concatenated…
We study two-dimensional translation-invariant CSS stabilizer codes over prime-dimensional qudits on the square lattice under twisted boundary conditions, generalizing the Kitaev $\mathbb{Z}_p$ toric code by augmenting each stabilizer with…
Due to their fast decoding algorithms, quantum generalizations of low-density parity check, or LDPC, codes have been investigated as a solution to the problem of decoherence in fragile quantum states. However, the additional twisted inner…
We address the challenge of crosstalk in quantum multiplexing -an obstacle to scaling throughput in quantum communication networks. Crosstalk arises when physically coupled quantum modes interfere, degrading signal fidelity. We propose a…
Continuous-variable cluster states (CVCSs) can be supplemented with Gottesman-Kitaev-Preskill (GKP) states to form a hybrid cluster state with the power to execute universal, fault-tolerant quantum computing in a measurement-based fashion.…
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…
Concatenated bosonic-stabilizer codes have recently gained prominence as promising candidates for achieving low-overhead fault-tolerant quantum computing in the long term. In such systems, analog information obtained from the syndrome…
Gottesman-Kitaev-Preskill (GKP) qubit is a promising ingredient for fault-tolerant quantum computation (FTQC) in optical continuous variables due to its advantage of noise tolerance and scalability. However, one of the main problems in the…
Topologically-ordered phases are stable to local perturbations, and topological quantum error-correcting codes enjoy thresholds to local errors. We connect the two notions of stability by constructing classical statistical mechanics models…
The stabilizer code is the most general algebraic construction of quantum error-correcting codes proposed so far. A stabilizer code can be constructed from a self-orthogonal subspace of a symplectic space over a finite field. We propose a…
Concatenating quantum error correction codes scales error correction capability by driving logical error rates down double-exponentially across levels. However, the noise structure shifts under concatenation, making it hard to choose an…
Continuous variable measurement-based quantum computation on cluster states has in recent years shown great potential for scalable, universal, and fault-tolerant quantum computation when combined with the Gottesman-Kitaev-Preskill (GKP)…
This is a comprehensive review on fault-tolerant topological quantum computation with the surface codes. The basic concepts and useful tools underlying fault-tolerant quantum computation, such as universal quantum computation, stabilizer…
We establish the connection between a recent new construction technique for quantum error correcting codes, based on graphs, and the so-called stabilizer codes: Each stabilizer code can be realized as a graph code and vice versa.
Scaling quantum computing to practical applications necessitates reliable quantum error correction. Although numerous correction codes have been proposed, the overall correction efficiency critically limited by the decode algorithms. We…
The large-scale execution of quantum algorithms requires basic quantum operations to be implemented fault-tolerantly. The most popular technique for accomplishing this, using the devices that can be realised in the near term, uses…
Generalized bicycle (GB) codes have emerged as a promising class of quantum error-correcting codes with practical decoding capabilities. While numerous asymptotically good quantum codes and quantum low-density parity-check code…
Bosonic codes allow the encoding of a logical qubit in a single component device, utilizing the infinitely large Hilbert space of a harmonic oscillator. In particular, the Gottesman-Kitaev-Preskill code has recently been demonstrated to be…