Fault tolerant quantum data locking

Abstract

Quantum data locking is a quantum communication primitive that allows the use of a short secret key to encrypt a much longer message. It guarantees information-theoretical security against an adversary with limited quantum memory. Here we present a quantum data locking protocol that employs pseudo-random circuits consisting of Clifford gates only, which are much easier to implement fault tolerantly than universal gates. We show that information can be encrypted into $n$-qubit code words using order $n-H_{\min }(\mathsf{X})$ secret bits, where $H_{\min }(\mathsf{X})$ is the min-entropy of the plain text, and a min-entropy smaller than $n$ accounts for information leakage to the adversary. As an application, we discuss an efficient method for encrypting the output of a quantum computer.

arXiv comment5 pages, 2 figures, 3 pages appendix

References in corpus (24)

• Roads towards fault-tolerant universal quantum computation
• Restrictions on Transversal Encoded Quantum Gate Sets
• Randomizing quantum states: Constructions and applications
• Quantum Error Correction: An Introductory Guide
• Random Quantum Circuits are Approximate 2-designs
• Local random quantum circuits are approximate polynomial-designs
• Locking classical correlation in quantum states
• Quantum computation with realistic magic state factories
• Blind topological measurement-based quantum computation
• Unitary designs and codes
• Decoupling with unitary approximate two-designs
• A Quantum Enigma Machine: Experimentally Demonstrating Quantum Data Locking
• From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking
• Locking classical information
• Quantum-locked key distribution at nearly the classical capacity rate
• Quantum to Classical Randomness Extractors
• Quantum enigma machines and the locking capacity of a quantum channel
• Robust quantum data locking from phase modulation
• Experimental quantum data locking
• Quantum data locking for high-rate private communication
• Continuous-variable quantum enigma machines for long-distance key distribution
• Photonic quantum data locking
• Weak locking capacity of quantum channels can be much larger than private capacity
• Metric and classical fidelity uncertainty relations for random unitary matrices

Cited by in corpus (3)

• Computational advantage of quantum random sampling
• Quantum cryptography beyond key distribution: theory and experiment
• Fault-tolerant and secure long-distance quantum communication via uncorrectable-error-injection