TY - JOUR
T1 - Time evolution of uniform sequential circuits
AU - Astrakhantsev, Nikita
AU - Lin, Sheng Hsuan
AU - Pollmann, Frank
AU - Smith, Adam
N1 - Publisher Copyright:
© 2023 authors. Published by the American Physical Society. Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.
PY - 2023/7
Y1 - 2023/7
N2 - Simulating time evolution of generic quantum many-body systems using classical numerical approaches has an exponentially growing cost either with evolution time or with the system size. In this work we present a polynomially scaling hybrid quantum-classical algorithm for time evolving a one-dimensional uniform system in the thermodynamic limit. This algorithm uses a layered uniform sequential quantum circuit as a variational Ansatz to represent infinite translation-invariant quantum states. We show numerically that this Ansatz requires a number of parameters polynomial in the simulation time for a given accuracy. Furthermore, this favorable scaling of the Ansatz is maintained during our variational evolution algorithm. All steps of the hybrid optimization are designed with near-term digital quantum computers in mind. After benchmarking the evolution algorithm on a classical computer, we demonstrate the measurement of observables of this uniform state using a finite number of qubits on a cloud-based quantum processing unit. With more efficient tensor contraction schemes, this algorithm may also offer improvements as a classical numerical algorithm.
AB - Simulating time evolution of generic quantum many-body systems using classical numerical approaches has an exponentially growing cost either with evolution time or with the system size. In this work we present a polynomially scaling hybrid quantum-classical algorithm for time evolving a one-dimensional uniform system in the thermodynamic limit. This algorithm uses a layered uniform sequential quantum circuit as a variational Ansatz to represent infinite translation-invariant quantum states. We show numerically that this Ansatz requires a number of parameters polynomial in the simulation time for a given accuracy. Furthermore, this favorable scaling of the Ansatz is maintained during our variational evolution algorithm. All steps of the hybrid optimization are designed with near-term digital quantum computers in mind. After benchmarking the evolution algorithm on a classical computer, we demonstrate the measurement of observables of this uniform state using a finite number of qubits on a cloud-based quantum processing unit. With more efficient tensor contraction schemes, this algorithm may also offer improvements as a classical numerical algorithm.
UR - http://www.scopus.com/inward/record.url?scp=85172862017&partnerID=8YFLogxK
U2 - 10.1103/PhysRevResearch.5.033187
DO - 10.1103/PhysRevResearch.5.033187
M3 - Article
AN - SCOPUS:85172862017
SN - 2643-1564
VL - 5
JO - Physical Review Research
JF - Physical Review Research
IS - 3
M1 - 033187
ER -