Error Mitigation for Thermodynamic Computing

• URL: http://arxiv.org/abs/2401.16231v1
• Date: Mon, 29 Jan 2024 15:30:47 GMT
• Title: Error Mitigation for Thermodynamic Computing
• Authors: Maxwell Aifer, Denis Melanson, Kaelan Donatella, Gavin Crooks, Thomas Ahle, and Patrick J. Coles
• Abstract summary: A key source of errors in thermodynamic computing is the imprecision of the analog hardware components. We introduce a method that reduces the overall error from a linear to a quadratic dependence. We numerically demonstrate the scalability of this method for dimensions greater than 1000.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: While physics-based computing can offer speed and energy efficiency compared to digital computing, it also is subject to errors that must be mitigated. For example, many error mitigation methods have been proposed for quantum computing. However this error mitigation framework has yet to be applied to other physics-based computing paradigms. In this work, we consider thermodynamic computing, which has recently captured attention due to its relevance to artificial intelligence (AI) applications, such as probabilistic AI and generative AI. A key source of errors in this paradigm is the imprecision of the analog hardware components. Here, we introduce a method that reduces the overall error from a linear to a quadratic dependence (from $\epsilon$ to $\epsilon^2$) on the imprecision $\epsilon$, for Gaussian sampling and linear algebra applications. The method involves sampling from an ensemble of imprecise distributions associated with various rounding events and then merging these samples. We numerically demonstrate the scalability of this method for dimensions greater than 1000. Finally, we implement this method on an actual thermodynamic computer and show $20\%$ error reduction for matrix inversion; the first thermodynamic error mitigation experiment.

Related papers

• Thermodynamic Matrix Exponentials and Thermodynamic Parallelism [0.0]
  We show that certain linear algebra problems can be solved thermodynamically, leading to an speedup scaling with the matrix dimension. The origin of this "thermodynamic advantage" has not yet been fully explained, and it is not clear what other problems might benefit from it.
  arXiv  Detail & Related papers  (2023-11-21T18:10:33Z)
• 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)
• Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target [62.997667081978825]
  We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data. We show how one can disprove faked data, and apply this to a classical count algorithm.
  arXiv  Detail & Related papers  (2022-11-07T12:00:45Z)
• 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)
• Algebraic Bethe Circuits [58.720142291102135]
  We bring the Algebraic Bethe Ansatz (ABA) into unitary form, for its direct implementation on a quantum computer. Our algorithm is deterministic and works for both real and complex roots of the Bethe equations. We derive a new form of the Yang-Baxter equation using unitary matrices, and also verify it on a quantum computer.
  arXiv  Detail & Related papers  (2022-02-09T19:00:21Z)
• Test Set Sizing Via Random Matrix Theory [91.3755431537592]
  This paper uses techniques from Random Matrix Theory to find the ideal training-testing data split for a simple linear regression. It defines "ideal" as satisfying the integrity metric, i.e. the empirical model error is the actual measurement noise. This paper is the first to solve for the training and test size for any model in a way that is truly optimal.
  arXiv  Detail & Related papers  (2021-12-11T13:18:33Z)
• Hamiltonian simulation with random inputs [74.82351543483588]
  Theory of average-case performance of Hamiltonian simulation with random initial states. Numerical evidence suggests that this theory accurately characterizes the average error for concrete models.
  arXiv  Detail & Related papers  (2021-11-08T19:08:42Z)
• First-Order Trotter Error from a Second-Order Perspective [0.0]
  Simulating quantum dynamics beyond the reach of classical computers is one of the main envisioned applications of quantum computers. The approximation error of these algorithms is often poorly understood, even in the most basic cases, which are particularly relevant for experiments. Recent studies have reported anomalously low approximation error with unexpected scaling in such cases, which they attribute to quantum interference between the errors from different steps of the algorithm. Our method generalizes state-of-the-art error bounds without the technical caveats of prior studies, and elucidates how each part of the total error arises from the underlying quantum circuit.
  arXiv  Detail & Related papers  (2021-07-16T17:53:44Z)
• Error mitigation by training with fermionic linear optics [0.05076419064097732]
  We describe a method of reducing errors which is tailored to quantum algorithms for simulating fermionic systems. The method is based on executing quantum circuits in the model of fermionic linear optics, which are known to be efficiently simulable classically. In classical numerical simulations of 12-qubit examples with physically realistic levels of depolarising noise, errors were reduced by a factor of around 34 compared with the uncorrected case.
  arXiv  Detail & Related papers  (2021-02-03T15:56:23Z)
• The data-driven physical-based equations discovery using evolutionary approach [77.34726150561087]
  We describe the algorithm for the mathematical equations discovery from the given observations data. The algorithm combines genetic programming with the sparse regression. It could be used for governing analytical equation discovery as well as for partial differential equations (PDE) discovery.
  arXiv  Detail & Related papers  (2020-04-03T17:21:57Z)
• Physics Informed Deep Learning for Transport in Porous Media. Buckley Leverett Problem [0.0]
  We present a new hybrid physics-based machine-learning approach to reservoir modeling. The methodology relies on a series of deep adversarial neural network architecture with physics-based regularization. The proposed methodology is a simple and elegant way to instill physical knowledge to machine-learning algorithms.
  arXiv  Detail & Related papers  (2020-01-15T08:20:11Z)

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.