2,126 research outputs found
Monotonicity of the quantum linear programming bound
The most powerful technique known at present for bounding the size of quantum
codes of prescribed minimum distance is the quantum linear programming bound.
Unlike the classical linear programming bound, it is not immediately obvious
that if the quantum linear programming constraints are satisfiable for
dimension K, that the constraints can be satisfied for all lower dimensions. We
show that the quantum linear programming bound is indeed monotonic in this
sense, and give an explicitly monotonic reformulation.Comment: 5 pages, AMSTe
Simple test for quantum channel capacity
Basing on states and channels isomorphism we point out that semidefinite
programming can be used as a quick test for nonzero one-way quantum channel
capacity. This can be achieved by search of symmetric extensions of states
isomorphic to a given quantum channel. With this method we provide examples of
quantum channels that can lead to high entanglement transmission but still have
zero one-way capacity, in particular, regions of symmetric extendibility for
isotropic states in arbitrary dimensions are presented. Further we derive {\it
a new entanglement parameter} based on (normalised) relative entropy distance
to the set of states that have symmetric extensions and show explicitly the
symmetric extension of isotropic states being the nearest to singlets in the
set of symmetrically extendible states. The suitable regularisation of the
parameter provides a new upper bound on one-way distillable entanglement.Comment: 6 pages, no figures, RevTeX4. Signifficantly corrected version. Claim
on continuity of channel capacities removed due to flaw in the corresponding
proof. Changes and corrections performed in the part proposing a new upper
bound on one-way distillable etanglement which happens to be not one-way
entanglement monoton
The Fidelity of Recovery is Multiplicative
Fawzi and Renner [Commun. Math. Phys. 340(2):575, 2015] recently established
a lower bound on the conditional quantum mutual information (CQMI) of
tripartite quantum states in terms of the fidelity of recovery (FoR),
i.e. the maximal fidelity of the state with a state reconstructed from
its marginal by acting only on the system. The FoR measures quantum
correlations by the local recoverability of global states and has many
properties similar to the CQMI. Here we generalize the FoR and show that the
resulting measure is multiplicative by utilizing semi-definite programming
duality. This allows us to simplify an operational proof by Brandao et al.
[Phys. Rev. Lett. 115(5):050501, 2015] of the above-mentioned lower bound that
is based on quantum state redistribution. In particular, in contrast to the
previous approaches, our proof does not rely on de Finetti reductions.Comment: v2: 9 pages, published versio
Quantum de Finetti Theorems under Local Measurements with Applications
Quantum de Finetti theorems are a useful tool in the study of correlations in
quantum multipartite states. In this paper we prove two new quantum de Finetti
theorems, both showing that under tests formed by local measurements one can
get a much improved error dependence on the dimension of the subsystems. We
also obtain similar results for non-signaling probability distributions. We
give the following applications of the results:
We prove the optimality of the Chen-Drucker protocol for 3-SAT, under the
exponential time hypothesis.
We show that the maximum winning probability of free games can be estimated
in polynomial time by linear programming. We also show that 3-SAT with m
variables can be reduced to obtaining a constant error approximation of the
maximum winning probability under entangled strategies of O(m^{1/2})-player
one-round non-local games, in which the players communicate O(m^{1/2}) bits all
together.
We show that the optimization of certain polynomials over the hypersphere can
be performed in quasipolynomial time in the number of variables n by
considering O(log(n)) rounds of the Sum-of-Squares (Parrilo/Lasserre) hierarchy
of semidefinite programs. As an application to entanglement theory, we find a
quasipolynomial-time algorithm for deciding multipartite separability.
We consider a result due to Aaronson -- showing that given an unknown n qubit
state one can perform tomography that works well for most observables by
measuring only O(n) independent and identically distributed (i.i.d.) copies of
the state -- and relax the assumption of having i.i.d copies of the state to
merely the ability to select subsystems at random from a quantum multipartite
state.
The proofs of the new quantum de Finetti theorems are based on information
theory, in particular on the chain rule of mutual information.Comment: 39 pages, no figure. v2: changes to references and other minor
improvements. v3: added some explanations, mostly about Theorem 1 and
Conjecture 5. STOC version. v4, v5. small improvements and fixe
Duality in Entanglement-Assisted Quantum Error Correction
The dual of an entanglement-assisted quantum error-correcting (EAQEC) code is
defined from the orthogonal group of a simplified stabilizer group. From the
Poisson summation formula, this duality leads to the MacWilliams identities and
linear programming bounds for EAQEC codes. We establish a table of upper and
lower bounds on the minimum distance of any maximal-entanglement EAQEC code
with length up to 15 channel qubits.Comment: This paper is a compact version of arXiv:1010.550
Algorithmic Aspects of Optimal Channel Coding
A central question in information theory is to determine the maximum success
probability that can be achieved in sending a fixed number of messages over a
noisy channel. This was first studied in the pioneering work of Shannon who
established a simple expression characterizing this quantity in the limit of
multiple independent uses of the channel. Here we consider the general setting
with only one use of the channel. We observe that the maximum success
probability can be expressed as the maximum value of a submodular function.
Using this connection, we establish the following results:
1. There is a simple greedy polynomial-time algorithm that computes a code
achieving a (1-1/e)-approximation of the maximum success probability. Moreover,
for this problem it is NP-hard to obtain an approximation ratio strictly better
than (1-1/e).
2. Shared quantum entanglement between the sender and the receiver can
increase the success probability by a factor of at most 1/(1-1/e). In addition,
this factor is tight if one allows an arbitrary non-signaling box between the
sender and the receiver.
3. We give tight bounds on the one-shot performance of the meta-converse of
Polyanskiy-Poor-Verdu.Comment: v2: 16 pages. Added alternate proof of main result with random codin
- …