Krylov variational quantum algorithm for first principles materials simulations

• URL: http://arxiv.org/abs/2105.13298v2
• Date: Thu, 26 Aug 2021 14:08:47 GMT
• Title: Krylov variational quantum algorithm for first principles materials simulations
• Authors: Francois Jamet, Abhishek Agarwal, Carla Lupo, Dan E. Browne, Cedric Weber, and Ivan Rungger
• Abstract summary: We propose an algorithm to obtain Green's functions as a continued fraction on quantum computers. This allows the integration of quantum algorithms with first principles material science simulations.
• Score: 2.432166214112399
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose an algorithm to obtain Green's functions as a continued fraction on quantum computers, which is based on the construction of the Krylov basis using variational quantum algorithms, and included in a Lanczos iterative scheme. This allows the integration of quantum algorithms with first principles material science simulations, as we demonstrate within the dynamical mean-field theory (DMFT) framework. DMFT enables quantitative predictions for strongly correlated materials, and relies on the calculation of Green's functions. On conventional computers the exponential growth of the Hilbert space with the number of orbitals limits DMFT to small systems. Quantum computers open new avenues and can lead to a significant speedup in the computation of expectation values required to obtain the Green's function. We apply our Krylov variational quantum algorithm combined with DMFT to the charge transfer insulator La$_{2}$CuO$_4$ using a quantum computing emulator, and show that with 8 qubits it predicts the correct insulating material properties for the paramagnetic phase. We therefore expect that the method is ideally suited to perform simulations for real materials on near term quantum hardware.

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)
• Dynamical Mean Field Theory for Real Materials on a Quantum Computer [0.0]
  We report on the development of a hybrid quantum-classical DFT+DMFT simulation framework. Hardware experiments with up to 14 qubits on the IBM Quantum system are conducted. We showcase the utility of our quantum DFT+DMFT workflow by assessing the correlation effects on the electronic structure of a real material.
  arXiv  Detail & Related papers  (2024-04-15T07:45:50Z)
• Quantum Simulation of Realistic Materials in First Quantization Using Non-local Pseudopotentials [1.3166122476354067]
  This paper improves and demonstrates the usefulness of the first quantized plane-wave algorithms for the quantum simulation of electronic structure. We focus on the Goedecker-Tetter-Hutter (GTH) pseudopotential, which is among the most accurate and widely used norm-conserving pseudopotentials. Despite the complicated form of the GTH pseudopotential, we are able to block encode the associated operator without significantly increasing the overall cost of quantum simulation.
  arXiv  Detail & Related papers  (2023-12-12T19:00:01Z)
• Quantum Thermal State Preparation [39.91303506884272]
  We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations. We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states. Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
  arXiv  Detail & Related papers  (2023-03-31T17:29:56Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• 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)
• 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)
• Hybrid quantum-classical algorithm for computing imaginary-time correlation functions [0.0]
  We propose a hybrid algorithm for computing imaginary-time Green's functions on quantum devices with limited hardware resources. Using a quantum circuit simulator, we verified this algorithm by computing Green's functions for a dimer model and a four-site impurity model.
  arXiv  Detail & Related papers  (2021-12-06T03:40:02Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Towards simulating 2D effects in lattice gauge theories on a quantum computer [1.327151508840301]
  We propose an experimental quantum simulation scheme to study ground state properties in two-dimensional quantum electrodynamics (2D QED) using existing quantum technology. The proposal builds on a formulation of lattice gauge theories as effective spin models in arXiv:2006.14160. We present two Variational Quantum Eigensolver (VQE) based protocols for the study of magnetic field effects, and for taking an important first step towards computing the running coupling of QED.
  arXiv  Detail & Related papers  (2020-08-21T01:20:55Z)
• Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum Computer Using Inherent Qubit Decoherence [53.20999552522241]
  We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems. We present three methods for implementing the thermal relaxation. We find excellent agreement between our results, experimental data, and the theoretical prediction.
  arXiv  Detail & Related papers  (2020-01-03T11:48:11Z)

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.