Abstract
Given the Hamiltonian, the evaluation of unitary operators has been at the heart of many quantum algorithms. Motivated by existing deterministic and random methods, we present a hybrid approach, where Hamiltonians with large amplitude are evaluated at each time step, while the remaining terms are evaluated at random. The bound for the mean square error is obtained, together with a concentration bound. The mean square error consists of a variance term and a bias term, arising, respectively, from the random sampling of the Hamiltonian terms and the operator-splitting error. Leveraging on the bias/variance trade-off, the error can be minimized by balancing the two. The concentration bound provides an estimate of the number of gates. The estimates are verified using numerical experiments on classical computers.
Similar content being viewed by others
References
An, D., Fang, D., Lin, L.: Time-dependent unbounded Hamiltonian simulation with vector norm scaling. Quantum 5, 459 (2021)
Aspuru-Guzik, A.: Simulated quantum computation of molecular energies. Science 309, 1704–1707 (2005). https://doi.org/10.1126/science.1113479
Babbush, R., McClean, J., Wecker, D., Aspuru-Guzik, A., Wiebe, N.: Chemical basis of Trotter-Suzuki errors in quantum chemistry simulation. Phys. Rev. A 91(2), 022311 (2015)
Babbush, R., Wiebe, N., McClean, J., McClain, J., Neven, H., Chan, K.L.: Low-depth quantum simulation of materials. Phys. Rev. X 8(1), 011044 (2018)
Baker, H.F.: Alternants and continuous groups. Proc. London Math. Soc. 2(1), 24–47 (1905)
Bravyi, S.B., Kitaev, A.Y.: Fermionic quantum computation. Ann. Phys. 298(1), 210–226 (2002)
Campbell, E.: Random compiler for fast Hamiltonian simulation. Phys. Rev. Lett. 123(7), 070503 (2019)
Campbell, J.E.: On a law of combination of operators (second paper). Proc. London Math. Soc. 1(1), 14–32 (1897)
Chen, C.F., Huang, H.Y., Kueng, R., Tropp, J.A.: Quantum simulation via randomized product formulas: low gate complexity with accuracy guarantees. arXiv:2008.11751 (2020)
Childs, A.M., Li, T.Y.: Efficient simulation of sparse Markovian quantum dynamics. arXiv:1611.05543 (2016)
Childs, A.M., Ostrander, A., Su, Y.: Faster quantum simulation by randomization. Quantum 3, 182 (2019)
Childs, A.M., Su, Y.: Nearly optimal lattice simulation by product formulas. Phys. Rev. Lett. 123(5), 050503 (2019)
Childs, A.M., Su, Y, Tran, M.C., Wiebe, N., Zhu, S.C.: Theory of Trotter error with commutator scaling. Phys. Rev. X 11(1), 011020 (2021)
Childs, A.M, Wiebe, N.: Hamiltonian simulation using linear combinations of unitary operations. arXiv:1202.5822 (2012)
Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Quantum algorithms revisited. Proc. R. Soc. London A 454, 339–354 (1998)
Cleve, R., Wang, C.H.: Efficient quantum algorithms for simulating lindblad evolution. arXiv:1612.09512 (2016)
Deuflhard, P., Bornemann, F.: Scientific Computing with Ordinary Differential Equations. Springer New York, NY (2012)
Faehrmann, P.K., Steudtner, M., Kueng, R., Kieferova, M., Eisert, J.: Randomizing multi-product formulas for improved Hamiltonian simulation. arXiv:2101.07808 (2021)
Feynman, R.P.: Quantum mechanical computers. Opt. News 11(2), 11–20 (1985)
Gilyén, A., Su, Y., Low, G.H., Wiebe, N.: Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. In: Proceedings of the 51st Annual ACM Sigact Symposium on Theory of Computing, pp. 193–204 (2019)
Gokhale, P., Angiuli, O., Ding, Y.S., Gui, K.W., Tomesh, T., Suchara, M., Martonosi, M., Chong, F.T.: Minimizing state preparations in variational quantum eigensolver by partitioning into commuting families. arXiv:1907.13623 (2019)
Golse, F., Jin, S., Paul, T.: The random batch method for \(n\)-body quantum dynamics. arXiv:1912.07424 (2020)
Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for solving linear systems of equations. arXiv: 0811.3171 (2009)
Hastings, M.B., Wecker, D., Bauer, B., Troyer, M.: Improving quantum algorithms for quantum chemistry. arXiv: 1403.1539 (2014)
Hausdorff, F.: Die symbolische exponentialformel in der gruppentheorie. Ber. Verh. Kgl. SÃ chs. Ges. Wiss. Leipzig. Math.-phys. Kl. 58, 19–48 (1906)
Havlíček, V., Troyer, M., Whitfield, J.D.: Operator locality in the quantum simulation of Fermionic models. Phys. Rev. A 95(3), 032332 (2017)
Jin, S., Li, L: Random batch methods for classical and quantum interacting particle systems and statistical samplings. arXiv:2104.04337 (2021)
Jin, S., Li, L., Liu, J.G..: Random batch methods (RBM) for interacting particle systems. J. Comput. Phys. 400, 108877 (2020)
Jin, S., Li, L., Liu, J.G.: Convergence of the random batch method for interacting particles with disparate species and weights. SIAM J. Num. Analys. 59(2), 746–768 (2021)
Jin, S., Li, L., Xu, Z.L., Zhao, Y.: A random batch Ewald method for particle systems with Coulomb interactions. SIAM. J. Sci. Comp. 43, B937–B960 (2021)
Jin, S., Li, X.T.: Random batch algorithms for quantum Monte Carlo simulations. Commun. Comput. Phys. 28(5), 1907–1936 (2020)
Jordan, P., Wigner, E.P.: About the Pauli exclusion principle. Z. Phys. 47(631), 14–75 (1928)
Kutin, S.: Extensions to McDiarmid’s inequality when differences are bounded with high probability. Dept. Comput. Sci., Univ. Chicago, Chicago, IL, USA, Tech. Rep. TR-2002-04 (2002)
Li, L., Xu, Z.L., Zhao, Y.: A random-batch Monte Carlo method for many-body systems with singular kernels. SIAM J. Sci. Comput. 42(3), A1486–A1509 (2020)
McClean, J.: OpenFermion: the electronic structure package for quantum computers. Quant. Sci. Technol. 5, 034041 (2020)
McDiarmid, C.: On the method of bounded differences. Surv. Combin. 141(1), 148–188 (1989)
McDiarmid, C., Concentration. In: Habib, M., McDiarmid, C., Ramirez-Alfonsin, J., Reed, B. (eds) Probabilistic Methods for Algorithmic Discrete Mathematics, pp. 195–248. Springer-Verlag, Berlin (1998)
Montanaro, A.: Quantum speedup of Monte Carlo methods. Proc. R. Soc. A 471(2181), 20150301 (2015)
Nielsen, M.A., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
Ouyang, Y.K., White, D.R., Campbell, E.T.: Compilation by stochastic Hamiltonian sparsification. Quantum 4, 235 (2020)
Poulin, D., Hastings, M.B, Wecker, D., Wiebe, N., Doherty, A.C, Troyer, M.: The Trotter step size required for accurate quantum simulation of quantum chemistry. arXiv:1406.4920 (2014)
Qin, Y.M.: Integral and Discrete Inequalities and Their Applications. Springer International Publishing, Switzerland (2016)
Ramsay, J.O., Silverman, B.W.: Applied Functional Data Analysis: Methods and Case Studies. Springer International Publishing, New York (2002)
Rio, E.: On McDiarmid’s concentration inequality. Electr. Commun. Prob. 18, 1–11 (2013)
Seeley, J.T., Richard, M.J., Love, P.J.: The Bravyi-Kitaev transformation for quantum computation of electronic structure. J. Chem. Phys. 137(22), 224109 (2012)
Sweke, R., Wilde, F., Meyer, J., Schuld, M., Fährmann, P.K., Meynard-Piganeau, B., Eisert, J.: Stochastic gradient descent for hybrid quantum-classical optimization. Quantum 4, 314 (2020)
Tran, M.C., Guo, A.Y., Su, Y., Garrison, J.R., Eldredge, Z., Foss-Feig, M., Childs, A.M., Gorshkov, A.V.: Locality and digital quantum simulation of power-law interactions. Phys. Rev. X 9(3), 031006 (2019)
Tranter, A., Love, P.J., Mintert, F., Coveney, P.V.: A comparison of the Bravyi-Kitaev and Jordan-Wigner transformations for the quantum simulation of quantum chemistry. J. Chem. Theory Comput. 14(11), 5617–5630 (2018)
Tranter, A., Love, P.J., Mintert, F., Wiebe, N., Coveney, P.V.: Ordering of Trotterization: impact on errors in quantum simulation of electronic structure. Entropy 21(12), 1218 (2019)
Tropp, J.A: An introduction to matrix concentration inequalities. arXiv:1501.01571 (2015)
Wecker, D., Bauer, B., Clark, B.K., Hastings, M.B., Troyer, M.: Gate count estimates for performing quantum chemistry on small quantum computers. arXiv: 1312.1695 (2014)
Whitfield, J.D., Biamonte, J., Aspuru-Guzik, A.: Simulation of electronic structure Hamiltonians using quantum computers. Mol. Phys. 109(5), 735–750 (2011)
Funding
Jin’s research was supported by the NSFC (Grant No. 12031013) and the Innovation Program of Shanghai Municipal Education Commission (Nos. 2021-01-07-00-02-E00087). Li’s research has been supported by the NSF (Grant Nos. DMS-1953120 and DMS-2111221).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Compliance with Ethical Standards
The authors declare that they have no conflict of interest. This work does not contain any studies with human participants performed by any of the authors. Informed consent was obtained from all individual participants included in the study.
Conflict of Interests
The authors have no competing interests to declare that are relevant to the content of this article.
Additional information
In Memory of Professor Zhong-Ci Shi.
Appendices
Appendix A The Proof of Proposition 1
Proof
To estimate this one-step error, we separate it into two terms,
As a result, we have the total one-step error
Using the triangle inequality and the estimates from Theorems 1 and 3, we arrive at the stated estimate.
Appendix B The Proof of Theorem 3
Proof
We first extend the function \(|\chi \rangle\) to \(t\in [0,\Delta t]\),
It can be directly verified that \({|{\chi (t)}\rangle }\) satisfies the differential equation
Since \(\delta H\) is Hermitian, we have
Therefore, using the Cauchy-Schwarz inequality, one has
By direct integration, or using the Ou-Iang inequality [42], this inequality leads to the desired bound (33).
Appendix C Proof of Theorem 5
Proof
Following standard procedure for analyzing the accumulation of the error in time [17], we can derive an error equation, given by
where
can be interpreted as a one-step truncation error.
Estimating the \(L^2\)-error is quite straightforward, since,
On the other hand, to connect to the MSE, one can start with (C1). Using the Cauchy-Schwarz inequality, one finds that
Using the inequality, \(2 \langle e_{n} |e_{n}\rangle ^{\frac{1}{2}} \leqslant 1 + \langle e_{n} |e_{n}\rangle ,\) we arrive at
A bound can be found using the following discrete Gronwall’s inequality [42][Theorem 2.1.3]:
As a result, we have
This can be combined with the one-step error bounds (51) (applied to the exponential) and (52).
Appendix D The Proof of Proposition 2
Proof
Recall that \({|{\psi (t)}\rangle }:= \exp \big ( -{\text{i}} t H \big ) {|{\psi (0)}\rangle }\) is the exact solution. We will split the error as follows:
The first term can be estimated by (45) from Theorem 4. For the second term, it is enough to consider the difference, denoted by \({|{\theta (t)}\rangle },\) of the following wave functions:
Let \({|{\phi (t)}\rangle }= \big ( -{\text{i}} t H_1 - {\text{i}} t \delta H \big ) |\psi _0\rangle\), and notice that
Therefore, the error term term \({|{\theta (t)}\rangle }\) satisfies the equation
Using the variation-of-constant formula, and using the fact that \({\mathbb {E}} [ \delta H]=0,\) we can write
Here \(U_1(t)=\exp ( -{\text{i}} t H_1).\) In light of the fact that \(\Vert {|{\phi }\rangle }\Vert =1,\) one can take the norms and arrive at
which yields the second term in the estimate (59).
This estimate can be extended to time \(t=n\Delta t\) [9] using the fact that for a unitary matrix V, \(\Vert {\mathbb {E}}[V] \Vert \leqslant 1.\) More specifically, we can split the error as follows:
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Jin, S., Li, X. A Partially Random Trotter Algorithm for Quantum Hamiltonian Simulations. Commun. Appl. Math. Comput. (2023). https://doi.org/10.1007/s42967-023-00336-z
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s42967-023-00336-z