Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1910.04292 · npj Quantum Information

Variational fast forwarding for quantum simulation beyond the coherence time

Cristina Cîrstoiu, Zoë Holmes, Joseph T. Iosue, Łukasz Cincio, Patrick J. Coles, Andrew T. Sornborger

Published Sep 18, 2020• 258 citations
arXivHTMLPDF

Abstract

Abstract Trotterization-based, iterative approaches to quantum simulation (QS) are restricted to simulation times less than the coherence time of the quantum computer (QC), which limits their utility in the near term. Here, we present a hybrid quantum-classical algorithm, called variational fast forwarding (VFF), for decreasing the quantum circuit depth of QSs. VFF seeks an approximate diagonalization of a short-time simulation to enable longer-time simulations using a constant number of gates. Our error analysis provides two results: (1) the simulation error of VFF scales at worst linearly in the fast-forwarded simulation time, and (2) our cost function’s operational meaning as an upper bound on average-case simulation error provides a natural termination condition for VFF. We implement VFF for the Hubbard, Ising, and Heisenberg models on a simulator. In addition, we implement VFF on Rigetti’s QC to demonstrate simulation beyond the coherence time. Finally, we show how to estimate energy eigenvalues using VFF.

DOI
10.1038/s41534-020-00302-0

Related papers

Variational Fast Forwarding for Efficient Evaluation of Many-Body Green’s Functions

Xiang Zhang, Xiangzhen Zhou, Fanxu Meng +4 more

Abstract Many-body Green’s functions are essential for characterizing excitation and spectral properties in strongly correlated quantum systems; however, their long-time dynamical evaluation remains computationally intractable on classical computers. Quantum computing offers a promising alternative for simulating such dynamics, yet existing approaches based on Trotterized time evolution suffer from a critical drawback: circuit depth grows linearly with simulated time, severely limiting performance on noisy intermediate-scale quantum (NISQ) devices due to gate errors and decoherence. In this work, we propose a fixed-depth quantum circuit framework to evaluate real-time many-body Green’s functions via Variational Fast Forwarding (VFF). By integrating a fixed-depth VFF-based evolution module into a standard ancilla-assisted interferometric measurement scheme, we enable direct extraction of Green’s function values. Numerical simulations on the two-site Hubbard model demonstrate that the approach reconstructs both the real-time Green’s function and the corresponding frequency-domain spectral function. Under a hardware-motivated noise model, a first-order Trotter circuit with step △ t = 0.1 suffers a fidelity collapse below 0.2 as its depth grows with t, whereas the compiled VFF circuit keeps a state fidelity above 0.8 over the same window. At t = 25 the evolution blocks U ( t ) contain 4751 and 79 CNOT gates. Training uses exact probabilities, without finite-shot sampling. The practical training cost and the performance on larger systems remain open.

Chinese Physics B•Nov 4, 2026•0 citations

Variational Hamiltonian Diagonalization for Dynamical Quantum Simulation

Benjamin Commeau, Marco Cerezo, Zoë Holmes +3 more

Dynamical quantum simulation may be one of the first applications to see quantum advantage. However, the circuit depth of standard Trotterization methods can rapidly exceed the coherence time of noisy quantum computers. This has led to recent proposals for variational approaches to dynamical simulation. In this work, we aim to make variational dynamical simulation even more practical and near-term. We propose a new algorithm called Variational Hamiltonian Diagonalization (VHD), which approximately transforms a given Hamiltonian into a diagonal form that can be easily exponentiated. VHD allows for fast forwarding, i.e., simulation beyond the coherence time of the quantum computer with a fixed-depth quantum circuit. It also removes Trotterization error and allows simulation of the entire Hilbert space. We prove an operational meaning for the VHD cost function in terms of the average simulation fidelity. Moreover, we prove that the VHD cost function does not exhibit a shallow-depth barren plateau, i.e., its gradient does not vanish exponentially. Our proof relies on locality of the Hamiltonian, and hence we connect locality to trainability. Our numerical simulations verify that VHD can be used for fast-forwarding dynamics.

arXiv:2009.02559•Bulletin of the American Physical Society•Sep 5, 2020•91 citations

Long-time simulations for fixed input states on quantum hardware

Joe Gibbs, Kaitlin Gili, Zoë Holmes +5 more

