PhysicsarXiv

Ranked by formulaVerdict: Notable

ArcTN: Efficient Tensor-Network Contraction Planning for Quantum Circuit Simulation

Tensor-network simulation of quantum circuits depends on contraction orders with low computational cost and small intermediate tensors, found without excessive planning time.

By Liu, Liu, Liu +7

Score████░░░░░░4.1

Key numbers

  • 1.62× faster than Cotengra Auto
  • 7.21× faster than Cotengra AutoHQ
  • 1.33× faster

Caveats

  • Preprint; not yet peer reviewed.

VerdictWorth a reader's time today.

Read the originalPDFCode

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× faster than Cotengra Auto/CMA-ES, and Heavy reduces FLOPs by 43.83% and plans 7.21× faster than Cotengra AutoHQ/Optuna. Heavy also needs 11.85% fewer FLOPs than OMECO TreeSA-8 and plans 1.33× 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× and 31× faster than Cotengra AutoHQ and Hyper128.

Zhengyi Liu, Li Liu, Songtao Liu, Xianglong Liu, Xiangzhen Zhou, Mingyu Huang, Dingchao Gao, Shenggang Ying, Ji Guan, Bolong Chen

The editor's rubric

Heuristic review

Leverage3 / 5
A method or resource many groups across the field will adopt within a year.
18% of this desk’s rubric
Magnitude3 / 5
Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
20% of this desk’s rubric
Evidence3 / 5
Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
22% of this desk’s rubric
Novelty2 / 5
A new combination of known ideas.
22% of this desk’s rubric
Trajectory2 / 5
Some room to improve with obvious engineering.
10% of this desk’s rubric
Stakes2 / 5
Benefits a professional community (practitioners, clinicians, engineers).
8% of this desk’s rubric

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose); gains (x-fold, relative gain); design (randomized); verification (code released); scale (efficient).

How the score was computed

rank-2026-10-18

Score████░░░░░░4.1

Score = 10 × (75% × adjusted merit / 10 + 15% × attention + 10% × freshness)

Desks place stronger verdicts first, then use this score to order work within the same verdict.

Merit
5.2 / 10
Weighted rubric, evidence-gated.
Adjusted merit
4.5 / 10
Shrunk toward the desk prior by editor confidence (40%).
Attention
0%
Citations, upvotes, points, mentions.
Freshness
77%
Half-life decay since publication.

No attention signals recorded yet.

The record

  • Reviewed by heuristic-v10 on Oct 25, 2026, 07:29 UTC. Paper type: method.
  • Categories: quant-ph, cs.MS
  • BRIEF, No.8 in the Physics edition of October 25, 2026.