2000 character limit reached
Doubling Efficiency of Hamiltonian Simulation via Generalized Quantum Signal Processing
Published 18 Jan 2024 in quant-ph | (2401.10321v1)
Abstract: Quantum signal processing provides an optimal procedure for simulating Hamiltonian evolution on a quantum computer using calls to a block encoding of the Hamiltonian. In many situations it is possible to control between forward and reverse steps with almost identical cost to a simple controlled operation. We show that it is then possible to reduce the cost of Hamiltonian simulation by a factor of 2 using the recent results of generalised quantum signal processing.
- S. Lloyd, Science 273, 1073 (1996).
- A. M. Childs, Communications in Mathematical Physics 294, 581–603 (2009).
- G. H. Low and I. L. Chuang, Physical Review Letters 118, 010501 (2017).
- G. H. Low and I. L. Chuang, Quantum 3, 163 (2019).
- D. Motlagh and N. Wiebe, arXiv:2308.01501 (2023).
- W. Rudin, The American Mathematical Monthly 107, 813–821 (2000).
- DLMF, “NIST Digital Library of Mathematical Functions,” https://dlmf.nist.gov/, Release 1.1.12 of 2023-12-15, F. W. J. Olver, A. B. Olde Daalhuis, D. W. Lozier, B. I. Schneider, R. F. Boisvert, C. W. Clark, B. R. Miller, B. V. Saunders, H. S. Cohl, and M. A. McClain, eds.
- Y. L. Luke, Journal of Approximation Theory 5, 41 (1972).
- R. B. Paris, SIAM Journal on Mathematical Analysis 15, 203–205 (1984).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.