Related papers: A sufficient and necessary condition for superdens…
State preparation is a necessary component of many quantum algorithms. In this work, we combine a method for efficiently representing smooth differentiable probability distributions using matrix product states with recently discovered…
Quantum state merging is one of the most important protocols in quantum information theory. In this task two parties aim to merge their parts of a pure tripartite state by making use of additional singlets while preserving correlations with…
Suppose Alice and Bob try to transform an entangled state shared between them into another one by local operations and classical communications. Then in general a certain amount of entanglement contained in the initial state will decrease…
Quantum computing algorithms require that the quantum register be initially present in a superposition state. To achieve this, we consider the practical problem of creating a coherent superposition state of several qubits. Owing to…
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 study the following task: Alice is given a classical description of a rank-$k$ projector $P$ on $\mathbb{C}^d$, and Alice and Bob want to prepare the quantum state $P/k$ on Bob's side using shared entanglement and classical…
Quantum state preparation is an important class of quantum algorithms that is employed as a black-box subroutine in many algorithms, or used by itself to generate arbitrary probability distributions. We present a novel state preparation…
Herein, we present a feasible, general protocol for quantum communication within a network via generalized remote preparation of an arbitrary $m$-qubit entangled state designed with genuine tripartite Greenberger--Horne--Zeilinger-type…
We explore the possibility of performing super dense coding with non-maximally entangled states as a resource. Using this we find that one can send two classical bits in a probabilistic manner by sending a qubit. We generalize our scheme to…
We study the problem of general entanglement purification protocols. Suppose Alice and Bob share a bipartite state $\rho$ which is ``reasonably close'' to perfect EPR pairs. The only information Alice and Bob possess is a lower bound on the…
We present many ensembles of states that can be remotely prepared by using minimum classical bits from Alice to Bob and their previously shared entangled state and prove that we have found all the ensembles in two-dimensional case.…
The principle of teleportation can be used to perform a quantum computation even before its quantum input is defined. The basic idea is to perform the quantum computation at some earlier time with qubits which are part of an entangled…
We consider a scenario of remote state preparation (RSP) of qubits in the context of sequential network scenario. A single copy of an entangled state is shared between Alice on one side, and several Bobs on the other, who sequentially…
The positivity of the partial transpose is in general only a necessary condition for separability. There exist quantum states that are not separable, but nevertheless are positive under partial transpose. States of this type are known as…
An interesting aspect of multipartite entanglement is that for perfect teleportation and superdense coding, not the maximally entangled W states but a special class of non-maximally entangled W-like states are required. Therefore, efficient…
The generation of a large amount of entanglement is a necessary condition for a quantum computer to achieve quantum advantage. In this paper, we propose a method to efficiently generate pseudo-random quantum states, for which the degree of…
We describe a protocol capable of preparing an arbitrary state of two photons in several spatial modes using pairs of photons generated by spontaneous parametric down-conversion, linear optical elements and single-photon detectors or…
In the past decades, quantum entanglement has been recognized to be the basic resource in quantum information theory. A fundamental need is then the understanding its qualification and its quantification: Is the quantum state entangled, and…
Known quantum pure states of a qudit can be remotely prepared onto a group of particles of qubits exactly or probabilistically with the aid of two-level Einstein-Podolsky-Rosen states. We present a protocol for such kind of remote state…
It is known that if the shared resource is a maximally entangled state then it is possible to teleport an unknown state with unit fidelity and unit probability. However, if the shared resource is a non-maximally entangled state then one has…