Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPerformance of Dense Coding and Teleportation for Random States --Augmentation via Pre-processing
54
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In order to understand the resourcefulness of a natural quantum system in quantum communication tasks, we study the dense coding capacity (DCC) and teleportation fidelity (TF) of Haar uniformly generated random multipartite states of various ranks. We prove that when a rank-2 two-qubit state, a Werner state, and a pure state possess the same amount of entanglement, the DCC of a rank-2 state belongs to the envelope made by pure and Werner states. In a similar way, we obtain an upper bound via the generalized Greenberger-Horne-Zeilinger state for rank-2 three-qubit states when the dense coding with two senders and a single receiver is performed and entanglement is measured in the senders:receiver bipartition. The normalized frequency distribution of DCC for randomly generated two-, three- and four-qubit density matrices with global as well as local decodings at the receivers end are reported. The estimation of mean DCC for two-qubit states is found to be in good agreement with the numerical simulations. Universally, we observe that the performance of random states for dense coding as well as teleportation decreases with the increase of the rank of states which we have shown to be surmounted by the local pre-processing operations performed on the shared states before starting the protocols, irrespective of the rank of the states. The local pre-processing employed here is based on positive operator valued measurements along with classical communication and we show that unlike dense coding with two-qubit random states, senders operations are always helpful to probabilistically enhance the capabilities of implementing dense coding as well as teleportation.
rate research
Read More
Physicists are attracted to open-system dynamics, how quantum systems evolve, and how they can protected from unnecessary environmental noise, especially environmental memory effects are not negligible, as with non-Markovian approximations. There are several methods to solve master equation of non-Markovian cases, we obtain the solutions of quantum-state-diffusion equation for a two qubit system using perturbation method, which under influence of various types of environmental noises, i.e., relaxation, dephasing and mix of them. We found that mixing these two types of noises benefit the quantum teleportation and quantum super-dense coding, that by introducing strong magnetic field on the relaxation processes will enhance quantum correlation in some time-scale.
We describe two protocols for efficient data transmission using a single passive bus. Different types of interactions are obtained enabling deterministic transfer and teleportation of composite quantum systems for arbitrary subsystem dimension and for arbitrary numbers of subsystems. The subsystems may become entangled in the transmission in which case the protocols can serve generalized teleportation based information processing as well as storage and transmission functions. We explore the cases of two qubits and two qutrits in detail, obtaining a maximally entangling mapping of the composite systems and discuss the use of a continuous variable bus.
We study a continuous variable (CV) dense-coding protocol, originally proposed to employ a two-mode squeezed state, using a general two-mode Gaussian state as a quantum channel. We particularly obtain conditions to manifest quantum advantage by beating two well-known single-mode schemes, namely, the squeezed-state scheme (best Gaussian scheme) and the number-state scheme (optimal scheme achieving the Holevo bound). We then extend our study to a multipartite Gaussian state and investigate the monogamy of operational entanglement measured by the communication capacity under the dense-coding protocol. We show that this operational entanglement represents a strict monogamy relation, by means of Heisenbergs uncertainty principle among different parties, i.e., the quantum advantage for communication can be possible for only one pair of two-mode systems among many parties.
We introduce a quantum teleportation scheme that can transfer a macroscopic spin coherent state between two locations. In the scheme a large number of copies of a qubit, such as realized in a coherent two-component Bose-Einstein condensate, is teleported onto a distant macroscopic spin coherent state using only elementary operations and measurements. We analyze the error of the protocol with the number of particles N in the spin coherent state under decoherence and find that it scales favorably with N.
Bidirectional teleportation is a fundamental protocol for exchanging quantum information between two parties by means of a shared resource state and local operations and classical communication (LOCC). In this paper, we develop two seemingly different ways of quantifying the simulation error of unideal bidirectional teleportation by means of the normalized diamond distance and the channel infidelity, and we prove that they are equivalent. By relaxing the set of operations allowed from LOCC to those that completely preserve the positivity of the partial transpose, we obtain semi-definite programming lower bounds on the simulation error of unideal bidirectional teleportation. We evaluate these bounds for three key examples: when there is no resource state at all and for isotropic and Werner states, in each case finding an analytical solution. The first aforementioned example establishes a benchmark for classical versus quantum bidirectional teleportation. We then evaluate the performance of some schemes for bidirectional teleportation due to [Kiktenko et al., Phys. Rev. A 93, 062305 (2016)] and find that they are suboptimal and do not go beyond the aforementioned classical limit for bidirectional teleportation. We offer a scheme alternative to theirs that is provably optimal. Finally, we generalize the whole development to the setting of bidirectional controlled teleportation, in which there is an additional assisting party who helps with the exchange of quantum information, and we establish semi-definite programming lower bounds on the simulation error for this task. More generally, we provide semi-definite programming lower bounds on the performance of bipartite and multipartite channel simulation using a shared resource state and LOCC.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
