SearcharxivSearch

arXiv subjects

Benjamin Rahn

Publications and source records attributed to Benjamin Rahn.

4 recordsLinked to original sources

Exact Performance of Concatenated Quantum Codes

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 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 certain codes under the symmetric depolarizing channel, we use the coding maps to compute exact threshold error probabilities for achievability of perfect fidelity in the infinite concatenation limit.

quant-ph

Exact and Approximate Performance of Concatenated Quantum Codes

We derive the effective channel for a logical qubit protected by an arbitrary quantum error-correcting code, and derive the map between channels induced by concatenation. For certain codes in the presence of single-bit Pauli errors, we calculate the exact threshold error probability for perfect fidelity in the infinite concatenation limit. We then use the control theory technique of balanced truncation to find low-order non-asymptotic approximations for the effective channel dynamics.

quant-ph

A Balanced Truncation Primer

Balanced truncation, a technique from robust control theory, is a systematic method for producing simple approximate models of complex linear systems. This technique may have significant applications in physics, particularly in the study of large classical and quantum systems. These notes summarize the concepts and results necessary to apply balanced truncation.

quant-ph

Robust quantum computation by simulation

Simulation of quantum systems that provide intrinsically fault-tolerant quantum computation is shown to preserve fault tolerance. Errors committed in the course of simulation are eliminated by the natural error-correcting features of the systems simulated. Two examples are explored, toric codes and non-abelian anyons. The latter is shown to provide universal robust quantum computation via simulation.

quant-ph