With the power of quantum information, we can achieve exciting and classically impossible cryptographic primitives. However, almost all quantum cryptography faces extreme difficulties with the near-term intermediate-scale quantum technology (NISQ technology); namely, the short lifespan of quantum states and limited sequential computation. At the same time, considering only limited quantum adversaries may still enable us to achieve never-before-possible tasks. In this work, we consider quantum cryptographic primitives against limited quantum adversaries - depth-bounded adversaries. We introduce a model for (depth-bounded) NISQ computers, which are classical circuits interleaved with shallow quantum circuits. Then, we show one-time memory can be achieved against any depth-bounded quantum adversaries introduced in the work, with their depth being any pre-fixed polynomial. Therefore we obtain applications like one-time programs and one-time proofs. Finally, we show our one-time memory has correctness even against constant-rate errors.
@InProceedings{liu:LIPIcs.ITCS.2023.82, author = {Liu, Qipeng}, title = {{Depth-Bounded Quantum Cryptography with Applications to One-Time Memory and More}}, booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)}, pages = {82:1--82:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-263-1}, ISSN = {1868-8969}, year = {2023}, volume = {251}, editor = {Tauman Kalai, Yael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.82}, URN = {urn:nbn:de:0030-drops-175859}, doi = {10.4230/LIPIcs.ITCS.2023.82}, annote = {Keywords: cryptographic protocol, one-time memory, quantum cryptography} }
Feedback for Dagstuhl Publishing