200 research outputs found
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
Entangled Games Are Hard to Approximate
We establish the first hardness results for the problem of computing the value of one-round games played by a verifier and a team of provers who can share quantum entanglement. In particular, we show that it is NP-hard to approximate within an inverse polynomial the value of a one-round game with (i) a quantum verifier and two entangled provers or (ii) a classical verifier and three entangled provers. Previously it was not even known if computing the value exactly is NP-hard. We also describe a mathematical conjecture, which, if true, would imply hardness of approximation of entangled-prover games to within a constant. Using our techniques we also show that every language in PSPACE has a two-prover one-round interactive proof system with perfect completeness and soundness 1-1/poly even against entangled provers. We start our proof by describing two ways to modify classical multiprover games to make them resistant to entangled provers. We then show that a strategy for the modified game that uses entanglement can be āroundedā to one that does not. The results then follow from classical inapproximability bounds. Our work implies that, unless P=NP, the values of entangled-prover games cannot be computed by semidefinite programs that are polynomial in the size of the verifier's system, a method that has been successful for more restricted quantum games
Quantum Proofs
Quantum information and computation provide a fascinating twist on the notion
of proofs in computational complexity theory. For instance, one may consider a
quantum computational analogue of the complexity class \class{NP}, known as
QMA, in which a quantum state plays the role of a proof (also called a
certificate or witness), and is checked by a polynomial-time quantum
computation. For some problems, the fact that a quantum proof state could be a
superposition over exponentially many classical states appears to offer
computational advantages over classical proof strings. In the interactive proof
system setting, one may consider a verifier and one or more provers that
exchange and process quantum information rather than classical information
during an interaction for a given input string, giving rise to quantum
complexity classes such as QIP, QSZK, and QMIP* that represent natural quantum
analogues of IP, SZK, and MIP. While quantum interactive proof systems inherit
some properties from their classical counterparts, they also possess distinct
and uniquely quantum features that lead to an interesting landscape of
complexity classes based on variants of this model.
In this survey we provide an overview of many of the known results concerning
quantum proofs, computational models based on this concept, and properties of
the complexity classes they define. In particular, we discuss non-interactive
proofs and the complexity class QMA, single-prover quantum interactive proof
systems and the complexity class QIP, statistical zero-knowledge quantum
interactive proof systems and the complexity class \class{QSZK}, and
multiprover interactive proof systems and the complexity classes QMIP, QMIP*,
and MIP*.Comment: Survey published by NOW publisher
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
Limitations of semidefinite programs for separable states and entangled games
Semidefinite programs (SDPs) are a framework for exact or approximate
optimization that have widespread application in quantum information theory. We
introduce a new method for using reductions to construct integrality gaps for
SDPs. These are based on new limitations on the sum-of-squares (SoS) hierarchy
in approximating two particularly important sets in quantum information theory,
where previously no -round integrality gaps were known: the set of
separable (i.e. unentangled) states, or equivalently, the
norm of a matrix, and the set of quantum correlations; i.e. conditional
probability distributions achievable with local measurements on a shared
entangled state. In both cases no-go theorems were previously known based on
computational assumptions such as the Exponential Time Hypothesis (ETH) which
asserts that 3-SAT requires exponential time to solve. Our unconditional
results achieve the same parameters as all of these previous results (for
separable states) or as some of the previous results (for quantum
correlations). In some cases we can make use of the framework of
Lee-Raghavendra-Steurer (LRS) to establish integrality gaps for any SDP, not
only the SoS hierarchy. Our hardness result on separable states also yields a
dimension lower bound of approximate disentanglers, answering a question of
Watrous and Aaronson et al. These results can be viewed as limitations on the
monogamy principle, the PPT test, the ability of Tsirelson-type bounds to
restrict quantum correlations, as well as the SDP hierarchies of
Doherty-Parrilo-Spedalieri, Navascues-Pironio-Acin and Berta-Fawzi-Scholz.Comment: 47 pages. v2. small changes, fixes and clarifications. published
versio
A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian
In this work we show a barrier towards proving a randomness-efficient
parallel repetition, a promising avenue for achieving many tight
inapproximability results. Feige and Kilian (STOC'95) proved an impossibility
result for randomness-efficient parallel repetition for two prover games with
small degree, i.e., when each prover has only few possibilities for the
question of the other prover. In recent years, there have been indications that
randomness-efficient parallel repetition (also called derandomized parallel
repetition) might be possible for games with large degree, circumventing the
impossibility result of Feige and Kilian. In particular, Dinur and Meir
(CCC'11) construct games with large degree whose repetition can be derandomized
using a theorem of Impagliazzo, Kabanets and Wigderson (SICOMP'12). However,
obtaining derandomized parallel repetition theorems that would yield optimal
inapproximability results has remained elusive.
This paper presents an explanation for the current impasse in progress, by
proving a limitation on derandomized parallel repetition. We formalize two
properties which we call "fortification-friendliness" and "yields robust
embeddings." We show that any proof of derandomized parallel repetition
achieving almost-linear blow-up cannot both (a) be fortification-friendly and
(b) yield robust embeddings. Unlike Feige and Kilian, we do not require the
small degree assumption.
Given that virtually all existing proofs of parallel repetition, including
the derandomized parallel repetition result of Dinur and Meir, share these two
properties, our no-go theorem highlights a major barrier to achieving
almost-linear derandomized parallel repetition
- ā¦