Determining ground-state phase diagrams on quantum computers via a generalized application of adiabatic state preparation

• URL: http://arxiv.org/abs/2112.04625v1
• Date: Wed, 8 Dec 2021 23:59:33 GMT
• Title: Determining ground-state phase diagrams on quantum computers via a generalized application of adiabatic state preparation
• Authors: Akhil Francis, Ephrata Zelleke, Ziyue Zhang, Alexander F. Kemper, J. K. Freericks
• Abstract summary: We use a local adiabatic ramp for state preparation to allow us to directly compute ground-state phase diagrams on a quantum computer via time evolution. We are able to calculate an accurate phase diagram on both two and three site systems using IBM quantum machines.
• Score: 61.49303789929307
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum phase transitions materialize as level crossings in the ground-state energy when the parameters of the Hamiltonian are varied. The resulting ground-state phase diagrams are straightforward to determine by exact diagonalization on classical computers, but are challenging on quantum computers because of the accuracy needed and the near degeneracy of competing states close to the level crossings. In this work, we use a local adiabatic ramp for state preparation to allow us to directly compute ground-state phase diagrams on a quantum computer via time evolution. This methodology is illustrated by examining the ground states of the XY model with a magnetic field in the z-direction in one dimension. We are able to calculate an accurate phase diagram on both two and three site systems using IBM quantum machines.

Related papers

• Thermalization and Criticality on an Analog-Digital Quantum Simulator [133.58336306417294]
  We present a quantum simulator comprising 69 superconducting qubits which supports both universal quantum gates and high-fidelity analog evolution. We observe signatures of the classical Kosterlitz-Thouless phase transition, as well as strong deviations from Kibble-Zurek scaling predictions. We digitally prepare the system in pairwise-entangled dimer states and image the transport of energy and vorticity during thermalization.
  arXiv  Detail & Related papers  (2024-05-27T17:40:39Z)
• Unveiling quantum phase transitions from traps in variational quantum algorithms [0.0]
  We introduce a hybrid algorithm that combines quantum optimization with classical machine learning. We use LASSO for identifying conventional phase transitions and the Transformer model for topological transitions. Our protocol significantly enhances efficiency and precision, opening new avenues in the integration of quantum computing and machine learning.
  arXiv  Detail & Related papers  (2024-05-14T09:01:41Z)
• Cost of Locally Approximating High-Dimensional Ground States of Contextual Quantum Models [1.5844265436419382]
  Contextuality, one of the strongest forms of quantum correlations, delineates the quantum world and the classical one. Some quantum models, in the form of infinite one-dimensional translation-invariant Hamiltonians, have the lowest ground state energy density allowed in quantum physics. We develop a universal set of permutation-symmetry preserving qubit-based gates, using them as an ansatz to simulate parameterized quantum circuits designed for qutrits.
  arXiv  Detail & Related papers  (2024-05-08T08:35:31Z)
• Reaction dynamics with qubit-efficient momentum-space mapping [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response. We consider a qubit-efficient mapping on a lattice, which can be efficiently performed using momentum-space basis states.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• Simulating 2D topological quantum phase transitions on a digital quantum computer [3.727382912998531]
  Efficient preparation of many-body ground states is key to harnessing the power of quantum computers in studying quantum many-body systems. We propose a simple method to design exact linear-depth parameterized quantum circuits which prepare a family of ground states across topological quantum phase transitions in 2D. We show that the 2D isoTNS can also be efficiently simulated by a holographic quantum algorithm requiring only an 1D array of qubits.
  arXiv  Detail & Related papers  (2023-12-08T15:01:44Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Sketching phase diagrams using low-depth variational quantum algorithms [0.04297070083645048]
  We investigate using quantum computers and the Variational Quantum Eigensolver (VQE) for this task. In contrast to the task of preparing the exact ground state using VQE, sketching phase diagrams might require less quantum resources and accuracy. We find that it is possible to predict the location of phase transitions up to reasonable accuracy using states produced by VQE.
  arXiv  Detail & Related papers  (2023-01-23T11:25:04Z)
• Preparing Valence-Bond-Solid states on noisy intermediate-scale quantum computers [0.5608803995383594]
  We propose methods to initialize on a gate-based quantum computer a general class of quantum spin wave functions. VBS states are the exact ground states of a class of interacting quantum spin models introduced by Affleck, Kennedy, Lieb and Tasaki. We find that schemes to prepare VBS states based on their tensor-network representations yield quantum circuits that are too deep to be within reach of noisy intermediate-scale quantum computers.
  arXiv  Detail & Related papers  (2022-07-15T19:40:15Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)

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.