Related papers: A simple unconditionally secure quantum bit commit…
Classical teleportation is defined as a scenario where the sender is given the classical description of an arbitrary quantum state while the receiver simulates any measurement on it. This scenario is shown to be achievable by transmitting…
We present two optimal methods of teleporting an unknown qubit using any pure entangled state. We also discuss how such methods can also have succesful application in quantum secret sharing with pure multipartite entangled states.
Unconditionally secure quantum bit commitment (QBC) was widely believed to be impossible for more than two decades. But recently, based on an anomalous behavior found in quantum steering, we proposed a QBC protocol which can be…
Quantum teleportation provides a way to transfer unknown quantum states from one system to another via an entangled state as a quantum channel without physical transmission of the object itself. The entangled channel, measurement performed…
There are two types of port-based teleportation (PBT) protocols: deterministic -- when the state always arrives to the receiver but is imperfectly transmitted and probabilistic -- when the state reaches the receiver intact with high…
Quantum teleportation allows for the transfer of arbitrary, in principle, unknown quantum states from a sender to a spatially distant receiver, who share an entangled state and can communicate classically. It is the essence of many…
Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classical and the quantum world. However, when committing to a string of n bits at once, how far can we stretch the quantum limits? In this letter,…
We establish quantum uncloneable encryption with unconditional security, preventing two non-communicating adversaries from simultaneously decrypting a single ciphertext $-$ even when both are given the key. Our construction achieves…
We want to certify in a black box scenario that two parties simulating the teleportation of a qubit are really using quantum resources. If active compensation is part of the simulation, perfect teleportation can be faked with purely…
In this work we provide a genuine relativistic quantum teleportation protocol whose classical communication component makes use of relativistic causal propagation of a quantum field. Consequently, the quantum teleportation is fully…
We show that a quantum clock cannot be teleported without prior synchronization between sender and receiver: every protocol using a finite amount of entanglement and an arbitrary number of rounds of classical communication will necessarily…
We address fundamental limitations of quantum teleportation -- the process of transferring quantum information using classical communication and preshared entanglement. We develop a new teleportation protocol based upon the idea of using…
We consider quantum teleportation when the given entanglement channel is an arbitrary multiparticle state. A general criterion is presented, which allows one to judge if the channel can be used to teleport faithfully an arbitrary quantum…
Quantum mechanics offers the possibility of unconditionally secure communication between multiple remote parties. Security proofs for such protocols typically rely on bounding the capacity of the quantum channel in use. In a similar manner,…
We study the teleportation scheme performed by means of a partially entangled pure state. We found that the information belonging to the quantum channel can be distributed into both the system of the transmitter and the system of the…
Digital signatures are widely used in electronic communications to secure important tasks such as financial transactions, software updates, and legal contracts. The signature schemes that are in use today are based on public-key…
It has been widely claimed and believed that many protocols in quantum key distribution, especially the single-photon BB84 protocol, have been proved unconditionally secure at least in principle, for both asymptotic and finite protocols…
Verification of quantum computation is a task to efficiently check whether an output given from a quantum computer is correct. Existing verification protocols conducted between a quantum computer to be verified and a verifier necessitate…
Teleportation for pure states, mixed states with standard and optimal protocols are introduced and investigated systematically. An explicit equation governing the teleportation of finite dimensional quantum pure states by a generally given…
A theorem is proved which states that no classical key generating protocol could ever be provably secure. Consequently, candidates for provably secure protocols must rely on some quantum effect. Theorem relies on the fact that BB84 Quantum…