938 research outputs found
Testing product states, quantum Merlin-Arthur games and tensor optimisation
We give a test that can distinguish efficiently between product states of n
quantum systems and states which are far from product. If applied to a state
psi whose maximum overlap with a product state is 1-epsilon, the test passes
with probability 1-Theta(epsilon), regardless of n or the local dimensions of
the individual systems. The test uses two copies of psi. We prove correctness
of this test as a special case of a more general result regarding stability of
maximum output purity of the depolarising channel. A key application of the
test is to quantum Merlin-Arthur games with multiple Merlins, where we obtain
several structural results that had been previously conjectured, including the
fact that efficient soundness amplification is possible and that two Merlins
can simulate many Merlins: QMA(k)=QMA(2) for k>=2. Building on a previous
result of Aaronson et al, this implies that there is an efficient quantum
algorithm to verify 3-SAT with constant soundness, given two unentangled proofs
of O(sqrt(n) polylog(n)) qubits. We also show how QMA(2) with log-sized proofs
is equivalent to a large number of problems, some related to quantum
information (such as testing separability of mixed states) as well as problems
without any apparent connection to quantum mechanics (such as computing
injective tensor norms of 3-index tensors). As a consequence, we obtain many
hardness-of-approximation results, as well as potential algorithmic
applications of methods for approximating QMA(2) acceptance probabilities.
Finally, our test can also be used to construct an efficient test for
determining whether a unitary operator is a tensor product, which is a
generalisation of classical linearity testing.Comment: 44 pages, 1 figure, 7 appendices; v6: added references, rearranged
sections, added discussion of connections to classical CS. Final version to
appear in J of the AC
Faithful Squashed Entanglement
Squashed entanglement is a measure for the entanglement of bipartite quantum
states. In this paper we present a lower bound for squashed entanglement in
terms of a distance to the set of separable states. This implies that squashed
entanglement is faithful, that is, strictly positive if and only if the state
is entangled. We derive the bound on squashed entanglement from a bound on
quantum conditional mutual information, which is used to define squashed
entanglement and corresponds to the amount by which strong subadditivity of von
Neumann entropy fails to be saturated. Our result therefore sheds light on the
structure of states that almost satisfy strong subadditivity with equality. The
proof is based on two recent results from quantum information theory: the
operational interpretation of the quantum mutual information as the optimal
rate for state redistribution and the interpretation of the regularised
relative entropy of entanglement as an error exponent in hypothesis testing.
The distance to the set of separable states is measured by the one-way LOCC
norm, an operationally-motivated norm giving the optimal probability of
distinguishing two bipartite quantum states, each shared by two parties, using
any protocol formed by local quantum operations and one-directional classical
communication between the parties. A similar result for the Frobenius or
Euclidean norm follows immediately. The result has two applications in
complexity theory. The first is a quasipolynomial-time algorithm solving the
weak membership problem for the set of separable states in one-way LOCC or
Euclidean norm. The second concerns quantum Merlin-Arthur games. Here we show
that multiple provers are not more powerful than a single prover when the
verifier is restricted to one-way LOCC operations thereby providing a new
characterisation of the complexity class QMA.Comment: 24 pages, 1 figure, 1 table. Due to an error in the published
version, claims have been weakened from the LOCC norm to the one-way LOCC
nor
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
Estimating operator norms using covering nets
We present several polynomial- and quasipolynomial-time approximation schemes
for a large class of generalized operator norms. Special cases include the
norm of matrices for , the support function of the set of
separable quantum states, finding the least noisy output of
entanglement-breaking quantum channels, and approximating the injective tensor
norm for a map between two Banach spaces whose factorization norm through
is bounded.
These reproduce and in some cases improve upon the performance of previous
algorithms by Brand\~ao-Christandl-Yard and followup work, which were based on
the Sum-of-Squares hierarchy and whose analysis used techniques from quantum
information such as the monogamy principle of entanglement. Our algorithms, by
contrast, are based on brute force enumeration over carefully chosen covering
nets. These have the advantage of using less memory, having much simpler proofs
and giving new geometric insights into the problem. Net-based algorithms for
similar problems were also presented by Shi-Wu and Barak-Kelner-Steurer, but in
each case with a run-time that is exponential in the rank of some matrix. We
achieve polynomial or quasipolynomial runtimes by using the much smaller nets
that exist in spaces. This principle has been used in learning theory,
where it is known as Maurey's empirical method.Comment: 24 page
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete
This paper presents stronger methods of achieving perfect completeness in
quantum interactive proofs. First, it is proved that any problem in QMA has a
two-message quantum interactive proof system of perfect completeness with
constant soundness error, where the verifier has only to send a constant number
of halves of EPR pairs. This in particular implies that the class QMA is
necessarily included by the class QIP_1(2) of problems having two-message
quantum interactive proofs of perfect completeness, which gives the first
nontrivial upper bound for QMA in terms of quantum interactive proofs. It is
also proved that any problem having an -message quantum interactive proof
system necessarily has an -message quantum interactive proof system of
perfect completeness. This improves the previous result due to Kitaev and
Watrous, where the resulting system of perfect completeness requires
messages if not using the parallelization result.Comment: 41 pages; v2: soundness parameters improved, correction of a minor
error in Lemma 23, and removal of the sentences claiming that our techniques
are quantumly nonrelativizin
Testing quantum expanders is co-QMA-complete
A quantum expander is a unital quantum channel that is rapidly mixing, has
only a few Kraus operators, and can be implemented efficiently on a quantum
computer. We consider the problem of estimating the mixing time (i.e., the
spectral gap) of a quantum expander. We show that this problem is
co-QMA-complete. This has applications to testing randomized constructions of
quantum expanders, and studying thermalization of open quantum systems
Testing quantum expanders is co-QMA-complete
A quantum expander is a unital quantum channel that is rapidly mixing, has
only a few Kraus operators, and can be implemented efficiently on a quantum
computer. We consider the problem of estimating the mixing time (i.e., the
spectral gap) of a quantum expander. We show that this problem is
co-QMA-complete. This has applications to testing randomized constructions of
quantum expanders, and studying thermalization of open quantum systems
- …