Fetching the paper…
Reading the bibliography…
We provide a recursive method for constructing product formula approximations to exponentials of commutators, giving the first approximations that are accurate to arbitrarily high order.
M. Abramowitz and I. A. Stegun, Handbook of mathematical functions with formulas, graphs, and mathematical tables , vol. 55 of Applied Mathematics Series (U.S. Government Printing Office, 1964)
1964
Earlier work this paper cites.
A. J. Chorin, T. J. R. Hughes, M. F. McCracken, and J. E. Marsden, Product formulas and numerical algorithms , Communications on Pure and Applied Mathematics 31
1978
Earlier work this paper cites.
1985
Earlier work this paper cites.
M. Suzuki, General theory of fractal path integrals with applications to many-body theories and statistical physics , Journal of Mathematical Physics 32
1991
Earlier work this paper cites.
S. Lloyd, Universal quantum simulators , Science 273
1996
Earlier work this paper cites.
F. Jean and P.-V. Koseleff, Elementary approximation of exponentials of lie polynomials , in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Springer, 1997), vol. 1255 of Lecture Notes in Computer Science , pp. 174–188
1997
Earlier work this paper cites.
C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, Strengths and weaknesses of quantum computing , SIAM Journal on Computing 26
1997
Earlier work this paper cites.
A. Y. Kitaev, Quantum computations: Algorithms and error correction , Russian Mathematical Surveys 52
1997
Earlier work this paper cites.
E. Farhi and S. Gutmann, Analog analogue of a digital quantum computation , Physical Review A 57
1998
Earlier work this paper cites.
S. Blanes, F. Casas, and J. Ros, Extrapolation of symplectic integrators , Celestial Mechanics and Dynamical Astronomy 75
1999
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge U.K., 2000)
2000
Earlier work this paper cites.
A. Y. Kitaev, A. H. Shen, and M. N. Vyalyi, Classical and Quantum Computation (AMS, 2002)
2002
Earlier work this paper cites.
D. Aharonov and A. Ta-Shma, Adiabatic quantum state generation and statistical zero knowledge , in Proceedings of the 35th ACM Symposium on Theory of Computing (2003), pp. 20–29, arXiv:quant-ph/0301023
2003
Earlier work this paper cites.
A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman, Exponential algorithmic speedup by quantum walk , in Proceedings of the 35th ACM Symposium on Theory of Computing (2003), pp. 59–68, arXiv:quant-ph/0209131
2003
Cited alongside, same era.
A. M. Childs, Quantum information processing in continuous time , Ph.D. thesis, Massachusetts Institute of Technology (2004)
2004
Cited alongside, same era.
N. Khaneja, T. Reiss, C. Kehlet, T. Schulte-Herbrüggen, and S. J. Glaser, Optimal control of coupled spin dynamics: Design of NMR pulse sequences by gradient ascent algorithms , Journal of Magnetic Resonance 172
2005
Cited alongside, same era.
T. Schulte-Herbrüggen, A. Spörl, N. Khaneja, and S. J. Glaser, Optimal control-based efficient synthesis of building blocks of quantum algorithms: A perspective from network complexity towards time complexity , Physical Review A 72
2005
Cited alongside, same era.
2010
Later among the works it cites.
2011
Later among the works it cites.
S. Sefi and P. van Loock, How to decompose arbitrary continuous-variable quantum operations , Physical Review Letters 107
2011
Later among the works it cites.
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Y. Kitaev, Fault-tolerant quantum computation by anyons , Ann. Phys. 303
2006
Cited alongside, same era.
C. M. Dawson and M. A. Nielsen, The Solovay-Kitaev algorithm , Quantum Information and Computation 6
2006
Cited alongside, same era.
D. W. Berry, G. Ahokas, R. Cleve, and B. C. Sanders, Efficient quantum algorithms for simulating sparse Hamiltonians , Communications in Mathematical Physics 270
2007
Cited alongside, same era.
E. Farhi, J. Goldstone, and S. Gutmann, A quantum algorithm for the Hamiltonian NAND tree , Theory of Computing 4
2008
Cited alongside, same era.
2009
Cited alongside, same era.
2009
Cited alongside, same era.
2009
Cited alongside, same era.
2010
Cited alongside, same era.
2011
Later among the works it cites.
2011
Later among the works it cites.
2012
Closest in time.
2012
Closest in time.
2012
Closest in time.
2012
Closest in time.
2012
Closest in time.