103 citations · 515 across the 33 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
quant-ph2022★ 13 cited
Simulating quantum circuits using efficient tensor network contraction algorithms with subexponential upper bound
Thorsten B. Wahl, Sergii Strelchuk
We derive a rigorous upper bound on the classical computation time of finite-ranged tensor network contractions in dimensions. Consequently, we show that quantum circuit…
quant-ph2022★ 8 cited
Toward Super-polynomial Quantum Speedup of Equivariant Quantum Algorithms with SU() Symmetry
Han Zheng, Zimu Li, Sergii Strelchuk +2
We introduce a framework of the equivariant convolutional quantum algorithms which is tailored for a number of machine-learning tasks on physical systems with arbitrary SU sym…