Fast classical simulation of Harvard/QuEra IQP circuits
- URL: http://arxiv.org/abs/2402.03211v1
- Date: Mon, 5 Feb 2024 17:22:41 GMT
- Title: Fast classical simulation of Harvard/QuEra IQP circuits
- Authors: Dmitri Maslov, Sergey Bravyi, Felix Tripier, Andrii Maksymov, and Joe
Latone
- Abstract summary: 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.
- Score: 4.415661493715816
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Establishing an advantage for (white-box) computations by a quantum computer
against its classical counterpart is currently a key goal for the quantum
computation community. 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, and as such, the quantum advantage can
be seen as a continued negotiation between classical simulations and quantum
computational experiments.
A recent publication (Bluvstein et al., Nature 626:58-65, 2024) introduces a
type of Instantaneous Quantum Polynomial-Time (IQP) computation complemented by
a $48$-qubit (logical) experimental demonstration using quantum hardware. The
authors state that the ``simulation of such logical circuits is challenging''
and project the simulation time to grow rapidly with the number of CNOT layers
added, see Figure 5d/bottom therein. However, we report a classical simulation
algorithm that takes only $0.00257947$ seconds to compute an amplitude for the
$48$-qubit computation, which is roughly $10^3$ times faster than that reported
by the original authors. Our algorithm is furthermore not subject to a
significant decline in performance due to the additional CNOT layers. We
simulated these types of IQP computations for up to $96$ qubits, taking an
average of $4.16629$ seconds to compute a single amplitude, and estimated that
a $192$-qubit simulation should be tractable for computations relying on Tensor
Processing Units.
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) - Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics [42.29248343585333]
We benchmark quantum hardware and error mitigation techniques on up to 133 qubits.
We show reliable control up to a two-qubit gate depth of 28, featuring a maximum of 1396 two-qubit gates.
Results are transferable to applications such as Hamiltonian simulation, variational algorithms, optimization, or quantum machine learning.
arXiv Detail & Related papers (2024-04-11T18:00:05Z) - 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 evidence for the utility of quantum
computing before fault tolerance [0.0]
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.
arXiv Detail & Related papers (2023-06-28T17:08:00Z) - Towards practical and massively parallel quantum computing emulation for
quantum chemistry [10.095945254794906]
Quantum computing is moving beyond its early stage and seeking for commercial applications in chemical and biomedical sciences.
It is valuable to emulate quantum computing on classical computers for developing quantum algorithms and validating quantum hardware.
Here we demonstrate a high-performance and massively parallel variational quantum eigensolver simulator based on matrix product states.
arXiv Detail & Related papers (2023-03-07T06:44:18Z) - 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) - Differentiable matrix product states for simulating variational quantum
computational chemistry [6.954927515599816]
We propose a parallelizable classical simulator for variational quantum eigensolver(VQE)
Our simulator seamlessly integrates the quantum circuit evolution into the classical auto-differentiation framework.
As applications, we use our simulator to study commonly used small molecules such as HF, LiH and H$$O, as well as larger molecules CO$$, BeH$ and H$_4$ with up to $40$ qubits.
arXiv Detail & Related papers (2022-11-15T08:36:26Z) - An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian
Simulation [55.41644538483948]
Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates.
We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions.
The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
arXiv Detail & Related papers (2021-08-06T19:38:03Z) - Computational power of one- and two-dimensional dual-unitary quantum
circuits [0.6946929968559495]
Quantum circuits that are classically simulatable tell us when quantum computation becomes less powerful than or equivalent to classical computation.
We make use of dual-unitary quantum circuits (DUQCs), which have been recently investigated as exactly solvable models of non-equilibrium physics.
arXiv Detail & Related papers (2021-03-16T17:37:11Z) - 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.