Coarse grained intermolecular interactions on quantum processors
arXiv:2110.00968 · doi:10.1103/PhysRevA.105.062409
Abstract
Variational quantum algorithms (VQAs) are increasingly being applied in simulations of strongly-bound (covalently bonded) systems using full molecular orbital basis representations. The application of quantum computers to the weakly-bound intermolecular and non-covalently bonded regime however has remained largely unexplored. In this work, we develop a coarse-grained representation of the electronic response that is ideally suited for determining the ground state of weakly interacting molecules using a VQA. We require qubit numbers that grow linearly with the number of molecules and derive scaling behaviour for the number of circuits and measurements required, which compare favourably to traditional variational quantum eigensolver methods. We demonstrate our method on IBM superconducting quantum processors and show its capability to resolve the dispersion energy as a function of separation for a pair of non-polar molecules - thereby establishing a means by which quantum computers can model Van der Waals interactions directly from zero-point quantum fluctuations. Within this coarse-grained approximation, we conclude that current-generation quantum hardware is capable of probing energies in this weakly bound but nevertheless chemically ubiquitous and biologically important regime. Finally, we perform experiments on simulated and real quantum computers for systems of three, four and five oscillators as well as oscillators with anharmonic onsite binding potentials; the consequences of the latter are unexamined in large systems using classical computational methods but can be incorporated here with low computational overhead.
arXiv comment28 pages, 12 figures. Published version. Additional experimental results
References in corpus (52)
- Adam: A Method for Stochastic Optimization
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Barren plateaus in quantum neural network training landscapes
- A Quantum Approximate Optimization Algorithm
- Quantum computational chemistry
- Quantum Circuit Learning
- Error mitigation for short-depth quantum circuits
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Noise-Induced Barren Plateaus in Variational Quantum Algorithms
- Hartree-Fock on a superconducting qubit quantum computer
- Towards Practical Quantum Variational Algorithms
- Efficient variational quantum simulator incorporating active error minimisation
- Optimal Quantum Circuits for General Two-Qubit Gates
- Training variational quantum algorithms is NP-hard
- Cloud Quantum Computing of an Atomic Nucleus
- An initialization strategy for addressing barren plateaus in parametrized quantum circuits
- Absence of Barren Plateaus in Quantum Convolutional Neural Networks
- Variational quantum algorithms for nonlinear problems
- Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
- Hybrid quantum-classical approach to correlated materials
- Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
- Quantum equation of motion for computing molecular excitation energies on a noisy quantum processor
- Quantum Supremacy through the Quantum Approximate Optimization Algorithm
- Efficient quantum measurement of Pauli operators in the presence of finite sampling error
- Resource-Efficient Quantum Algorithm for Protein Folding
- Resource-efficient digital quantum simulation of -level systems for photonic, vibrational, and spin- Hamiltonians
- Entanglement Devised Barren Plateau Mitigation
- Correlation Matrices of Two-Mode Bosonic Systems
- Avoiding barren plateaus using classical shadows
- Measurement reduction in variational quantum algorithms
- On barren plateaus and cost function locality in variational quantum algorithms
- Digital quantum simulation of molecular vibrations
- Hardware Efficient Quantum Algorithms for Vibrational Structure Calculations
- Quantum algorithm for calculating molecular vibronic spectra
- Quantum states on Harmonic lattices
- Iterative Quantum Assisted Eigensolver
- Dynamical mean field theory algorithm and experiment on quantum computers
- Few-qubit quantum-classical simulation of strongly correlated lattice fermions
- Natural Evolutionary Strategies for Variational Quantum Computation
- Non-linear quantum-classical scheme to simulate non-equilibrium strongly correlated fermionic many-body dynamics
- Minimum Hardware Requirements for Hybrid Quantum-Classical DMFT
- A quantum alternating operator ansatz with hard and soft constraints for lattice protein folding
- Algorithmic Error Mitigation Scheme for Current Quantum Processors
- Pauli Partitioning with Respect to Gate Sets
- Quantum algorithm for nonlinear differential equations
- Molecular-scale remnants of the liquid-gas transition in supercritical polar fluids
- Electronic coarse graining enhances the predictive power of molecular simulation allowing challenges in water physics to be addressed
- User's guide to Monte Carlo methods for evaluating path integrals
Cited by in corpus (6)
- Universal control of a bosonic mode via drive-activated native cubic interactions
- Solving lattice gauge theories using the quantum Krylov algorithm and qubitization
- Partitioned Quantum Subspace Expansion
- Qualitative model of a positive hydrogen peroxide ion in a thermal bath
- A Quantum Information Perspective on Many-Body Dispersive Forces
- Modeling Non-Covalent Interatomic Interactions on a Photonic Quantum Computer