Learning to Rank Tensor Network Contraction Plans for GPU-Accelerated Quantum Circuit Simulation
cs.LG, cs.DC, cs.PF, quant-ph
Submitted: 2026-08-06
Updated: 2026-10-02
Code: https://github.com/dmlc/XGBoost.jl
Project page: https://quantumkithub.github.io/TensorOperations.jl/stable
License: http://creativecommons.org/licenses/by/4.0/
The gist: Classical simulation remains essential for developing and validating quantum algorithms, but its cost grows rapidly with circuit size.
Terminology
Abstract
Classical simulation remains essential for developing and validating quantum algorithms, but its cost grows rapidly with circuit size. Tensor-network contraction can reduce this cost by exploiting circuit structure, although its efficiency depends strongly on the chosen contraction plan. On GPUs, plans with similar theoretical complexity may perform very differently because execution also depends on parallelism, reduction structure, memory traffic, and contraction geometry. We present a learning-to-rank framework for selecting efficient contraction plans before executing them. Each plan is represented by structural features derived directly from its sequence of pairwise contractions, and gradient-boosted rankers are trained from GPU measurements using listwise and pairwise objectives. We evaluate the resulting models on diverse circuit families, using separate in-distribution and circuit-family-shift test sets, and compare them with random and MinFill-based baselines. The learned rankers generally identify better plans, with the listwise model providing the strongest overall decision quality. We also study backend shift by comparing empirical plan orderings on two GPU architectures and evaluating the source-trained models on the second device without retraining. The rankings remain substantially, though not perfectly, stable across GPUs, and the models retain useful decision quality. These results support Learning to Rank as a practical way to reduce contraction-plan search, while showing that performance remains partly backend dependent.
Sources
- Learning to rank quantum circuits for hardware-optimized performance enhancement
- A Survey on Quantum Machine Learning: Current Trends, Challenges, Opportunities, and the Road Ahead
- Predicting Good Quantum Circuit Compilation Options
- Learning to learn with quantum neural networks via classical neural networks
- A Survey on E-Commerce Learning to Rank
- Unified Learning-to-Rank for Multi-Channel Retrieval in Large-Scale E-Commerce Search
- Recent Advances in the Foundations and Applications of Unbiased Learning to Rank
- Computing Tree Decompositions with FlowCutter: PACE 2017 Submission
- Feature Interactions in XGBoost
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks