Epsilon-net method for optimizations over separable states
From MaRDI portal
Recommendations
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)
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)
