The simulation of time evolution of large quantum systems is a classically challenging and in general intractable task, making it a promising application for quantum computation. A Trotter-Suzuki approximation yields an implementation thereof, where a higher approximation accuracy can be traded for an increased gate count. In this work, we introduce a variational algorithm which uses solutions of classical optimizations to predict efficient quantum circuits for time evolution of translationally invariant quantum systems. Our strategy can improve upon the Trotter-Suzuki accuracy by several orders of magnitude. It translates into a reduction in gate count and hence gain in overall fidelity at the same algorithmic accuracy. This is important in NISQ-applications where the fidelity of the output state decays exponentially with the number of gates. The performance advantage of our classical assisted strategy can be extended to open boundaries with translational symmetry in the bulk. We can extrapolate our method to beyond classically simulatable system sizes, maintaining its total fidelity advantage over a Trotter-Suzuki approximation making it an interesting candidate for beyond classical time evolution.
The simulation of time evolution of large quantum systems is a classically challenging and often intractable task, making it a promising application for quantum computation. A Trotter-Suzuki approximation yields an implementation thereof, where a certain desired accuracy can be achieved by raising the gate count adequately. In this work, we introduce a variational algorithm which uses solutions of classical optimizations to predict efficient quantum circuits for time evolution of large quantum systems. Our strategy improves on the Trotter-Suzuki ansatz in accuracy and gate count by several orders of magnitude. In a NISQ-friendly setting, we can either significantly reduce the approximation error while using the same amount of gates as the Trotter-Suzuki ansatz or achieve a comparable accuracy with significantly fewer gates. We find, that our strategy outperforms the Trotter-Suzuki benchmark in translation invariant systems as well as for open boundaries.
Quantum systems subject to periodic driving exhibit a diverse set of phenomena both of fundamental and technological interest. However, such dynamical systems are more challenging to simulate classically than their equilibrium counterparts. Here, we introduce the Quantum High Frequency Floquet Simulation (QHiFFS) algorithm as a method for simulating the dynamics of fast-driven Floquet systems on quantum hardware. Central to QHiFFS is the concept of a kick operator which transforms the system into a basis where the dynamics is governed by a time-independent effective Hamiltonian. This allows prior methods for time-independent Hamiltonian simulation to be lifted to the simulation of Floquet systems. We use the periodically driven biaxial next-nearest neighbor Ising (BNNNI) model as a case study to illustrate our algorithm. This oft-studied model is a natural test bed for quantum frustrated magnetism and criticality. We successfully implemented a 20-qubit simulation of the driven two-dimensional BNNNI model on Quantinuum's trapped ion quantum computer. This is complemented with an analysis of QHiFFS algorithmic errors. Our study indicates that the algorithm exhibits not only a cubic scaling advantage in driving frequency ω but also a linear one in simulation time t compared to Trotterisation, making it an interesting avenue to push towards near-term quantum advantage.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.