Simple Information Processing Tasks with Unbounded Quantum Advantage (2308.07727v4)
Abstract: Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of the system. We show that already in the simplest possible scenarios it is possible to detect a definite, unbounded advantage of quantum systems over classical systems. We do this by constructing a family of operationally meaningful communication tasks each of which on one hand can be implemented by using just a single qubit but which on the other hand require unboundedly larger classical system for classical implementation. Furthemore, we show that even though with the additional resource of shared randomness the proposed communication tasks can be implemented by both quantum and classical systems of the same size, the number of coordinated actions needed for the classical implementation also grows unboundedly. In particular, no finite storage can be used to store all the coordinated actions needed to implement all the possible quantum communication tasks with classical systems. As a consequence, shared randomness cannot be viewed as a free resource.
- J. Preskill, Quantum computing in the NISQ era and beyond, Quantum 2, 79 (2018).
- B. F. Toner and D. Bacon, Communication cost of simulating bell correlations, Phys. Rev. Lett. 91, 187904 (2003).
- M. J. Renner, A. Tavakoli, and M. T. Quintino, Classical cost of transmitting a qubit, Phys. Rev. Lett. 130, 120801 (2023).
- C. Perry, R. Jain, and J. Oppenheim, Communication tasks with infinite quantum-classical separation, Phys. Rev. Lett. 115, 030504 (2015).
- R. Chaves, J. B. Brask, and N. Brunner, Device-independent tests of entropy, Phys. Rev. Lett. 115, 110501 (2015).
- P.-E. Emeriau, M. Howard, and S. Mansfield, Quantum advantage in information retrieval, PRX Quantum 3, 020307 (2022).
- E. F. Galvão and L. Hardy, Substituting a qubit for an arbitrarily large number of classical bits, Phys. Rev. Lett. 90, 087902 (2003).
- S. Halder, A. Streltsov, and M. Banik, Quantum vs classical: identifying the value of a random variable unambiguously, arXiv:2211.09194 (2022).
- Z. Bar-Yossef, T. S. Jayram, and I. Kerenidis, Exponential separation of quantum and classical one-way communication complexity, SIAM Journal on Computing 38, 366 (2008).
- S. Aaronson, Limitations of quantum advice and one-way communication, Theory of Computing 1, 1 (2005).
- P. E. Frenkel and M. Weiner, Classical information storage in an n-level quantum system, Commun. Math. Phys. 340, 563 (2015).
- T. Heinosaari, O. Kerppo, and L. Leppäjärvi, Communication tasks in operational theories, J. Phys. A: Math. Theor. 53, 435302 (2020).
- T. Heinosaari and O. Kerppo, Communication of partial ignorance with qubits, J. Phys. A: Math. Theor. 52, 395301 (2019).
- A. S. Holevo, Bounds for the quantity of information transmitted by a quantum communication channel, Probl. Peredachi Inf. 9, 3 (1973).
- O. Kerppo, Quantum communication tasks, Ph.D. thesis (University of Turku, 2023).
- T. Lee, Z. Wei, and R. de Wolf, Some upper and lower bounds on psd-rank, Math. Program. 162, 495 (2017).
- Y. Shitov, The complexity of positive semidefinite matrix factorization, SIAM J. Optim. 27, 18981909 (2016).
- S. Vavasis, On the complexity of nonnegative matrix factorization, SIAM J. Optim. 20, 1364 (2009).
- N. Gillis and F. Glineur, On the geometric interpretation of the nonnegative rank, Linear Algebra Appl. 437, 2685 (2012).
- Y. Shitov, An upper bound for nonnegative rank, Journal of Combinatorial Theory, Series A 122, 126 (2014).
- P. Hrubeš, On the nonnegative rank of distance matrices, Inf. Process. Lett 112, 457 (2012).
- T. Heinosaari and O. Kerppo, Antidistinguishability of pure quantum states, J. Phys. A: Math. Theor. 51, 365303 (2018).
- C. M. Caves, C. A. Fuchs, and R. Schack, Conditions for compatibility of quantum-state assignments, Phys. Rev. A 66, 062111 (2002).
- V. Havlíček and J. Barrett, Simple communication complexity separation from quantum state antidistinguishability, Phys. Rev. Research 2, 013326 (2020).
- V. Russo and J. Sikora, Inner products of pure states and their antidistinguishability, Phys. Rev. A 107, L030202 (2023).
- M. F. Pusey, J. Barrett, and T. Rudolph, On the reality of the quantum state, Nature Physics 8, 475 (2012).
- M. S. Leifer and C. Duarte, Noncontextuality inequalities from antidistinguishability, Phys. Rev. A 101, 062113 (2020).
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.