Adaptive Multi-Backend Simulation of Near-Clifford Quantum Circuits via Spatial Stabilizer-Frame Partitioning

• URL: http://arxiv.org/abs/2607.27075v1
• Date: Wed, 29 Jul 2026 16:00:35 GMT
• Title: Adaptive Multi-Backend Simulation of Near-Clifford Quantum Circuits via Spatial Stabilizer-Frame Partitioning
• Abstract summary: We present an exact amplitude simulator for Clifford+T quantum circuits.<n>The construction extends prior stabilizer-based Schrdinger-Feynman methods in three directions.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present an exact amplitude simulator for Clifford+T quantum circuits that combines a Feynman path sum across a balanced qubit bipartition with stabilizer-frame simulation on each half. The construction extends prior stabilizer-based Schrödinger-Feynman methods in three directions: recursive multilevel bipartition into a binary tree, automatic fallback to dense state-vector simulation when a leaf's stabilizer frame would exceed its memory ceiling, and a cost-model-driven partition selector that replaces the standard cut-count minimization heuristic. We show cut-count minimization is an unreliable proxy in practice: a globally cleaner partition can reduce cross-cut count yet increase wall-clock time, because it imbalances T-gate density across halves and inflates per-half stabilizer-frame size. Our cost model substitutes the stabilizer-frame bound 2w for the dense 2n ceiling per side and explicitly models per-amplitude readout cost; isolating that term uncovered a quadratic-asymptotic inefficiency in the leaf simulator's end-of-path amplitude extraction, fixed by replacing it with an existing O(F * s * n) single-amplitude inner product. On a structured hierarchical n=16 benchmark the recursive simulator beats monolithic stabilizer-frame simulation by 92x to 17,645x, wins by 79x per path against a dense half-state-vector baseline under an identical cut, and beats a production state-vector simulator end to end by up to 47.9x (median ~5x). On adversarial random Clifford+T circuits the dense state vector wins past a crossover near n/2 cross-cut gates -- the regime the cost model identifies. The dominant cost, the cross-cut Feynman sum, is embarrassingly parallel with constant inter-worker communication, unlike recent matrix-product-state stabilizer-tensor methods whose inner contraction loop is sequential.

Related papers

• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• SymFT: Universal Fault-Tolerant Quantum Circuit Simulation via Symbolic Clifford--Pauli Frames and Stabilizer Coordinates [1.8668905919280483]
  We present SymFT, a high-induced simulator for Clifford-dominated circuits with Pauli rotations, Pauli noise, mid-circuit Pauli measurements, and measurement-record-controlled Pauli feedback.<n>SymFT achieves state-of-the-art sampling performance across the tested pure-Clifford and near-Clifford circuits.
  arXiv  Detail & Related papers  (2026-07-30T17:51:54Z)
• Closed-Form Spectral Regularization for Multi-Task Model Merging [96.82449201305234]
  Model merging combines several independently fine-tuned experts into a single multi-task model without any training data.<n>State-of-the-art merging methods formulate merging as a layer-wise interference problem.<n>We propose SWUDI, a closed-form method that combines a soft exponential filter, which matches the gradient-flow trajectory of iterative descent.
  arXiv  Detail & Related papers  (2026-06-05T14:00:47Z)
• CAWN: Continuous Acoustic Wave Networks for Autoregressive Language Modeling [46.16066322190728]
  We introduce the Continuous Acoustic Wave Network (CAWN), a fully continuous sequence-mixing architecture.<n>Instead of discrete matrix-based attention, CAWN projects hidden states into multi-headed complex-domain phasors.<n>To prevent signal degradation over ultra-long contexts, we introduce a dual-gated Selective Phase Resonance mechanism.
  arXiv  Detail & Related papers  (2026-04-05T20:13:22Z)
• QuickQudits: A Framework for Efficient Simulation of Noisy Qudit Clifford Circuits via an Extended Stabilizer Tableau Formalism [0.0]
  We present a framework for the efficient classical simulation of circuits acting on $d$-dimensional qudits.<n>This framework forms the basis for a scalable, open-source strong+weak stabilizer simulator including noise.
  arXiv  Detail & Related papers  (2026-03-24T18:28:49Z)
