344 research outputs found
Multiple Particle Interference and Quantum Error Correction
The concept of multiple particle interference is discussed, using insights
provided by the classical theory of error correcting codes. This leads to a
discussion of error correction in a quantum communication channel or a quantum
computer. Methods of error correction in the quantum regime are presented, and
their limitations assessed. A quantum channel can recover from arbitrary
decoherence of x qubits if K bits of quantum information are encoded using n
quantum bits, where K/n can be greater than 1-2 H(2x/n), but must be less than
1 - 2 H(x/n). This implies exponential reduction of decoherence with only a
polynomial increase in the computing resources required. Therefore quantum
computation can be made free of errors in the presence of physically realistic
levels of decoherence. The methods also allow isolation of quantum
communication from noise and evesdropping (quantum privacy amplification).Comment: Submitted to Proc. Roy. Soc. Lond. A. in November 1995, accepted May
1996. 39 pages, 6 figures. This is now the final version. The changes are
some added references, changed final figure, and a more precise use of the
word `decoherence'. I would like to propose the word `defection' for a
general unknown error of a single qubit (rotation and/or entanglement). It is
useful because it captures the nature of the error process, and has a verb
form `to defect'. Random unitary changes (rotations) of a qubit are caused by
defects in the quantum computer; to entangle randomly with the environment is
to form a treacherous alliance with an enemy of successful quantu
"Building" exact confidence nets
Confidence nets, that is, collections of confidence intervals that fill out
the parameter space and whose exact parameter coverage can be computed, are
familiar in nonparametric statistics. Here, the distributional assumptions are
based on invariance under the action of a finite reflection group. Exact
confidence nets are exhibited for a single parameter, based on the root system
of the group. The main result is a formula for the generating function of the
coverage interval probabilities. The proof makes use of the theory of
"buildings" and the Chevalley factorization theorem for the length distribution
on Cayley graphs of finite reflection groups.Comment: 20 pages. To appear in Bernoull
Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
Schur-Weyl duality is a ubiquitous tool in quantum information. At its heart
is the statement that the space of operators that commute with the tensor
powers of all unitaries is spanned by the permutations of the tensor factors.
In this work, we describe a similar duality theory for tensor powers of
Clifford unitaries. The Clifford group is a central object in many subfields of
quantum information, most prominently in the theory of fault-tolerance. The
duality theory has a simple and clean description in terms of finite
geometries. We demonstrate its effectiveness in several applications:
(1) We resolve an open problem in quantum property testing by showing that
"stabilizerness" is efficiently testable: There is a protocol that, given
access to six copies of an unknown state, can determine whether it is a
stabilizer state, or whether it is far away from the set of stabilizer states.
We give a related membership test for the Clifford group.
(2) We find that tensor powers of stabilizer states have an increased
symmetry group. We provide corresponding de Finetti theorems, showing that the
reductions of arbitrary states with this symmetry are well-approximated by
mixtures of stabilizer tensor powers (in some cases, exponentially well).
(3) We show that the distance of a pure state to the set of stabilizers can
be lower-bounded in terms of the sum-negativity of its Wigner function. This
gives a new quantitative meaning to the sum-negativity (and the related mana)
-- a measure relevant to fault-tolerant quantum computation. The result
constitutes a robust generalization of the discrete Hudson theorem.
(4) We show that complex projective designs of arbitrary order can be
obtained from a finite number (independent of the number of qudits) of Clifford
orbits. To prove this result, we give explicit formulas for arbitrary moments
of random stabilizer states.Comment: 60 pages, 2 figure
Solving the Closest Vector Problem in Time--- The Discrete Gaussian Strikes Again!
We give a -time and space randomized algorithm for solving the
exact Closest Vector Problem (CVP) on -dimensional Euclidean lattices. This
improves on the previous fastest algorithm, the deterministic
-time and -space algorithm of
Micciancio and Voulgaris.
We achieve our main result in three steps. First, we show how to modify the
sampling algorithm from [ADRS15] to solve the problem of discrete Gaussian
sampling over lattice shifts, , with very low parameters. While the
actual algorithm is a natural generalization of [ADRS15], the analysis uses
substantial new ideas. This yields a -time algorithm for
approximate CVP for any approximation factor .
Second, we show that the approximate closest vectors to a target vector can
be grouped into "lower-dimensional clusters," and we use this to obtain a
recursive reduction from exact CVP to a variant of approximate CVP that
"behaves well with these clusters." Third, we show that our discrete Gaussian
sampling algorithm can be used to solve this variant of approximate CVP.
The analysis depends crucially on some new properties of the discrete
Gaussian distribution and approximate closest vectors, which might be of
independent interest
Exponential lower bound on the highest fidelity achievable by quantum error-correcting codes
On a class of memoryless quantum channels which includes the depolarizing
channel, the highest fidelity of quantum error-correcting codes of length n and
rate R is proven to be lower bounded by 1-exp[-nE(R)+o(n)] for some function
E(R). The E(R) is positive below some threshold R', which implies R' is a lower
bound on the quantum capacity.Comment: Ver.4. In vers.1--3, I claimed Theorem 1 for general quantum
channels. Now I claim this only for a slight generalization of depolarizing
channel in this paper because Lemma 2 in vers.1--3 was wrong; the original
general statement is proved in quant-ph/0112103. Ver.5. Text sectionalized.
Appeared in PRA. The PRA article is typographically slightly crude: The LaTeX
symbol star, used as superscripts, was capriciously replaced by the asterisk
in several places after my proof readin
Tsirelson's problem and Kirchberg's conjecture
Tsirelson's problem asks whether the set of nonlocal quantum correlations
with a tensor product structure for the Hilbert space coincides with the one
where only commutativity between observables located at different sites is
assumed. Here it is shown that Kirchberg's QWEP conjecture on tensor products
of C*-algebras would imply a positive answer to this question for all bipartite
scenarios. This remains true also if one considers not only spatial
correlations, but also spatiotemporal correlations, where each party is allowed
to apply their measurements in temporal succession; we provide an example of a
state together with observables such that ordinary spatial correlations are
local, while the spatiotemporal correlations reveal nonlocality. Moreover, we
find an extended version of Tsirelson's problem which, for each nontrivial Bell
scenario, is equivalent to the QWEP conjecture. This extended version can be
conveniently formulated in terms of steering the system of a third party.
Finally, a comprehensive mathematical appendix offers background material on
complete positivity, tensor products of C*-algebras, group C*-algebras, and
some simple reformulations of the QWEP conjecture.Comment: 57 pages, to appear in Rev. Math. Phy
- âŠ