Generalized quantum repeater graph states

• URL: http://arxiv.org/abs/2407.01429v1
• Date: Mon, 1 Jul 2024 16:21:37 GMT
• Title: Generalized quantum repeater graph states
• Authors: Bikun Li, Kenneth Goodenough, Filip Rozpędek, Liang Jiang,
• Abstract summary: 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.
• Score: 1.7635061227370266
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: All-photonic quantum repeaters are essential for establishing long-range quantum entanglement. Within repeater nodes, reliably performing entanglement swapping is a key component of scalable quantum communication. To tackle the challenge of probabilistic Bell state measurement in linear optics, which often leads to information loss, various approaches have been proposed to ensure the loss tolerance of distributing a single ebit. We have generalized previous work regarding repeater graph states with elaborate connectivity, enabling the efficient establishment of exploitable ebits at a finite rate with high probability. We demonstrate that our new scheme significantly outperforms the previous work with much flexibility and discuss the generation overhead of such resource states. These findings offer new insights into the scalability and reliability of loss-tolerant quantum networks.

Related papers

• Quantum Networks Enhanced by Distributed Quantum Memories [0.0]
  We show that a network-wide synergistic usage of quantum memories distributed in a quantum communication network offers a fundamental advantage. We first map the problem of quantum communication with local usage of memories into a classical continuum percolation model. This improved mapping can be formulated in terms of graph-merging rules, analogous to the decimation rules of the renormalization group treatment of disordered quantum magnets.
  arXiv  Detail & Related papers  (2024-03-25T02:16:25Z)
• 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)
• Asynchronous Entanglement Routing for the Quantum Internet [0.42855555838080833]
  We propose a new set of asynchronous routing protocols for quantum networks. The protocols update the entanglement-link asynchronous topologyly, identify optimal entanglement-swapping paths, and preserve unused direct-link entanglements. Our results indicate that asynchronous protocols achieve a larger upper bound with an appropriate setting and significantly higher entanglement rate than existing synchronous approaches.
  arXiv  Detail & Related papers  (2023-12-21T21:14:21Z)
• 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)
• Scalable Quantum Repeater Deployment Modeling [3.7710541619011737]
  Long-distance quantum communication presents a significant challenge as maintaining the fidelity of qubits can be difficult. We present novel models to quickly determine a minimum number of quantum repeaters to deploy in large-scale networks.
  arXiv  Detail & Related papers  (2023-05-16T23:54:41Z)
• 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)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• 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)
• The Computational and Latency Advantage of Quantum Communication Networks [70.01340727637825]
  This article summarises the current status of classical communication networks. It identifies some critical open research challenges that can only be solved by leveraging quantum technologies.
  arXiv  Detail & Related papers  (2021-06-07T06:31:02Z)
• 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)
• 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)

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.