Related papers: Memory-assisted decoder for approximate Gottesman-…
Efficient and accurate decoding of quantum error-correcting codes is essential for fault-tolerant quantum computation, however, it is challenging due to the degeneracy of errors, the complex code topology, and the large space for logical…
Device error rates on current quantum computers have improved enough to where demonstrations of error correction below break-even are now possible. Still, the circuits required for quantum error correction introduce significant overhead and…
Quantum information platforms made great progress in the control of many-body entanglement and the implementation of quantum error correction, but it remains a challenge to realize both in the same setup. Here, we propose a mixture of two…
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. QECC, as its classical counterpart (ECC), enables the reduction of error rates, by distributing quantum logical information across…
Encoding in a high-dimensional Hilbert space improves noise resilience in quantum information processing. This approach, however, may result in cross-mode coupling and detection complexities, thereby reducing quantum cryptography…
Modular quantum computing architectures require error correction schemes that remain effective in the presense of noisy inter-processor operations. We introduce a distributed quantum error correction framework based on approximate codes to…
Autonomous quantum error correction (AQEC) protects logical qubits by engineered dissipation and thus circumvents the necessity of frequent, error-prone measurement-feedback loops. Bosonic code spaces, where single-photon loss represents…
Quantum states that are symmetric under particle exchange play a crucial role in fields such as quantum metrology and quantum error correction. We use a variational circuit composed of global one-axis twisting and global rotations to…
Bosonic quantum error-correcting codes offer a viable direction towards reducing the hardware overhead required for fault-tolerant quantum information processing. A broad class of bosonic codes, namely rotation-symmetric codes, can be…
We work out a theory of approximate quantum error correction that allows us to derive a general lower bound for the entanglement fidelity of a quantum code. The lower bound is given in terms of Kraus operators of the quantum noise. This…
Transversal encoded gatesets are highly desirable for fault tolerant quantum computing. However, a quantum error correcting code which exactly corrects for local erasure noise and supports a universal set of transversal gates is ruled out…
Scalability of flying photonic quantum systems in generating quantum entanglement offers a potential for implementing large-scale fault-tolerant quantum computation, especially by means of measurement-based quantum computation (MBQC).…
Practical implementation of quantum error correction is currently limited by near-term quantum hardware. In contrast, quantum error mitigation has demonstrated strong promise for improving the performance of noisy quantum circuits without…
Gauss's law-based quantum error correction (GLQEC) offers a promising approach to reducing qubit overhead in lattice gauge theory simulations by leveraging built-in symmetries. For applications of GLQEC to 1+1D lattice quantum…
Motivated by the close relationship between quantum error-correction, topological order, the holographic AdS/CFT duality, and tensor networks, we initiate the study of approximate quantum error-detecting codes in matrix product states…
We introduce an encoding of information in the relative displacement or photon number of different optical modes. Since the loss rate to interference is insensitive to squeezing and many non-Gaussian fluctuations, such a space is relatively…
Qubit loss is a major source of error in quantum computation, as it invalidates the algebraic structure of the standard stabilizer formalism for quantum error-correcting codes. On the one hand, it complicates decoding; on the other hand, it…
The Gottesman-Knill theorem allows for the efficient simulation of stabilizer-based quantum error-correction circuits. Errors in these circuits are commonly modeled as depolarizing channels by using Monte Carlo methods to insert Pauli gates…
We ask how much energy is required to weakly simulate an $n$-qubit quantum circuit (i.e., produce samples from its output distribution) by a unitary circuit in a hybrid qubit-oscillator model. The latter consists of a certain number of…
Using nuclear magnetic resonance techniques, we experimentally investigated the effects of applying a two bit phase error detection code to preserve quantum information in nuclear spin systems. Input states were stored with and without…