A systematic variational approach to band theory in a quantum computer

• URL: http://arxiv.org/abs/2104.03409v2
• Date: Sun, 19 Dec 2021 21:40:56 GMT
• Title: A systematic variational approach to band theory in a quantum computer
• Authors: Kyle Sherbert and Frank Cerasoli and Marco Buongiorno Nardelli (Department of Physics, University of North Texas)
• Abstract summary: We present a hybrid quantum-classical algorithm to solve the band structure of any periodic system. We show that the algorithm is reliable in a low-noise device, functional with low precision on present-day noisy quantum computers.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computers promise to revolutionize our ability to simulate molecules, and cloud-based hardware is becoming increasingly accessible to a wide body of researchers. Algorithms such as Quantum Phase Estimation and the Variational Quantum Eigensolver are being actively developed and demonstrated in small systems. However, extremely limited qubit count and low fidelity seriously limit useful applications, especially in the crystalline phase, where compact orbital bases are difficult to develop. To address this difficulty, we present a hybrid quantum-classical algorithm to solve the band structure of any periodic system described by an adequate tight-binding model. We showcase our algorithm by computing the band structure of a simple-cubic crystal with one $s$ and three $p$ orbitals per site (a simple model for Polonium) using simulators with increasingly realistic levels of noise and culminating with calculations on IBM quantum computers. Our results show that the algorithm is reliable in a low-noise device, functional with low precision on present-day noisy quantum computers, and displays a complexity that scales as $\Omega(M^3)$ with the number $M$ of tight-binding orbitals per unit-cell, similarly to its classical counterparts. Our simulations offer a new insight into the ``quantum'' mindset and demonstrate how the algorithms under active development today can be optimized in special cases, such as band structure calculations.

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)
• Differentiable matrix product states for simulating variational quantum computational chemistry [6.954927515599816]
  We propose a parallelizable classical simulator for variational quantum eigensolver(VQE) Our simulator seamlessly integrates the quantum circuit evolution into the classical auto-differentiation framework. As applications, we use our simulator to study commonly used small molecules such as HF, LiH and H$$O, as well as larger molecules CO$$, BeH$ and H$_4$ with up to $40$ qubits.
  arXiv  Detail & Related papers  (2022-11-15T08:36:26Z)
• A Scalable Approach to Quantum Simulation via Projection-based Embedding [0.0]
  We describe a new and chemically intuitive approach that permits a subdomain of the electronic structure of a molecule to be calculated accurately on a quantum device. We demonstrate that our method produces improved results for molecules that cannot be simulated fully on quantum computers but which can be resolved classically at a lower level of approximation.
  arXiv  Detail & Related papers  (2022-03-02T14:27:44Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• 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)
• Quantum Assisted Simulator [0.0]
  We provide a novel hybrid quantum-classical algorithm for simulating the dynamics of quantum systems. Unlike existing variational quantum simulation algorithms, our algorithm does not require any classical-quantum feedback loop.
  arXiv  Detail & Related papers  (2020-11-12T13:52:44Z)
• 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)
• Reinforcement Learning for Digital Quantum Simulation [0.0]
  We introduce a reinforcement learning algorithm to build optimized quantum circuits for digital quantum simulation. We consistently obtain quantum circuits that reproduce physical observables with as little as three entangling gates for long times and large system sizes.
  arXiv  Detail & Related papers  (2020-06-29T18:00:11Z)
• Simulating quantum chemistry in the seniority-zero space on qubit-based quantum computers [0.0]
  We combine the so-called seniority-zero, or paired-electron, approximation of computational quantum chemistry with techniques for simulating molecular chemistry on gate-based quantum computers. We show that using the freed-up quantum resources for increasing the basis set can lead to more accurate results and reductions in the necessary number of quantum computing runs.
  arXiv  Detail & Related papers  (2020-01-31T19:44:37Z)

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.