Quantum de Finetti theorems under local measurements with applications

DOI10.1007/S00220-017-2880-3zbMath1380.81068arXiv1210.6367OpenAlexW2607074006WikidataQ59711903 ScholiaQ59711903MaRDI QIDQ2358805

Aram W. Harrow, Fernando G. S. L. Brandão

Publication date: 16 June 2017

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.6367

Mathematics Subject Classification ID

Quantum measurement theory, state operations, state preparations (81P15) Empirical decision procedures; empirical Bayes procedures (62C12) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (13)

Semidefinite programming hierarchies for constrained bilinear optimization ⋮ Improved stability for 2D attractive Bose gases ⋮ A convergent inflation hierarchy for quantum causal structures ⋮ A fermionic de Finetti theorem ⋮ Non linear Schrödinger limit of bosonic ground states, again ⋮ Average field approximation for almost bosonic anyons in a magnetic field ⋮ The sum-of-squares hierarchy on the sphere and applications in quantum information theory ⋮ Classical field theory limit of many-body quantum Gibbs states in 2D and 3D ⋮ Scaling limits of bosonic ground states, from many-body to non-linear Schrödinger ⋮ De Finetti theorems for braided parafermions ⋮ Schur-Weyl duality for the Clifford group with applications: property testing, a robust Hudson theorem, and de Finetti representations ⋮ Many-body blow-up profile of boson stars with external potentials ⋮ De Finetti theorems for the unitary dual group

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distinguishing multi-partite states by local measurements
• Non-deterministic exponential time has two-prover interactive protocols
• Faithful squashed entanglement
• On general minimax theorems
• Quantum Arthur-Merlin games
• The complexity of optimizing over a simplex, hypercube or sphere: a short survey
• A simple proof of monogamy of entanglement
• A generalization of quantum Stein's lemma
• Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
• Symmetric states of composite systems
• Finite exchangeable sequences
• An application of Bell's inequalities to a quantum state extension problem
• Quantum multi-prover interactive proof systems with limited prior entanglement.
• Which problems have strongly exponential complexity?
• One-and-a-half quantum de Finetti theorems
• Relative entropy and squashed entanglement
• Symmetric states of infinite tensor products of \(C^ *\)-algebras
• Global Optimization with Polynomials and the Problem of Moments
• Three-Player Entangled XOR Games are NP-Hard to Approximate
• Symmetric Extensions of Quantum States and Local Hidden Variable Theories
• Entangled Games Are Hard to Approximate
• Proof verification and the hardness of approximation problems
• Subexponential Algorithms for Unique Games and Related Problems
• Near-Optimal and Explicit Bell Inequality Violations
• A de Finetti representation for finite symmetric quantum states
• The learnability of quantum states
• SECURITY OF QUANTUM KEY DISTRIBUTION
• Polynomial-Space Approximation of No-Signaling Provers
• Finite de Finetti theorem for conditional probability distributions describing physical theories
• Probabilistic checking of proofs
• Locally normal symmetric states and an analogue of de Finetti's theorem
• Strengths and Weaknesses of Quantum Computing
• Unknown quantum states: The quantum de Finetti representation
• Squashed Entanglement for Multipartite States and Entanglement Measures Based on the Mixed Convex Roof
• On the Power of the PPT Constraint in the Symmetric Extensions Test for Separability
• Algorithms and Computation
• Approximating the set of separable states using the positive partial transpose test
• Rounding sum-of-squares relaxations
• Weak Decoupling Duality and Quantum Identification
• Computational Complexity
• Mixed-state entanglement and quantum error correction
• Unique Games with Entangled Provers Are Easy
• Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization
• Hypercontractivity, sum-of-squares proofs, and their applications
• A quasipolynomial-time algorithm for the quantum separability problem
• A Two Prover One Round Game with Strong Soundness
• Product-state approximations to quantum ground states
• Approximability and proof complexity
• Quantum Information Theory
• On the complexity of \(k\)-SAT
• A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.

This page was built for publication: Quantum de Finetti theorems under local measurements with applications