Adiabatic quantum algorithm for artificial graphene

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.

13 pages, 7 figures: paper with code

References in corpus (13)

• Electric Field Effect in Atomically Thin Carbon Films
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• The density-matrix renormalization group in the age of matrix product states
• Quantum computational advantage using photons
• Simulated Quantum Computation of Molecular Energies
• Power of data in quantum machine learning
• Quantum advantage in learning from experiments
• A rigorous and robust quantum speed-up in supervised machine learning
• Superconductivity in rhombohedral trilayer graphene
• Engineering artificial graphene in a two-dimensional electron gas
• Realizable Hamiltonians for Universal Adiabatic Quantum Computers
• Qibo: a framework for quantum simulation with hardware acceleration
• The performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs

Cited by in corpus (5)

• Nuclear shell-model simulation in digital quantum computers
• Quantum entanglement patterns in the structure of atomic nuclei within the nuclear shell model
• A Quantum Annealing Protocol to Solve the Nuclear Shell Model
• Exploring Ground States of Fermi-Hubbard Model on Honeycomb Lattices with Counterdiabaticity
• Survey on Computational Applications of Tensor Network Simulations