Related papers: Error Correction for Partially Stuck Memory Cells
The realization of quantum error correction is an essential ingredient for reaching the full potential of fault-tolerant universal quantum computation. Using a range of different schemes, logical qubits can be redundantly encoded in a set…
We present a method for quantum error mitigation on partially error-corrected quantum computers - i.e., computers with some logical qubits and some noisy qubits. Our method is inspired by the error cancellation method and is implemented via…
We introduce a novel framework for implementing error-correction in constrained systems. The main idea of our scheme, called Quantized-Constraint Concatenation (QCC), is to employ a process of embedding the codewords of an error-correcting…
Quantum error correction works effectively only if the error rate of gate operations is sufficiently low. However, some rare physical mechanisms can cause a temporary increase in the error rate that affects many qubits; examples include…
A new class of exact-repair regenerating codes is constructed by stitching together shorter erasure correction codes, where the stitching pattern can be viewed as block designs. The proposed codes have the "help-by-transfer" property where…
Quantum error correction is widely thought to be the key to fault-tolerant quantum computation. However, determining the most suited encoding for unknown error channels or specific laboratory setups is highly challenging. Here, we present a…
Recent progress in quantum cryptography and quantum computers has given hope to their imminent practical realization. An essential element at the heart of the application of these quantum systems is a quantum error correction scheme. We…
It has been an open question in deep learning if fault-tolerant computation is possible: can arbitrarily reliable computation be achieved using only unreliable neurons? In the grid cells of the mammalian cortex, analog error correction…
Quantum error correction (QEC) is an essential concept for any quantum information processing device. Typically, QEC is designed with minimal assumptions about the noise process; this generic assumption exacts a high cost in efficiency and…
Homological quantum error correction uses tools of algebraic topology and homological algebra to derive Calderbank-Shor-Steane quantum error correcting codes from cellulations of topological spaces. This work is an exploration of the…
We study error-correcting codes for permutations under the infinity norm, motivated by a novel storage scheme for flash memories call rank modulation. In this scheme, a set of $n$ flash cells are combined to create a single virtual…
The rotation of trapped molecules offers a promising platform for quantum technologies and quantum information processing. In parallel, quantum error correction codes that can protect quantum information encoded in rotational states of a…
Quantum burst error correction codes (QBECCs) are of great importance to deal with the memory effect in quantum channels. As the most important family of QBECCs, quantum cyclic codes (QCCs) play a vital role in the correction of burst…
An algorithm is presented for error correction in the surface code quantum memory. This is shown to correct depolarizing noise up to a threshold error rate of 18.5%, exceeding previous results and coming close to the upper bound of 18.9%.…
We compare failure distributions of quantum error correction circuits for stochastic errors and coherent errors. We utilize a fully coherent simulation of a fault tolerant quantum error correcting circuit for a $d=3$ Steane and surface…
Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant…
We present a full quantum error correcting procedure with the semion code: an off-shell extension of the double semion model. We construct open strings operators that recover the quantum memory from arbitrary errors and closed string…
In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information indefinitely is nontrivial, even in an infinite automaton. Still, there is a solution in 2…
In this paper, we give a generalization on the error correcting capability of twisted centralizer codes obtained from a fixed rank 1 matrix. In particular, we fix the combinatorial matrix which is obtained by getting the linear combination…
Many current quantum error-correcting codes that achieve full fault tolerance suffer from having low ratios of logical to physical qubits and significant overhead. This makes them difficult to implement on current noisy intermediate-scale…