Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement
- URL: http://arxiv.org/abs/2012.11982v3
- Date: Wed, 20 Oct 2021 16:33:52 GMT
- Title: Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement
- Authors: Daryus Chandra, Angela Sara Cacciapuoti, Marcello Caleffi, Lajos Hanzo
- Abstract summary: 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.
- Score: 69.25543534545538
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: To realize the Quantum Internet, quantum communications require pre-shared
entanglement among quantum nodes. However, both the generation and the
distribution of the maximally-entangled quantum states are inherently
contaminated by quantum decoherence. Conventionally, the quantum decoherence is
mitigated by performing the consecutive steps of quantum entanglement
distillation followed by quantum teleportation. However, this conventional
approach imposes a long delay. To circumvent this impediment, we propose a
novel quantum communication scheme relying on realistic noisy pre-shared
entanglement, which eliminates the sequential steps imposing delay in the
standard approach. More precisely, our proposed scheme can be viewed as a
direct quantum communication scheme capable of improving the quantum bit error
ratio (QBER) of the logical qubits despite relying on realistic noisy
pre-shared entanglement. Our performance analysis shows that the proposed
scheme offers competitive QBER, yield, and goodput compared to the existing
state-of-the-art quantum communication schemes, despite requiring fewer quantum
gates.
Related papers
- 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) - Noise mitigation in quantum teleportation [0.0]
Noise-mitigation mechanism applicable in both the discrete- and continuous-variable quantum teleportation schemes.
We find that, as long as a bound state is formed in the energy spectrum of the total system, the quantum superiority of the fidelity is persistently recovered.
arXiv Detail & Related papers (2024-02-04T04:56:32Z) - Enhanced quantum state transfer: Circumventing quantum chaotic behavior [35.74056021340496]
We show how to transfer few-particle quantum states in a two-dimensional quantum network.
Our approach paves the way to short-distance quantum communication for connecting distributed quantum processors or registers.
arXiv Detail & Related papers (2024-02-01T19:00:03Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - 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) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - Noncyclic nonadiabatic holonomic quantum gates via shortcuts to
adiabaticity [5.666193021459319]
We propose a fast and robust scheme to construct high-fidelity holonomic quantum gates for universal quantum systems via shortcuts to adiabaticity.
Our scheme is readily realizable in physical system currently pursued for implementation of quantum computation.
arXiv Detail & Related papers (2021-05-28T15:23:24Z) - Quantum teleportation is a reversal of quantum measurement [0.0]
We introduce a generalized concept of quantum teleportation in the framework of quantum measurement and reversing operation.
Our framework makes it possible to find an optimal protocol for quantum teleportation enabling a faithful transfer of unknown quantum states.
arXiv Detail & Related papers (2021-04-25T15:03:08Z) - Capacity-approaching quantum repeaters for quantum communications [0.0]
In present-day quantum communications, one of the main problems is the lack of a quantum repeater design that can simultaneously secure high rates and long distances.
Recent literature has established the end-to-end capacities that are achievable by the most general protocols for quantum and private communication within a quantum network.
We put forward a design for continuous-variable quantum repeaters and show that it can actually achieve the feat.
arXiv Detail & Related papers (2020-07-14T12:10:11Z)
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.