Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer

Abstract

Simulating chemical systems is highly sought after and computationally challenging, as the number of degrees of freedom increases exponentially with the size of the system. Quantum computers have been proposed as a computational means to overcome this bottleneck , thanks to their capability of representing this amount of information efficiently. Most efforts so far have been centered around determining the ground states of chemical systems. However, hardness results and the lack of theoretical guarantees for efficient heuristics for initial-state generation shed doubt on the feasibility. Here, we propose a heuristically guided approach that is based on inherently efficient routines to solve chemical simulation problems, requiring quantum circuits of size scaling polynomially in relevant system parameters. If a set of assumptions can be satisfied, our approach finds good initial states for dynamics simulation by assembling them in a scattering tree. In particular, we investigate a scattering-based state preparation approach within the context of mergo-association. We discuss a variety of quantities of chemical interest that can be measured after the quantum simulation of a process, e.g., a reaction, following its corresponding initial state preparation.

significant update, added section IV; 32 pages, 6 figures

References in corpus (37)

• Simulated Quantum Computation of Molecular Energies
• Challenges and Opportunities in Quantum Machine Learning
• Quantum advantage in learning from experiments
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Is there evidence for exponential quantum advantage in quantum chemistry?
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Non-adiabatic molecular quantum dynamics with quantum computers
• Prospects of Quantum Computing for Molecular Sciences
• Formation of ultracold molecules by merging optical tweezers
• Single-ancilla ground state preparation via Lindbladians
• Hybridized Methods for Quantum Simulation in the Interaction Picture
• Grid-based methods for chemistry simulations on a quantum computer
• Merlin-Arthur Games and Stoquastic Complexity
• Rapid initial state preparation for the quantum simulation of strongly correlated molecules
• qSWIFT: High-order randomized compiler for Hamiltonian simulation
• Composite Quantum Simulations
• Simulating Non-Markovian Quantum Dynamics on NISQ Computers Using the Hierarchical Equations of Motion
• Quantum Thermal State Preparation
• Circuit complexity of quantum access models for encoding classical data
• Uncomputability of Phase Diagrams
• Quantum Simulations of Chemistry in First Quantization with any Basis Set
• Faster quantum chemistry simulations on a quantum computer with improved tensor factorization and active volume compilation
• Efficient Quantum Algorithm for All Quantum Wavelet Transforms
• Weakly measured while loops: peeking at quantum states
• Efficient and practical Hamiltonian simulation from time-dependent product formulas
• Simulating open-system molecular dynamics on analog quantum computers
• Improved precision scaling for simulating coupled quantum-classical dynamics
• Lower bound for simulation cost of open quantum systems: Lipschitz continuity approach
• Quantum Algorithm for Vibronic Dynamics: Case Study on Singlet Fission Solar Cell Design
• Parallel-in-time quantum simulation via Page and Wootters quantum time
• Low-depth quantum symmetrization
• Toward end-to-end quantum simulation for protein dynamics
• Low Depth Phase Oracle Using a Parallel Piecewise Circuit
• Faster Algorithmic Quantum and Classical Simulations by Corrected Product Formulas
• Dividing and Conquering the Van Vleck Catastrophe
• On the Computational Complexity of Schrödinger Operators
• The Thermodynamic Cost of Ignorance: Thermal State Preparation with One Ancilla Qubit