Related papers: Nonsignaling quantum random access code boxes
Quantum entanglement, perhaps the most non-classical manifestation of quantum information theory, cannot be used to transmit information between remote parties. Yet, it can be used to reduce the amount of communication required to process a…
Classical communications are used in the post-processing procedure of quantum key distribution. Since the security of quantum key distribution is based on the principles of quantum mechanics, intuitively the secret key can only be derived…
Coin flipping is a cryptographic primitive in which two distrustful parties wish to generate a random bit in order to choose between two alternatives. This task is impossible to realize when it relies solely on the asynchronous exchange of…
We show that with the fourpartite quantum channel used to teleport an arbitrary two qubit state, we can construct a superdense coding protocol where it is possible to transmit 4 bits of classical information sending only 2 qubits. Alice and…
Under two-party deterministic dense-coding, Alice communicates (perfectly distinguishable) messages to Bob via a qudit from a pair of entangled qudits in pure state |Psi>. If |Psi> represents a maximally entangled state (i.e., each of its…
Non-local correlations are among the most fascinating features of quantum theory from the point of view of information: Such correlations, although not allowing for signaling, are unexplainable by pre-shared information. The correlations…
We introduce a relativistic version of quantum encryption protocol by considering two inertial observers who wish to securely transmit quantum information encoded in a free scalar quantum field state forming Minkowski particles. In a…
Homomorphic encryption has been an area of study in classical computing for decades. The fundamental goal of homomorphic encryption is to enable (untrusted) Oscar to perform a computation for Alice without Oscar knowing the input to the…
We consider a situation in which two parties, Alice and Bob, share a 3-qubit system coupled in an initial maximally entangled, GHZ state. By manipulating locally two of the qubits, Alice can prepare any one of the eight 3-qubit GHZ states.…
This paper addresses the application of quantum entanglement and cryptography for automation and control of dynamic systems. A dynamic system is a system where the rates of changes of its state variables are not negligible. Quantum…
In a deterministic quantum key distribution (DQKD) protocol with a two-way quantum channel, Bob sends a qubit to Alice who then encodes a key bit onto the qubit and sends it back to Bob. After measuring the returned qubit, Bob can obtain…
We obtain strict upper bounds on the bit transmission rate for communication of Classical bit codewords over Quantum channels. Albeit previous arguments in arXiv: 1804.01797 which have demonstrated that lower bounds can be shown to hold for…
One of the most intriguing features of quantum physics is the non-locality of correlations that can be obtained by measuring entangled particles. Recently, it has been noticed that non-locality can be studied without reference to the…
A long sequence of tosses of a classical coin produces an apparently random bit string, but classical randomness is an illusion: the algorithmic information content of a classically-generated bit string lies almost entirely in the…
In the classical setting, public-key encryption requires randomness in order to be secure against a forward search attack, whereby an adversary compares the encryption of a guess of the secret message with that of the actual secret message.…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
Oblivious transfer (OT) is an important cryptographic primitive. Any multi-party computation can be realised with OT as building block. XOR oblivious transfer (XOT) is a variant where the sender Alice has two bits, and a receiver Bob…
We investigate how a classical private key can be used by two players, connected by an insecure one-way quantum channel, to perform private communication of quantum information. In particular we show that in order to transmit n qubits…
We discuss concepts of message identification in the sense of Ahlswede and Dueck via general quantum channels, extending investigations for classical channels, initial work for classical-quantum (cq) channels and "quantum fingerprinting".…
In the context of quantum communications between two parties (here Alice and Bob), Bob's lack of knowledge about the communications channel can affect the purity of the states that he receives. The operation of applying an unknown unitary…