Better-than-classical Grover search via quantum error detection and suppression

• URL: http://arxiv.org/abs/2211.04543v1
• Date: Tue, 8 Nov 2022 20:31:02 GMT
• Title: Better-than-classical Grover search via quantum error detection and suppression
• Authors: Bibek Pokharel, Daniel Lidar
• Abstract summary: Grover's search algorithm is one of the first quantum algorithms to exhibit a provable quantum advantage. Here, we report better-than-classical success probabilities for a complete Grover search algorithm on the largest scale demonstrated to date.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Grover's search algorithm is one of the first quantum algorithms to exhibit a provable quantum advantage. It forms the backbone of numerous quantum applications and is widely used in benchmarking efforts. Here, we report better-than-classical success probabilities for a complete Grover search algorithm on the largest scale demonstrated to date, of up to five qubits, using two different IBM superconducting transmon qubit platforms. This is enabled, on the four and five-qubit scale, by error suppression via robust dynamical decoupling pulse sequences, without which we do not observe better-than-classical results. Further improvements arise after the use of measurement error mitigation, but the latter is insufficient by itself for achieving better-than-classical performance. For two qubits, we demonstrate a success probability of 99.5% via the use of the [[4,2,2]] quantum error-detection (QED) code. This constitutes a demonstration of quantum algorithmic breakeven via QED. Along the way, we introduce algorithmic error tomography, a method of independent interest that provides a holistic view of the errors accumulated throughout an entire quantum algorithm, filtered via the errors detected by the QED code used to encode the circuit. We demonstrate that algorithmic error tomography provides a stringent test of an error model based on a combination of amplitude damping, dephasing, and depolarization.

Related papers

• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Emulating two qubits with a four-level transmon qudit for variational quantum algorithms [0.0]
  We implement a two-qubit superconducting transmon qudit for variational quantum algorithm applications. We analyze its noise model and improve the accuracy of the results. Our work demonstrates that qudits are a practical alternative to qubits for variational algorithms.
  arXiv  Detail & Related papers  (2023-03-08T18:45:11Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Quantum Speedup for Higher-Order Unconstrained Binary Optimization and MIMO Maximum Likelihood Detection [2.5272389610447856]
  We propose a quantum algorithm that supports a real-valued higher-order unconstrained binary optimization problem. The proposed algorithm is capable of reducing the query complexity in the classical domain and providing a quadratic speedup in the quantum domain.
  arXiv  Detail & Related papers  (2022-05-31T00:14:49Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• 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)
• Exponential suppression of bit or phase flip errors with repetitive error correction [56.362599585843085]
  State-of-the-art quantum platforms typically have physical error rates near $10-3$. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits. We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
  arXiv  Detail & Related papers  (2021-02-11T17:11:20Z)
• Analyzing the Performance of Variational Quantum Factoring on a Superconducting Quantum Processor [0.0]
  We study a QAOA-based quantum optimization algorithm by implementing the Variational Quantum Factoring (VQF) algorithm. We demonstrate the impact of different noise sources on the performance of QAOA and reveal the coherent error caused by the residual ZZ-coupling between qubits.
  arXiv  Detail & Related papers  (2020-12-14T18:58:30Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• Scalable evaluation of quantum-circuit error loss using Clifford sampling [8.140947383885262]
  We use the quadratic error loss and the final-state fidelity loss to characterize quantum circuits. It is shown that these loss functions can be efficiently evaluated in a scalable way by sampling from Clifford-dominated circuits. Our results pave the way towards the optimization-based quantum device and algorithm design in the intermediate-scale quantum regime.
  arXiv  Detail & Related papers  (2020-07-20T11:51:36Z)

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.