Deterministic joint remote state preparation with a non-maximally entangled channel

• URL: http://arxiv.org/abs/2212.01092v2
• Date: Tue, 9 May 2023 08:32:16 GMT
• Title: Deterministic joint remote state preparation with a non-maximally entangled channel
• Authors: Xuanxuan Xin and Shiwen He and Yongxing Li and Chong Li
• Abstract summary: We have designed a novel deterministic joint remote state preparation scheme using a degenerated non-maximally entangled state directly. A protocol for deterministic joint remote preparation of a two-dimensional quantum state via a non-maximally hyperentangled quantum channel has been devised. No matter how weak the shared entanglement is, the success probability of communication is maintained at 100% as soon as it exists.
• Score: 10.351739012146378
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Ideal deterministic quantum communication tasks require maximally entangled channels. The reality is that the maximally entangled channel is inevitably degraded to a non-maximally entangled one because of various decoherence mechanisms, seriously deteriorating the performance of quantum communication. Instead of adopting traditional entanglement purification or distillation to rebuild maximally entangled channels, we have designed a novel deterministic joint remote state preparation scheme using the degenerated non-maximally entangled state directly. A protocol for deterministic joint remote preparation of a two-dimensional quantum state via a non-maximally hyperentangled quantum channel has been devised with the help of auxiliary qudits. Then we generalize it to prepare a high-dimensional quantum state faithfully. No matter how weak the shared entanglement is, the success probability of communication is maintained at 100% as soon as it exists. This investigation provides an ideology for the construction of practical quantum communication networks.

Related papers

• Unextendible entanglement of quantum channels [4.079147243688764]
  We study the ability of quantum channels to perform quantum communication tasks. A quantum channel can distill a highly entangled state between two parties. We generalize the formalism of $k$-extendibility to bipartite superchannels.
  arXiv  Detail & Related papers  (2024-07-22T18:00:17Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Optimal deterministic remote state preparation via a non-maximally entangled channel without additional quantum resources [10.351739012146378]
  We have increased the success probability of preparing a d-dimensional quantum state to 1 via a non-maximally entangled quantum channel. This work provides a valuable method to address decoherence and environmental noises in the practicalization of quantum communication tasks.
  arXiv  Detail & Related papers  (2022-06-29T22:10:06Z)
• Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
  This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations. The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
  arXiv  Detail & Related papers  (2022-05-05T03:49:19Z)
• Achieving the ultimate end-to-end rates of lossy quantum communication networks [0.0]
  In this work, we give a practical design for an optimal entanglement distillation protocol followed by teleportation. Our ultimate design is an iterative approach, where each purification step operates on shared entangled states. As a simpler design, we show that the first round of iteration can purify completely at high rates.
  arXiv  Detail & Related papers  (2022-03-25T22:02:32Z)
• Nontraditional Deterministic Remote State Preparation Using a Non-Maximally Entangled Channel without Additional Quantum Resources [10.351739012146378]
  We have developed a nontraditional remote state preparation protocol that allows for deterministically transferring information encoded in quantum states. With an auxiliary particle and a simple measurement method, the success probability of preparing a d-dimensional quantum state is increased to 1 without spending additional quantum resources in advance to improve quantum channels.
  arXiv  Detail & Related papers  (2022-03-16T08:59:49Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Creating and destroying coherence with quantum channels [62.997667081978825]
  We study optimal ways to create a large amount of quantum coherence via quantum channels. correlations in multipartite systems do not enhance the ability of a quantum channel to create coherence. We show that a channel can destroy more coherence when acting on a subsystem of a bipartite state.
  arXiv  Detail & Related papers  (2021-05-25T16:44:13Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.