Deciding separability with a fixed error
David Perez-Garcia
Abstract
We give a short proof of the cross norm characterization of separability due to O. Rudolph and show how its computation, for a fixed chosen error, can be reduced to a linear programming problem whose dimension grows polynomially with the inverse of the error.
Create a lesson
Related papers
An entangling Hubbard quasiparticle collider on a digital quantum processor
Chan Bin Bark, Hanbyul Kim, Yoonil Koo et al.
A Warped Born Rule Turns an Observer into a Maxwell's Demon
Olumakinde Ogunnaike
A scalable sample-based quantum diagonalization solver for general Pauli-sum Hamiltonians
Yutaro Iiyama
Quantum Query Complexity of Maximum Degree and its Generalizations
Amin Shiraz Gilani, Nikhil S. Mande, Subhasree Patro et al.
Maximally antiflat fixed-particle-number fermionic states
Rahul Gupta, Arya Haghighian, James D. Whitfield
An Annealing-based Quantum Neural Network with Discrete Wavelet Transforms for Enhanced Air Pollution Nowcasting
Otto Menegasso Pires, André Saimon, Daniela Herrmann et al.