Quantum computers offer the potential to efficiently simulate the dynamics of quantum systems, a task whose difficulty scales exponentially with system size on classical devices. To assess the potential for near-term quantum computers to simulate many-body systems we develop a formalism to straightforwardly compute bounds on the number of Trotter steps needed to accurately simulate the time evolution of fermionic lattice models based on the first-order commutator scaling. We apply this formalism to two closely related many-body models prominent in condensed matter physics, the Hubbard and t-J models. We find that, while a naive comparison of the Trotter depth first seems to favor the Hubbard model, careful consideration of the model parameters and the allowable error for accurate simulation leads to a substantial advantage in favor of the t-J model. These results and formalism set the stage for significant improvements in quantum simulation costs.
The Trotter-Suzuki decomposition is one of the main approaches for realization of quantum simulations on digital quantum computers. Variance-based global sensitivity analysis (the Sobol method) is a wide used method which allows to decompose output variance of mathematical model into fractions allocated to different sources of uncertainty in inputs or sets of inputs of the model. Here we developed a method for application of the global sensitivity analysis to the optimization of Trotter-Suzuki decomposition. We show with a proof-of-concept example that this approach allows to reduce the number…
Dynamical Spin Squeezing via Higher Order Trotter-Suzuki Approximation
本文提出了一种基于高阶Trotter-Suzuki近似的单轴扭转哈密顿量到双轴扭转哈密顿量的变换方案。与文献[Y. C. Liu等人，物理修订信函107，013601（2011）]，我们的方法可以将控制循环的数量从$1000$减少到$50$。与文献[C. Shen等人，A87，051801（2013）]。并给出了相应的误差分析。
One of the most promising applications of near-term quantum computing is the simulation of quantum systems, a classically intractable task. Quantum simulation requires computationally expensive matrix exponentiation; Trotter-Suzuki decomposition of this exponentiation enables efficient simulation to a desired accuracy on a quantum computer. We apply the Covariance Matrix Adaptation Evolutionary Strategy (CMA-ES) algorithm to optimise the Trotter-Suzuki decompositions of a canonical quantum system, the Heisenberg Chain; we reduce simulation error by around 60%. We introduce this problem to the …
Quantum systems are the future candidates for computers and information processing devices. Information about quantum states and processes may be incomplete and scattered in these systems. We use a quantum version of Belief Propagation(BP) Algorithm to integrate the distributed information. In this algorithm the distributed information, which is in the form of density matrix, can be approximated to local structures. The validity of this algorithm is measured in comparison with Suzuki-Trotter(ST) method, using simulated information. ST in 3-body Heisenberg example gives a more accurate answer, …
Optimising Trotter-Suzuki Simulations of Markovian Open Quantum Systems via Classical Search
University of KwaZulu-Natal（夸祖鲁-纳塔尔大学）；National Institute for Theoretical and Computational Sciences (NITheCS)（国家理论与计算科学研究所）；Stellenbosch University（斯泰伦博斯大学）
Beyond Trotterization: Variational Product Formulas for Quantum Simulation
Memorial University of Newfoundland and Labrador（纽芬兰与拉布拉多纪念大学）；Interdisciplinary Research Center (IRC) for Advanced Quantum Computing (AQC)（先进量子计算跨学科研究中心）；National Research Council Canada（加拿大国家研究委员会）；Perimeter Institute for Theoretical Physics（理论物理 perimeter 研究所）；Institute for Quantum Computing（量子计算研究所）；Compute Everything Technologies Ltd.（Compute Everything 科技有限公司）
Although the simulation of quantum chemistry is one of the most anticipated applications of quantum computing, the scaling of known upper bounds on the complexity of these algorithms is daunting. Prior work has bounded errors due to Trotterization in terms of the norm of the error operator and analyzed scaling with respect to the number of spin-orbitals. However, we find that these error bounds can be loose by up to sixteen orders of magnitude for some molecules. Furthermore, numerical results for small systems fail to reveal any clear correlation between ground state error and number of spin-…
We present a product formula to approximate the exponential of a skew-Hermitian operator that is a sum of generators of a Lie algebra. The number of terms in the product depends on the structure factors. When the generators have large norm with respect to the dimension of the Lie algebra, or when the norm of the effective operator resulting from nested commutators is less than the product of the norms, the number of terms in the product is significantly less than that obtained from well-known results. We apply our results to construct product formulas useful for the quantum simulation of some …
Unbiased Hamiltonian Simulation by Reversing Trotter Error Dynamics
Quantinuum K.K.；Department of Physics, The University of Tokyo（东京大学物理学系）；RIKEN Center for Interdisciplinary Theoretical and Mathematical Sciences (iTHEMS)（理化学研究所交叉理论与数学科学中心 (iTHEMS)）；RIKEN（理化学研究所）；Quantinuum；Institute for Physics of Intelligence, The University of Tokyo（东京大学物理智能研究所）；Institute for Solid State Physics, The University of Tokyo（东京大学固体物理研究所）
The dynamics of a quantum system can be simulated using a quantum computer by breaking down the unitary into a quantum circuit of one and two qubit gates. The most established methods are the Trotter-Suzuki decompositions, for which rigorous bounds on the circuit size depend on the number of terms $L$ in the system Hamiltonian and the size of the largest term in the Hamiltonian $Λ$. Consequently, Trotter-Suzuki is only practical for sparse Hamiltonians. Trotter-Suzuki is a deterministic compiler but it was recently shown that randomised compiling offers lower overheads. Here we present and ana…
For many quantum systems of interest, the classical computational cost of simulating their time evolution scales exponentially in the system size. At the same time, quantum computers have been shown to allow for simulations of some of these systems using resources that scale polynomially with the system size. Given the potential for using quantum computers for simulations that are not feasible using classical devices, it is paramount that one studies the scaling of quantum algorithms carefully. This work identifies a term in the Hamiltonian of a class of constrained systems that naively requir…
As noisy intermediate-scale quantum (NISQ) processors increase in size and complexity, their use as general purpose quantum simulators will rely on algorithms based on the Trotter-Suzuki expansion. We run quantum simulations on a small, highly accurate quantum processor, and show how one can optimize simulation accuracy by balancing algorithmic (Trotter) errors against native errors specific to the quantum hardware at hand. We further study the interplay between native errors, Trotter errors, and the emergence of chaos as seen in measurements of a time averaged fidelity-out-of-time-ordered-cor…
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 orde…
Trotter decomposition is the basis of the digital quantum simulation. Asymmetric and symmetric decompositions are used in our GPU demonstration of the digital adiabatic quantum simulations of $2+1$ dimensional quantum $\mathbb{Z}_2$ lattice gauge theory. The actual errors in Trotter decompositions are investigated as functions of the coupling parameter and the number of Trotter substeps in each step of the variation of coupling parameter. The relative error of energy is shown to be closely related to the Trotter error usually defined defined in terms of the evolution operators. They are much s…
We present an algorithmic method for the digital quantum simulation of many-body locally indivisible non-Markovian open quantum systems. It consists of two parts: firstly, a Suzuki-Lie-Trotter decomposition of the global system propagator into the product of subsystem propagators, which may not be quantum channels, and secondly, an algorithmic procedure for the implementation of the subsystem propagators through unitary operations and measurements on a dilated space. By providing rigorous error bounds for the relevant Suzuki-Lie-Trotter decomposition, we are able to analyze the efficiency of t…
In designing quantum control, it is generally required to simulate the controlled system evolution with a classical computer. However, computing the time evolution operator can be quite resource-consuming since the total Hamiltonian is often hard to diagonalize. In this paper, we mitigate this issue by substituting the time evolution segments with their Trotter decompositions, which reduces the propagator into a combination of single-qubit operations and fixed-time system evolutions. The resulting procedure can provide substantial speed gain with acceptable costs in the propagator error. As a …
Recent work has deployed linear combinations of unitaries techniques to reduce the cost of fault-tolerant quantum simulations of correlated electron models. Here, we show that one can sometimes improve upon those results with optimized implementations of Trotter-Suzuki-based product formulas. We show that low-order Trotter methods perform surprisingly well when used with phase estimation to compute relative precision quantities (e.g. energies per unit cell), as is often the goal for condensed-phase systems. In this context, simulations of the Hubbard and plane-wave electronic structure models …
Trotter-Suzuki decompositions are frequently used in the quantum simulation of quantum chemistry. They transform the evolution operator into a form implementable on a quantum device, while incurring an error---the Trotter error. The Trotter error can be made arbitrarily small by increasing the Trotter number. However, this increases the length of the quantum circuits required, which may be impractical. It is therefore desirable to find methods of reducing the Trotter error through alternate means. The Trotter error is dependent on the order in which individual term unitaries are applied. Due t…
We study the behavior of errors in the quantum simulation of spin systems with long-range multi-body interactions resulting from the Trotter-Suzuki decomposition of the time-evolution operator. We identify a regime where the Floquet operator underlying the Trotter decomposition undergoes sharp changes even for small variations in the simulation step size. This results in a time evolution operator that is very different from the dynamics generated by the targeted Hamiltonian, which leads to a proliferation of errors in the quantum simulation. These regions of sharp change in the Floquet operato…
Quantum computers can efficiently simulate many-body systems. As a widely used Hamiltonian simulation tool, the Trotter-Suzuki scheme splits the evolution into the number of Trotter steps $N$ and approximates the evolution of each step by a product of exponentials of each individual term of the total Hamiltonian. The algorithmic error due to the approximation can be reduced by increasing $N$, which however requires a longer circuit and hence inevitably introduces more physical errors. In this work, we first study such a trade-off and numerically find the optimal number of Trotter steps $N_{\te…
Quantum simulation has shown great potential in many fields due to its powerful computational capabilities. However, the limited fidelity can lead to a severe limitation on the number of gate operations, which requires us to find optimized algorithms. Trotter decomposition and high order Trotter decompositions are widely used in quantum simulations. We find that they can be significantly improved by force-gradient integrator in lattice QCD. By using two applications as examples, we show that the force-gradient decomposition can reduce the number of gate operations up to about a third of those …
In this work we propose a series-expansion thermal tensor network (SETTN) approach for efficient simulations of quantum lattice models. This continuous-time SETTN method is based on the numerically exact Taylor series expansion of equilibrium density operator $e^{-βH}$ (with $H$ the total Hamiltonian and $β$ the imaginary time), and is thus Trotter-error free. We discover, through simulating XXZ spin chain and square-lattice quantum Ising models, that not only the Hamiltonian $H$, but also its powers $H^n$, can be efficiently expressed as matrix product operators, which enables us to calculate…
Faster Quantum Simulation Of Markovian Open Quantum Systems Via Randomisation
University of KwaZulu-Natal（夸祖鲁-纳塔尔大学）；National Institute for Theoretical and Computational Sciences (NITheCS)（国家理论与计算科学研究所）；Stellenbosch University（斯坦伦布什大学）
