Epsilon-net method for optimizations over separable states

DOI10.1016/j.tcs.2015.03.031zbMath1329.68121OpenAlexW1977466875MaRDI QIDQ496030

Xiaodi Wu, Yaoyun Shi

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)

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
• Parallel approximation of min-max problems
• An improved semidefinite programming hierarchy for testing entanglement
• Quantum Arthur-Merlin games
• The power of quantum systems on a line
• Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
• Geometric algorithms and combinatorial optimization.
• Classical complexity and quantum entanglement
• Quantum interactive proofs and the complexity of separability testing
• Quantum entanglement
• Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
• On Relating Time and Space to Size and Depth
• Online Variance Minimization
• Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization
• A quasipolynomial-time algorithm for the quantum separability problem
• The Complexity of the Local Hamiltonian Problem
• Minimax Theorems

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