Quantum algorithms for optimal effective theory of many-body systems

• URL: http://arxiv.org/abs/2211.14854v2
• Date: Wed, 6 Sep 2023 07:09:25 GMT
• Title: Quantum algorithms for optimal effective theory of many-body systems
• Authors: Yongdan Yang, Zongkang Zhang, Xiaosi Xu, Bing-Nan Lu, Ying Li
• Abstract summary: We propose two approaches that apply quantum computing to find the optimal effective theory of a quantum many-body system. The first algorithm searches the space of effective Hamiltonians by quantum phase estimation and amplitude amplification. The second algorithm is based on a variational approach that is promising for near-future applications.
• Score: 3.4918110778972458
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A common situation in quantum many-body physics is that the underlying theories are known but too complicated to solve efficiently. In such cases one usually builds simpler effective theories as low-energy or large-scale alternatives to the original theories. Here the central tasks are finding the optimal effective theories and proving their equivalence to the original theories. Recently quantum computing has shown the potential of solving quantum many-body systems by exploiting its inherent parallelism. It is thus an interesting topic to discuss the emergence of effective theories and design efficient tools for finding them based on the results from quantum computing. As the first step towards this direction, in this paper, we propose two approaches that apply quantum computing to find the optimal effective theory of a quantum many-body system given its full Hamiltonian. The first algorithm searches the space of effective Hamiltonians by quantum phase estimation and amplitude amplification. The second algorithm is based on a variational approach that is promising for near-future applications.

Related papers

• Universal Euler-Cartan Circuits for Quantum Field Theories [0.0]
  A hybrid quantum-classical algorithm is presented for the computation of non-perturbative characteristics of quantum field theories. The algorithm relies on a universal parametrized quantum circuit ansatz based on Euler and Cartan's decompositions of single and two-qubit operators.
  arXiv  Detail & Related papers  (2024-07-31T01:59:09Z)
• Bridging Classical and Quantum: Group-Theoretic Approach to Quantum Circuit Simulation [0.0]
  Efficiently simulating quantum circuits on classical computers is a fundamental challenge in quantum computing. This paper presents a novel theoretical approach that achieves exponential speedups (polynomial runtime) over existing simulators. The findings may have implications for quantum algorithm design, error correction, and the development of more efficient quantum simulators.
  arXiv  Detail & Related papers  (2024-07-28T20:02:21Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Hamiltonian truncation tensor networks for quantum field theories [42.2225785045544]
  We introduce a tensor network method for the classical simulation of continuous quantum field theories. The method is built on Hamiltonian truncation and tensor network techniques. One of the key developments is the exact construction of matrix product state representations of global projectors.
  arXiv  Detail & Related papers  (2023-12-19T19:00:02Z)
• Quantum Simulation of Bound State Scattering [0.0]
  We present a strategy to excite wavepackets of the interacting theory directly from the vacuum of the interacting theory. This is the first step towards digital quantum simulation of scattering of bound states.
  arXiv  Detail & Related papers  (2023-05-12T18:00:01Z)
• 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)
• Theory and Implementation of the Quantum Approximate Optimization Algorithm: A Comprehensible Introduction and Case Study Using Qiskit and IBM Quantum Computers [0.0]
  We lay our focus on practical aspects and step-by-step guide through the realization of a proof of concept quantum application. In every step we first explain the underlying theory and subsequently provide the implementation using IBM's Qiskit. As another central aspect of this tutorial we provide extensive experiments on the 27 qubits state-of-the-art quantum computer ibmq_ehningen.
  arXiv  Detail & Related papers  (2023-01-23T16:38:06Z)
• Perturbation theory with quantum signal processing [0.0]
  We provide a quantum algorithm to obtain perturbative energies on quantum computers. The proposed algorithm uses quantum signal processing (QSP) to achieve this goal. This work is a first step towards explainable'' quantum simulation on fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2022-10-03T05:20:26Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Quantum simulation of gauge theory via orbifold lattice [47.28069960496992]
  We propose a new framework for simulating $textU(k)$ Yang-Mills theory on a universal quantum computer. We discuss the application of our constructions to computing static properties and real-time dynamics of Yang-Mills theories.
  arXiv  Detail & Related papers  (2020-11-12T18:49:11Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.