Extension of exactly-solvable Hamiltonians using symmetries of Lie algebras

• URL: http://arxiv.org/abs/2305.18251v2
• Date: Mon, 18 Sep 2023 17:43:57 GMT
• Title: Extension of exactly-solvable Hamiltonians using symmetries of Lie algebras
• Authors: Smik Patel, Tzu-Ching Yen, Artur F. Izmaylov
• Abstract summary: We show that a linear combination of operators forming a modest size Lie algebra can be substituted by determinants of the Lie algebra symmetries. The new class of solvable Hamiltonians can be measured efficiently using quantum circuits with gates that depend on the result of a mid-circuit measurement of the symmetries.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Exactly-solvable Hamiltonians that can be diagonalized using relatively simple unitary transformations are of great use in quantum computing. They can be employed for decomposition of interacting Hamiltonians either in Trotter-Suzuki approximations of the evolution operator for the quantum phase estimation algorithm, or in the quantum measurement problem for the variational quantum eigensolver. One of the typical forms of exactly solvable Hamiltonians is a linear combination of operators forming a modest size Lie algebra. Very frequently such linear combinations represent non-interacting Hamiltonians and thus are of limited interest for describing interacting cases. Here we propose the extension where coefficients in these combinations are substituted by polynomials of the Lie algebra symmetries. This substitution results in a more general class of solvable Hamiltonians and for qubit algebras is related to the recently proposed non-contextual Pauli Hamiltonians. In fermionic problems, this substitution leads to Hamiltonians with eigenstates that are single Slater determinants but with different sets of single-particle states for different eigenstates. The new class of solvable Hamiltonians can be measured efficiently using quantum circuits with gates that depend on the result of a mid-circuit measurement of the symmetries.

Related papers

• Scalable embedding of parity constraints in quantum annealing hardware [0.0]
  We present fixed, modular and scalable embeddings that can be used to embed any optimization problem described as an Ising Hamiltonian. These embeddings are the result of an extension of the well-known parity mapping. We show how our new embeddings can be mapped to existing quantum annealers and that the embedded Hamiltonian physical properties match the original Hamiltonian properties.
  arXiv  Detail & Related papers  (2024-05-23T16:14:33Z)
• Coherence generation with Hamiltonians [44.99833362998488]
  We explore methods to generate quantum coherence through unitary evolutions. This quantity is defined as the maximum derivative of coherence that can be achieved by a Hamiltonian. We identify the quantum states that lead to the largest coherence derivative induced by the Hamiltonian.
  arXiv  Detail & Related papers  (2024-02-27T15:06:40Z)
• Exactly solvable Hamiltonian fragments obtained from a direct sum of Lie algebras [0.0]
  Exactly solvable Hamiltonians are useful in the study of quantum many-body systems using quantum computers. We apply more general classes of exactly solvable qubit Hamiltonians than previously considered to address the Hamiltonian measurement problem.
  arXiv  Detail & Related papers  (2024-02-14T18:22:45Z)
• On The Study Of Partial Qubit Hamiltonian For Efficient Molecular Simulation Using Variational Quantum Eigensolvers [0.0]
  We present a new approach for extracting information from the partial qubit Hamiltonian of simple molecules to design more efficient variational quantum eigensolvers. The results of this study have the potential to demonstrate the potential advancement in the field of quantum computing and its implementation in quantum chemistry.
  arXiv  Detail & Related papers  (2023-08-24T03:25:05Z)
• Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians [65.268245109828]
  We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix. A quantum algorithm to simulate the dynamics of the density matrix is proposed.
  arXiv  Detail & Related papers  (2023-06-14T23:08:51Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Simultaneous Stoquasticity [0.0]
  Stoquastic Hamiltonians play a role in the computational complexity of the local Hamiltonian problem. We address the question of whether two or more Hamiltonians may be made simultaneously stoquastic via a unitary transformation.
  arXiv  Detail & Related papers  (2022-02-17T19:08:30Z)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• 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)
• Exploiting anticommutation in Hamiltonian simulation [21.306196108171164]
  Quantum computing can efficiently simulate Hamiltonian dynamics of many-body quantum physics. The hardness lies at the ubiquitous anti-commutative relations of quantum operators. We find that, contrary to our intuition, anti-commutative relations could also reduce the hardness of Hamiltonian simulation.
  arXiv  Detail & Related papers  (2021-03-14T18:13:15Z)
• Stoquasticity in circuit QED [78.980148137396]
  We show that scalable sign-problem free path integral Monte Carlo simulations can typically be performed for such systems. We corroborate the recent finding that an effective, non-stoquastic qubit Hamiltonian can emerge in a system of capacitively coupled flux qubits.
  arXiv  Detail & Related papers  (2020-11-02T16:41:28Z)

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.