Abstract
In this work we are interested in 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 = \varOmega (d^2/\epsilon ^2)\) copies are necessary to test separability, assuming \(\epsilon \) is not too small, viz. \(\epsilon = \varOmega (1/\sqrt{d})\).
We also study completely positive distributions on the grid \([d] \times [d]\), as a classical analogue of separable states. We analogously prove that \(\varOmega (d/\epsilon ^2)\) samples from an unknown distribution p are necessary to decide whether p is completely positive or \(\epsilon \)-far from all completely positive distributions in total variation distance.
Supported by NSF grant FET-1909310. This material is based upon work supported by the National Science Foundation under grant numbers listed above. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author and do not necessarily reflect the views of the National Science Foundation (NSF).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Note that d in [13] corresponds to \(d^2\) in the present paper.
References
Aubrun, G., Szarek, S.: Alice and Bob Meet Banach. American Mathematical Society, Providence (2017)
Aubrun, G., Szarek, S.: Dvoretzky’s theorem and the complexity of entanglement detection. Discr. Anal. 1–20 (2017)
Diaconis, P.: Finite forms of de Finetti’s theorem on exchangeability. Synthese 36(2), 271–281 (1977). https://doi.org/10.1007/BF00486116
Doherty, A.C., Parrilo, P.A., Spedalieri, F.M.: Complete family of separability criteria. Phys. Rev. A 69(2), 022308 (2004)
Gärtner, B., Matoušek, J.: Approximation Algorithms and Semidefinite Programming. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-22015-9
Gühne, O., Tóth, G.: Entanglement detection. Phys. Rep. 474(1–6), 1–75 (2009)
Gurvits, L.: Classical complexity and quantum entanglement. J. Comput. Syst. Sci. 69(3), 448–484 (2004)
Gurvits, L., Barnum, H.: Largest separable balls around the maximally mixed bipartite quantum state. Phys. Rev. A 66(6), 062311 (2002)
Haah, J., Harrow, A.W., Ji, Z., Wu, X., Yu, N.: Sample-optimal tomography of quantum states. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016. ACM Press (2016)
Horodecki, R., Horodecki, P., Horodecki, M., Horodecki, K.: Quantum entanglement. Rev. Mod. Phys. 81(2), 865–942 (2009)
Maxfield, J.E., Minc, H.: On the matrix equation \(X^{\prime }X = A\). In: Proceedings of the Edinburgh Mathematical Society, vol. 13, no. 02, p. 125 (1962)
Montanaro, A., de Wolf, R.: A survey of quantum property testing. Theory Comput. 1(1), 1–81 (2016)
O’Donnell, R., Wright, J.: Quantum spectrum testing. In: Proceedings of the 47th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2015. ACM Press (2015)
O’Donnell, R., Wright, J.: Efficient quantum tomography. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016. ACM Press (2016)
Paninski, L.: A coincidence-based test for uniformity given very sparsely sampled discrete data. IEEE Trans. Inf. Theory 54(10), 4750–4755 (2008)
Wainwright, M.J.: High-Dimensional Statistics. Cambridge University Press, Cambridge (2019)
Watrous, J.: The Theory of Quantum Information. Cambridge University Press, Cambridge (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Bădescu, C., O’Donnell, R. (2020). Lower Bounds for Testing Complete Positivity and Quantum Separability. In: Kohayakawa, Y., Miyazawa, F.K. (eds) LATIN 2020: Theoretical Informatics. LATIN 2021. Lecture Notes in Computer Science(), vol 12118. Springer, Cham. https://doi.org/10.1007/978-3-030-61792-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-030-61792-9_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-61791-2
Online ISBN: 978-3-030-61792-9
eBook Packages: Computer ScienceComputer Science (R0)