Exponential challenges in unbiasing quantum Monte Carlo algorithms with quantum computers

• URL: http://arxiv.org/abs/2205.09203v1
• Date: Wed, 18 May 2022 20:23:12 GMT
• Title: Exponential challenges in unbiasing quantum Monte Carlo algorithms with quantum computers
• Authors: Guglielmo Mazzola, Giuseppe Carleo
• Abstract summary: We show that the proposed hybrid method, in its present form, is unlikely to offer a sizeable advantage over conventional quantum Monte Carlo approaches. For the prototypical transverse-field Ising model, we show that the required time resources to compete with classical simulations on around 40 qubits are already of the order of $1013$ projective measurements.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recently, Huggins et. al. [Nature, 603, 416-420 (2022)] devised a general projective Quantum Monte Carlo method suitable for implementation on quantum computers. This hybrid approach, however, relies on a subroutine -the computation of the local energy estimator on the quantum computer -that is intrinsically affected by an exponential scaling of the computational time with the number of qubits. By means of numerical experiments, we show that this exponential scaling manifests prominently already on systems below the point of "quantum advantage". For the prototypical transverse-field Ising model, we show that the required time resources to compete with classical simulations on around 40 qubits are already of the order of $10^{13}$ projective measurements, with an estimated running time of a few thousand years on superconducting hardware. These observations strongly suggest that the proposed hybrid method, in its present form, is unlikely to offer a sizeable advantage over conventional quantum Monte Carlo approaches.

Related papers

• From quantum enhanced to quantum inspired Monte Carlo [0.0]
  We perform a comprehensive analysis of the quantum-enhanced Monte Carlo method [Nature, 619, 282-287 (2023). We observe an optimal mixing Hamiltonian strength and analyze the scaling of the total evolution time with the size of the system. We propose that classical, approximate quantum simulators can be used for the proposal step instead of the original real- hardware implementation.
  arXiv  Detail & Related papers  (2024-11-26T19:02:21Z)
• 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)
• Classical Chaos in Quantum Computers [39.58317527488534]
  Current-day quantum processors, comprising 50-100 qubits, operate outside the range of quantum simulation on classical computers. We demonstrate that the simulation of classical limits can be a potent diagnostic tool potentially mitigating this problem. We find that classical and quantum simulations lead to similar stability metrics in systems with $mathcalO$ transmons.
  arXiv  Detail & Related papers  (2023-04-27T18:00:04Z)
• 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-assisted Monte Carlo algorithms for fermions [5.625946422295428]
  We propose a family of scalable quantum-assisted Monte Carlo algorithms where the quantum computer is used at its minimal cost. We show that the hybrid Monte Carlo framework is a general way to suppress errors in the ground state obtained from classical algorithms.
  arXiv  Detail & Related papers  (2022-05-30T07:49:22Z)
• 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)
• Strong quantum computational advantage using a superconducting quantum processor [33.030717006448526]
  We develop a two-dimensional programmable superconducting quantum processor, textitZuchongzhi, composed of 66 functional qubits in a tunable coupling architecture. Our work establishes an unambiguous quantum computational advantage that is infeasible classical computation in a reasonable amount of time.
  arXiv  Detail & Related papers  (2021-06-28T14:06:07Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.