Complexity of Implementing Trotter Steps
Quantum dynamics can be simulated on a quantum computer by exponentiating elementary terms from the Hamiltonian in a sequential manner. However, such an implementation of Trotter steps has gate complexity depending on the total Hamiltonian term number, comparing unfavorably to algorithms using more...
Main Authors: | Guang Hao Low, Yuan Su, Yu Tong, Minh C. Tran |
---|---|
Format: | Article |
Language: | English |
Published: |
American Physical Society
2023-05-01
|
Series: | PRX Quantum |
Online Access: | http://doi.org/10.1103/PRXQuantum.4.020323 |
Similar Items
-
Theory of Trotter Error with Commutator Scaling
by: Andrew M. Childs, et al.
Published: (2021-02-01) -
Nearly tight Trotterization of interacting electrons
by: Yuan Su, et al.
Published: (2021-07-01) -
Generalizations of the Szemerédi–Trotter Theorem
by: Sharir, Micha, et al.
Published: (2017) -
Studies on the genetics of trotting performance in <it>dutch trotters</it>. II. – A method for the breeding value estimation of trotter stallions
by: Minkema D
Published: (1976-10-01) -
Trotter welfare’s protection: A legislative perspective
by: Annamaria Passantino, et al.
Published: (2015-03-01)