ArcTN cuts quantum simulation costs with faster contraction planning
ArcTN: Efficient Tensor-Network Contraction Planning for Quantum Circuit Simulation
Mathematical Software
Summary
Simulating quantum circuits on classical computers requires combining many complex parts in an efficient way. The authors introduce ArcTN, a new approach that finds a faster and less resource-heavy process to do this combining, called contraction planning. ArcTN offers two methods: one that plans quickly with good results, and one that takes more time but finds even better combinations. Their tests show ArcTN uses less computing power and runs faster than several existing methods, making quantum circuit simulations more efficient.
What this means in practice
- •For quantum software developers: Optimize simulation runs by using ArcTN to plan tensor contractions more efficiently, reducing computation time and memory use.
- •For high-performance computing teams: Implement ArcTN’s contraction planning to speed up classical simulations of quantum circuits for research and benchmarking.
Authors
Zhengyi Liu, Li Liu, Songtao Liu, Xianglong Liu, Xiangzhen Zhou, Mingyu Huang, Dingchao Gao, Shenggang Ying, Ji Guan, Bolong Chen
Abstract
Tensor-network simulation of quantum circuits depends on contraction orders with low computational cost and small intermediate tensors, found without excessive planning time. We present ArcTN, a contraction-order optimization framework with two search presets. Light keeps planning overhead low, and Heavy spends more effort on refinement. Both combine randomized-greedy construction, subtree reconfiguration, and parallel tempering with stage-specific stopping rules. ArcTN also provides Fixed and Dynamic slicing to meet tensor-size limits and executes the returned orders. On the 30 QC32 quantum-circuit networks completed by all eight compared configurations, Light reduces FLOPs by 61.32% and plans 1.62$\times$ faster than Cotengra Auto/CMA-ES, and Heavy reduces FLOPs by 43.83% and plans 7.21$\times$ faster than Cotengra AutoHQ/Optuna. Heavy also needs 11.85% fewer FLOPs than OMECO TreeSA-8 and plans 1.33$\times$ faster. Dynamic slicing meets the size limits in all 90 runs on 18 scalar-output networks and reduces total sliced FLOPs by 31.99% relative to Fixed slicing, at the cost of longer planning. With a common NumPy executor, Heavy has the lowest combined planning and execution time among five configurations on the runs that all of them completed. On 672 networks built from 320 MQT Bench circuits, Heavy obtains the lowest geometric-mean FLOPs on the 142 large networks while planning 3.1$\times$ and 31$\times$ faster than Cotengra AutoHQ and Hyper128.