Universal Error Correction for Distributed Quantum Computing

• URL: http://arxiv.org/abs/2508.15580v1
• Date: Thu, 21 Aug 2025 13:55:27 GMT
• Title: Universal Error Correction for Distributed Quantum Computing
• Authors: Daowen Qiu, Ligang Xiao, Le Luo, Paulo Mateus,
• Abstract summary: We propose a universal error correction scheme to reduce errors and obtain effective solutions.<n>Our method may provide a universal strategy of error correction for a kind of distributed quantum computing.
• Score: 4.199844472131922
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In distributed quantum computing, the final solution of a problem is usually achieved by catenating these partial solutions resulted from different computing nodes, but intolerable errors likely yield in this catenation process. In this paper, we propose a universal error correction scheme to reduce errors and obtain effective solutions. Then, we apply this error correction scheme to designing a distributed phase estimation algorithm that presents a basic tool for studying distributed Shor's algorithm and distributed discrete logarithm algorithm as well as other distributed quantum algorithms. Our method may provide a universal strategy of error correction for a kind of distributed quantum computing.

Related papers

• Distributed Quantum Error Correction with Permutation-Invariant Approximate Codes [0.7161783472741748]
  We introduce a distributed quantum error correction framework based on approximate codes to address this challenge.<n>We derive a lower bound and present corresponding simulations which indicate that this nontraditional approach can provide marked advantage.<n>Results highlight the potential of approximate distributed error correction strategies for scalable, modular, fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2025-09-29T17:28:39Z)
• Error and Resource Estimates of Variational Quantum Algorithms for Solving Differential Equations Based on Runge-Kutta Methods [1.1999555634662633]
  We provide an extensive analysis of error sources and determine the resource requirements needed to achieve specific target errors.<n>We derive analytical error and resource estimates for scenarios with and without shot noise.<n>We evaluate the implications of our results by applying them to two scenarios: classically solving a $1$D ordinary differential equation and solving an option pricing linear partial differential equation with the variational algorithm.
  arXiv  Detail & Related papers  (2024-12-16T19:00:03Z)
• Bregman-divergence-based Arimoto-Blahut algorithm [53.64687146666141]
  We generalize the Arimoto-Blahut algorithm to a general function defined over Bregman-divergence system.<n>This algorithm can be applied to classical and quantum rate-distortion theory.
  arXiv  Detail & Related papers  (2024-08-10T06:16:24Z)
• Distributed Markov Chain Monte Carlo Sampling based on the Alternating Direction Method of Multipliers [143.6249073384419]
  In this paper, we propose a distributed sampling scheme based on the alternating direction method of multipliers. We provide both theoretical guarantees of our algorithm's convergence and experimental evidence of its superiority to the state-of-the-art. In simulation, we deploy our algorithm on linear and logistic regression tasks and illustrate its fast convergence compared to existing gradient-based methods.
  arXiv  Detail & Related papers  (2024-01-29T02:08:40Z)
• Convergence rate of algorithms for solving linear equations by quantum annealing [0.0]
  We consider various iterative algorithms for solving the linear equation $ax=b$ using a quantum computer. The application of this approach to algorithms using both an infinite number of qubits and a small number of qubits is discussed.
  arXiv  Detail & Related papers  (2023-10-24T01:23:00Z)
• Connection between single-layer Quantum Approximate Optimization Algorithm interferometry and thermal distributions sampling [0.0]
  We extend the theoretical derivation of the amplitudes of the eigenstates, and the Boltzmann distributions generated by single-layer QAOA. We also review the implications that this behavior has from both a practical and fundamental perspective.
  arXiv  Detail & Related papers  (2023-10-13T15:06:58Z)
• Mitigating Quantum Gate Errors for Variational Eigensolvers Using Hardware-Inspired Zero-Noise Extrapolation [0.0]
  We develop a recipe for mitigating quantum gate errors for variational algorithms using zero-noise extrapolation. We utilize the fact that gate errors in a physical quantum device are distributed inhomogeneously over different qubits and qubit pairs. We find that the estimated energy in the variational approach is approximately linear with respect to the circuit error sum.
  arXiv  Detail & Related papers  (2023-07-20T18:00:03Z)
• A Quantum Algorithm for Computing All Diagnoses of a Switching Circuit [73.70667578066775]
  Faults are by nature while most man-made systems, and especially computers, work deterministically. This paper provides such a connecting via quantum information theory which is an intuitive approach as quantum physics obeys probability laws.
  arXiv  Detail & Related papers  (2022-09-08T17:55:30Z)
• Alternatives to a nonhomogeneous partial differential equation quantum algorithm [52.77024349608834]
  We propose a quantum algorithm for solving nonhomogeneous linear partial differential equations of the form $Apsi(textbfr)=f(textbfr)$. These achievements enable easier experimental implementation of the quantum algorithm based on nowadays technology.
  arXiv  Detail & Related papers  (2022-05-11T14:29:39Z)
• First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems [88.58409977434269]
  We consider the problem of computing an equilibrium in a class of nonlinear generalized Nash equilibrium problems (NGNEPs) Our contribution is to provide two simple first-order algorithmic frameworks based on the quadratic penalty method and the augmented Lagrangian method. We provide nonasymptotic theoretical guarantees for these algorithms.
  arXiv  Detail & Related papers  (2022-04-07T00:11:05Z)
• Bregman divergence based em algorithm and its application to classical and quantum rate distortion theory [61.12008553173672]
  We address the minimization problem of the Bregman divergence between an exponential subfamily and a mixture subfamily in a Bregman divergence system. We apply this algorithm to rate distortion and its variants including the quantum setting.
  arXiv  Detail & Related papers  (2022-01-07T13:33:28Z)

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.