Fast classical simulation of evidence for the utility of quantum computing before fault tolerance

• URL: http://arxiv.org/abs/2306.16372v1
• Date: Wed, 28 Jun 2023 17:08:00 GMT
• Title: Fast classical simulation of evidence for the utility of quantum computing before fault tolerance
• Authors: Tomislav Begu\v{s}i\'c and Garnet Kin-Lic Chan
• Abstract summary: We show that a classical algorithm based on sparse Pauli dynamics can efficiently simulate quantum circuits studied in a recent experiment on 127 qubits of IBM's Eagle processor. Our simulations on a single core of a laptop are orders of magnitude faster than the reported walltime of the quantum simulations, and are in good agreement with the zero-noise extrapolated experimental results.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We show that a classical algorithm based on sparse Pauli dynamics can efficiently simulate quantum circuits studied in a recent experiment on 127 qubits of IBM's Eagle processor [Nature 618, 500 (2023)]. Our classical simulations on a single core of a laptop are orders of magnitude faster than the reported walltime of the quantum simulations, as well as faster than the estimated quantum hardware runtime without classical processing, and are in good agreement with the zero-noise extrapolated experimental results.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Leapfrogging Sycamore: Harnessing 1432 GPUs for 7$\times$ Faster Quantum Random Circuit Sampling [40.83618005962484]
  Random quantum circuit sampling serves as a benchmark to demonstrate quantum computational advantage. Recent progress in classical algorithms has significantly reduced the classical simulation time. Our work provides the first unambiguous experimental evidence to refute textitSycamore's claim of quantum advantage.
  arXiv  Detail & Related papers  (2024-06-27T05:01:47Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Fast classical simulation of Harvard/QuEra IQP circuits [4.415661493715816]
  A quantum advantage is achieved once a certain computational capability of a quantum computer is so complex that it can no longer be reproduced by classical means. We report a classical simulation algorithm that takes only $0.00947$ seconds to compute an amplitude for a $48$-qubit computation. Our algorithm is furthermore not subject to a significant decline in performance due to the additional CNOT layers.
  arXiv  Detail & Related papers  (2024-02-05T17:22:41Z)
• Benchmarking highly entangled states on a 60-atom analog quantum simulator [7.354547292158537]
  We perform fidelity benchmarking and mixed-state entanglement estimation with a 60-atom analog Rydberg quantum simulator. Our results enable a new paradigm for evaluating the ability of both analog and digital quantum devices to generate entanglement.
  arXiv  Detail & Related papers  (2023-08-15T17:54:31Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Doubling the size of quantum simulators by entanglement forging [2.309018557701645]
  Quantum computers are promising for simulations of chemical and physical systems. We present a method, classical entanglement forging, that harnesses classical resources to capture quantum correlations. We compute the ground state energy of a water molecule in the most accurate simulation to date.
  arXiv  Detail & Related papers  (2021-04-20T19:32:37Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Classical Simulation of Quantum Supremacy Circuits [11.913526591569632]
  It is believed that random quantum circuits are difficult to simulate classically. In this work, we present a network-based classical simulation algorithm. We estimate that our simulator can perform this task in less than 20 days.
  arXiv  Detail & Related papers  (2020-05-14T07:57:38Z)

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.