eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2023-07-10
33:1
33:45
10.4230/LIPIcs.CCC.2023.33
article
On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation
Chia, Nai-Hui
1
Chung, Kai-Min
2
Hsieh, Yao-Ching
3
Lin, Han-Hsuan
4
Lin, Yao-Ting
5
Shen, Yu-Ching
2
Rice University, Houston, TX, USA
Academia Sinica, Taipei, Taiwan
University of Washington, Seattle, WA, USA
National Tsing Hua University, Hsinchu, Taiwan
University of California at Santa Barbara, CA, USA
Hamiltonian simulation is one of the most important problems in the field of quantum computing. There have been extended efforts on designing algorithms for faster simulation, and the evolution time T for the simulation greatly affect algorithm runtime as expected. While there are some specific types of Hamiltonians that can be fast-forwarded, i.e., simulated within time o(T), for some large classes of Hamiltonians (e.g., all local/sparse Hamiltonians), existing simulation algorithms require running time at least linear in the evolution time T. On the other hand, while there exist lower bounds of Ω(T) circuit size for some large classes of Hamiltonian, these lower bounds do not rule out the possibilities of Hamiltonian simulation with large but "low-depth" circuits by running things in parallel. As a result, physical systems with system size scaling with T can potentially do a fast-forwarding simulation. Therefore, it is intriguing whether we can achieve fast Hamiltonian simulation with the power of parallelism.
In this work, we give a negative result for the above open problem in various settings. In the oracle model, we prove that there are time-independent sparse Hamiltonians that cannot be simulated via an oracle circuit of depth o(T). In the plain model, relying on the random oracle heuristic, we show that there exist time-independent local Hamiltonians and time-dependent geometrically local Hamiltonians on n qubits that cannot be simulated via an oracle circuit of depth o(T/n^c), where the Hamiltonians act on n qubits, and c is a constant. Lastly, we generalize the above results and show that any simulators that are geometrically local Hamiltonians cannot do the simulation much faster than parallel quantum algorithms.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol264-ccc2023/LIPIcs.CCC.2023.33/LIPIcs.CCC.2023.33.pdf
Hamiltonian simulation
Depth lower bound
Parallel query lower bound