127 research outputs found
Non-Additive Quantum Codes from Goethals and Preparata Codes
We extend the stabilizer formalism to a class of non-additive quantum codes
which are constructed from non-linear classical codes. As an example, we
present infinite families of non-additive codes which are derived from Goethals
and Preparata codes.Comment: submitted to the 2008 IEEE Information Theory Workshop (ITW 2008
Structured Error Recovery for Codeword-Stabilized Quantum Codes
Codeword stabilized (CWS) codes are, in general, non-additive quantum codes
that can correct errors by an exhaustive search of different error patterns,
similar to the way that we decode classical non-linear codes. For an n-qubit
quantum code correcting errors on up to t qubits, this brute-force approach
consecutively tests different errors of weight t or less, and employs a
separate n-qubit measurement in each test. In this paper, we suggest an error
grouping technique that allows to simultaneously test large groups of errors in
a single measurement. This structured error recovery technique exponentially
reduces the number of measurements by about 3^t times. While it still leaves
exponentially many measurements for a generic CWS code, the technique is
equivalent to syndrome-based recovery for the special case of additive CWS
codes.Comment: 13 pages, 9 eps figure
On the logical operators of quantum codes
I show how applying a symplectic Gram-Schmidt orthogonalization to the
normalizer of a quantum code gives a different way of determining the code's
logical operators. This approach may be more natural in the setting where we
produce a quantum code from classical codes because the generator matrices of
the classical codes form the normalizer of the resulting quantum code. This
technique is particularly useful in determining the logical operators of an
entanglement-assisted code produced from two classical binary codes or from one
classical quaternary code. Finally, this approach gives additional formulas for
computing the amount of entanglement that an entanglement-assisted code
requires.Comment: 5 pages, sequel to the findings in arXiv:0804.140
Classical simulations of Abelian-group normalizer circuits with intermediate measurements
Quantum normalizer circuits were recently introduced as generalizations of
Clifford circuits [arXiv:1201.4867]: a normalizer circuit over a finite Abelian
group is composed of the quantum Fourier transform (QFT) over G, together
with gates which compute quadratic functions and automorphisms. In
[arXiv:1201.4867] it was shown that every normalizer circuit can be simulated
efficiently classically. This result provides a nontrivial example of a family
of quantum circuits that cannot yield exponential speed-ups in spite of usage
of the QFT, the latter being a central quantum algorithmic primitive. Here we
extend the aforementioned result in several ways. Most importantly, we show
that normalizer circuits supplemented with intermediate measurements can also
be simulated efficiently classically, even when the computation proceeds
adaptively. This yields a generalization of the Gottesman-Knill theorem (valid
for n-qubit Clifford operations [quant-ph/9705052, quant-ph/9807006] to quantum
circuits described by arbitrary finite Abelian groups. Moreover, our
simulations are twofold: we present efficient classical algorithms to sample
the measurement probability distribution of any adaptive-normalizer
computation, as well as to compute the amplitudes of the state vector in every
step of it. Finally we develop a generalization of the stabilizer formalism
[quant-ph/9705052, quant-ph/9807006] relative to arbitrary finite Abelian
groups: for example we characterize how to update stabilizers under generalized
Pauli measurements and provide a normal form of the amplitudes of generalized
stabilizer states using quadratic functions and subgroup cosets.Comment: 26 pages+appendices. Title has changed in this second version. To
appear in Quantum Information and Computation, Vol.14 No.3&4, 201
Non-Additive Quantum Codes from Goethals and Preparata Codes
We extend the stabilizer formalism to a class of non-additive quantum codes
which are constructed from non-linear classical codes. As an example, we
present infinite families of non-additive codes which are derived from Goethals
and Preparata codes.Comment: submitted to the 2008 IEEE Information Theory Workshop (ITW 2008
Entanglement required in achieving entanglement-assisted channel capacities
Entanglement shared between the two ends of a quantum communication channel
has been shown to be a useful resource in increasing both the quantum and
classical capacities for these channels. The entanglement-assisted capacities
were derived assuming an unlimited amount of shared entanglement per channel
use. In this paper, bounds are derived on the minimum amount of entanglement
required per use of a channel, in order to asymptotically achieve the capacity.
This is achieved by introducing a class of entanglement-assisted quantum codes.
Codes for classes of qubit channels are shown to achieve the quantum
entanglement-assisted channel capacity when an amount of shared entanglement
per channel given by, E = 1 - Q_E, is provided. It is also shown that for very
noisy channels, as the capacities become small, the amount of required
entanglement converges for the classical and quantum capacities.Comment: 9 pages, 2 figures, RevTex
- …