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

• Comparing One- and Two-way Quantum Repeater Architectures [9.942288691108914]
  Quantum repeaters are an essential building block for realizing long-distance quantum communications. Due to the fragile nature of quantum information, these repeaters suffer from loss and operational errors. Recent increases in the number of available memories, and introduction of entanglement generation through multiplexing motivate a re-comparison of one-way and two-way repeater architectures.
  arXiv  Detail & Related papers  (2024-09-10T01:55:01Z)
• 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)
• 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)
• Standard Deviation-Based Quantization for Deep Neural Networks [17.495852096822894]
  Quantization of deep neural networks is a promising approach that reduces the inference cost. We propose a new framework to learn the quantization intervals (discrete values) using the knowledge of the network's weight and activation distributions. Our scheme simultaneously prunes the network's parameters and allows us to flexibly adjust the pruning ratio during the quantization process.
  arXiv  Detail & Related papers  (2022-02-24T23:33:47Z)
• Post-training Quantization for Neural Networks with Provable Guarantees [9.58246628652846]
  We modify a post-training neural-network quantization method, GPFQ, that is based on a greedy path-following mechanism. We prove that for quantizing a single-layer network, the relative square error essentially decays linearly in the number of weights.
  arXiv  Detail & Related papers  (2022-01-26T18:47:38Z)
• 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)
• Semi-supervised Network Embedding with Differentiable Deep Quantisation [81.49184987430333]
  We develop d-SNEQ, a differentiable quantisation method for network embedding. d-SNEQ incorporates a rank loss to equip the learned quantisation codes with rich high-order information. It is able to substantially compress the size of trained embeddings, thus reducing storage footprint and accelerating retrieval speed.
  arXiv  Detail & Related papers  (2021-08-20T11:53:05Z)
• SignalNet: A Low Resolution Sinusoid Decomposition and Estimation Network [79.04274563889548]
  We propose SignalNet, a neural network architecture that detects the number of sinusoids and estimates their parameters from quantized in-phase and quadrature samples. We introduce a worst-case learning threshold for comparing the results of our network relative to the underlying data distributions. In simulation, we find that our algorithm is always able to surpass the threshold for three-bit data but often cannot exceed the threshold for one-bit data.
  arXiv  Detail & Related papers  (2021-06-10T04:21:20Z)
• Optimizing Entanglement Generation and Distribution Using Genetic Algorithms [0.640476282000118]
  Long-distance quantum communication via entanglement distribution is of great importance for the quantum internet. Quantum repeaters could in theory be used to extend the distances over which entanglement can be distributed, but in practice hardware quality is still lacking. We propose a methodology based on genetic algorithms and simulations of quantum repeater chains for optimization of entanglement generation and distribution.
  arXiv  Detail & Related papers  (2020-10-30T17:09:34Z)
• Enabling certification of verification-agnostic networks via memory-efficient semidefinite programming [97.40955121478716]
  We propose a first-order dual SDP algorithm that requires memory only linear in the total number of network activations. We significantly improve L-inf verified robust accuracy from 1% to 88% and 6% to 40% respectively. We also demonstrate tight verification of a quadratic stability specification for the decoder of a variational autoencoder.
  arXiv  Detail & Related papers  (2020-10-22T12:32:29Z)
• 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)
• ReActNet: Towards Precise Binary Neural Network with Generalized Activation Functions [76.05981545084738]
  We propose several ideas for enhancing a binary network to close its accuracy gap from real-valued networks without incurring any additional computational cost. We first construct a baseline network by modifying and binarizing a compact real-valued network with parameter-free shortcuts. We show that the proposed ReActNet outperforms all the state-of-the-arts by a large margin.
  arXiv  Detail & Related papers  (2020-03-07T02:12:02Z)

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.