Document Open Access Logo

Consumable Data via Quantum Communication

Authors Dar Gilboa, Siddhartha Jain , Jarrod R. McClean

PDF

File

Thumbnail PDF
PDF
LIPIcs.APPROX-RANDOM.2025.39.pdf
  • Filesize: 0.8 MB
  • 23 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Communication complexity
  • Theory of computation → Quantum complexity theory
  • Theory of computation → Computational pricing and auctions
  • Security and privacy → Information-theoretic techniques
Keywords
  • quantum communication
  • one-time programs
  • data markets

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Classical data can be copied and re-used for computation, with adverse consequences economically and in terms of data privacy. Motivated by this, we formulate problems in one-way communication complexity where Alice holds some data x and Bob holds m inputs y_1, …, y_m. They want to compute m instances of a bipartite relation R(⋅,⋅) on every pair (x, y_1), …, (x, y_m). We call this the asymmetric direct sum question for one-way communication. We give examples where the quantum communication complexity of such problems scales polynomially with m, while the classical communication complexity depends at most logarithmically on m. Thus, for such problems, data behaves like a consumable resource that is effectively destroyed upon use when the owner stores and transmits it as quantum states, but not when transmitted classically. We show an application to a strategic data-selling game, and discuss other potential economic implications.

Cite As Get BibTex

Dar Gilboa, Siddhartha Jain, and Jarrod R. McClean. Consumable Data via Quantum Communication. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 353, pp. 39:1-39:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2025.39

Author Details

Dar Gilboa
  • Google Quantum AI, Venice, CA, USA
Siddhartha Jain
  • Google Quantum AI, Venice, CA, USA
  • University of Texas at Austin, TX, USA
Jarrod R. McClean
  • Google Quantum AI, Venice, CA, USA

Funding

  • Jain, Siddhartha: Partially supported by Scott Aaronson’s CIQC grant.

Acknowledgements

The authors thank Scott Aaronson, Dmytro Gavinsky, and Or Sattath for insightful discussions and comments on the manuscript.

