Density functionals and Kohn-Sham potentials with minimal wavefunction preparations on a quantum computer

• URL: http://arxiv.org/abs/2008.05592v3
• Date: Tue, 17 Nov 2020 12:44:53 GMT
• Title: Density functionals and Kohn-Sham potentials with minimal wavefunction preparations on a quantum computer
• Authors: Thomas E. Baker and David Poulin
• Abstract summary: One of the potential applications of a quantum computer is solving quantum chemical systems. We demonstrate a method for obtaining the exact functional as a machine learned model from a sufficiently powerful quantum computer.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: One of the potential applications of a quantum computer is solving quantum chemical systems. It is known that one of the fastest ways to obtain somewhat accurate solutions classically is to use approximations of density functional theory. We demonstrate a general method for obtaining the exact functional as a machine learned model from a sufficiently powerful quantum computer. Only existing assumptions for the current feasibility of solutions on the quantum computer are used. Several known algorithms including quantum phase estimation, quantum amplitude estimation, and quantum gradient methods are used to train a machine learned model. One advantage of this combination of algorithms is that the quantum wavefunction does not need to be completely re-prepared at each step, lowering a sizable pre-factor. Using the assumptions for solutions of the ground-state algorithms on a quantum computer, we demonstrate that finding the Kohn-Sham potential is not necessarily more difficult than the ground state density. Once constructed, a classical user can use the resulting machine learned functional to solve for the ground state of a system self-consistently, provided the machine learned approximation is accurate enough for the input system. It is also demonstrated how the classical user can access commonly used time- and temperature-dependent approximations from the ground state model. Minor modifications to the algorithm can learn other types of functional theories including exact time- and temperature-dependence. Several other algorithms--including quantum machine learning--are demonstrated to be impractical in the general case for this problem.

Related papers

• Rapidly Achieving Chemical Accuracy with Quantum Computing Enforced Language Model [22.163742052849432]
  QiankunNet-VQE is a transformer based language models enforced with quantum computing to learn and generate quantum states. It has been implemented using up to 12 qubits and attaining an accuracy level competitive with state-of-the-art classical methods.
  arXiv  Detail & Related papers  (2024-05-15T07:50:57Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• 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)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Variational quantum algorithm based on the minimum potential energy for solving the Poisson equation [7.620967781722716]
  We present a variational quantum algorithm for solving the Poisson equation. The proposed method defines the total potential energy of the Poisson equation as a Hamiltonian. Because the number of terms is independent of the size of the problem, this method requires relatively few quantum measurements.
  arXiv  Detail & Related papers  (2021-06-17T09:01:53Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Iterative Quantum Assisted Eigensolver [0.0]
  We provide a hybrid quantum-classical algorithm for approximating the ground state of a Hamiltonian. Our algorithm builds on the powerful Krylov subspace method in a way that is suitable for current quantum computers.
  arXiv  Detail & Related papers  (2020-10-12T12:25:16Z)
• 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)

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.