Quantum advantage for probabilistic one-time programs
Abstract
One-time programs, computer programs which self-destruct after being run only once, are a powerful building block in cryptography and would allow for new forms of secure software distribution. However, ideal one-time programs have been proved to be unachievable using either classical or quantum resources. Here we relax the definition of one-time programs to allow some probability of error in the output and show that quantum mechanics offers security advantages over purely classical resources. We introduce a scheme for encoding probabilistic one-time programs as quantum states with prescribed measurement settings, explore their security, and experimentally demonstrate various one-time programs using measurements on single-photon states. These include classical logic gates, a program to solve Yao's millionaires problem, and a one-time delegation of a digital signature. By combining quantum and classical technology, we demonstrate that quantum techniques can enhance computing capabilities even before full-scale quantum computers are available.
Cite
@article{arxiv.1709.09724,
title = {Quantum advantage for probabilistic one-time programs},
author = {Marie-Christine Roehsner and Joshua A. Kettlewell and Tiago B. Batalhão and Joseph F. Fitzsimons and Philip Walther},
journal= {arXiv preprint arXiv:1709.09724},
year = {2019}
}