Consumable data via quantum communication

DOI10.4230/LIPICS.APPROX/RANDOM.2025.39MaRDI QIDQ7346869zbMATH OpenFDO

Authors Dar Gilboa, Siddhartha Jain, Jarrod R. McClean

Publication date 11 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2025.39

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cites work

• A compressed classical description of quantum states
• A direct product theorem for one-way quantum communication
• Adiabatic quantum state generation and statistical zero knowledge
• Direct products in communication complexity
• Exponential separation of quantum and classical communication complexity
• Exponential Separation of Quantum and Classical One-Way Communication Complexity
• Exponential separations between learning with and without quantum memory
• Gentle measurement of quantum states and differential privacy
• Hidden cosets and applications to unclonable cryptography
• scientific article; zbMATH DE number 3825698 (Why is no real title available?)
• scientific article; zbMATH DE number 1406113 (Why is no real title available?)
• scientific article; zbMATH DE number 3307201 (Why is no real title available?)
• Improved Quantum data analysis
• Lower bounds in communication complexity
• Multiparty computation with low communication, computation and interaction via threshold FHE
• New approaches for quantum copy-protection
• One-Time Programs
• Optimal lower bounds for quantum automata and random access codes
• Pseudorandom quantum states
• Quantum advantage in learning from experiments
• Quantum communication complexity of linear regression
• Quantum computation and quantum information. 10th anniversary edition
• Quantum encryption with certified deletion
• Quantum one-time programs. (Extended abstract)
• Quantum one-way communication can be exponentially stronger than classical communication
• Shadow tomography of quantum states
• Strong direct product theorems for quantum communication and query complexity
• The algorithmic foundations of differential privacy
• The round complexity of verifiable secret sharing and secure multicast
• Towards proving strong direct product theorems
• Twenty lectures on algorithmic game theory
• Two-party direct-sum questions through the lens of multiparty communication complexity

This page was built for publication: Consumable data via quantum communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346869)