Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization

DOI10.1145/2432622.2432625zbMath1281.68112arXiv1001.0017OpenAlexW2144362128WikidataQ58478268 ScholiaQ58478268MaRDI QIDQ5395703

Aram W. Harrow, Ashley Montanaro

Publication date: 17 February 2014

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

entanglementtensor optimizationquantum Merlin-Arthur games

Mathematics Subject Classification ID

Noncooperative games (91A10) Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (18)

Quantum de Finetti theorems under local measurements with applications ⋮ Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms ⋮ Noisy tensor completion via the sum-of-squares hierarchy ⋮ A Gap in the Subrank of Tensors ⋮ QMA with Subset State Witnesses ⋮ Non-Boolean quantum amplitude amplification and quantum mean estimation ⋮ Approximate orthogonality of permutation operators, with application to quantum information ⋮ Flexible constrained de Finetti reductions and applications ⋮ Unnamed Item ⋮ Limitations of semidefinite programs for separable states and entangled games ⋮ The sum-of-squares hierarchy on the sphere and applications in quantum information theory ⋮ Epsilon-net method for optimizations over separable states ⋮ Dvoretzky's theorem and the complexity of entanglement detection ⋮ An improved semidefinite programming hierarchy for testing entanglement ⋮ Quantum free games ⋮ The power of unentangled quantum proofs with non-negative amplitudes ⋮ Geometry of entanglement and separability in Hilbert subspaces of dimension up to three ⋮ Unconditionally secure commitments with quantum auxiliary inputs

This page was built for publication: Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization