Quantum Computing Applications in Hamiltonian Simulation

The Schrödinger Equation Gets Practical: Quantum Algorithm Speeds Up Real-World Simulations Quantum computing has taken a major leap forward with a new algorithm designed to simulate coupled harmonic oscillators, systems that model everything from molecular vibrations to bridges and neural networks. By reformulating the dynamics of these oscillators into the Schrödinger equation and applying Hamiltonian simulation methods, researchers have shown that complex physical systems can be simulated exponentially faster on a quantum computer than with traditional algorithms. This breakthrough demonstrates not only a practical use of the Schrödinger equation but also the deep connection between quantum dynamics and classical mechanics. The study introduces two powerful quantum algorithms that reduce the required resources to only about log(N) qubits for N oscillators, compared to the massive computational demands of classical methods. This exponential speedup could transform fields such as engineering, chemistry, neuroscience, and material science, where coupled oscillators serve as the backbone of real-world modeling. By bridging theory and application, this research underscores how quantum computing is redefining problem-solving in physics and beyond. With proven exponential advantages and the ability to simulate systems once thought computationally impossible, this quantum algorithm marks a milestone in quantum simulation, Hamiltonian dynamics, and real-world physics applications. The findings point toward a future where quantum computers can accelerate scientific discovery, optimize engineering designs, and even open new frontiers in AI and computational neuroscience. #QuantumComputing #SchrodingerEquation #HamiltonianSimulation #QuantumAlgorithm #CoupledOscillators #QuantumPhysics #ComputationalScience #Neuroscience #Chemistry #Engineering

Exciting yet under-the-radar paper (arXiv:2506.10191) from Google Quantum AI on higher-order OTOCs (out-of-time-order correlators) -- a big leap toward practical (scientific) quantum advantage! 🚀 Using their Willow chip with ~100 qubits, they’ve shown remarkable result, yet it’s surprising this hasn’t sparked more buzz -- perhaps because OTOCs are tricky to explain to a wider audience. 🤔   Key Takeaways: 🕒 Quantum Speed: Willow chip solves quantum Hamiltonian properties in ~2.1 hours, using ~40 kWh of energy. 💻 Classical Lag: Best classical method (tensor networks) on Frontier supercomputer estimated to take 3.2 years, 550GWh energy—practically infeasible! 🧪 Real-World Impact: Enables learning properties of quantum materials, with applications in chemistry and quantum control. 10,000x reduction in needed energy for simulation.   This showcases power of NISQ-era quantum devices for quantum simulation. Shall we call it scientific quantum advantage? 📢 #QuantumComputing #QuantumAdvantage #GoogleQuantumAI

Wave-based inverse problems are prevalent in disciplines such as seismology, medical imaging, nondestructive testing and metamaterial research. However, these fields are fundamentally limited by the current state of conventional high-performance computing resources due to the excessive computational cost of the numerical wave simulation. Future quantum computers are expected to offer promising runtime improvements for numerous computational problems.   In this work, led by Cyrill Bösch, Malte Schade, Giacomo Aloisi and Scott Keating, we present a quantum algorithmic framework for simulating linear, anti-Hermitian (lossless) wave equations in heterogeneous, anisotropic media. It encompasses a broad class of wave equations, including the acoustic wave equation, Maxwell’s equations and the elastic wave equation. Our formulation is compatible with standard numerical discretization schemes and allows for the efficient implementation of multiple practically relevant time- and space-dependent sources. Furthermore, we demonstrate that subspace energies can be extracted and wave fields compared through an L2 loss function, achieving optimal precision scaling with the number of samples taken. Additionally, we introduce techniques for incorporating boundary conditions and linear constraints that preserve the anti-Hermitian nature of the equations.   Leveraging the Hamiltonian simulation algorithm, our framework achieves a quartic speedup over classical solvers in three-dimensional simulations, under conditions of sufficiently global measurements and compactly supported sources and initial conditions. This quartic speedup is optimal for time-domain solutions, as the Hamiltonian of the discretized wave equations has local couplings. In summary, our framework provides a versatile approach for simulating wave equations on quantum computers, offering substantial speedups over state-of-the-art classical methods. The open-access paper can be found here: https://lnkd.in/de9ubsyK This work would not have been possible without the help and advice of Marion Dugué, Patrick Marty, Ines Ulrich, Václav Hapla and several colleagues at Google Quantum AI (Ryan Babbush, Rolando Somma and many others). #quantumcomputing #highperformancecomputing #waves #physics #metamaterials #seismology #ndt #medicalimaging #science #research

Our new work, “Observation of Improved Accuracy over Classical Sparse Ground-State Solvers using a Quantum Computer,” in collaboration with researchers from RIKEN and the University of Chicago demonstrate how a hybrid quantum-classical algorithm can achieve higher accuracy than off-the-shelf selected configuration interaction (SCI) methods: https://lnkd.in/eQ89H8cU In this work, we construct a family of local Hamiltonians with sparse ground states that are nonetheless challenging for SCI heuristics. On the quantum side, we use sample-based Krylov quantum diagonalization (SKQD), which draws bitstring samples from time-evolved quantum states, projects the Hamiltonian into the sampled subspace, and performs a classical diagonalization step (https://lnkd.in/epwCrG5R). The natural classical comparator, SCI, uses the same project-and-diagonalize template but selects the basis classically. On a 49-qubit instance from this family, we provide the same problem instance and the same inputs to both solvers. In experiments on an IBM Heron R3 processor, SKQD identifies the exact ground state, while SCI run classically does not. As shown in the paper, these methods do not yet surpass DMRG or iterative solvers. But they do provide valuable insight into the structure of the problems where quantum methods can outperform certain classical approaches, helping us sharpen our understanding of what is needed to reach quantum advantage.

⚛️ A Rigorous Introduction to Hamiltonian Simulation via High-Order Product Formulas 📑 This work provides a rigorous and self-contained introduction to numerical methods for Hamiltonian simulation in quantum computing, with a focus on high-order product formulas for efficiently approximating the time evolution of quantum systems. Aimed at students and researchers seeking a clear mathematical treatment, the study begins with the foundational principles of quantum mechanics and quantum computation before presenting the Lie-Trotter product formula and its higher-order generalizations. In particular, Suzuki’s recursive method is explored to achieve improved error scaling. Through theoretical analysis and illustrative examples, the advantages and limitations of these techniques are discussed, with an emphasis on their application to k-local Hamiltonians and their role in overcoming classical computational bottlenecks. The work concludes with a brief overview of current advances and open challenges in Hamiltonian simulation. ℹ️ Javier Lopez-Cerezo - Department of Applied Mathematics - University of Malaga - Spain - 2025