Abstract Publicly accessible quantum computers open the exciting possibility of experimental dynamical quantum simulations. While rapidly improving, current devices have short coherence times, restricting the viable circuit depth. Despite these limitations, we demonstrate long-time, high fidelity simulations on current hardware. Specifically, we simulate an XY-model spin chain on Rigetti and IBM quantum computers, maintaining a fidelity over 0.9 for 150 times longer than is possible using the iterated Trotter method. Our simulations use an algorithm we call fixed state Variational Fast Forwarding (fsVFF). Recent work has shown an approximate diagonalization of a short time evolution unitary allows a fixed-depth simulation. fsVFF substantially reduces the required resources by only diagonalizing the energy subspace spanned by the initial state, rather than over the total Hilbert space. We further demonstrate the viability of fsVFF through large numerical simulations, and provide an analysis of the noise resilience and scaling of simulation errors.

arXiv:2102.04313•npj Quantum Information•Nov 19, 2022•95 citations

Fast-forwarding with NISQ processors without feedback loop

Kian Hwee Lim, Tobias Haug, L. C. Kwek +1 more

Abstract Simulating quantum dynamics is expected to be performed more easily on a quantum computer than on a classical computer. However, the currently available quantum devices lack the capability to implement fault-tolerant quantum algorithms for quantum simulation. Hybrid classical quantum algorithms such as the variational quantum algorithms have been proposed to effectively use current term quantum devices. One promising approach to quantum simulation in the noisy intermediate-scale quantum (NISQ) era is the diagonalisation based approach, with some of the promising examples being the subspace variational quantum simulator (SVQS), variational fast forwarding (VFF), fixed-state variational fast forwarding (fs-VFF), and the variational Hamiltonian diagonalisation (VHD) algorithms. However, these algorithms require a feedback loop between the classical and quantum computers, which can be a crucial bottleneck in practical application. Here, we present the classical quantum fast forwarding (CQFF) as an alternative diagonalisation based algorithm for quantum simulation. CQFF shares some similarities with SVQS, VFF, fs-VFF and VHD but removes the need for a classical-quantum feedback loop and controlled multi-qubit unitaries. The CQFF algorithm does not suffer from the barren plateau problem and the accuracy can be systematically increased. Furthermore, if the Hamiltonian to be simulated is expressed as a linear combination of tensored-Pauli matrices, the CQFF algorithm reduces to the task of sampling some many-body quantum state in a set of Pauli-rotated bases, which is easy to do in the NISQ era. We run the CQFF algorithm on existing quantum processors and demonstrate the promise of the CQFF algorithm for current-term quantum hardware. We compare CQFF with Trotterization for a XY spin chain model Hamiltonian and find that the CQFF algorithm can simulate the dynamics more than 10 5 times longer than Trotterization on current-term quantum hardware. This provides a 10 4 times improvement over the previous record.

arXiv:2104.01931•Quantum Science and Technology•Oct 8, 2021•18 citations

Variational Phase Estimation with Variational Fast Forwarding

Maria-Andreea Filip, David Muñoz Ramo, Nathan Fitzpatrick

Subspace diagonalisation methods have appeared recently as promising means to access the ground state and some excited states of molecular Hamiltonians by classically diagonalising small matrices, whose elements can be efficiently obtained by a quantum computer. The recently proposed Variational Quantum Phase Estimation (VQPE) algorithm uses a basis of real time-evolved states, for which the energy eigenvalues can be obtained directly from the unitary matrix U=e−iHΔt , which can be computed with cost linear in the number of states used. In this paper, we report a circuit-based implementation of VQPE for arbitrary molecular systems and assess its performance and costs for the H2 , H3+ and H6 molecules. We also propose using Variational Fast Forwarding (VFF) to decrease to quantum depth of time-evolution circuits for use in VQPE. We show that the approximation provides a good basis for Hamiltonian diagonalisation even when its fidelity to the true time evolved states is low. In the high fidelity case, we show that the approximate unitary U can be diagonalised instead, preserving the linear cost of exact VQPE.

arXiv:2211.16097•Quantum•Mar 13, 2024•7 citations

Variational quantum state diagonalization

Ryan LaRose, Arkin Tikku, Étude O’Neel-Judy +2 more

