Spectral Analysis of Product Formulas for Quantum Simulation

• URL: http://arxiv.org/abs/2102.12655v1
• Date: Thu, 25 Feb 2021 03:17:25 GMT
• Title: Spectral Analysis of Product Formulas for Quantum Simulation
• Authors: Changhao Yi, Elizabeth Crosson
• Abstract summary: We show that the Trotter step size needed to estimate an energy eigenvalue within precision can be improved in scaling from $epsilon$ to $epsilon1/2$ for a large class of systems. Results partially generalize to diabatic processes, which remain in a narrow energy band separated from the rest of the spectrum by a gap.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider Hamiltonian simulation using the first order Lie-Trotter product formula under the assumption that the initial state has a high overlap with an energy eigenstate, or a collection of eigenstates in a narrow energy band. This assumption is motivated by quantum phase estimation (QPE) and digital adiabatic simulation (DAS). Treating the effective Hamiltonian that generates the Trotterized time evolution using rigorous perturbative methods, we show that the Trotter step size needed to estimate an energy eigenvalue within precision $\epsilon$ using QPE can be improved in scaling from $\epsilon$ to $\epsilon^{1/2}$ for a large class of systems (including any Hamiltonian which can be decomposed as a sum of local terms or commuting layers that each have real-valued matrix elements). For DAS we improve the asymptotic scaling of the Trotter error with the total number of gates $M$ from $\mathcal{O}(M^{-1})$ to $\mathcal{O}(M^{-2})$, and for any fixed circuit depth we calculate an approximately optimal step size that balances the error contributions from Trotterization and the adiabatic approximation. These results partially generalize to diabatic processes, which remain in a narrow energy band separated from the rest of the spectrum by a gap, thereby contributing to the explanation of the observed similarities between the quantum approximate optimization algorithm and diabatic quantum annealing at small system sizes. Our analysis depends on the perturbation of eigenvectors as well as eigenvalues, and on quantifying the error using state fidelity (instead of the matrix norm of the difference of unitaries which is sensitive to an overall global phase).

Related papers

• Quantum Boltzmann machine learning of ground-state energies [3.187381965457262]
  Esting the ground-state energy of Hamiltonians is a fundamental task for which quantum computers can be helpful. We analyze the performance of quantum Boltzmann machines for this task. Our algorithm estimates the gradient of the energy function efficiently by means of a novel quantum circuit construction.
  arXiv  Detail & Related papers  (2024-10-16T18:22:03Z)
• Assessing the query complexity limits of quantum phase estimation using symmetry aware spectral bounds [0.0]
  computational cost of quantum algorithms for physics and chemistry is closely linked to the spectrum of the Hamiltonian. We introduce a hierarchy of symmetry-aware spectral bounds that provide a unified understanding of the performance of quantum phase estimation algorithms.
  arXiv  Detail & Related papers  (2024-03-07T18:38:49Z)
• First-Order Phase Transition of the Schwinger Model with a Quantum Computer [0.0]
  We explore the first-order phase transition in the lattice Schwinger model in the presence of a topological $theta$-term. We show that the electric field density and particle number, observables which reveal the phase structure of the model, can be reliably obtained from the quantum hardware.
  arXiv  Detail & Related papers  (2023-12-20T08:27:49Z)
• Quantum tomography of helicity states for general scattering processes [55.2480439325792]
  Quantum tomography has become an indispensable tool in order to compute the density matrix $rho$ of quantum systems in Physics. We present the theoretical framework for reconstructing the helicity quantum initial state of a general scattering process.
  arXiv  Detail & Related papers  (2023-10-16T21:23:42Z)
• Variational Microcanonical Estimator [0.0]
  We propose a variational quantum algorithm for estimating microcanonical expectation values in models obeying the eigenstate thermalization hypothesis. An ensemble of variational states is then used to estimate microcanonical averages of local operators.
  arXiv  Detail & Related papers  (2023-01-10T18:53:24Z)
• Assessment of the variational quantum eigensolver: application to the Heisenberg model [0.0]
  We present and analyze large-scale simulation results of a hybrid quantum-classical variational method to calculate the ground state energy of the anti-ferromagnetic Heisenberg model. We predict that a fully functional quantum computer with 100 qubits can calculate the ground state energy with a relatively small error.
  arXiv  Detail & Related papers  (2022-01-13T16:49:04Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Optimal policy evaluation using kernel-based temporal difference methods [78.83926562536791]
  We use kernel Hilbert spaces for estimating the value function of an infinite-horizon discounted Markov reward process. We derive a non-asymptotic upper bound on the error with explicit dependence on the eigenvalues of the associated kernel operator. We prove minimax lower bounds over sub-classes of MRPs.
  arXiv  Detail & Related papers  (2021-09-24T14:48:20Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• On Linear Stochastic Approximation: Fine-grained Polyak-Ruppert and Non-Asymptotic Concentration [115.1954841020189]
  We study the inequality and non-asymptotic properties of approximation procedures with Polyak-Ruppert averaging. We prove a central limit theorem (CLT) for the averaged iterates with fixed step size and number of iterations going to infinity.
  arXiv  Detail & Related papers  (2020-04-09T17:54:18Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18: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.