Learning Quantum Entanglement Distillation with Noisy Classical Communications

• URL: http://arxiv.org/abs/2205.08561v1
• Date: Tue, 17 May 2022 18:10:16 GMT
• Title: Learning Quantum Entanglement Distillation with Noisy Classical Communications
• Authors: Hari Hara Suthan Chittoor, Osvaldo Simeone
• Abstract summary: entanglement distillation aims to enhance the fidelity of entangled qubits through local operations and classical communication. Existing distillation protocols assume the availability of ideal, noiseless, communication channels. In this paper, we study the case in which communication takes place over noisy binary symmetric channels.
• Score: 39.000858564696856
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum networking relies on the management and exploitation of entanglement. Practical sources of entangled qubits are imperfect, producing mixed quantum state with reduced fidelity with respect to ideal Bell pairs. Therefore, an important primitive for quantum networking is entanglement distillation, whose goal is to enhance the fidelity of entangled qubits through local operations and classical communication (LOCC). Existing distillation protocols assume the availability of ideal, noiseless, communication channels. In this paper, we study the case in which communication takes place over noisy binary symmetric channels. We propose to implement local processing through parameterized quantum circuits (PQCs) that are optimized to maximize the average fidelity, while accounting for communication errors. The introduced approach, Noise Aware-LOCCNet (NA-LOCCNet), is shown to have significant advantages over existing protocols designed for noiseless communications.

Related papers

• Capacity-Achieving Entanglement Purification Protocol for Pauli Dephasing Channel [1.6632263048576381]
  A simple entanglement swapping protocol via a central node is not effective against the Pauli dephasing channel. This highlights the importance of purifying distributed Bell states before performing entanglement swapping. We introduce an entanglement purification protocol assisted by two-way classical communication that not only purifies the states but also achieves the channel capacities.
  arXiv  Detail & Related papers  (2024-11-21T20:41:16Z)
• Virtual entanglement purification via noisy entanglement [0.16777183511743468]
  We present a protocol utilizing virtual operations that purifies noisy entanglement at the level of expectation values. Our protocol bridges the gap between DQC with entanglement and with circuit knitting, thus providing a flexible way for further scalability in the presence of hardware limitations.
  arXiv  Detail & Related papers  (2024-11-15T08:09:36Z)
• Repeater-Based Quantum Communication Protocol: Maximizing Teleportation Fidelity with Minimal Entanglement [0.0]
  We propose a more efficient protocol for a certain class of noisy states in any intermediary segment. Our approach ensures enhanced teleportation fidelity even when the end-to-end state gets noisier.
  arXiv  Detail & Related papers  (2024-06-20T11:31:12Z)
• Quantum communication networks with defects in silicon carbide [0.0]
  Silicon carbide (SiC) defects offer strong optical transitions, long spin coherence lifetimes and the opportunity for integration with semiconductor devices. These unique properties make SiC an attractive platform for the implementation of quantum nodes for quantum communication networks. We model a memory-enhanced quantum communication protocol in order to extract the parameters required to surpass a direct point-to-point link performance.
  arXiv  Detail & Related papers  (2024-03-05T19:33:45Z)
• Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
  In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes. We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
  arXiv  Detail & Related papers  (2023-04-10T07:16:51Z)
• Learning Distributed Quantum State Discrimination with Noisy Classical Communications [39.000858564696856]
  This paper presents Noise Aware-LOCCNet (NA-LOCCNet) for distributed quantum state discrimination in the presence of noisy communication. We propose specific ansatzes for the case of two observed qubit pairs, and we describe a noise-aware training design criterion.
  arXiv  Detail & Related papers  (2022-07-22T22:06:56Z)
• 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)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• 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.