Related papers: Counterfactual Concealed Telecomputation
We present a model of quantum teleportation protocol based on a double quantum dot array. The unknown qubit is encoded using a pair of quantum dots, coupled by tunneling, with one excess electron. It is shown how to create maximally…
It has long been assumed in physics that for information to travel between two parties in empty space, "Alice" and "Bob", physical particles have to travel between them. Here, using the "chained" quantum Zeno effect, we show how, in the…
Cyclic quantum teleportation schemes requires at least the existence of three collaborators acting all as senders and receivers of quantum information, each one of them has an information to be transmitted to the next neighbour in a…
Oblivious transfer is a fundamental cryptographic primitive which is useful for secure multiparty computation. There are several variants of oblivious transfer. We consider 1 out of 2 oblivious transfer, where a sender sends two bits of…
The framework of distributed computing, consisting of several spatially separated input-output servers, has immense importance in distant data manipulation. One of the most challenging parts of this setting is to optimize the use of…
Quantum teleportation allows one to transmit an arbitrary qubit from point A to point B using a pair of (pre-shared) entangled qubits and classical bits of information. The conventional protocol for teleportation uses two bits of classical…
We develop a quantum teleportation protocol of an unknown optical single rail qubit using a hybrid quantum channel composed of continuous variable (CV) states of certain parity. The quantum channel is characterized by two parameters: a…
Bidirectional quantum teleportation scheme is a two-way quantum communication process, in which two parties simultaneously receive each other information. Recently, in paper [1] (Zhou et al., IEEE Access, 7, 44269 (2019)), a six-qubit…
Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks such as parallel computation and circuit optimisation. Crucially, the communication overhead introduced by the allotment process should be…
Distributed quantum systems and especially the Quantum Internet have the ever-increasing potential to fully demonstrate the power of quantum computation. This is particularly true given that developing a general-purpose quantum computer is…
After quantum computers come out, governments and rich companies will have the abilities to buy these useful quantum computers, meanwhile they are familiar with these technologies proficiently. If a client wants to perform quantum computing…
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…
Private distributed learning studies the problem of how multiple distributed entities collaboratively train a shared deep network with their private data unrevealed. With the security provided by the protocols of blind quantum computation,…
Because quantum computers are expensive, it is envisaged that individuals who want to utilize them would do so by delegating their calculations to someone who has a quantum computer. When quantum computer users delegate computations to…
We study the remote implementation of a unitary transformation on a qubit. We show the existence of non-trivial protocols (i.e., using less resources than bidirectional state teleportation) which allow the perfect remote implementation of…
Quantum computers, besides offering substantial computational speedups, are also expected to provide the possibility of preserving the privacy of a computation. Here we show the first such experimental demonstration of blind quantum…
Truly concurrent process algebras are generalizations to the traditional process algebras for true concurrency, CTC to CCS, APTC to ACP, $\pi_{tc}$ to $\pi$ calculus, APPTC to probabilistic process algebra, APTC with localities to process…
We present a continuous variable (CV) quantum key distribution (QKD) scheme based on the CV quantum teleportation of coherent states that yields a raw secret key made up of discrete variables for both Alice and Bob. This protocol preserves…
We show the optimal setup that allows Alice to teleport coherent states to Bob giving the greatest fidelity (efficiency) when one takes into account two realistic assumptions. The first one says that in any actual implementation of the…
We propose a heralded protocol for implementing nontrivial quantum gates on two stationary qubits coupled to spatially separated cavities. By dynamically controlling the evolution of the composite system, nonlocal two-qubit quantum (e.g.,…