Epsilon-net method for optimizations over separable states

DOI10.1016/J.TCS.2015.03.031MaRDI QIDQ496030zbMATH OpenOpenAlexFDO

Authors Yaoyun Shi, Xiaodi Wu

Publication date 16 September 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.03.031

zbMATH Keywords

separable statesepsilon-netlocal Hamiltonian problemPSSPACEQMA(2)

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Quantum algorithms and complexity in the theory of computing (68Q12)

Recommendations

• Epsilon-net method for optimizations over separable states
• A quasipolynomial-time algorithm for the quantum separability problem
• Computational complexity of the quantum separability problem
• Strong NP-hardness of the quantum separability problem
• A two-way algorithm for the entanglement problem

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 1776257 (Why is no real title available?)
• A quasipolynomial-time algorithm for the quantum separability problem
• An improved semidefinite programming hierarchy for testing entanglement
• Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
• Classical complexity and quantum entanglement
• Computational complexity of the quantum separability problem
• Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
• Distinguishing quantum operations having few Kraus operators
• Geometric algorithms and combinatorial optimization.
• Improved soundness for QMA with multiple provers
• Minimax Theorems
• NP vs QMA\(_{\log}(2)\)
• On QMA protocols with two short quantum proofs
• On Relating Time and Space to Size and Depth
• Online Variance Minimization
• Parallel approximation of min-max problems
• Quantum Arthur-Merlin games
• Quantum Merlin-Arthur proof systems: are multiple Merlins more helpful to Arthur?
• Quantum entanglement
• Quantum interactive proofs and the complexity of separability testing
• Strong NP-hardness of the quantum separability problem
• Testing product states, quantum Merlin-Arthur games and tensor optimization
• The Complexity of the Local Hamiltonian Problem
• The complexity of quantum spin systems on a two-dimensional square lattice
• The multiplicative weights update method: a meta-algorithm and applications
• The power of quantum systems on a line
• The power of unentanglement

Cited in

(2)

• Epsilon-net method for optimizations over separable states
• A quasipolynomial-time algorithm for the quantum separability problem

This page was built for publication: Epsilon-net method for optimizations over separable states

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496030)