Quantum de Finetti Theorem under Fully-One-Way Adaptive Measurements
We prove a version of the quantum de Finetti theorem: permutation-invariant quantum states are well approximated as a probabilistic mixture of multifold product states. The approximation is measured by distinguishability under measurements that are implementable by fully-one-way local operations and...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society
2015
|
| Online Access: | http://hdl.handle.net/1721.1/96814 https://orcid.org/0000-0002-3944-8449 |
| Summary: | We prove a version of the quantum de Finetti theorem: permutation-invariant quantum states are well approximated as a probabilistic mixture of multifold product states. The approximation is measured by distinguishability under measurements that are implementable by fully-one-way local operations and classical communication (LOCC). Our result strengthens Brandao and Harrow’s de Finetti theorem where a kind of partially-one-way LOCC measurements was used for measuring the approximation, with essentially the same error bound. As main applications, we show (i) a quasipolynomial-time algorithm which detects multipartite entanglement with an amount larger than an arbitrarily small constant (measured with a variant of the relative entropy of entanglement), and (ii) a proof that in quantum Merlin-Arthur proof systems, polynomially many provers are not more powerful than a single prover when the verifier is restricted to one-way LOCC operations. |
|---|