When a logical qubit is protected using a quantum error-correcting code, the net effect of coding, decoherence ͑a physical channel acting on qubits in the codeword͒ and recovery can be represented exactly by an effective channel acting directly on the logical qubit. In this paper we describe a procedure for deriving the map between physical and effective channels that results from a given coding and recovery procedure. We show that the map for a concatenation of codes is given by the composition of the maps for the constituent codes. This perspective leads us to an efficient means for calculating the exact performance of quantum codes with arbitrary levels of concatenation. We present explicit results for single-bit Pauli channels. For cert...
We demonstrate that there exists a universal, near-optimal recovery map—the transpose channel—for ap...
Recent progress in quantum cryptography and quantum computers has given hope to their imminent pract...
It has been show by E.Knill (quant-ph/9610011) and D.Aharonov (quant-ph/9611025) that once elementar...
When a logical qubit is protected using a quantum error-correcting code, the net effect of coding, d...
When a logical qubit is protected using a quantum error-correcting code, the net effect of coding, d...
When a logical qubit is protected using a quantum error-correcting code, the net effect of coding, d...
We consider the problem of optimally decoding a quantum error correction code -- that is to find the...
Concatenation of two quantum error-correcting codes with complementary sets of transversal gates can...
Concatenation of two quantum error-correcting codes with complementary sets of transversal gates can...
Concatenation of two quantum error-correcting codes with complementary sets of transversal gates can...
Full accuracy simulations of quantum systems are very costly, and as a result most studies of quant...
We analyze the resource overhead of recently proposed methods for universal fault-tolerant quantum c...
We analyze the resource overhead of recently proposed methods for universal fault-tolerant quantum c...
It has been known that error-correction via concatenated codes can be done with exponentially small ...
We demonstrate that there exists a universal, near-optimal recovery map—the transpose channel—for ap...
We demonstrate that there exists a universal, near-optimal recovery map—the transpose channel—for ap...
Recent progress in quantum cryptography and quantum computers has given hope to their imminent pract...
It has been show by E.Knill (quant-ph/9610011) and D.Aharonov (quant-ph/9611025) that once elementar...
When a logical qubit is protected using a quantum error-correcting code, the net effect of coding, d...
When a logical qubit is protected using a quantum error-correcting code, the net effect of coding, d...
When a logical qubit is protected using a quantum error-correcting code, the net effect of coding, d...
We consider the problem of optimally decoding a quantum error correction code -- that is to find the...
Concatenation of two quantum error-correcting codes with complementary sets of transversal gates can...
Concatenation of two quantum error-correcting codes with complementary sets of transversal gates can...
Concatenation of two quantum error-correcting codes with complementary sets of transversal gates can...
Full accuracy simulations of quantum systems are very costly, and as a result most studies of quant...
We analyze the resource overhead of recently proposed methods for universal fault-tolerant quantum c...
We analyze the resource overhead of recently proposed methods for universal fault-tolerant quantum c...
It has been known that error-correction via concatenated codes can be done with exponentially small ...
We demonstrate that there exists a universal, near-optimal recovery map—the transpose channel—for ap...
We demonstrate that there exists a universal, near-optimal recovery map—the transpose channel—for ap...
Recent progress in quantum cryptography and quantum computers has given hope to their imminent pract...
It has been show by E.Knill (quant-ph/9610011) and D.Aharonov (quant-ph/9611025) that once elementar...