Quantum advantage for probabilistic one-time programs

TL;DR

This paper demonstrates that quantum mechanics can enhance the security of probabilistic one-time programs, enabling functionalities like logic gates and digital signatures through experimental quantum encoding.

Contribution

It introduces a scheme for probabilistic one-time programs using quantum states, showing security advantages over classical methods and experimental realizations.

Findings

Quantum encoding enables secure one-time programs with error tolerance.

Experimental demonstration of quantum one-time programs for logic gates and digital signatures.

Quantum techniques can augment classical computing capabilities before full quantum computers are available.

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.