Abstract
For the \(l_{1}\) norm of coherence, what is the relation between the coherence of a state and the individual terms that by superposition yield the state? We find upper bounds on the coherence change before and after the superposition. When every term comes from one Hilbert subspace, the upper bound is the number of terms in the superpositions minus one. However, when the terms have support on orthogonal subspaces, the coherence of the superposition cannot be more the double of the above upper bound than the average of the coherence of the all terms being superposed.
Similar content being viewed by others
References
Horodecki, R., Horodecki, P., Horodecki, M., Horodecki, K.: Quantum entanglement. Rev. Mod. Phys. 81, 865 (2009)
Modi, K., Brodutch, A., Cable, H., Paterek, T., Vedral, V.: The classical-quantum boundary for correlations: discord and related measures. Rev. Mod. Phys. 84, 1655 (2012)
Brunner, N., Cavalcanti, D., Pironio, S., Scarani, V., Wehner, S.: Bell nonlocality. Rev. Mod. Phys. 86, 419 (2014)
Napoli, C., Bromley, T.R., Cianciaruso, M., Piani, M., Johnston, N., Adesso, G.: Robustness of coherence: an operational and observable measure of quantum coherence. Phys. Rev. Lett. 116, 150502 (2016)
Baumgratz, T., Cramer, M., Plenio, M.B.: Quantifying coherence. Phys. Rev. Lett. 113, 140401 (2014)
Winter, A., Yang, D.: Operational resource theory of coherence. Phys. Rev. Lett. 116, 120404 (2016)
Bagan, E., Bergou, J.A., Cottrell, S.S., Hillery, M.: Relations between coherence and path information. Phys. Rev. Lett. 116, 160406 (2016)
Linden, N., Popescu, S., Smolin, J.A.: Entanglement of superpositions. Phys. Rev. Lett. 97, 100502 (2006)
Yue, Q. L., Liu, F., Yu, C. H., Wang, X. L., Gao, F., Wen, Q. Y.: Coherence of superpositions. arXiv:1605.04067 (2016)
Anderson, B., Kasevich, M.A.: Macroscopic quantum interference from atomic tunnel arrays. Science 282, 1686 (1998)
Wineland, D.J.: Nobel lecture: superposition, entanglement, and raising Schrödinger’s cat. Rev. Mod. Phys. 85, 1103 (2013)
Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484 (1997)
Grover, L. K.: A fast mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (ACM, New York), p. 212 (1996)
Gisin, N., Ribordy, G., Tittel, W., Zbinden, H.: Quantum cryptography. Rev. Mod. Phys. 74, 145 (2002)
Oszmaniec, M., Grudka, A., Horodecki, M., Wójcik, A.: Creating a superposition of unknown quantum states. Phys. Rev. Lett. 116, 110403 (2016)
Alvarez-Rodriguez, U., Sanz, M., Lamata, L., Solano, E.: The forbidden quantum adder. Sci. Rep. 5, 11983 (2015)
Acknowledgments
This work is supported by NSFC (Grant No. 61202475) and Shandong Provincial Natural Science Foundation, China (Grant No. ZR2015FQ006).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, F., Li, F. The number of terms in the superpositions upper bounds the amount of the coherence change. Quantum Inf Process 15, 4203–4209 (2016). https://doi.org/10.1007/s11128-016-1399-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11128-016-1399-4