Efficient optimization of cut-offs in quantum repeater chains
- URL: http://arxiv.org/abs/2005.04946v2
- Date: Fri, 4 Jun 2021 15:28:13 GMT
- Title: Efficient optimization of cut-offs in quantum repeater chains
- Authors: Boxi Li, Tim Coopmans, David Elkouss
- Abstract summary: We develop an algorithm for computing the probability distribution of the waiting time and fidelity of entanglement produced by repeater chain protocols.
We use the algorithm to optimize cut-offs in order to maximize secret-key rate between the end nodes of the repeater chain.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum communication enables the implementation of tasks that are
unachievable with classical resources. However, losses on the communication
channel preclude the direct long-distance transmission of quantum information
in many relevant scenarios. In principle quantum repeaters allow one to
overcome losses. However, realistic hardware parameters make long-distance
quantum communication a challenge in practice. For instance, in many protocols
an entangled pair is generated that needs to wait in quantum memory until the
generation of an additional pair. During this waiting time the first pair
decoheres, impacting the quality of the final entanglement produced. At the
cost of a lower rate, this effect can be mitigated by imposing a cut-off
condition. For instance, a maximum storage time for entanglement after which it
is discarded. In this work, we optimize the cut-offs for quantum repeater
chains. First, we develop an algorithm for computing the probability
distribution of the waiting time and fidelity of entanglement produced by
repeater chain protocols which include a cut-off. Then, we use the algorithm to
optimize cut-offs in order to maximize secret-key rate between the end nodes of
the repeater chain. We find that the use of the optimal cut-off extends the
parameter regime for which secret key can be generated and moreover
significantly increases the secret-key rate for a large range of parameters.
Related papers
- Generalized quantum repeater graph states [1.7635061227370266]
We present a new approach to ensure the loss tolerance of distributing a single ebit.
We demonstrate that our new scheme significantly outperforms the previous work with much flexibility.
These findings offer new insights into the scalability and reliability of loss-tolerant quantum networks.
arXiv Detail & Related papers (2024-07-01T16:21:37Z) - On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations [9.32782060570252]
Losses are one of the main bottlenecks for the distribution of entanglement in quantum networks.
We analytically investigate the case of equally-spaced repeaters.
We find exact analytic formulae for all moments of the fidelity up to 25 segments.
arXiv Detail & Related papers (2024-04-10T16:24:51Z) - 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) - Circuit Cutting with Non-Maximally Entangled States [59.11160990637615]
Distributed quantum computing combines the computational power of multiple devices to overcome the limitations of individual devices.
circuit cutting techniques enable the distribution of quantum computations through classical communication.
Quantum teleportation allows the distribution of quantum computations without an exponential increase in shots.
We propose a novel circuit cutting technique that leverages non-maximally entangled qubit pairs.
arXiv Detail & Related papers (2023-06-21T08:03:34Z) - Entanglement Distribution in Quantum Repeater with Purification and
Optimized Buffer Time [53.56179714852967]
We explore entanglement distribution using quantum repeaters with optimized buffer time.
We observe that increasing the number of memories on end nodes leads to a higher entanglement distribution rate per memory.
When imperfect operations are considered, however, we make the surprising observation that the per-memory entanglement rate decreases with increasing number of memories.
arXiv Detail & Related papers (2023-05-23T23:23:34Z) - Suppressing Amplitude Damping in Trapped Ions: Discrete Weak
Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
We introduce a low-overhead protocol to reverse this degradation.
We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise.
This filter can be understood as a protocol for single-copy quasi-distillation.
arXiv Detail & Related papers (2022-09-06T18:18:41Z) - Exact rate analysis for quantum repeaters with imperfect memories and
entanglement swapping as soon as possible [0.0]
We present an exact rate analysis for a secret key that can be shared among two parties employing a linear quantum repeater chain.
We consider additional tools and parameters such as memory cut-offs, multiplexing, initial state and swapping gate fidelities.
arXiv Detail & Related papers (2022-03-19T12:55:56Z) - Overcoming the repeaterless bound in continuous-variable quantum
communication without quantum memories [0.0]
One of the main problems in quantum communications is how to achieve high rates at long distances.
We introduce a continuous-variable protocol which overcomes the repeaterless bound and scales like the single-repeater bound.
We show that our scheme can be extended to longer repeater chains using quantum memories.
arXiv Detail & Related papers (2021-05-08T04:02:17Z) - 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) - Finite-key analysis for memory-assisted decoy-state quantum key
distribution [1.218340575383456]
Memory-assisted quantum key distribution (MA-QKD) systems are among novel promising solutions.
We show that accounting for finite-key effects would actually favour MA-QKD setups.
arXiv Detail & Related papers (2020-05-09T13:02:09Z)
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.