Reducing the computational cost scaling of tensor network algorithms via field-programmable gate array parallelism
Open Access
- 15 June 2026
- journal article
- Published by American Physical Society (APS) in APS Open Science
- Vol. 1
Abstract
Improving the computational efficiency of quantum many-body calculations from a hardware perspective remains a critical challenge. Although field-programmable gate arrays (FPGAs) have recently been exploited to improve the computational scaling of algorithms such as Monte Carlo methods, their application to tensor network algorithms is still at an early stage. In this work, we propose a fine-grained parallel tensor network design based on FPGAs to substantially enhance the computational efficiency of two representative tensor network algorithms: the infinite time-evolving block decimation (iTEBD) and the higher-order tensor renormalization group (HOTRG). By employing a quad-tile partitioning strategy to decompose tensor elements and map them onto hardware circuits, our approach effectively translates algorithmic computational complexity into scalable hardware resource utilization, enabling an extremely high degree of parallelism on FPGAs. Compared with conventional CPU-based implementations, our scheme exhibits superior scalability in computation time, reducing the bond-dimension scaling of the computational cost from O ( D b 3 ) to O ( D b ) for iTEBD and from O ( D b 6 ) to O ( D b 2 ) for HOTRG. This work provides a theoretical foundation for future hardware implementations of large-scale tensor network computations.Keywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (12274126)
- National Natural Science Foundation of China (12575204)
- National Key Research and Development Program of China (2023YFF0719200)
- Innovation Program for Quantum Science and Technology (2021ZD0303000)
- Innovation Program for Quantum Science and Technology (2021ZD0303002)
This publication has 51 references indexed in Scilit:
- Nearly degenerate ground states of a checkerboard antiferromagnet and their bosonic interpretationScience China Physics, Mechanics & Astronomy, 2023
- TeNeS: Tensor network solver for quantum lattice systemsComputer Physics Communications, 2022
- Gapless quantum spin liquid and global phase diagram of the spin-1/2
J
1
-
J
2
square antiferromagnetic Heisenberg modelScience Bulletin, 2022
- Field‐programmable gate arrays and quantum Monte Carlo: Power efficient coprocessing for scalable high‐performance computingInternational Journal of Quantum Chemistry, 2019
- A survey of FPGA-based accelerators for convolutional neural networksNeural Computing and Applications, 2018
- A practical introduction to tensor networks: Matrix product states and projected entangled pair statesAnnals of Physics, 2014
- The density-matrix renormalization group in the age of matrix product statesAnnals of Physics, 2011
- FPGA acceleration of a quantum Monte Carlo applicationParallel Computing, 2008
- Parallelization strategies for density matrix renormalization group algorithms on shared-memory systemsJournal of Computational Physics, 2004
- A parallel method for computing the generalized singular value decompositionJournal of Parallel and Distributed Computing, 1985