Estimating local observables via cluster-level light-cone decomposition

Simulating large quantum circuits on hardware with limited qubit counts is often attempted through methods like circuit knitting, which typically incur sample costs that grow exponentially with the number of connections cut. In this work, we introduce a framework based on Cluster-level Light-cone analysis that leverages the natural locality of quantum workloads. We propose two complementary algorithms: the Causal Decoupling Algorithm, which exploits geometric disconnections in the light cone for sampling efficiency, and the Algebraic Decomposition Algorithm, which utilizes algebraic expansion to minimize hardware requirements. These methods allow simulation costs to depend on circuit depth and connectivity rather than system size. Together, our results generalize Lieb-Robinson-inspired locality to modular architectures and establish a quantitative framework for probing local physics on near-term quantum devices by decoupling the simulation cost from the global system size.

Authors

Institutions

Publication Details

Journal
Physical review. A/Physical review, A
Published
2026-02-12
DOI
https://doi.org/10.1103/rzhg-szgj
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Estimating local observables via cluster-level light-cone decomposition

Jun Huang, Xiao Yuan, Yijun Tang
Physical review. A/Physical review, A
Quantum Computing Algorithms and Architecture
article

Estimating local observables via cluster-level light-cone decomposition

Jun Huang, Xiao Yuan, Yijun Tang
article en

Abstract

Simulating large quantum circuits on hardware with limited qubit counts is often attempted through methods like circuit knitting, which typically incur sample costs that grow exponentially with the number of connections cut. In this work, we introduce a framework based on Cluster-level Light-cone analysis that leverages the natural locality of quantum workloads. We propose two complementary algorithms: the Causal Decoupling Algorithm, which exploits geometric disconnections in the light cone for sampling efficiency, and the Algebraic Decomposition Algorithm, which utilizes algebraic expansion to minimize hardware requirements. These methods allow simulation costs to depend on circuit depth and connectivity rather than system size. Together, our results generalize Lieb-Robinson-inspired locality to modular architectures and establish a quantitative framework for probing local physics on near-term quantum devices by decoupling the simulation cost from the global system size.

Physical review. A/Physical review, AVol. 113(3)
Peking University (CN)
National Natural Science Foundation of China, Beijing Science and Technology Planning Project, National Safety Academic Fund
Openalex Percentile: Top 99%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Estimating local observables via cluster-level light-cone decomposition — Jun Huang, Xiao Yuan, et al. · Physical review. A/Physical review, A (2026) | TGRS Research Map | TGRS