Electronic Structure Calculations using Quantum Computing

• URL: http://arxiv.org/abs/2305.07902v1
• Date: Sat, 13 May 2023 12:02:05 GMT
• Title: Electronic Structure Calculations using Quantum Computing
• Authors: Nouhaila Innan, Muhammad Al-Zafar Khan, and Mohamed Bennai
• Abstract summary: We present a hybrid Classical-Quantum computational procedure that uses the Variational Quantum Eigensolver (VQE) algorithm. Our algorithm offers a streamlined process requiring fewer computational resources than classical methods. Results indicate the potential of the algorithm to expedite the development of new materials and technologies.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The computation of electronic structure properties at the quantum level is a crucial aspect of modern physics research. However, conventional methods can be computationally demanding for larger, more complex systems. To address this issue, we present a hybrid Classical-Quantum computational procedure that uses the Variational Quantum Eigensolver (VQE) algorithm. By mapping the quantum system to a set of qubits and utilising a quantum circuit to prepare the ground state wavefunction, our algorithm offers a streamlined process requiring fewer computational resources than classical methods. Our algorithm demonstrated similar accuracy in rigorous comparisons with conventional electronic structure methods, such as Density Functional Theory and Hartree-Fock Theory, on a range of molecules while utilising significantly fewer resources. These results indicate the potential of the algorithm to expedite the development of new materials and technologies. This work paves the way for overcoming the computational challenges of electronic structure calculations. It demonstrates the transformative impact of quantum computing on advancing our understanding of complex quantum systems.

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)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Probing Quantum Efficiency: Exploring System Hardness in Electronic Ground State Energy Estimation [0.0]
  We consider the question of how correlated the system hardness is between classical algorithms of electronic structure theory and quantum algorithms. For quantum algorithms, we have selected the Variational Quantum Eigensolver (VQE) and Quantum Phase Estimation (QPE) methods.
  arXiv  Detail & Related papers  (2023-10-31T20:07:15Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Perturbation theory with quantum signal processing [0.0]
  We provide a quantum algorithm to obtain perturbative energies on quantum computers. The proposed algorithm uses quantum signal processing (QSP) to achieve this goal. This work is a first step towards explainable'' quantum simulation on fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2022-10-03T05:20:26Z)
• Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron Correlation [58.720142291102135]
  We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer. We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
  arXiv  Detail & Related papers  (2021-06-22T18:00:00Z)
• Implementation of Quantum Machine Learning for Electronic Structure Calculations of Periodic Systems on Quantum Computing Devices [0.0]
  We implement the benchmark test of the hybrid quantum machine learning on the IBM-Q quantum computer. This benchmark result implies that the hybrid quantum machine learning, empowered by quantum computers, could provide a new way of calculating the electronic structures of quantum many-body systems.
  arXiv  Detail & Related papers  (2021-03-02T21:30:20Z)
• 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)
• Quantum computation of silicon electronic band structure [0.0]
  We show that unprecedented methods used in quantum chemistry, designed to simulate molecules on quantum processors, can be extended to calculate properties of periodic solids. In particular, we present minimal depth circuits implementing the variational quantum eigensolver algorithm and successfully use it to compute the band structure of silicon on a quantum machine for the first time.
  arXiv  Detail & Related papers  (2020-06-06T07:45:06Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)
• Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular Simulations on Quantum Computing Devices [0.0]
  We introduce a quantum solver of contracted eigenvalue equations, the quantum analogue of classical methods for the energies. We demonstrate the algorithm though computations on both a quantum simulator and two IBM quantum processing units.
  arXiv  Detail & Related papers  (2020-04-23T18:35:26Z)

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.