A Gell-Mann & Low Theorem Perspective on Quantum Computing: New Paradigm for Designing Quantum Algorithm

• URL: http://arxiv.org/abs/2311.18271v1
• Date: Thu, 30 Nov 2023 06:18:24 GMT
• Title: A Gell-Mann & Low Theorem Perspective on Quantum Computing: New Paradigm for Designing Quantum Algorithm
• Authors: Chun-Tse Li, T. Tzen Ong, Lucas Wang, Ming-Chien Hsu, Hsin Lin, and Min-Hsiu Hsieh
• Abstract summary: This work offers a new conceptual perspective for variational quantum computing based upon the Gell-Mann & Low theorem. We employ an innovative mathematical technique to explicitly unfold the normalized S-matrix, thereby enabling the systematic reconstruction of the Dyson series on a quantum computer, order by order. Our simulations indicate that this method not only successfully recovers the Dyson series but also exhibits robust and stable convergence.
• Score: 7.680510419135912
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The Gell-Mann & Low theorem is a cornerstone of Quantum Field Theory (QFT) and condensed matter physics, and many-body perturbation theory is a foundational tool for treating interactions. However, their integration into quantum algorithms remains a largely unexplored area of research, with current quantum simulation algorithms predominantly operating in the Schr\"odinger picture, leaving the potential of the interaction picture largely untapped. Our Variational Interaction-Picture S-matrix Ansatz (VIPSA) now fills this gap, specifically in the context of the Fermi-Hubbard model -- a canonical paradigm in condensed matter physics which is intricately connected to phenomena such as high-temperature superconductivity and Mott insulator transitions. This work offers a new conceptual perspective for variational quantum computing based upon the Gell-Mann & Low theorem. We achieve this by employing an innovative mathematical technique to explicitly unfold the normalized S-matrix, thereby enabling the systematic reconstruction of the Dyson series on a quantum computer, order by order. This method stands in contrast to the conventional reliance on Trotter expansion for adiabatic time evolution, marking a conceptual shift towards more sophisticated quantum algorithmic design. We leverage the strengths of the recently developed ADAPT-VQE algorithm, tailoring it to reconstruct perturbative terms effectively. Our simulations indicate that this method not only successfully recovers the Dyson series but also exhibits robust and stable convergence. We believe that our approach shows great promise in generalizing to more complex scenarios without increasing algorithmic complexity.

Related papers

• Quantum Simulation of an Open System: A Dissipative 1+1D Ising Model [0.0]
  We implement quantum algorithms for the simulation of open or complex coupling quantum field theories on IBM devices. Our successful reproduction of the transition represents a non-trivial test for current hardware.
  arXiv  Detail & Related papers  (2023-11-30T17:25:48Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Towards a Quantum Simulation of Nonlinear Sigma Models with a Topological Term [0.0]
  We show that the quantum theory is massless in the strong-coupling regime. We also highlight the limitations of current quantum algorithms, designed for noisy intermediate-scale quantum devices.
  arXiv  Detail & Related papers  (2022-10-07T16:35:03Z)
• Schrieffer-Wolff Transformation on IBM Quantum Computer [0.0]
  Schrieffer-Wolff transformation (SWT) has been extensively used in quantum many-body physics. We implement our quantum algorithm in QisKit and carry out SWT for SIAM on IBM Quantum computers.
  arXiv  Detail & Related papers  (2022-08-05T17:58:11Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  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.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• 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)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Probing Geometric Excitations of Fractional Quantum Hall States on Quantum Computers [0.0]
  In solid-state materials, fractional quantum Hall (FQH) phases attract attention as hosts of emergent geometrical excitations analogous to gravitons. Here, we identify a quasi-one-dimensional model that captures the geometric properties and graviton dynamics of FQH states. We then simulate geometric quench and the subsequent graviton dynamics on the IBM quantum computer using an optimally-compiled Trotter circuit with bespoke error mitigation.
  arXiv  Detail & Related papers  (2021-07-21T18:00: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)
• 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)
• QFold: Quantum Walks and Deep Learning to Solve Protein Folding [0.0]
  We develop quantum computational tools to predict how proteins fold in 3D. We explain how to combine recent deep learning advances with the well known technique of quantum walks applied to a Metropolis.
  arXiv  Detail & Related papers  (2021-01-25T18:00:03Z)

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.