Calculation of generating function in many-body systems with quantum computers: technical challenges and use in hybrid quantum-classical methods

• URL: http://arxiv.org/abs/2104.08181v2
• Date: Thu, 25 Nov 2021 13:22:31 GMT
• Title: Calculation of generating function in many-body systems with quantum computers: technical challenges and use in hybrid quantum-classical methods
• Authors: Edgar Andres Ruiz Guzman and Denis Lacroix
• Abstract summary: The generating function of a Hamiltonian $H$ is defined as $F(t)=langle e-itHrangle$, where $t$ is the time and where the expectation value is taken on a given initial quantum state. We show how the information content of this function can be used a posteriori on classical computers to solve quantum many-body problems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The generating function of a Hamiltonian $H$ is defined as $F(t)=\langle e^{-itH}\rangle$, where $t$ is the time and where the expectation value is taken on a given initial quantum state. This function gives access to the different moments of the Hamiltonian $\langle H^{K}\rangle$ at various orders $K$. The real and imaginary parts of $F(t)$ can be respectively evaluated on quantum computers using one extra ancillary qubit with a set of measurement for each value of the time $t$. The low cost in terms of qubits renders it very attractive in the near term period where the number of qubits is limited. Assuming that the generating function can be precisely computed using quantum devices, we show how the information content of this function can be used a posteriori on classical computers to solve quantum many-body problems. Several methods of classical post-processing are illustrated with the aim to predict approximate ground or excited state energies and/or approximate long-time evolutions. This post-processing can be achieved using methods based on the Krylov space and/or on the $t$-expansion approach that is closely related to the imaginary time evolution. Hybrid quantum-classical calculations are illustrated in many-body interacting systems using the pairing and Fermi-Hubbard models.

Related papers

• A Novel Quantum-Classical Hybrid Algorithm for Determining Eigenstate Energies in Quantum Systems [1.9714447272714082]
  We introduce a novel quantum XZ24 algorithm, designed for efficiently computing the eigen-energy spectra of any quantum systems. Compared to existing quantum methods, the new algorithm stands out for its remarkably low measurement cost. We anticipate that the new algorithm will drive significant progress in quantum system simulation and offer promising applications in quantum computing and quantum information processing.
  arXiv  Detail & Related papers  (2024-06-01T04:31:43Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Variance minimisation on a quantum computer for nuclear structure [0.0]
  We present a variance based method of finding the excited state spectrum of a small nuclear system using a quantum computer. Our aim is to develop quantum computing algorithms which can reproduce and predict nuclear structure.
  arXiv  Detail & Related papers  (2022-09-16T09:38:07Z)
• Extracting a function encoded in amplitudes of a quantum state by tensor network and orthogonal function expansion [0.0]
  We present a quantum circuit and its optimization procedure to obtain an approximating function of $f$ that has a number of degrees of freedom with respect to $d$. We also conducted a numerical experiment to approximate a finance-motivated function to demonstrate that our method works.
  arXiv  Detail & Related papers  (2022-08-31T04:10:24Z)
• Near-term quantum algorithm for computing molecular and materials properties based on recursive variational series methods [44.99833362998488]
  We propose a quantum algorithm to estimate the properties of molecules using near-term quantum devices. We test our method by computing the one-particle Green's function in the energy domain and the autocorrelation function in the time domain.
  arXiv  Detail & Related papers  (2022-06-20T16:33:23Z)
• Estimating Gibbs partition function with quantumClifford sampling [6.656454497798153]
  We develop a hybrid quantum-classical algorithm to estimate the partition function. Our algorithm requires only a shallow $mathcalO(1)$-depth quantum circuit. Shallow-depth quantum circuits are considered vitally important for currently available NISQ (Noisy Intermediate-Scale Quantum) devices.
  arXiv  Detail & Related papers  (2021-09-22T02:03:35Z)
• Computing molecular excited states on a D-Wave quantum annealer [52.5289706853773]
  We demonstrate the use of a D-Wave quantum annealer for the calculation of excited electronic states of molecular systems. These simulations play an important role in a number of areas, such as photovoltaics, semiconductor technology and nanoscience.
  arXiv  Detail & Related papers  (2021-07-01T01:02:17Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• Quantum Power Method by a Superposition of Time-Evolved States [0.9137554315375919]
  We show that the number of gates required for approximating $hatcal Hn$ scales linearly in the power and the number of qubits. Using numerical simulation, we show that the power method can control systematic errors in approximating the Hamiltonian power $hatcal Hn$ for $n$ as large as 100.
  arXiv  Detail & Related papers  (2020-08-09T05:21:25Z)
• Variational Monte Carlo calculations of $\mathbf{A\leq 4}$ nuclei with an artificial neural-network correlator ansatz [62.997667081978825]
  We introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei. We compute the binding energies and point-nucleon densities of $Aleq 4$ nuclei as emerging from a leading-order pionless effective field theory Hamiltonian.
  arXiv  Detail & Related papers  (2020-07-28T14:52:28Z)
• 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.