References

  1. Scott Aaronson. Quantum copy-protection and quantum money. In 24th Annual IEEE Conference on Computational Complexity, pages 229-242. IEEE Computer Soc., Los Alamitos, CA, 2009. URL: https://doi.org/10.1109/CCC.2009.42.
  2. Scott Aaronson. Shadow tomography of quantum states. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pages 325-338, New York, NY, USA, 2018. ACM. URL: https://doi.org/10.1145/3188745.3188802.
  3. Scott Aaronson, Jiahui Liu, Qipeng Liu, Mark Zhandry, and Ruizhe Zhang. New approaches for quantum copy-protection. In Advances in cryptology - CRYPTO 2021. Part I, volume 12825 of Lecture Notes in Comput. Sci., pages 526-555. Springer, Cham, 2021. URL: https://doi.org/10.1007/978-3-030-84242-0_19.
  4. Scott Aaronson and Guy N Rothblum. Gentle measurement of quantum states and differential privacy. In STOC'19 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 322-333. ACM, New York, 2019. URL: https://doi.org/10.1145/3313276.3316378.
  5. Anish Agarwal, Munther Dahleh, and Tuhin Sarkar. A marketplace for data: An algorithmic solution. In Proceedings of the 2019 ACM Conference on Economics and Computation, New York, NY, USA, 2019. ACM. URL: https://doi.org/10.1145/3328526.3329589.
  6. Dorit Aharonov and Amnon Ta-Shma. Adiabatic quantum state generation and statistical zero knowledge. In Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pages 20-29. ACM, New York, 2003. URL: https://doi.org/10.1145/780542.780546.
  7. Kenneth J Arrow. An extension of the basic theorems of classical welfare economics. In Proceedings of the second Berkeley symposium on mathematical statistics and probability, volume 2, pages 507-533, 1951. Google Scholar
  8. Kenneth J Arrow. Economic welfare and the allocation of resources for invention. In The Rate and Direction of Inventive Activity, pages 609-626. Princeton University Press, Princeton, 1962. Google Scholar
  9. Gilad Asharov, Abhishek Jain, Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan, and Daniel Wichs. Multiparty computation with low communication, computation and interaction via threshold FHE. In Advances in Cryptology - EUROCRYPT 2012, Lecture notes in computer science, pages 483-501. Springer Berlin Heidelberg, Berlin, Heidelberg, 2012. URL: https://doi.org/10.1007/978-3-642-29011-4_29.
  10. Ziv Bar-Yossef, T S Jayram, and Iordanis Kerenidis. Exponential separation of quantum and classical one-way communication complexity. SIAM J. Comput., 38(1):366-384, 2008. URL: https://doi.org/10.1137/060651835.
  11. Shalev Ben-David and Or Sattath. Quantum Tokens for Digital Signatures. Quantum, 7:901, January 2023. URL: https://doi.org/10.22331/q-2023-01-19-901.
  12. Mark Braverman, Anup Rao, Omri Weinstein, and Amir Yehudayoff. Direct products in communication complexity. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pages 746-755. IEEE, 2013. URL: https://doi.org/10.1109/FOCS.2013.85.
  13. Anne Broadbent, Gus Gutoski, and Douglas Stebila. Quantum one-time programs (extended abstract). In Advances in cryptology - CRYPTO 2013. Part II, volume 8043 of Lecture Notes in Comput. Sci., pages 344-360. Springer, Heidelberg, 2013. URL: https://doi.org/10.1007/978-3-642-40084-1_20.
  14. Anne Broadbent and Rabib Islam. Quantum encryption with certified deletion. In Theory of cryptography. Part III, volume 12552 of Lecture Notes in Comput. Sci., pages 92-122. Springer, Cham, 2020. URL: https://doi.org/10.1007/978-3-030-64381-2_4.
  15. Tom Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared D Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, Sandhini Agarwal, Ariel Herbert-Voss, Gretchen Krueger, Tom Henighan, Rewon Child, Aditya Ramesh, Daniel Ziegler, Jeffrey Wu, Clemens Winter, Chris Hesse, Mark Chen, Eric Sigler, Mateusz Litwin, Scott Gray, Benjamin Chess, Jack Clark, Christopher Berner, Sam McCandlish, Alec Radford, Ilya Sutskever, and Dario Amodei. Language models are few-shot learners. Advances in Neural Information Processing Systems, 33:1877-1901, 2020. Google Scholar
  16. Costin Bădescu and Ryan O'Donnell. Improved quantum data analysis. In STOC '21 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 1398-1411. ACM, New York, 2021. Google Scholar
  17. Clément L. Canonne. A short note on learning discrete distributions, 2020. URL: https://arxiv.org/abs/2002.11457.
  18. Rohit Chatterjee, Srijita Kundu, and Supartha Podder. Are uncloneable proof and advice states strictly necessary? In STOC'25 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing. ACM, New York, 2025. Google Scholar
  19. Mark Chen, Jerry Tworek, Heewoo Jun, Qiming Yuan, Henrique Ponde de Oliveira Pinto, Jared Kaplan, Harri Edwards, Yuri Burda, Nicholas Joseph, Greg Brockman, Alex Ray, Raul Puri, Gretchen Krueger, Michael Petrov, Heidy Khlaaf, Girish Sastry, Pamela Mishkin, Brooke Chan, Scott Gray, Nick Ryder, Mikhail Pavlov, Alethea Power, Lukasz Kaiser, Mohammad Bavarian, Clemens Winter, Philippe Tillet, Felipe Petroski Such, Dave Cummings, Matthias Plappert, Fotios Chantzis, Elizabeth Barnes, Ariel Herbert-Voss, William Hebgen Guss, Alex Nichol, Alex Paino, Nikolas Tezak, Jie Tang, Igor Babuschkin, Suchir Balaji, Shantanu Jain, William Saunders, Christopher Hesse, Andrew N Carr, Jan Leike, Josh Achiam, Vedant Misra, Evan Morikawa, Alec Radford, Matthew Knight, Miles Brundage, Mira Murati, Katie Mayer, Peter Welinder, Bob McGrew, Dario Amodei, Sam McCandlish, Ilya Sutskever, and Wojciech Zaremba. Evaluating large language models trained on code. arXiv [cs.LG], 2021. URL: https://arxiv.org/abs/2107.03374.
  20. Sitan Chen, Jordan Cotler, Hsin-Yuan Huang, and Jerry Li. Exponential separations between learning with and without quantum memory. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science - FOCS 2021, pages 574-585. IEEE Computer Soc., Los Alamitos, CA, 2022. Google Scholar
  21. Richard Cleve, Wim van Dam, Michael Nielsen, and Alain Tapp. Quantum entanglement and the communication complexity of the inner product function. In Quantum computing and quantum communications (Palm Springs, CA, 1998), volume 1509 of Lecture Notes in Comput. Sci., pages 61-74. Springer, Berlin, 1999. URL: https://doi.org/10.1007/3-540-49208-9_4.
  22. Andrea Coladangelo, Jiahui Liu, Qipeng Liu, and Mark Zhandry. Hidden cosets and applications to unclonable cryptography. In Advances in Cryptology – CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part I, pages 556-584, Berlin, Heidelberg, 2021. Springer-Verlag. URL: https://doi.org/10.1007/978-3-030-84242-0_20.
  23. Gerard Debreu. Theory of value: An axiomatic analysis of economic equilibrium, volume 17. Yale University Press, 1959. Google Scholar
  24. Cynthia Dwork and Aaron Roth. The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci., 9(3-4):211-407, 2014. URL: https://doi.org/10.1561/0400000042.
  25. David Evans, Vladimir Kolesnikov, and Mike Rosulek. A pragmatic introduction to secure multi-party computation. Found. Trends® Priv. Secur., 2(2-3):70-246, 2018. URL: https://doi.org/10.1561/3300000019.
  26. Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, and Tal Rabin. The round complexity of verifiable secret sharing and secure multicast. In Proceedings of the thirty-third annual ACM symposium on Theory of computing, New York, NY, USA, 2001. ACM. URL: https://doi.org/10.1145/380752.380853.
  27. O Goldreich, S Micali, and A Wigderson. How to play ANY mental game. In Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87, New York, New York, USA, 1987. ACM Press. Google Scholar
  28. Shafi Goldwasser, Yael Tauman Kalai, and Guy N Rothblum. One-Time programs. In Lecture Notes in Computer Science, Lecture notes in computer science, pages 39-56. Springer Berlin Heidelberg, Berlin, Heidelberg, 2008. URL: https://doi.org/10.1007/978-3-540-85174-5_3.
  29. Weiyuan Gong and Scott Aaronson. Learning distributions over quantum measurement outcomes. In Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, and Jonathan Scarlett, editors, Proceedings of the 40th International Conference on Machine Learning, volume 202 of Proceedings of Machine Learning Research, pages 11598-11613. PMLR, 23-29 July 2023. URL: https://proceedings.mlr.press/v202/gong23a.html.
  30. David Gosset and John Smolin. A compressed classical description of quantum states. In 14th Conference on the Theory of Quantum Computation, Communication and Cryptography, volume 135 of LIPIcs (Leibniz Int. Proc. Inform.), pages 8:1-8:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPIcs.TQC.2019.8.
  31. Sam Gunn and Ramis Movassagh. Quantum one-time protection of any randomized algorithm. Cryptology ePrint Archive, Paper 2024/1798, 2024. URL: https://eprint.iacr.org/2024/1798.
  32. Aparna Gupte, Jiahui Liu, Justin Raizes, Bhaskar Roberts, and Vinod Vaikuntanathan. Quantum one-time programs, revisited. Cryptology ePrint Archive, Paper 2024/1934, 2024. URL: https://eprint.iacr.org/2024/1934.
  33. Itay Hazan and Eyal Kushilevitz. Two-party direct-sum questions through the lens of multiparty communication complexity. In 31 International Symposium on Distributed Computing, volume 91 of LIPIcs (Leibniz Int. Proc. Inform.), pages 26:1-26:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPIcs.DISC.2017.26.
  34. Hsin-Yuan Huang, Michael Broughton, Jordan Cotler, Sitan Chen, Jerry Li, Masoud Mohseni, Hartmut Neven, Ryan Babbush, Richard Kueng, John Preskill, and Jarrod R McClean. Quantum advantage in learning from experiments. Science, 376(6598):1182-1186, 2022. Google Scholar
  35. Hsin-Yuan Huang, Richard Kueng, and John Preskill. Predicting many properties of a quantum system from very few measurements. Nature Physics, 16(10):1050-1057, 2020. Google Scholar
  36. Rahul Jain and Srijita Kundu. A direct product theorem for one-way quantum communication. In 36th Computational Complexity Conference, volume 200 of LIPIcs (Leibniz Int. Proc. Inform.), pages 27:1-27:28. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.CCC.2021.27.
  37. Zhengfeng Ji, Yi-Kai Liu, and Fang Song. Pseudorandom quantum states. In Lecture Notes in Computer Science, Lecture notes in computer science, pages 126-152. Springer International Publishing, Cham, 2018. URL: https://doi.org/10.1007/978-3-319-96878-0_5.
  38. Charles I Jones and Christopher Tonetti. Nonrivalry and the economics of data. Am. Econ. Rev., 110(9):2819-2858, 2020. Google Scholar
  39. Ilan Kremer. Quantum communication. PhD thesis, Hebrew University of Jerusalem, 1995. Google Scholar
  40. Vijay Krishna. Auction Theory. Academic Press, San Diego, CA, 2 edition, 2009. Google Scholar
  41. Heinz D Kurz and Neri Salvadori. Theory of Production: A Long-Period Analysis. Cambridge University Press, 1995. Google Scholar
  42. Eyal Kushilevitz and Noam Nisan. Communication Complexity. Cambridge University Press, 1996. Google Scholar
  43. Troy Lee and Adi Shraibman. Lower bounds in communication complexity. Foundations and Trends® in Theoretical Computer Science, 3(4):263-399, 2009. URL: https://doi.org/10.1561/0400000040.
  44. Troy Lee, Adi Shraibman, and Robert Spalek. A direct product theorem for discrepancy. In 2008 23rd Annual IEEE Conference on Computational Complexity, pages 71-80. IEEE, 2008. URL: https://doi.org/10.1109/CCC.2008.25.
  45. Amil Merchant, Simon Batzner, Samuel S Schoenholz, Muratahan Aykol, Gowoon Cheon, and Ekin Dogus Cubuk. Scaling deep learning for materials discovery. Nature, 624(7990):80-85, 2023. URL: https://doi.org/10.1038/S41586-023-06735-9.
  46. Ashley Montanaro and Changpeng Shao. Quantum communication complexity of linear regression. ACM Trans. Comput. Theory, 16(1):Art. 1, 30, 2024. Google Scholar
  47. S Nageeb Ali, Ayal Chen-Zion, and Erik Lillethun. Reselling information. arXiv [cs.GT], 2020. URL: https://arxiv.org/abs/2004.01788.
  48. Ashwin Nayak. Optimal lower bounds for quantum automata and random access codes. In 40th Annual Symposium on Foundations of Computer Science (New York, 1999), pages 369-376. IEEE Computer Soc., Los Alamitos, CA, 1999. URL: https://doi.org/10.1109/SFFCS.1999.814608.
  49. Michael A Nielsen and Isaac L Chuang. Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, 2010. Google Scholar
  50. Ran Raz. Exponential separation of quantum and classical communication complexity. In Proceedings of the thirty-first annual ACM symposium on Theory of Computing, STOC '99, pages 358-367, New York, NY, USA, 1999. Association for Computing Machinery. URL: https://doi.org/10.1145/301250.301343.
  51. Oded Regev and Bo'az Klartag. Quantum one-way communication can be exponentially stronger than classical communication. In Proceedings of the forty-third annual ACM symposium on Theory of computing, New York, NY, USA, 2011. ACM. URL: https://doi.org/10.1145/1993636.1993642.
  52. Paul M Romer. Endogenous technological change. J. Polit. Econ., 98(5):S71-S102, 1990. Google Scholar
  53. Tim Roughgarden. Twenty lectures on algorithmic game theory. Cambridge University Press, Cambridge, England, 2016. Google Scholar
  54. Joseph A Schumpeter. Capitalism, Socialism, and Democracy. Harper & Brothers, New York, 1942. Google Scholar
  55. Ronen Shaltiel. Towards proving strong direct product theorems. Comput. Complex., 12(1-2):1-22, 2003. URL: https://doi.org/10.1007/S00037-003-0175-X.
  56. Alexander A Sherstov. Strong direct product theorems for quantum communication and query complexity. In Proceedings of the forty-third annual ACM symposium on Theory of computing, New York, NY, USA, 2011. ACM. URL: https://doi.org/10.1145/1993636.1993643.
  57. Pablo Villalobos, Jaime Sevilla, Lennart Heim, Tamay Besiroglu, Marius Hobbhahn, and Anson Ho. Will we run out of data? an analysis of the limits of scaling datasets in machine learning. arXiv [cs.LG], 2022. URL: https://arxiv.org/abs/2211.04325.
  58. Stephen Wiesner. Conjugate coding. SIGACT News, 15(1):78-88, 1983. URL: https://doi.org/10.1145/1008908.1008920.
  59. Andrew C Yao. Protocols for secure computations. In 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), pages 160-164. IEEE, 1982. Google Scholar
  60. Andrew Chi-Chih Yao. How to generate and exchange secrets. In 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pages 162-167. IEEE, 1986. Google Scholar
  61. Haimeng Zhao, Laura Lewis, Ishaan Kannan, Yihui Quek, Hsin-Yuan Huang, and Matthias C Caro. Learning quantum states and unitaries of bounded gate complexity. arXiv [quant-ph], 2023. URL: https://arxiv.org/abs/2310.19882.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact