Impossibility of adversarial self-testing and secure sampling
Self-testing is the task where spatially separated Alice and Bob cooperate to deduce the inner workings of untrusted quantum devices by interacting with them in a classical manner. We examine the task above where Alice and Bob do not trust each other which we call adversarial self-testing. We show that adversarial self-testing implies secure sampling—a simpler task that we introduce where distrustful Alice and Bob wish to sample from a joint probability distribution with the guarantee that an honest party's marginal is not biased. By extending impossibility results in two-party quantum cryptography, we give a simple proof that both of these tasks are impossible in all but trivial settings. Published by the American Physical Society 2024
Authors
- Akshay Bansal (ORCID: https://orcid.org/0000-0001-9874-3379)
- Atul Singh Arora (ORCID: https://orcid.org/0000-0003-4696-1125)
- Thomas van Himbeeck (ORCID: https://orcid.org/0000-0001-7903-7516)
- Jamie Sikora (ORCID: https://orcid.org/0000-0001-8203-9133)
Institutions
- California Institute of Technology (US)
- Télécom Paris (FR)
- Park University (US)
- Joint Center for Quantum Information and Computer Science (US)
- University of Maryland, College Park (US)
- Virginia Tech (US)
Publication Details
- Journal
- Physical Review Research
- Published
- 2024-08-21
- DOI
- https://doi.org/10.1103/physrevresearch.6.l032039
- Primary Topic
- Adversarial Robustness in Machine Learning
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation
- U.S. Department of Defense
- Gordon and Betty Moore Foundation
- Virginia Polytechnic Institute and State University
- European Commission
- Multidisciplinary University Research Initiative
- Simons Institute for the Theory of Computing, University of California Berkeley
- Institute for Quantum Information and Matter, California Institute of Technology
- HORIZON EUROPE Framework Programme