• Open Access

Quantum Enigma Machines and the Locking Capacity of a Quantum Channel

Saikat Guha, Patrick Hayden, Hari Krovi, Seth Lloyd, Cosmo Lupo, Jeffrey H. Shapiro, Masahiro Takeoka, and Mark M. Wilde
Phys. Rev. X 4, 011016 – Published 31 January 2014

Abstract

The locking effect is a phenomenon that is unique to quantum information theory and represents one of the strongest separations between the classical and quantum theories of information. The Fawzi-Hayden-Sen locking protocol harnesses this effect in a cryptographic context, whereby one party can encode n bits into n qubits while using only a constant-size secret key. The encoded message is then secure against any measurement that an eavesdropper could perform in an attempt to recover the message, but the protocol does not necessarily meet the composability requirements needed in quantum key distribution applications. In any case, the locking effect represents an extreme violation of Shannon’s classical theorem, which states that information-theoretic security holds in the classical case if and only if the secret key is the same size as the message. Given this intriguing phenomenon, it is of practical interest to study the effect in the presence of noise, which can occur in the systems of both the legitimate receiver and the eavesdropper. This paper formally defines the locking capacity of a quantum channel as the maximum amount of locked information that can be reliably transmitted to a legitimate receiver by exploiting many independent uses of a quantum channel and an amount of secret key sublinear in the number of channel uses. We provide general operational bounds on the locking capacity in terms of other well-known capacities from quantum Shannon theory. We also study the important case of bosonic channels, finding limitations on these channels’ locking capacity when coherent-state encodings are employed and particular locking protocols for these channels that might be physically implementable.

  • Received 30 July 2013

DOI:https://doi.org/10.1103/PhysRevX.4.011016

This article is available under the terms of the Creative Commons Attribution 3.0 License. Further distribution of this work must maintain attribution to the author(s) and the published article’s title, journal citation, and DOI.

Published by the American Physical Society

Authors & Affiliations

Saikat Guha1, Patrick Hayden2, Hari Krovi1, Seth Lloyd3, Cosmo Lupo4, Jeffrey H. Shapiro4, Masahiro Takeoka5,1, and Mark M. Wilde6

  • 1Quantum Information Processing Group, Raytheon BBN Technologies, Cambridge, Massachusetts 02138, USA
  • 2Department of Physics, Stanford University, 382 Via Pueblo Mall, Stanford, California 94305-4060, USA
  • 3Department of Mechanical Engineering, MIT, Cambridge, Massachusetts 02139, USA
  • 4Research Laboratory of Electronics, MIT, Cambridge, Massachusetts 02139, USA
  • 5National Institute of Information and Communications Technology, 4-2-1 Nukuikita, Koganei, Tokyo 184-8795, Japan
  • 6Department of Physics and Astronomy, Center for Computation and Technology, Hearne Institute for Theoretical Physics, Louisiana State University, Baton Rouge, Louisiana 70803, USA

Popular Summary

Quantum cryptography, including the task of quantum key distribution (QKD), is one of the major contemporary areas of application of quantum mechanics. In QKD, the goal is to transmit a secret key between the two communicating parties, and the successfully shared key is then used to encrypt a message communicated through a public channel, which a third party has practically no chance of decrypting. A fundamental drawback, however, is that the key and the message must have equal length. This means that the distribution of secret keys must be done at bit rates comparable to standard communication technology, but reaching those bit rates is still a major challenge for current quantum technology.

A conceptually different approach has been proposed to circumvent this challenge, based on the phenomenon of quantum data locking (QDL). Because of a strong form of the quantum-mechanical uncertainty principle, a small secret key can be used to “lock” an exponentially longer message, if this message is suitably encoded into a quantum system. The encrypted message is then secure against any hacking or interfering attempt of a third party who performs a quantum measurement to learn about the message. To find useful applications, however, QDL must be proven to be robust against noise. In this paper, we place the concept of noisy QDL on a solid theoretical ground for the first time.

Many fundamental questions about noisy QDL were open. How should the locking capacity of a quantum channel (such as a fiber optic cable for photon-based information transmission) be defined? Are there noisy quantum channels with nonzero locking capacity? If yes, is such a channel required to preserve quantum entanglement or is “quantum discord,” a less stringent form of quantum correlation, sufficient? Can the locking capacity of a quantum channel surpass its capacity for transmitting information securely against an adversary with access to a quantum memory? Is QDL possible with coherent states? We address all of these questions with complete or partial answers, including a concrete definition of the locking capacity of a noisy quantum channel and a rigorous bound on that capacity.

From a fundamental perspective, our paper sets out the locking capacity of a quantum channel as one that is unique to quantum information theory. Schemes for QDL could very well allow for secure communication of data at much higher rates than is possible with QKD, as long as malicious adversaries do not have access to fully functional quantum computers and reliable quantum storage.

Key Image

Article Text

Click to Expand

References

Click to Expand
Issue

Vol. 4, Iss. 1 — January - March 2014

Subject Areas
Reuse & Permissions
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review X

Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 3.0 License. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

×

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×