Quantum computation with the eigenstate thermalization hypothesis instead of wavefunction preparation

• URL: http://arxiv.org/abs/2504.19185v1
• Date: Sun, 27 Apr 2025 10:20:07 GMT
• Title: Quantum computation with the eigenstate thermalization hypothesis instead of wavefunction preparation
• Authors: Thomas E. Baker,
• Abstract summary: The eigenstate thermalization hypothesis connects a time-average of expectation values for non-integrable systems to the normalized trace of an operator.<n>It is shown here that the hypothesis can be a suitable way to take an expectation value over an equal superposition of eigenstates on the quantum computer.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The eigenstate thermalization hypothesis connects a time-average of expectation values for non-integrable systems to the normalized trace of an operator. It is shown here that the hypothesis can be a suitable way to take an expectation value over an equal superposition of eigenstates on the quantum computer. The complexity of taking the expectation value relies on an efficient time-evolution implementation with complexity $O(T)$ where $T$ is the cost of a single time-step going as $O(\log_2N)$ and sampling at each time step. The resulting algorithm is demonstrated for the expectation value of the inverse of an operator and then generalized to the gradient of a logarithm-determinant. The method scales as $O(\tau TM/\varepsilon^3)$ with a factor $M$ relating to the number of digits of precision, $\varepsilon$, and $\tau$ the averaging time. This is independent of the condition number of the input operator and does not require a quantum memory. There is a potential for a many-body localized state--which would increase the thermalization time--but many circuits of practical interest are uniform enough to avoid this, and it is also expected that the eigenstate thermalization hypothesis holds beyond the currently available system sizes that are studied. The boundary where this algorithm would be considered a classical versus quantum algorithm is also considered.

Related papers

• Quantum algorithm for the gradient of a logarithm-determinant [0.0]
  The inverse of a sparse-rank input operator may be determined efficiently.<n>Measuring an expectation value of the quantum state--instead of all $N2$ elements of the input operator--can be accomplished in $O(ksigma)$ time.<n>The algorithm is envisioned for fully error-corrected quantum computers but may be implementable on near-term machines.
  arXiv  Detail & Related papers  (2025-01-16T09:39:31Z)
• Quantum Algorithms for Stochastic Differential Equations: A Schrödingerisation Approach [29.662683446339194]
  We propose quantum algorithms for linear differential equations.<n>The gate complexity of our algorithms exhibits an $mathcalO(dlog(Nd))$ dependence on the dimensions.<n>The algorithms are numerically verified for the Ornstein-Uhlenbeck processes, Brownian motions, and one-dimensional L'evy flights.
  arXiv  Detail & Related papers  (2024-12-19T14:04:11Z)
• Quantum Algorithms for Non-smooth Non-convex Optimization [30.576546266390714]
  This paper considers the problem for finding the $(,epsilon)$-Goldstein stationary point of Lipschitz continuous objective. We construct a zeroth-order quantum estimator for the surrogate oracle function.
  arXiv  Detail & Related papers  (2024-10-21T16:52:26Z)
• Classically estimating observables of noiseless quantum circuits [36.688706661620905]
  We present a classical algorithm for estimating expectation values of arbitrary observables on most quantum circuits. For non-classically-simulable input states or observables, the expectation values can be estimated by augmenting our algorithm with classical shadows of the relevant state or observable.
  arXiv  Detail & Related papers  (2024-09-03T08:44:33Z)
• Heisenberg-limited adaptive gradient estimation for multiple observables [0.39102514525861415]
  In quantum mechanics, measuring the expectation value of a general observable has an inherent statistical uncertainty.<n>We provide an adaptive quantum algorithm for estimating the expectation values of $M$ general observables within root mean squared error.<n>Our method paves a new way to precisely understand and predict various physical properties in complicated quantum systems using quantum computers.
  arXiv  Detail & Related papers  (2024-06-05T14:16:47Z)
• Calculating response functions of coupled oscillators using quantum phase estimation [40.31060267062305]
  We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer. Our proposed quantum algorithm operates in the standard $s-sparse, oracle-based query access model. We show that a simple adaptation of our algorithm solves the random glued-trees problem in time.
  arXiv  Detail & Related papers  (2024-05-14T15:28:37Z)
• Measuring the Loschmidt amplitude for finite-energy properties of the Fermi-Hubbard model on an ion-trap quantum computer [27.84599956781646]
  We study the operation of a quantum-classical time-series algorithm on a present-day quantum computer. Specifically, we measure the Loschmidt amplitude for the Fermi-Hubbard model on a $16$-site ladder geometry (32 orbitals) on the Quantinuum H2-1 trapped-ion device. We numerically analyze the influence of noise on the full operation of the quantum-classical algorithm by measuring expectation values of local observables at finite energies.
  arXiv  Detail & Related papers  (2023-09-19T11:59:36Z)
• Nearly Optimal Quantum Algorithm for Estimating Multiple Expectation Values [0.17126708168238122]
  We describe an approach that leverages Gily'en et al.'s quantum gradient estimation algorithm to achieve $mathcalO(sqrtM/varepsilon)$ scaling up to logarithmic factors. We prove that this scaling is worst-case optimal in the high-precision regime if the state preparation is treated as a black box.
  arXiv  Detail & Related papers  (2021-11-17T18:34:17Z)
• Heisenberg-limited quantum phase estimation of multiple eigenvalues with few control qubits [1.6328866317851185]
  We show that single-control qubit variants of quantum phase estimation can achieve the Heisenberg limit, em also when one is unable to prepare eigenstates of the system. We present numerical evidence that using the matrix pencil technique the algorithm can achieve Heisenberg-limited scaling as well.
  arXiv  Detail & Related papers  (2021-07-09T18:00:10Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.