Quantum simulation of chemical systems is one of the most promising near-term applications of quantum computers. The variational quantum eigensolver, a leading algorithm for molecular simulations on quantum hardware, has a serious limitation in that it typically relies on a pre-selected wavefunction ansatz that results in approximate wavefunctions and energies. Here we present an arbitrarily accurate variational algorithm that, instead of fixing an ansatz upfront, grows it systematically one operator at a time in a way dictated by the molecule being simulated. This generates an ansatz with a small number of parameters, leading to shallow-depth circuits. We present numerical simulations, including for a prototypical strongly correlated molecule, which show that our algorithm performs much better than a unitary coupled cluster approach, in terms of both circuit depth and chemical accuracy. Our results highlight the potential of our adaptive algorithm for exact simulations with present-day and near-term quantum hardware.
Download full-text PDF |
Source |
|---|---|
| http://www.ncbi.nlm.nih.gov/pmc/articles/PMC6614426 | PMC |
| http://dx.doi.org/10.1038/s41467-019-10988-2 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
A structural health monitoring data reconstruction method based on VMD and SSA-optimized GRU model.
Sci Rep
January 2025
School of Civil Engineering, Qingdao University of Technology, Qingdao, 266525, China.
In the field of Structural Health Monitoring (SHM), complete datasets are fundamental for modal identification analysis and risk prediction. However, data loss due to sensor failures, transmission interruptions, or hardware issues is a common problem. To address this challenge, this study develops a method combining Variational Mode Decomposition (VMD) and Sparrow Search Algorithm (SSA)-optimized Gate Recurrent Unit (GRU) for recovering structural response data.
View Article and Find Full Text PDFVAE-Surv: A novel approach for genetic-based clustering and prognosis prediction in myelodysplastic syndromes.
Comput Methods Programs Biomed
January 2025
Computational Biomedicine Unit, Department of Medical Sciences, University of Torino, Via Santena 19, 10126, Torino, Italy.
Background And Objectives: Several computational pipelines for biomedical data have been proposed to stratify patients and to predict their prognosis through survival analysis. However, these analyses are usually performed independently, without integrating the information derived from each of them. Clustering of survival data is an underexplored problem, and current approaches are limited for biomedical applications, whose data are usually heterogeneous and multimodal, with poor scalability for high-dimensionality.
View Article and Find Full Text PDFCharacterizing Conical Intersections of Nucleobases on Quantum Computers.
J Chem Theory Comput
January 2025
Department of Chemistry and The James Franck Institute, The University of Chicago, Chicago, Illinois 60637, United States.
Hybrid quantum-classical computing algorithms offer significant potential for accelerating the calculation of the electronic structure of strongly correlated molecules. In this work, we present the first quantum simulation of conical intersections (CIs) in a biomolecule, cytosine, using a superconducting quantum computer. We apply the contracted quantum eigensolver (CQE)─with comparisons to conventional variational quantum deflation (VQD)─to compute the near-degenerate ground and excited states associated with the conical intersection, a key feature governing the photostability of DNA and RNA.
View Article and Find Full Text PDFUnsupervised data imputation with multiple importance sampling variational autoencoders.
Sci Rep
January 2025
School of Mathematics and Statistics, Shaoguan University, Shaoguan, 512005, China.
Recently, deep latent variable models have made significant progress in dealing with missing data problems, benefiting from their ability to capture intricate and non-linear relationships within the data. In this work, we further investigate the potential of Variational Autoencoders (VAEs) in addressing the uncertainty associated with missing data via a multiple importance sampling strategy. We propose a Missing data Multiple Importance Sampling Variational Auto-Encoder (MMISVAE) method to effectively model incomplete data.
View Article and Find Full Text PDFEEG-to-EEG: Scalp-to-Intracranial EEG Translation Using a Combination of Variational Autoencoder and Generative Adversarial Networks.
Sensors (Basel)
January 2025
Department of Electrical and Electronic Engineering, Imperial College London, London SW7 2AZ, UK.
A generative adversarial network (GAN) makes it possible to map a data sample from one domain to another one. It has extensively been employed in image-to-image and text-to image translation. We propose an EEG-to-EEG translation model to map the scalp-mounted EEG (scEEG) sensor signals to intracranial EEG (iEEG) sensor signals recorded by foramen ovale sensors inserted into the brain.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!