Related papers: Distributed Quantum Faithful Simulation and Functi…
Fingerprinting is a technique in communication complexity in which two parties (Alice and Bob) with large data sets send short messages to a third party (a referee), who attempts to compute some function of the larger data sets. For the…
In the study of quantum computation, data is represented in terms of linear operators which form a generalized model of probability, and computations are most commonly described as products of unitary transformations, which are the…
We study the maximum achievable quantum teleportation fidelity between two distant parties, Alice and Charlie, where each of them share a bipartite quantum state only with a common intermediary, Bob, and all parties are allowed to perform…
Reduced density matrices are a powerful tool in the analysis of entanglement structure, approximate or coarse-grained dynamics, decoherence, and the emergence of classicality. It is straightforward to produce a reduced density matrix with…
In this paper, different from the other existing methods that only the special and limited numbers of qubits transmit between Alice and Bob, a general method is proposed to implement Bidirectional Quantum Controlled/uncontrolled…
We develop a technique for single qubit quantum state tomography using the mathematical setup of generalized quantization scheme for games. In our technique Alice sends an unknown pure quantum state to Bob who appends it with |0><0| and…
We give an overview of joint unsharp measurements of non-commuting observables using positive operator valued measures (POVMs). We exemplify the role played by joint measurability of POVMs in entropic uncertainty relation for Alice's pair…
Quantum teleportation has become a fundamental building block of quantum technologies, playing a vital role in the development of quantum communication networks. Here, we present a bidirectional quantum teleportation (BQT) protocol that…
The usual representation of quantum algorithms is limited to the process of solving the problem. We extend it to the process of setting the problem. Bob, the problem setter, selects a problem-setting by the initial measurement. Alice, the…
Quantum Key Distribution is a quantum communication technique in which random numbers are encoded on quantum systems, usually photons, and sent from one party, Alice, to another, Bob. Using the data sent via the quantum signals,…
Recent works have shown that defining a behavioural equivalence that matches the observational properties of a quantum-capable, concurrent, non-deterministic system is a surprisingly difficult task. We explore coalgebras over distributions…
We propose a quantum teleportation scheme for transmitting a single qutrit state by adopting a 2-qudit entangled state as the quantum channel. The measurement basis for Alice has been carefully and systematically constructed, which is…
A quantum measurement can be described by a set of matrices, one for each possible outcome, which represents the positive operator-valued measure (POVM) of the sensor. Efficient protocols of POVM extraction for arbitrary sensors are…
Tremendous efforts have been paid for realization of fault-tolerant quantum computation so far. However, preexisting fault-tolerant schemes assume that a lot of qubits live together in a single quantum system, which is incompatible with…
We show that non-maximally entangled states can be used to build a quantum key distribution (QKD) scheme whose security and key rate transmission is nearly equivalent to those of standard QKD protocols. These aspects can be controlled by…
We present a distributed implementation of Shor's quantum factoring algorithm on a distributed quantum network model. This model provides a means for small capacity quantum computers to work together in such a way as to simulate a large…
Harnessing quantum mechanics properties, quantum computers have the potential to outperform classical computers in many applications and are envisioned to affect various aspects of our society. Different approaches are being explored for…
The problem of computing functions of values at the nodes in a network in a totally distributed manner, where nodes do not have unique identities and make decisions based only on local information, has applications in sensor, peer-to-peer,…
Secret sharing is a procedure for sharing a secret among a number of participants such that only the qualified subsets of participants have the ability to reconstruct the secret. Even in the presence of eavesdropping, secret sharing can be…
Standard multiparty Bell experiments involve a single source shared by a set of observers. In contrast, network Bell experiments feature multiple independent sources, and each of them may distribute physical systems to a set of observers…