Quantum algorithms for quantum dynamics: A performance study on the spin-boson model

Abstract

Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. This approach typically relies on deep circuits and is therefore hampered by the substantial limitations of available noisy and near-term quantum hardware. On the other hand, variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. However, despite the recent development of variational quantum algorithms for quantum dynamics, a detailed assessment of their efficiency and scalability is yet to be presented. To fill this gap, we applied a variational quantum algorithm based on McLachlan's principle to simulate the dynamics of a spin-boson model subject to varying levels of realistic hardware noise as well as in different physical regimes, and discuss the algorithm's accuracy and scaling behavior as a function of system size. We observe a good performance of the variational approach used in combination with a general, physically motivated wavefunction ansatz, and compare it to the conventional first-order Trotter-evolution. Finally, based on this, we make scaling predictions for the simulation of a classically intractable system. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage for the solution of time-dependent problems.

8 pages, 4 figures

References in corpus (3)

• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Digital Quantum Rabi and Dicke Models in Superconducting Circuits
• Evaluating low-depth quantum algorithms for time evolution on fermion-boson systems

Cited by in corpus (24)

• Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
• Universal qudit gate synthesis for transmons
• Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation
• Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics
• Quantum algorithms for grid-based variational time evolution
• TenCirChem: An Efficient Quantum Computational Chemistry Package for the NISQ Era
• Quantum algorithms for scientific computing
• Digital Quantum Simulation of the Spin-Boson Model under Open System Dynamics
• Efficient Quantum Simulation of Electron-Phonon Systems by Variational Basis State Encoder
• Quantum Algorithms for Inverse Participation Ratio Estimation in multi-qubit and multi-qudit systems
• A Quantum Computing Implementation of Nuclear-Electronic Orbital (NEO) Theory: Towards an Exact pre-Born-Oppenheimer Formulation of Molecular Quantum Systems
• Sampling Error Analysis in Quantum Krylov Subspace Diagonalization
• Quantum Computing Simulation of a Mixed Spin-Boson Hamiltonian and Its Performance for a Cavity Quantum Electrodynamics Problem
• Approximate Quantum Compiling for Quantum Simulation: A Tensor Network based approach
• Simulating open-system molecular dynamics on analog quantum computers
• Genuine non-Gaussian entanglement of light and quantum coherence for an atom from noisy multiphoton spin-boson interactions
• Universal pulses for superconducting qudit ladder gates
• Digital Quantum Simulation of Scalar Yukawa Coupling
• Simulating the Fermi-Hubbard model with long-range hopping on a quantum computer
• A signature of quantumness in pure decoherence control
• Quantum criticality in sub-Ohmic systems with three competing terms: beyond conventional spin-boson physics
• Error and Resource Estimates of Variational Quantum Algorithms for Solving Differential Equations Based on Runge-Kutta Methods
• Time evolution of controlled many-body quantum systems with matrix product operators
• Variational Quantum Simulation of Chemical Dynamics with Quantum Computers