Information Theory and Reliable Communication

Quantum theory: Concepts and methods

Have you ever felt that the very title, Progress in Optics, conjured an image in your mind? Don’t you see a row of handsomely printed books, bearing the editorial stamp of one of the most brilliant members of the optics community, and chronicling the field of optics since the invention of the laser? If so, you are certain to move the bookend to make room for Volume 16, the latest of this series. It contains seven chapters on widely diverging topics, written by well-known authorities in their fields. These are: 1) Laser Selective Photophysics and Photochemistry by V. S. Letokhov, 2) Recent Advances in Phase Profiles (sic) Generation by J. J. Clair and C. I. Abitbol, 3 ) Computer-Generated Holograms: Techniques and Applications by W.-H. Lee, 4) Speckle Interferometry by A. E. Ennos, 5 ) Deformation  Invariant, Space-Variant Optical  Pattern Recognition by D. Casasent and D. Psaltis, 6) Light Emission from High-Current Surface-Spark Discharges by R. E. Beverly, and 7) Semiclassical Radiation  Theory within a  QuantumMechanical Framework by I. R. Senitzkt. The  breadth of topic  matter  spanned  by  these  chapters makes it impossible, for this reviewer at least, to pass judgement on the comprehensiveness, relevance, and completeness of every chapter. With an editorial board as prominent as that of Progress in Optics, however, it seems hardly likely that such comments should be necessary. It should certainly be possible to take the authority of each author as credible. The only remaining judgment to be  made on these chapters is their readability. In short, what are they like to read? The first sentence of the first chapter greets the eye with an obvious typographical error: “The creation of coherent laser light source, that have tunable radiation, opened the . . . .” Two pages later we find: “When two types of atoms or molecules of different isotopic composition ( A and B ) have even one spectral line that does not overlap with others, it is pos-

Progress in optics

Associate DIETRICH BELITZ, University of Oregon Editors: Condensed Matter Physics (Theoretical) J. IGNACIO CIRAC, Max-Planck-Institut für Quantenoptik Quantum Information RAYMOND E. GOLDSTEIN, University of Cambridge Biological Physics ARTHUR F. HEBARD, University of Florida Condensed Matter Physics (Experimental) RANDALL D. KAMIEN, University of Pennsylvania Soft Condensed Matter DANIEL KLEPPNER, Massachusetts Institute of Technology Atomic, Molecular, and Optical Physics (Experimental) PAUL G. LANGACKER, Institute for Advanced Study, Princeton University Particle Physics (Theoretical) VERA LÜTH, Stanford University Particle Physics (Experimental) DAVID D. MEYERHOFER, University of Rochester Physics of Plasmas and Matter at High-Energy Density WITOLD NAZAREWICZ, University of Tennessee, Oak Ridge National Laboratory Nuclear Physics JOHN H. SCHWARZ, California Institute of Technology Mathematical Physics FRIEDRICH-KARL THIELEMANN, Universität Basel Astrophysics Senior Assistant Editor: DEBBIE BRODBAR, APS Editorial Office American Physical Society

Reviews of Modern Physics

Quantum cryptography is arguably the fastest growing area in quantum
information science. Novel theoretical protocols are designed on a regular
basis, security proofs are constantly improving, and experiments are
gradually moving from proof-of-principle lab demonstrations to in-field
implementations and technological prototypes. In this paper, we provide
both a general introduction and a state-of-the-art description of the
recent advances in the field, both theoretical and experimental. We start
by reviewing protocols of quantum key distribution based on discrete
variable systems. Next we consider aspects of device independence,
satellite challenges, and protocols based on continuous-variable systems.
We will then discuss the ultimate limits of point-to-point private
communications and how quantum repeaters and networks may overcome these
restrictions. Finally, we will discuss some aspects of quantum
cryptography beyond standard quantum key distribution, including quantum
random number generators and quantum digital signatures.

/pdf/advances-in-quantum-cryptography-47uxe1y6u2.pdf

Advances in quantum cryptography

Secure key distribution between two remote parties is impossible when both are classical, unless some unproven (and arguably unrealistic) computation-complexity assumptions are made, such as the difficulty of factorizing large numbers. On the other hand, a secure key distribution is possible when both parties are quantum. What is possible when only one party (Alice) is quantum, yet the other (Bob) has only classical capabilities? Recently, a semiquantum key distribution protocol was presented [M. Boyer, D. Kenigsberg, and T. Mor, Phys. Rev. Lett. 99, 140501 (2007)], in which one of the parties (Bob) is classical, and yet, the protocol is proven to be completely robust against an eavesdropping attempt. Here we extend that result much further. We present two protocols with this constraint and prove their complete robustness against attacks: we prove that any attempt of an adversary to obtain information (and even a tiny amount of information) necessarily induces some errors that the legitimate parties could notice. One protocol presented here is identical to the one referred to above; however, its robustness is proven here in a much more general scenario. The other protocol is very different as it is based on randomization.