• Riemannian MeanFlow for One-Step Generation on Manifolds [54.09734511705173]
  Flow Matching enables simulation-free training of generative models.<n>MeanFlow can be extended to manifold-valued generation where velocities lie in location-dependent tangent spaces.<n>Experiments on spheres, tori, and SO(3) demonstrate competitive one-step sampling with improved quality-efficiency trade-offs and substantially reduced sampling cost.
  arXiv  Detail & Related papers  (2026-03-11T12:41:46Z)
• Exponentially Accelerated Sampling of Pauli Strings for Nonstabilizerness [9.107796201474187]
  Quantum magic, quantified by nonstabilizerness, measures departures from stabilizer structure and underlies potential quantum speedups.<n>We introduce an efficient classical algorithm that exactly computes stabilizer Rényi entropies and stabilizer nullity for generic many-body wavefunctions of $N$ qubits.
  arXiv  Detail & Related papers  (2026-01-02T17:37:04Z)
• Lane-Frame Quantum Multimodal Driving Forecasts for the Trajectory of Autonomous Vehicles [6.137648436139678]
  Tray forecasting for autonomous driving must deliver accurate, multi-modal calibrated forecasts under tight compute and latency constraints.<n>We propose a compact hybrid quantum architecture that aligns quantum inductive bias with road-scene structure by operating in an ego-centric, lane-aligned frame.<n>In the Open Motion dataset, the model achieves minADE of SI1.94m and minFDE of SI3.56m, consistently outperforming a kinematic baseline with reduced miss rates and strong recall.
  arXiv  Detail & Related papers  (2025-11-21T07:00:07Z)
• Faster computation of nonstabilizerness [3.8061090528695543]
  The stabilizer extent is a useful tool to estimate the simulation cost using rank-based simulators.<n>We propose faster numerical algorithms to compute the stabilizer extent.
  arXiv  Detail & Related papers  (2024-06-24T14:28:15Z)
• Dissipative preparation and stabilization of many-body quantum states in a superconducting qutrit array [55.41644538483948]
  We present and analyze a protocol for driven-dissipatively preparing and stabilizing a manifold of quantum manybody entangled states. We perform theoretical modeling of this platform via pulse-level simulations based on physical features of real devices. Our work shows the capacity of driven-dissipative superconducting cQED systems to host robust and self-corrected quantum manybody states.
  arXiv  Detail & Related papers  (2023-03-21T18:02:47Z)
• Classical simulation of quantum circuits with partial and graphical stabiliser decompositions [0.0]
  We show how, by considering certain non-stabiliser entangled states which have more favourable decompositions, we can speed up simulations. We additionally find a new technique of partial stabiliser decompositions that allow us to trade magic states for stabiliser terms. With our techniques we manage to reliably simulate 50-qubit 1400 T-count hidden shift circuits in a couple of minutes on a consumer laptop.
  arXiv  Detail & Related papers  (2022-02-18T14:04:30Z)
• Improved Graph Formalism for Quantum Circuit Simulation [77.34726150561087]
  We show how to efficiently simplify stabilizer states to canonical form. We characterize all linearly dependent triplets, revealing symmetries in the inner products. Using our novel controlled-Pauli $Z$ algorithm, we improve runtime for inner product computation from $O(n3)$ to $O(nd2)$ where $d$ is the maximum degree of the graph.
  arXiv  Detail & Related papers  (2021-09-20T05:56:25Z)
• Iterative Refinement in the Continuous Space for Non-Autoregressive Neural Machine Translation [68.25872110275542]
  We propose an efficient inference procedure for non-autoregressive machine translation. It iteratively refines translation purely in the continuous space. We evaluate our approach on WMT'14 En-De, WMT'16 Ro-En and IWSLT'16 De-En.
  arXiv  Detail & Related papers  (2020-09-15T15:30:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.