English
Related papers

Related papers: Quantum mutual information and the one-time pad

200 papers

Suppose Alice and Bob have access to two separated regions, respectively, of a system of electrons moving in the presence of a regular one-dimensional lattice of binding atoms. We consider the problem of communicating as much quantum…

Quantum Physics · Physics 2013-05-30 Hulya Yadsan-Appleby , Tobias J. Osborne

Quantum mechanics ensures that the information stored in a quantum state is secure and the ability to send private information through a quantum channel is at least as great as the coherent information. We derive trade-off relations between…

Quantum Physics · Physics 2017-10-02 Arun Kumar Pati , Kratveer Singh , Manish K. Gupta

Secure key distribution among 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…

Quantum Physics · Physics 2009-11-13 Michel Boyer , Dan Kenigsberg , Tal Mor

We introduce and analyze an information theoretical task that we call the quantum multiple-access one-time pad. Here, a number of senders initially share a correlated quantum state with a receiver and an eavesdropper. Each sender performs a…

Quantum Physics · Physics 2022-08-26 Eyuri Wakakuwa

We consider a quantum communication task between two users Alice and Bob, in which Alice and Bob exchange their respective quantum information by means of local operations and classical communication assisted by shared entanglement. Here,…

Quantum Physics · Physics 2019-01-15 Yonghae Lee , Ryuji Takagi , Hayata Yamasaki , Gerardo Adesso , Soojoon Lee

If Alice must communicate with Bob over a channel shared with the adversarial Eve, then Bob must be able to validate the authenticity of the message. In particular we consider the model where Alice and Eve share a discrete memoryless…

Information Theory · Computer Science 2016-09-30 Eric Graves , Paul Yu , Predrag Spasojevic

A classical one-time pad allows two parties to send private messages over a public classical channel -- an eavesdropper who intercepts the communication learns nothing about the message. A quantum one-time pad is a shared quantum state…

Quantum Physics · Physics 2012-01-31 Fernando G. S. L. Brandão , Jonathan Oppenheim

A scheme is proposed by which two parties, Alice and Bob, can securely exchange real numbers. The scheme requires Alice and Bob to share entanglement and both to perform Bell-state measurements. With a qubit system two real numbers can each…

Quantum Physics · Physics 2007-05-23 Sung Soon Jang , Hai-Woong Lee

Quantum resources may provide advantage over their classical counterparts. We say this as quantum advantage. Here we consider a single communication task to study different approaches of observing quantum advantage. We say this setting as a…

Quantum Physics · Physics 2025-03-03 Saronath Halder , Alexander Streltsov

Alice communicates with words drawn uniformly amongst $\{\ket{j}\}_{j=1..n}$, the canonical orthonormal basis. Sometimes however Alice interleaves quantum decoys $\{\frac{\ket{j}+i\ket{k}}{\sqrt{2}}\}$ between her messages. Such pairwise…

Quantum Physics · Physics 2007-05-23 Pablo Arrighi

We present a novel one-way quantum key distribution protocol based on 3-dimensional quantum state, a qutrit, that encodes two qubits in its 2-dimensional subspaces. The qubits hold the classical bit information that has to be shared between…

Quantum Physics · Physics 2012-02-03 R. Kumar , R. Demkowicz-Dobrzanski , K. Banaszek

We show how two distrustful parties, "Bob" and "Charlie", can share a secret key with the help of a mutually trusted "Alice", counterfactually - that is with no information-carrying particles travelling between any of the three parties.

Quantum Physics · Physics 2014-07-28 Hatim Salih

We consider one of the quantum key distribution protocols recently introduced in Ref. [Pirandola et al., Nature Physics 4, 726 (2008)]. This protocol consists in a two-way quantum communication between Alice and Bob, where Alice encodes…

Quantum Physics · Physics 2009-02-20 Stefano Pirandola , Stefano Mancini , Seth Lloyd , Samuel L. Braunstein

The importance of transporting quantum information and entanglement with high fidelity cannot be overemphasized. We present a scheme based on adiabatic passage that allows for transportation of a qubit, operator measurements and…

Quantum Physics · Physics 2007-05-23 Andrew D. Greentree , Simon J. Devitt , Lloyd C. L. Hollenberg

Imagine that Alice and Bob, unable to communicate, are both given a 16-bit string such that the strings are either equal, or they differ in exactly 8 positions. Both parties are then supposed to output a 4-bit string in such a way that…

Quantum Physics · Physics 2007-05-23 Viktor Galliard , Stefan Wolf , Alain Tapp

We postulate the existence of a universal uncertainty relation between the quantum and classical mutual informations between pairs of quantum systems. Specifically, we propose that the sum of the classical mutual information, determined by…

Quantum Physics · Physics 2014-12-18 James Schneeloch , Curtis J. Broadbent , John C. Howell

A game is played by a team of two --- say Alice and Bob --- in which the value of a random variable $x$ is revealed to Alice only, who cannot freely communicate with Bob. Instead, she is given a quantum $n$-level system, respectively a…

Information Theory · Computer Science 2015-12-16 Péter E. Frenkel , Mihály Weiner

Quantum key distribution (QKD) allows Alice and Bob to agree on a shared secret key, while communicating over a public (untrusted) quantum channel. Compared to classical key exchange, it has two main advantages: (i) The key is…

Quantum Physics · Physics 2024-01-03 Giulio Malavolta , Michael Walter

We present a scheme to realize a quantum key distribution using vacuum-one photon entangled states created both from Alice and Bob. The protocol consists in an exchange of spatial modes between Alice and Bob and in a recombination which…

Quantum Physics · Physics 2007-05-23 Gian Luca Giorgi

Suppose that a transmitter Alice potentially wishes to communicate with a receiver Bob over an adversarially jammed binary channel. An active adversary James eavesdrops on their communication over a binary symmetric channel (BSC(q)), and…

Information Theory · Computer Science 2021-06-25 Qiaosheng Zhang , Mayank Bakshi , Sidharth Jaggi