Diagonalization of large many-body Hamiltonians on a quantum processor

• URL: http://arxiv.org/abs/2407.14431v3
• Date: Thu, 3 Oct 2024 02:22:52 GMT
• Title: Diagonalization of large many-body Hamiltonians on a quantum processor
• Authors: Nobuyuki Yoshioka, Mirko Amico, William Kirby, Petar Jurcevic, Arkopal Dutt, Bryce Fuller, Shelly Garion, Holger Haas, Ikko Hamamura, Alexander Ivrii, Ritajit Majumdar, Zlatko Minev, Mario Motta, Bibek Pokharel, Pedro Rivero, Kunal Sharma, Christopher J. Wood, Ali Javadi-Abhari, Antonio Mezzacapo,
• Abstract summary: We use a superconducting quantum processor to compute eigenenergies of quantum many-body systems on two-dimensional lattices of up to 56 sites. We construct subspaces of the many-body Hilbert space using Trotterized unitary evolutions executed on the quantum processor.
• Score: 28.65071920454694
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The estimation of low energies of many-body systems is a cornerstone of computational quantum sciences. Variational quantum algorithms can be used to prepare ground states on pre-fault-tolerant quantum processors, but their lack of convergence guarantees and impractical number of cost function estimations prevent systematic scaling of experiments to large systems. Alternatives to variational approaches are needed for large-scale experiments on pre-fault-tolerant devices. Here, we use a superconducting quantum processor to compute eigenenergies of quantum many-body systems on two-dimensional lattices of up to 56 sites, using the Krylov quantum diagonalization algorithm, an analog of the well-known classical diagonalization technique. We construct subspaces of the many-body Hilbert space using Trotterized unitary evolutions executed on the quantum processor, and classically diagonalize many-body interacting Hamiltonians within those subspaces. These experiments show that quantum diagonalization algorithms are poised to complement their classical counterpart at the foundation of computational methods for quantum systems.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• Quantum computing topological invariants of two-dimensional quantum matter [0.0]
  We present two quantum circuits for calculating Chern numbers of two-dimensional quantum matter on quantum computers. First algorithm uses many qubits, and we analyze it using a tensor-network simulator of quantum circuits. Second circuit uses fewer qubits, and we implement it experimentally on a quantum computer based on superconducting qubits.
  arXiv  Detail & Related papers  (2024-04-09T06:22:50Z)
• Entanglement Forging with generative neural network models [0.0]
  We show that a hybrid quantum-classical variational ans"atze can forge entanglement to lower quantum resource overhead. The method is efficient in terms of the number of measurements required to achieve fixed precision on expected values of observables.
  arXiv  Detail & Related papers  (2022-05-02T14:29:17Z)
• Simulating quantum circuits using the multi-scale entanglement renormalization ansatz [0.0]
  We propose a scalable technique for approximate simulations of intermediate-size quantum circuits. We benchmark the proposed technique for checkerboard-type intermediate-size quantum circuits of 27 qubits with various depths.
  arXiv  Detail & Related papers  (2021-12-28T09:05:01Z)
• Expanding variational quantum eigensolvers to larger systems by dividing the calculations between classical and quantum hardware [0.0]
  We present a hybrid classical/quantum algorithm for efficiently solving the eigenvalue problem of many-particle Hamiltonians on quantum computers with limited resources. This algorithm reduces the needed number of qubits at the expense of an increased number of quantum evaluations.
  arXiv  Detail & Related papers  (2021-12-09T17:37:41Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Advancing Hybrid Quantum-Classical Algorithms via Mean-Operators [0.30905468888217874]
  Entanglement in quantum many-body systems is the key concept for future technology and science. We propose a theory which overcomes the limitations by combining advantages of the hybrid algorithms and the standard mean-field-theory in condensed matter physics.
  arXiv  Detail & Related papers  (2021-07-15T18:00:04Z)
• 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)
• 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.