Semiquantum key distribution

The nonlocal behavior of quantum mechanics can be used to generate guaranteed fresh randomness from an untrusted device that consists of two nonsignalling components; since the generation process requires some initial fresh randomness to act as a catalyst, one also speaks of randomness expansion. R. Colbeck and A. Kent [J. Phys. A 44, 095305 (2011)] proposed the first method for generating randomness from untrusted devices, but without providing a rigorous analysis. This was addressed subsequently by S. Pironio et al. [Nature (London) 464, 1021 (2010)], who aimed at deriving a lower bound on the min-entropy of the data extracted from an untrusted device based only on the observed nonlocal behavior of the device. Although that article succeeded in developing important tools for reaching the stated goal, the proof itself contained a bug, and the given formal claim on the guaranteed amount of min-entropy needs to be revisited. In this paper we build on the tools provided by Pironio et al. and obtain a meaningful lower bound on the min-entropy of the data produced by an untrusted device based on the observed nonlocal behavior of the device. Our main result confirms the essence of the (improperly formulated) claims of Pironio et al. and puts them on solid ground. We also address the question of composability and show that different untrusted devices can be composed in an alternating manner under the assumption that they are not entangled. This enables superpolynomial randomness expansion based on two untrusted yet unentangled devices.

Security and composability of randomness expansion from Bell inequalities

The aim of position-based cryptography is to use the geographical position of a party as its only credential. In this work, we study position-based cryptography in the quantum setting.

We show that if collaborating adversaries are allowed to pre-share an arbitrarily large entangled quantum state, then position-verification, and as a consequence position-based cryptography in general, is impossible (also) in the quantum setting.

To this end, we prove that with the help of sufficient pre-shared entanglement, any non-local quantum computation, i.e., any computation that involves quantum inputs from two parties at different locations, can be performed instantaneously and without any communication, up to local corrections that need to be applied to the outputs. The latter can be understood in that the parties obtain their respective outputs "encrypted", where each corresponding encryption key is known by the opposite party. This result generalizes to any number of parties, and it implies that any non-local quantum computation can be performed using a single round of mutual communication (in which the parties exchange the encryption keys), and that any position-verification scheme can be broken, assuming sufficient pre-shared entanglement among the adversaries.

On the positive side, we show that for adversaries that are restricted to not share any entangled quantum states, secure position-verification is achievable. Jointly, these results suggest the interesting question whether secure position-verification is possible in case of a bounded amount of entanglement. Our positive result can be interpreted as resolving this question in the simplest case, where the bound is set to zero.

/pdf/position-based-quantum-cryptography-impossibility-and-1q85smhg3l.pdf

Position-based quantum cryptography: impossibility and constructions

We revisit the problem of reliable interactive communication over a noisy channel, and obtain the first fully explicit (randomized) efficient constant-rate emulation procedure for reliable interactive communication. Our protocol works for any discrete memory less noisy channel with constant capacity, and fails with exponentially small probability in the total length of the protocol. Following a work by Schulman [Schulman 1993] our simulation uses a tree-code, yet as opposed to the non-constructive absolute tree-code used by Schulman, we introduce a relaxation in the notion of goodness for a tree code and define a potent tree code. This relaxation allows us to construct an explicit emulation procedure for any two-party protocol. Our results also extend to the case of interactive multiparty communication. We show that a randomly generated tree code (with suitable constant alphabet size) is an efficiently decodable potent tree code with overwhelming probability. Furthermore we are able to partially derandomize this result by means of epsilon-biased distributions using only O(N) random bits, where N is the depth of the tree.

/pdf/efficient-and-explicit-coding-for-interactive-communication-x7n0uh9v0k.pdf

Efficient and Explicit Coding for Interactive Communication

Coding for interactive communication augments coding theory to the interactive setting: instead of communicating a message from a sender to a receiver, here the parties are involved in an interacti...

/pdf/coding-for-interactive-communication-a-survey-l16m6ixuf7.pdf

Ran Gelles

Papers

Semiquantum key distribution

Security and composability of randomness expansion from Bell inequalities

Position-based quantum cryptography: impossibility and constructions

Efficient and Explicit Coding for Interactive Communication

Coding for Interactive Communication: A Survey