Adiabatic quantum algorithm for artificial graphene

• URL: http://arxiv.org/abs/2204.03013v1
• Date: Wed, 6 Apr 2022 18:00:25 GMT
• Title: Adiabatic quantum algorithm for artificial graphene
• Authors: Axel P\'erez-Obiol, Adri\'an P\'erez-Salinas, Sergio S\'anchez-Ram\'irez, Bruna G. M. Ara\'ujo, Artur Garcia-Saez
• Abstract summary: We devise a quantum-circuit algorithm to solve the ground state and ground energy of artificial graphene. A full simulation of the algorithm is performed and ground energies are obtained for lattices with up to four hexagons.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We devise a quantum-circuit algorithm to solve the ground state and ground energy of artificial graphene. The algorithm implements a Trotterized adiabatic evolution from a purely tight-binding Hamiltonian to one including kinetic, spin-orbit and Coulomb terms. The initial state is obtained efficiently using Gaussian-state preparation, while the readout of the ground energy is organized into seventeen sets of measurements, irrespective of the size of the problem. The total depth of the corresponding quantum circuit scales polynomially with the size of the system. A full simulation of the algorithm is performed and ground energies are obtained for lattices with up to four hexagons. Our results are benchmarked with exact diagonalization for systems with one and two hexagons. For larger systems we use the exact statevector and approximate matrix product state simulation techniques. The latter allows to systematically trade off precision with memory and therefore to tackle larger systems. We analyze adiabatic and Trotterization errors, providing estimates for optimal periods and time discretizations given a finite accuracy. In the case of large systems we also study approximation errors.

Related papers

• Benchmarking a heuristic Floquet adiabatic algorithm for the Max-Cut problem [0.0]
  We show that adiabatic evolution can be performed with a fixed, finite Trotter step. We give numerical evidence using matrix-product-state simulations that it can optimally solve the Max-Cut problem. Extrapolating our numerical results, we estimate the resources needed for a quantum computer to compete with classical exact or approximate solvers.
  arXiv  Detail & Related papers  (2024-04-24T17:29:03Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Quantum algorithm for collisionless Boltzmann simulation of self-gravitating systems [0.0]
  We propose an efficient quantum algorithm to solve the collisionless Boltzmann equation (CBE) We extend the algorithm to perform quantum simulations of self-gravitating systems, incorporating the method to calculate gravity. It will allow us to perform large-scale CBE simulations on future quantum computers.
  arXiv  Detail & Related papers  (2023-03-29T06:59:00Z)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• Characterization of variational quantum algorithms using free fermions [0.0]
  We numerically study the interplay between these symmetries and the locality of the target state. We find that the number of iterations to converge to the solution scales linearly with system size.
  arXiv  Detail & Related papers  (2022-06-13T18:11:16Z)
• On optimization of coherent and incoherent controls for two-level quantum systems [77.34726150561087]
  This article considers some control problems for closed and open two-level quantum systems. The closed system's dynamics is governed by the Schr"odinger equation with coherent control. The open system's dynamics is governed by the Gorini-Kossakowski-Sudarshan-Lindblad master equation.
  arXiv  Detail & Related papers  (2022-05-05T09:08:03Z)
• Neural-Network Quantum States for Periodic Systems in Continuous Space [66.03977113919439]
  We introduce a family of neural quantum states for the simulation of strongly interacting systems in the presence of periodicity. For one-dimensional systems we find very precise estimations of the ground-state energies and the radial distribution functions of the particles. In two dimensions we obtain good estimations of the ground-state energies, comparable to results obtained from more conventional methods.
  arXiv  Detail & Related papers  (2021-12-22T15:27:30Z)
• 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)
• Spectral Analysis of Product Formulas for Quantum Simulation [0.0]
  We show that the Trotter step size needed to estimate an energy eigenvalue within precision can be improved in scaling from $epsilon$ to $epsilon1/2$ for a large class of systems. Results partially generalize to diabatic processes, which remain in a narrow energy band separated from the rest of the spectrum by a gap.
  arXiv  Detail & Related papers  (2021-02-25T03:17:25Z)
• Efficient construction of tensor-network representations of many-body Gaussian states [59.94347858883343]
  We present a procedure to construct tensor-network representations of many-body Gaussian states efficiently and with a controllable error. These states include the ground and thermal states of bosonic and fermionic quadratic Hamiltonians, which are essential in the study of quantum many-body systems.
  arXiv  Detail & Related papers  (2020-08-12T11:30:23Z)
• Entanglement Production and Convergence Properties of the Variational Quantum Eigensolver [0.0]
  We use the Variational Quantum Eigensolver (VQE) algorithm to determine the ground state energies of two-dimensional model fermionic systems. In particular, we focus on the nature of the entangler blocks which provide the most efficient convergence to the system ground state. We show that the number of gates required to reach a solution within an error follows the Solovay-Kitaev scaling.
  arXiv  Detail & Related papers  (2020-03-27T15:44:56Z)

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.