On proving the robustness of algorithms for early fault-tolerant quantum computers

• URL: http://arxiv.org/abs/2209.11322v2
• Date: Wed, 13 Nov 2024 07:47:00 GMT
• Title: On proving the robustness of algorithms for early fault-tolerant quantum computers
• Authors: Rutuja Kshirsagar, Amara Katabarwa, Peter D. Johnson,
• Abstract summary: We introduce a randomized algorithm for the task of phase estimation and give an analysis of its performance under two simple noise models. We calculate that the randomized algorithm can succeed with arbitrarily high probability as long as the required circuit depth is less than 0.916 times the dephasing scale.
• Score: 0.0
• License:
• Abstract: The hope of the quantum computing field is that quantum architectures are able to scale up and realize fault-tolerant quantum computing. Due to engineering challenges, such ''cheap'' error correction may be decades away. In the meantime, we anticipate an era of ''costly'' error correction, or early fault-tolerant quantum computing. Costly error correction might warrant settling for error-prone quantum computations. This motivates the development of quantum algorithms which are robust to some degree of error as well as methods to analyze their performance in the presence of error. Several such algorithms have recently been developed; what is missing is a methodology to analyze their robustness. To this end, we introduce a randomized algorithm for the task of phase estimation and give an analysis of its performance under two simple noise models. In both cases the analysis leads to a noise threshold, below which arbitrarily high accuracy can be achieved by increasing the number of samples used in the algorithm. As an application of this general analysis, we compute the maximum ratio of the largest circuit depth and the dephasing scale such that performance guarantees hold. We calculate that the randomized algorithm can succeed with arbitrarily high probability as long as the required circuit depth is less than 0.916 times the dephasing scale.

Related papers

• An adaptive Bayesian quantum algorithm for phase estimation [0.0]
  We present a coherence-based phase-estimation algorithm which can achieve the optimal quadratic scaling in the mean absolute error and the mean squared error. In the presence of noise, our algorithm produces errors that approach the theoretical lower bound.
  arXiv  Detail & Related papers  (2023-03-02T19:00:01Z)
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
  We analyze and optimize an improved quantum algorithm for topological data analysis. We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation. We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
  arXiv  Detail & Related papers  (2022-09-27T17:56:15Z)
• Quantum Vulnerability Analysis to Accurate Estimate the Quantum Algorithm Success Rate [21.46259138110464]
  Quantum computers suffer from noise during computation that is not fully understood. In this article, we propose quantum vulnerability analysis (QVA) to quantify the error impact on quantum applications.
  arXiv  Detail & Related papers  (2022-07-29T02:51:16Z)
• Establishing trust in quantum computations [0.0]
  We introduce a technique for measuring the fidelity with which an as-built quantum computer can execute an algorithm. Our technique converts the algorithm's quantum circuits into a set of closely related circuits whose success rates can be efficiently measured.
  arXiv  Detail & Related papers  (2022-04-15T17:44:30Z)
• Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation [50.591267188664666]
  Quantum chemistry and materials is one of the most promising applications of quantum computing. Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
  arXiv  Detail & Related papers  (2022-03-14T16:51:36Z)
• Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code [42.394110572265376]
  We demonstrate quantum error correction using the surface code, which is known for its exceptionally high tolerance to errors. In an error correction cycle taking only $1.1,mu$s, we demonstrate the preservation of four cardinal states of the logical qubit.
  arXiv  Detail & Related papers  (2021-12-07T13:58:44Z)
• Can Noise on Qubits Be Learned in Quantum Neural Network? A Case Study on QuantumFlow [25.408147000243158]
  This paper aims to tackle the noise issue from another angle. Instead of creating perfect qubits for general quantum algorithms, we investigate the potential to mitigate the noise issue for dedicate algorithms. This paper targets quantum neural network (QNN), and proposes to learn the errors in the training phase, so that the identified QNN model can be resilient to noise.
  arXiv  Detail & Related papers  (2021-09-08T04:43:12Z)
• Optimization and Noise Analysis of the Quantum Algorithm for Solving One-Dimensional Poisson Equation [17.65730040410185]
  We propose an efficient quantum algorithm for solving one-dimensional Poisson equation. We further develop this algorithm to make it closer to the real application on the noisy intermediate-scale quantum (NISQ) devices. We analyze the effect of common noise existing in the real quantum devices on our algorithm using the IBM Qiskit toolkit.
  arXiv  Detail & Related papers  (2021-08-27T09:44:41Z)
• Leveraging Randomized Compiling for the QITE Algorithm [0.0]
  Iterative algorithms like Quantum Imaginary Time Evolution are susceptible to coherent errors. This article presents the combination of both noise tailoring using Randomized Compiling and error mitigation with a purification. We show how combining noise tailoring and error mitigation will push forward the performance of NISQ devices.
  arXiv  Detail & Related papers  (2021-04-18T09:26:25Z)
• Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor [0.0]
  Coherent errors limit the performance of quantum algorithms in an unpredictable manner. Average error rates measured by randomized benchmarking and related protocols are not sensitive to the full impact of coherent errors. Our results demonstrate that randomized compiling can be utilized to leverage and predict the capabilities of modern-day noisy quantum processors.
  arXiv  Detail & Related papers  (2020-10-01T06:52:45Z)
• A Gentle Introduction to Quantum Computing Algorithms with Applications to Universal Prediction [21.344529157722366]
  This technical report gives an elementary introduction to Quantum Computing for non-physicists. We describe some of the foundational Quantum Algorithms including: the Deutsch-Jozsa Algorithm, Shor's Algorithm, Grocer Search, and Quantum Counting Algorithm. We then attempt to use Quantum computing to find better algorithms for the approximation of Solomonoff Induction.
  arXiv  Detail & Related papers  (2020-04-29T11:46:52Z)

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.