Abstract Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gate sequence (with speedup over classical cost evaluation), and a classical computer uses this information to adjust the parameters of the gate sequence. Here we present such an algorithm for quantum state diagonalization. State diagonalization has applications in condensed matter physics (e.g., entanglement spectroscopy) as well as in machine learning (e.g., principal component analysis). For a quantum state ρ and gate sequence U, our cost function quantifies how far $$U\rho U^\dagger$$ U ρ U † is from being diagonal. We introduce short-depth quantum circuits to quantify our cost. Minimizing this cost returns a gate sequence that approximately diagonalizes ρ. One can then read out approximations of the largest eigenvalues, and the associated eigenvectors, of ρ. As a proof-of-principle, we implement our algorithm on Rigetti’s quantum computer to diagonalize one-qubit states and on a simulator to find the entanglement spectrum of the Heisenberg model ground state.

arXiv:1810.10506•npj Quantum Information•Jun 26, 2019•210 citations
Abstract Trotterization-based, iterative approaches to quantum simulation (QS) are restricted to simulation times less than the coherence time of the quantum computer (QC), which limits their utility in the near term. Here, we present a hybrid quantum-classical algorithm, called variational fast forwarding (VFF), for decreasing the quantum circuit depth of QSs. VFF seeks an approximate diagonalization of a short-time simulation to enable longer-time simulations using a constant number of gates. Our error analysis provides two results: (1) the simulation error of VFF scales at worst linearly in the fast-forwarded simulation time, and (2) our cost function’s operational meaning as an upper bound on average-case simulation error provides a natural termination condition for VFF. We implement VFF for the Hubbard, Ising, and Heisenberg models on a simulator. In addition, we implement VFF on Rigetti’s QC to demonstrate simulation beyond the coherence time. Finally, we show how to estimate energy eigenvalues using VFF.
Abstract Many-body Green’s functions are essential for characterizing excitation and spectral properties in strongly correlated quantum systems; however, their long-time dynamical evaluation remains computationally intractable on classical computers. Quantum computing offers a promising alternative for simulating such dynamics, yet existing approaches based on Trotterized time evolution suffer from a critical drawback: circuit depth grows linearly with simulated time, severely limiting performance on noisy intermediate-scale quantum (NISQ) devices due to gate errors and decoherence. In this work, we propose a fixed-depth quantum circuit framework to evaluate real-time many-body Green’s functions via Variational Fast Forwarding (VFF). By integrating a fixed-depth VFF-based evolution module into a standard ancilla-assisted interferometric measurement scheme, we enable direct extraction of Green’s function values. Numerical simulations on the two-site Hubbard model demonstrate that the approach reconstructs both the real-time Green’s function and the corresponding frequency-domain spectral function. Under a hardware-motivated noise model, a first-order Trotter circuit with step △ t = 0.1 suffers a fidelity collapse below 0.2 as its depth grows with t, whereas the compiled VFF circuit keeps a state fidelity above 0.8 over the same window. At t = 25 the evolution blocks U ( t ) contain 4751 and 79 CNOT gates. Training uses exact probabilities, without finite-shot sampling. The practical training cost and the performance on larger systems remain open.
Dynamical quantum simulation may be one of the first applications to see quantum advantage. However, the circuit depth of standard Trotterization methods can rapidly exceed the coherence time of noisy quantum computers. This has led to recent proposals for variational approaches to dynamical simulation. In this work, we aim to make variational dynamical simulation even more practical and near-term. We propose a new algorithm called Variational Hamiltonian Diagonalization (VHD), which approximately transforms a given Hamiltonian into a diagonal form that can be easily exponentiated. VHD allows for fast forwarding, i.e., simulation beyond the coherence time of the quantum computer with a fixed-depth quantum circuit. It also removes Trotterization error and allows simulation of the entire Hilbert space. We prove an operational meaning for the VHD cost function in terms of the average simulation fidelity. Moreover, we prove that the VHD cost function does not exhibit a shallow-depth barren plateau, i.e., its gradient does not vanish exponentially. Our proof relies on locality of the Hamiltonian, and hence we connect locality to trainability. Our numerical simulations verify that VHD can be used for fast-forwarding dynamics.
Abstract Publicly accessible quantum computers open the exciting possibility of experimental dynamical quantum simulations. While rapidly improving, current devices have short coherence times, restricting the viable circuit depth. Despite these limitations, we demonstrate long-time, high fidelity simulations on current hardware. Specifically, we simulate an XY-model spin chain on Rigetti and IBM quantum computers, maintaining a fidelity over 0.9 for 150 times longer than is possible using the iterated Trotter method. Our simulations use an algorithm we call fixed state Variational Fast Forwarding (fsVFF). Recent work has shown an approximate diagonalization of a short time evolution unitary allows a fixed-depth simulation. fsVFF substantially reduces the required resources by only diagonalizing the energy subspace spanned by the initial state, rather than over the total Hilbert space. We further demonstrate the viability of fsVFF through large numerical simulations, and provide an analysis of the noise resilience and scaling of simulation errors.
Abstract Simulating quantum dynamics is expected to be performed more easily on a quantum computer than on a classical computer. However, the currently available quantum devices lack the capability to implement fault-tolerant quantum algorithms for quantum simulation. Hybrid classical quantum algorithms such as the variational quantum algorithms have been proposed to effectively use current term quantum devices. One promising approach to quantum simulation in the noisy intermediate-scale quantum (NISQ) era is the diagonalisation based approach, with some of the promising examples being the subspace variational quantum simulator (SVQS), variational fast forwarding (VFF), fixed-state variational fast forwarding (fs-VFF), and the variational Hamiltonian diagonalisation (VHD) algorithms. However, these algorithms require a feedback loop between the classical and quantum computers, which can be a crucial bottleneck in practical application. Here, we present the classical quantum fast forwarding (CQFF) as an alternative diagonalisation based algorithm for quantum simulation. CQFF shares some similarities with SVQS, VFF, fs-VFF and VHD but removes the need for a classical-quantum feedback loop and controlled multi-qubit unitaries. The CQFF algorithm does not suffer from the barren plateau problem and the accuracy can be systematically increased. Furthermore, if the Hamiltonian to be simulated is expressed as a linear combination of tensored-Pauli matrices, the CQFF algorithm reduces to the task of sampling some many-body quantum state in a set of Pauli-rotated bases, which is easy to do in the NISQ era. We run the CQFF algorithm on existing quantum processors and demonstrate the promise of the CQFF algorithm for current-term quantum hardware. We compare CQFF with Trotterization for a XY spin chain model Hamiltonian and find that the CQFF algorithm can simulate the dynamics more than 10 5 times longer than Trotterization on current-term quantum hardware. This provides a 10 4 times improvement over the previous record.
Subspace diagonalisation methods have appeared recently as promising means to access the ground state and some excited states of molecular Hamiltonians by classically diagonalising small matrices, whose elements can be efficiently obtained by a quantum computer. The recently proposed Variational Quantum Phase Estimation (VQPE) algorithm uses a basis of real time-evolved states, for which the energy eigenvalues can be obtained directly from the unitary matrix U=e−iHΔt , which can be computed with cost linear in the number of states used. In this paper, we report a circuit-based implementation of VQPE for arbitrary molecular systems and assess its performance and costs for the H2 , H3+ and H6 molecules. We also propose using Variational Fast Forwarding (VFF) to decrease to quantum depth of time-evolution circuits for use in VQPE. We show that the approximation provides a good basis for Hamiltonian diagonalisation even when its fidelity to the true time evolved states is low. In the high fidelity case, we show that the approximate unitary U can be diagonalised instead, preserving the linear cost of exact VQPE.
Abstract Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gate sequence (with speedup over classical cost evaluation), and a classical computer uses this information to adjust the parameters of the gate sequence. Here we present such an algorithm for quantum state diagonalization. State diagonalization has applications in condensed matter physics (e.g., entanglement spectroscopy) as well as in machine learning (e.g., principal component analysis). For a quantum state ρ and gate sequence U, our cost function quantifies how far UρU†U\rho U^\daggerUρU† U ρ U † is from being diagonal. We introduce short-depth quantum circuits to quantify our cost. Minimizing this cost returns a gate sequence that approximately diagonalizes ρ. One can then read out approximations of the largest eigenvalues, and the associated eigenvectors, of ρ. As a proof-of-principle, we implement our algorithm on Rigetti’s quantum computer to diagonalize one-qubit states and on a simulator to find the entanglement spectrum of the Heisenberg model ground state.