Time evolution of uniform sequential circuits

被引:7
作者
Astrakhantsev N. [1 ]
Lin S.-H. [2 ]
Pollmann F. [2 ,3 ]
Smith A. [4 ,5 ]
机构
[1] Department of Physics, University of Zurich, Winterthurerstrasse 190, Zurich
[2] Technical University of Munich (TUM), TUM School of Natural Sciences, Physics Department, Garching
[3] Munich Center for Quantum Science and Technology (MCQST), Schellingstr. 4, Munich
[4] School of Physics and Astronomy, University of Nottingham, Nottingham
[5] Centre for the Mathematics and Theoretical Physics of Quantum Non-Equilibrium Systems, University of Nottingham, Nottingham
来源
Physical Review Research | 2023年 / 5卷 / 03期
关键词
Evolutionary algorithms - Quantum computers - Quantum optics - Sequential circuits;
D O I
10.1103/PhysRevResearch.5.033187
中图分类号
学科分类号
摘要
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. © 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.
引用
收藏
相关论文
共 53 条
[31]  
Crooks G. E., Gradients of parameterized quantum gates using the parameter-shift rule and gate decomposition
[32]  
We note that the number of parameters can be reduced considering the redundancy of the consecutive single-qubit gates
[33]  
Vidal J. G., Theis D. O., Calculus on parameterized quantum circuits
[34]  
Nakanishi K. M., Fujii K., Todo S., Sequential minimal optimization for quantum-classical hybrid algorithms, Phys. Rev. Res, 2, (2020)
[35]  
Parrish R. M., Iosue J. T., Ozaeta A., McMahon P. L., A Jacobi diagonalization and Anderson acceleration algorithm for variational quantum algorithm parameter optimization
[36]  
Ostaszewski M., Grant E., Benedetti M., Structure optimization for parameterized quantum circuits, Quantum, 5, (2021)
[37]  
Otten M., Cortes C. L., Gray S. K., Noise-resilient quantum dynamics using symmetry-preserving ansatzes
[38]  
Lim Y. L., Barrett S. D., Beige A., Kok P., Kwek L. C., Repeat-until-success quantum computing using stationary and flying qubits, Phys. Rev. A, 73, (2006)
[39]  
Mitarai K., Fujii K., Methodology for replacing indirect measurements with direct measurements, Phys. Rev. Res, 1, (2019)
[40]  
Generalization to a Hamiltonian with longer-range interaction acting between qubits separated by (Equation presented) would require a transfer matrix in Fig