Quantum Internet: Resource Estimation for Entanglement Routing

• URL: http://arxiv.org/abs/2410.10512v1
• Date: Mon, 14 Oct 2024 13:50:39 GMT
• Title: Quantum Internet: Resource Estimation for Entanglement Routing
• Authors: Manik Dawar, Ralf Riedinger, Nilesh Vyas, Paulo Mendes,
• Abstract summary: We consider the problem of estimating the physical resources required for routing entanglement in a quantum network. We propose a novel way of accounting for experimental errors in the purification process. We show that the approximation works reasonably well over a wide-range of errors.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider the problem of estimating the physical resources required for routing entanglement along an arbitrary path in a quantum bipartite entanglement network based on first-generation quantum repeaters. This resource consumption is intimately linked with the purification protocol and the errors that it introduces due to experimental imperfections. We propose a novel way of accounting for experimental errors in the purification process, which offers the flexibility of accounting for a non uniform probability distribution over different kinds of errors. Moreover, we introduce a novel approach for computing a non-recursive estimation of the resource consumption and illustrate it specifically for our error treatment on a nested repeater protocol. This allows for a reduction in the time complexity of the computation required for the resource estimation, from linear in the required number of purification steps, to constant. Given the fragility and ultra-short lifespans of quantum information, this is especially crucial for an effective operation of a quantum network. The results demonstrate that the approximation works reasonably well over a wide-range of errors.

Related papers

• Predicting Probabilities of Error to Combine Quantization and Early Exiting: QuEE [68.6018458996143]
  We propose a more general dynamic network that can combine both quantization and early exit dynamic network: QuEE. Our algorithm can be seen as a form of soft early exiting or input-dependent compression. The crucial factor of our approach is accurate prediction of the potential accuracy improvement achievable through further computation.
  arXiv  Detail & Related papers  (2024-06-20T15:25:13Z)
• Inverted-circuit zero-noise extrapolation for quantum gate error mitigation [0.0]
  We propose a simple method for estimating the strength of errors occurring in a quantum circuit. The method determines the error strength for a circuit by appending to it the inverted circuit and measuring the probability of the initial state. Our method proves to be particularly effective on current hardware, showcasing its suitability for near-term quantum computing applications.
  arXiv  Detail & Related papers  (2024-03-03T20:27:27Z)
• Leveraging junk information to enhance the quantum error mitigation [8.049186254119121]
  We introduce a quantum error mitigation method named Self-Trained Quantum Noise Filter (SQNF) Our numerical results demonstrate that the proposed method can significantly reduce the infidelity of population distributions.
  arXiv  Detail & Related papers  (2024-02-16T07:01:18Z)
• 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)
• Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing [73.7522199491117]
  Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources. The fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. We propose a resource allocation model to provision quantum computing and networking resources.
  arXiv  Detail & Related papers  (2023-07-25T00:38:46Z)
• 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)
• Fault Tolerant Non-Clifford State Preparation for Arbitrary Rotations [3.47670594338385]
  We propose a postselection-based algorithm to efficiently prepare resource states for gate teleportation. Our algorithm achieves fault tolerance, demonstrating the exponential suppression of logical errors with code distance. Our approach presents a promising path to reducing the resource requirement for quantum algorithms on error-corrected and noisy intermediate-scale quantum computers.
  arXiv  Detail & Related papers  (2023-03-30T13:46:52Z)
• Semantic Strengthening of Neuro-Symbolic Learning [85.6195120593625]
  Neuro-symbolic approaches typically resort to fuzzy approximations of a probabilistic objective. We show how to compute this efficiently for tractable circuits. We test our approach on three tasks: predicting a minimum-cost path in Warcraft, predicting a minimum-cost perfect matching, and solving Sudoku puzzles.
  arXiv  Detail & Related papers  (2023-02-28T00:04:22Z)
• Fundamental limits of quantum error mitigation [0.0]
  We show how error-mitigation algorithms can reduce the computation error as a function of their sampling overhead. Our results provide a means to identify when a given quantum error-mitigation strategy is optimal and when there is potential room for improvement.
  arXiv  Detail & Related papers  (2021-09-09T17:56:14Z)
• Cluster-Promoting Quantization with Bit-Drop for Minimizing Network Quantization Loss [61.26793005355441]
  Cluster-Promoting Quantization (CPQ) finds the optimal quantization grids for neural networks. DropBits is a new bit-drop technique that revises the standard dropout regularization to randomly drop bits instead of neurons. We experimentally validate our method on various benchmark datasets and network architectures.
  arXiv  Detail & Related papers  (2021-09-05T15:15:07Z)
• Error mitigation via verified phase estimation [0.25295633594332334]
  This paper presents a new error mitigation technique based on quantum phase estimation. We show that it can be adapted to function without the use of control qubits.
  arXiv  Detail & Related papers  (2020-10-06T07:44:10Z)

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.