Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits

• URL: http://arxiv.org/abs/2112.05688v1
• Date: Fri, 10 Dec 2021 17:32:15 GMT
• Title: Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits
• Authors: Thomas Steckmann, Trevor Keen, Alexander F. Kemper, Eugene F. Dumitrescu, Yan Wang
• Abstract summary: Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
• Score: 62.73367618671969
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model and thus gives an approximate solution of the Hubbard model by solving the simpler quantum impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models by preparing and evolving the ground state under the impurity Hamiltonian on a quantum computer instead of using intractable classical algorithms. We propose a highly optimized fast-forwarding quantum circuit to significantly improve quantum algorithms for the minimal DMFT problem preserving the Mott phase transition. Our Cartan decomposition based algorithm uses a fixed depth quantum circuit to eliminate time-discretization errors and evolve the initial state over arbitrary times. Exploiting the structure of the fast-forwarding circuits, we sufficiently reduce the gate cost to simulate the dynamics of, and extract frequencies from, the Anderson impurity model on noisy quantum hardware and demonstrate the Mott transition by mapping the phase-diagram of the corresponding impurity problem. Especially near the Mott phase transition when the quasiparticle resonance frequency converges to zero and evolving the system over long-time scales is necessary, our method maintains accuracy where Trotter error would otherwise dominate. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware, made viable by a highly optimized computation in terms of gate depth, simulation error, and run-time on quantum hardware. The combination of algebraic circuit decompositions and model specific error mitigation techniques used may have applications extending beyond our use case to solving correlated electronic phenomena on noisy quantum computers.

Related papers

• Quantum Simulation of Dissipative Energy Transfer via Noisy Quantum Computer [0.40964539027092917]
  We propose a practical approach to simulate the dynamics of an open quantum system on a noisy computer. Our method leverages gate noises on the IBM-Q real device, enabling us to perform calculations using only two qubits. In the last, to deal with the increasing depth of quantum circuits when doing Trotter expansion, we introduced the transfer tensor method(TTM) to extend our short-term dynamics simulation.
  arXiv  Detail & Related papers  (2023-12-03T13:56:41Z)
• Matrix product channel: Variationally optimized quantum tensor network to mitigate noise and reduce errors for the variational quantum eigensolver [0.0]
  We develop a method to exploit the quantum-classical interface provided by informationally complete measurements. We argue that a hybrid strategy of using the quantum hardware together with the classical software outperforms a purely classical strategy. The algorithm can be applied as the final postprocessing step in the quantum hardware simulation of protein-ligand complexes in the context of drug design.
  arXiv  Detail & Related papers  (2022-12-20T13:03:48Z)
• Orders of magnitude reduction in the computational overhead for quantum many-body problems on quantum computers via an exact transcorrelated method [0.0]
  We show that the Hamiltonian becomes non-Hermitian, posing problems for quantum algorithms based on the variational principle. We overcome these limitations with the ansatz-based quantum imaginary time evolution algorithm. Our work paves the way for the use of exact transcorrelated methods for the simulations of ab initio systems on quantum computers.
  arXiv  Detail & Related papers  (2022-01-09T16:37:32Z)
• 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)
• Unraveling correlated material properties with noisy quantum computers: Natural orbitalized variational quantum eigensolving of extended impurity models within a slave-boson approach [0.0]
  We propose a method for computing space-resolved correlation properties of the two-dimensional Hubbard model within a quantum-classical embedding strategy. We solve a two-impurity embedded model requiring eight qubits with an advanced hybrid scheme on top of the Variational Quantum Eigensolver algorithm. This paves the way to a controlled solution of the Hubbard model with larger and larger embedded problems solved by quantum computers.
  arXiv  Detail & Related papers  (2021-08-24T14:58:14Z)
• 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)
• 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)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)

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.