Simulating the dynamic evolutions of physical and molecular systems in a quantum computer is of fundamental interest in many applications. Its implementation requires efficient quantum simulation algorithms. The Lie-Trotter-Suzuki approximation algorithm, also well known as the Trotterization, is a basic algorithm in quantum dynamic simulation. A multi-product algorithm that is a linear combination of multiple Trotterizations has been proposed to improve the approximation accuracy. Implementing such multi-product Trotterization in quantum computers however remains experimentally challenging and its success probability is limited. Here, we modify the multi-product Trotterization and combine it with the oblivious amplitude amplification to simultaneously reach a high simulation precision and high success probability. We experimentally implement the modified multi-product algorithm in an integrated-photonics programmable quantum simulator in silicon, which allows the initialization, manipulation and measurement of four-qubit states and a sequence of linearly combined controlled-unitary gates, to emulate the dynamics of a coupled electron and nuclear spins system. Theoretical and experimental results are in good agreement, and they both show the modified multi-product algorithm can simulate Hamiltonian dynamics with a higher precision than conventional Trotterizations and a nearly deterministic success probability. We certificate the multi-product algorithm in a small-scale quantum simulator based on linear combinations of operations, and this work promises the practical implementations of quantum dynamics simulations.
Simulating the dynamic evolutions of physical and molecular systems in a quantum computer is of fundamental interest in many applications. Its implementation requires efficient quantum simulation algorithms. The Lie-Trotter-Suzuki approximation algorithm, also well known as the Trotterization, is a basic algorithm in quantum dynamic simulation. A multi-product algorithm that is a linear combination of multiple Trotterizations has been proposed to improve the approximation accuracy. Implementing such multi-product Trotterization in quantum computers however remains experimentally challenging and its success probability is limited. Here, we modify the multi-product Trotterization and combine it with the oblivious amplitude amplification to simultaneously reach a high simulation precision and high success probability. We experimentally implement the modified multi-product algorithm in an integrated-photonics programmable quantum simulator in silicon, which allows the initialization, manipulation and measurement of four-qubit states and a sequence of linearly combined controlled-unitary gates, to emulate the dynamics of a coupled electron and nuclear spins system. Theoretical and experimental results are in good agreement, and they both show the modified multi-product algorithm can simulate Hamiltonian dynamics with a higher precision than conventional Trotterizations and a nearly deterministic success probability. We certificate the multi-product algorithm in a small-scale quantum simulator based on linear combinations of operations, and this work promises the practical implementations of quantum dynamics simulations.
Simulating the dynamic evolution of physical and molecular systems in a quantum computer is of fundamental interest in many applications. The implementation of dynamics simulation requires efficient quantum algorithms. The Lie-Trotter-Suzuki approximation algorithm, also known as the Trotterization, is basic in Hamiltonian dynamics simulation. A multi-product algorithm that is a linear combination of multiple Trotterizations has been proposed to improve the approximation accuracy. However, implementing such multi-product Trotterization in quantum computers remains challenging due to the requirements of highly controllable and precise quantum entangling operations with high success probability. Here, we report a programmable integrated-photonic quantum simulator based on a linear combination of unitaries, which can be tailored for implementing the linearly combined multiple Trotterizations, and on the simulator we benchmark quantum simulation of Hamiltonian dynamics. We modify the multi-product algorithm by integrating it with oblivious amplitude amplification to simultaneously reach high simulation precision and high success probability. The quantum simulator is devised and fabricated on a large-scale silicon-photonic quantum chip, which allows the initialization, manipulation, and measurement of arbitrary four-qubit states and linearly combined unitary gates. As an example, the quantum simulator is reprogrammed to emulate the dynamics of an electron spin and nuclear spin coupled system. This work promises the practical dynamics simulations of real-world physical and molecular systems in future large-scale quantum computers.
We propose a variational alternative to the Trotter-Suzuki decomposition that provides greater control over errors while preserving the unitary structure of time evolution. The variational parameters in our ansatz are derived from a global action principle, where Euler-Lagrange equations govern their optimal dynamics. Unlike conventional wavefunction-based variational methods, our approach specifically targets the time evolution operation and this allows a single set of optimized parameters to be applied to any initial state for a fixed Hamiltonian avoiding costly optimization procedures. Our method outperforms the standard Trotter-Suzuki formulas, typically achieving higher accuracy than higher-order Suzuki schemes. This translates directly to quantum computing applications, where it enables the design of quantum circuits with fewer gates which reduces noise and improves precision. Although we focus on quantum dynamics, the method is broadly applicable to problems involving general time-evolution operators. Applied to various model Hamiltonians, our approach reduces errors by factors of 2 to 5 compared to Trotter-Suzuki decompositions, demonstrating its promise for accurate quantum simulation with improved efficiency. In certain cases, the variational ansatz achieves higher accuracy than more complex higher-order Suzuki formulas while reducing the gate count by nearly half within a single circuit layer. Furthermore, we derive approximate analytical expressions for the variational parameters up to cubic order in time, valid for generic Hamiltonians. These approximations enable long-time quantum simulations with improved accuracy over equivalent Suzuki decompositions, providing ready-to-use evolution formulas that match Suzuki's gate complexity while delivering better performance.
In this work we propose an approach for implementing time-evolution of a quantum system using product formulas. The quantum algorithms we develop have provably better scaling (in terms of gate complexity and circuit depth) than a naive application of well-known Trotter formulas, for systems where the evolution is determined by a Hamiltonian with different energy scales (i.e., one part is "large" and another part is "small"). Our algorithms generate a decomposition of the evolution operator into a product of simple unitaries that are directly implementable on a quantum computer. Although the theoretical scaling is suboptimal compared with state-of-the-art algorithms (e.g., quantum signal processing), the performance of the algorithms we propose is highly competitive in practice. We illustrate this via extensive numerical simulations for several models. For instance, in the strong-field regime of the 1D transverse-field Ising model, our algorithms achieve an improvement of one order of magnitude in both the system size and evolution time that can be simulated with a fixed budget of 1000 arbitrary 2-qubit gates, compared with standard Trotter formulas.
Quantum simulation, the simulation of quantum processes on quantum computers, suggests a path forward for the efficient simulation of problems in condensed-matter physics, quantum chemistry, and materials science. While the majority of quantum simulation algorithms are deterministic, a recent surge of ideas has shown that randomization can greatly benefit algorithmic performance. In this work, we introduce a scheme for quantum simulation that unites the advantages of randomized compiling on the one hand and higher-order multi-product formulas, as they are used for example in linear-combination-of-unitaries (LCU) algorithms or quantum error mitigation, on the other hand. In doing so, we propose a framework of randomized sampling that is expected to be useful for programmable quantum simulators and present two new multi-product formula algorithms tailored to it. Our framework reduces the circuit depth by circumventing the need for oblivious amplitude amplification required by the implementation of multi-product formulas using standard LCU methods, rendering it especially useful for early quantum computers used to estimate the dynamics of quantum systems instead of performing full-fledged quantum phase estimation. Our algorithms achieve a simulation error that shrinks exponentially with the circuit depth. To corroborate their functioning, we prove rigorous performance bounds as well as the concentration of the randomized sampling procedure. We demonstrate the functioning of the approach for several physically meaningful examples of Hamiltonians, including fermionic systems and the Sachdev–Ye–Kitaev model, for which the method provides a favorable scaling in the effort.
Abstract Quantum computers can be used to simulate the evolution of quantum systems via the discretization of this evolution into unitary gate sequences. While Trotter-Suzuki (TS) methods stand as the most prevalent approach for quantum simulation, their effectiveness is contingent upon the sparsity of the Hamiltonian system. This is due to the precision and gate complexity of the TS method being dependent on the number of terms within the Hamiltonian. Despite attempts to mitigate this dependence through the random permutation of terms within TS methods, scalability issues persist. To address this, Campbell introduced the qDRIFT algorithm, leveraging random compilation to alleviate the reliance on the Hamiltonian’s term count. However, the initial implementation of this algorithm necessitated the involvement of classical computing resources for gate set compilation. Our study presents two novel quantum circuit implementations of the qDRIFT algorithm, eliminating the need for classical computing resources. We employ the Linear Combination of Unitaries (LCU) approach and the Quantum Forking (QF) procedure to construct efficient circuits to implement the qDRIFT algorithm. Furthermore, we conduct a comparative analysis of the gate complexities between our proposed circuits and TS methods, identifying the scenarios in which our circuits exhibit superior performance.
Product formula approximations of the time-evolution operator on quantum computers are of great interest due to their simplicity, and good scaling with system size by exploiting commutativity between Hamiltonian terms. However, product formulas exhibit poor scaling with the time t and error ε of simulation as the gate cost of a single step scales exponentially with the order m of accuracy. We introduce well-conditioned multiproduct formulas, which are a linear combination of product formulas, where a single step has polynomial cost O(m2log(m)) and succeeds with probability Ω(1/log2(m)). Our multiproduct formulas imply a simple and generic simulation algorithm that simultaneously exploits commutativity in arbitrary systems and has a worst-case cost O(tlog2(t/ε)) which is optimal up to poly-logarithmic factors. In contrast, prior Trotter and post-Trotter Hamiltonian simulation algorithms realize only one of these two desirable features. A key technical result of independent interest is our solution to a conditioning problem in previous multiproduct formulas that amplified numerical errors by eΩ(m) in the classical setting, and led to a vanishing success probability e−Ω(m) in the quantum setting.