Corpus ID: 146120702

Lower bounds for testing complete positivity and quantum separability

@article{Buadescu2019LowerBF,
  title={Lower bounds for testing complete positivity and quantum separability},
  author={Costin Buadescu and R. O'Donnell},
  journal={arXiv: Quantum Physics},
  year={2019}
}
  • Costin Buadescu, R. O'Donnell
  • Published 2019
  • Physics, Mathematics
  • arXiv: Quantum Physics
  • In this work we are interested the problem of testing quantum entanglement. More specifically, we study the separability problem in quantum property testing, where one is given $n$ copies of an unknown mixed quantum state $\varrho$ on $\mathbb{C}^d \otimes \mathbb{C}^d$, and one wants to test whether $\varrho$ is separable or $\epsilon$-far from all separable states in trace distance. We prove that $n = \Omega(d^2/\epsilon^2)$ copies are necessary to test separability, assuming $\epsilon$ is… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 16 REFERENCES
    Complete family of separability criteria
    • 232
    • Open Access
    Classical complexity and quantum entanglement
    • 170
    • Open Access
    Sample-Optimal Tomography of Quantum States
    • 71
    • Open Access
    Quantum Spectrum Testing
    • 34
    • Open Access
    A Survey of Quantum Property Testing
    • 77
    • Open Access
    Efficient quantum tomography
    • 54
    • Open Access
    Dvoretzky's theorem and the complexity of entanglement detection
    • 6
    • Open Access
    Approximation Algorithms and Semidefinite Programming
    • 114
    • Open Access
    A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data
    • 192
    • Open Access