Further improvements to stabilizer simulation theory: classical rewriting of CSS-preserving stabilizer circuits, quadratic form expansions of stabilizer operations, and framed hidden variable models

• URL: http://arxiv.org/abs/2511.05478v1
• Date: Fri, 07 Nov 2025 18:40:02 GMT
• Title: Further improvements to stabilizer simulation theory: classical rewriting of CSS-preserving stabilizer circuits, quadratic form expansions of stabilizer operations, and framed hidden variable models
• Authors: Vsevolod I. Yashin, Evgeniy O. Kiktenko, Vladimir V. Yatsulevich, Aleksey K. Fedorov,
• Abstract summary: We argue that further improvements can arise from the theoretical structure of stabilizer operations themselves.<n>We focus on the subclass of stabilizer circuits composed of Calderbank-Shor-Steane (CSS)-preserving stabilizer operations.<n>We show that such circuits can be exactly rewritten as classical probabilistic circuits that reproduce measurement statistics.
• Score: 0.19999259391104385
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Simulation of stabilizer circuits is a well-studied problem in quantum information processing, with a number of highly optimized algorithms available. Yet, we argue that further improvements can arise from the theoretical structure of stabilizer operations themselves. We focus on the subclass of stabilizer circuits composed of Calderbank-Shor-Steane (CSS)-preserving stabilizer operations, which naturally appear in fault-tolerant computations over CSS stabilizer codes. Using elementary circuit-transformation techniques, we show that such circuits can be exactly rewritten as classical probabilistic circuits that reproduce measurement statistics. This rewriting introduces no computational overhead, in contrast to the general case of stabilizer circuits. To clarify the origin of this simplification, we introduce the standard quadratic-form representation of general stabilizer operations (Clifford channels). It provides an efficient way to describe compositions of stabilizer operations and thus to simulate stabilizer circuits. CSS-preserving operations correspond to purely linear forms, which under a Walsh-Hadamard-Fourier transform yield a noncontextual hidden variable model, providing an alternative proof of the introduced rewriting. Finally, we develop a theory of reference frames for multiqubit systems, where frames are encoded by quadratic forms. This allows us to express stabilizer operations as probabilistic maps for proper reference frames. Non-CSS-preserving stabilizer circuits require dynamical modifications of reference frames, embodying a contextuality resource that leads to the computational overhead. This framework provides a new perspective on simulating stabilizer and near-stabilizer circuits within dynamically evolving quasiprobability models.

Related papers

• A streamlined demonstration that stabilizer circuits simulation reduces to Boolean linear algebra [0.0]
  Gottesman-Knill theorem states that computations on stabilizer circuits can be simulated on a classical computer.<n>This note aims to make the connection between stabilizer circuits and Boolean linear algebra even more explicit.
  arXiv  Detail & Related papers  (2025-04-18T22:57:24Z)
• Large Continual Instruction Assistant [59.585544987096974]
  Continual Instruction Tuning (CIT) is adopted to instruct Large Models to follow human intent data by data.<n>Existing update gradient would heavily destroy the performance on previous datasets during CIT process.<n>We propose a general continual instruction tuning framework to address the challenge.
  arXiv  Detail & Related papers  (2024-10-08T11:24:59Z)
• 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)
• SymPhase: Phase Symbolization for Fast Simulation of Stabilizer Circuits [3.5664433935013165]
  This paper proposes an efficient stabilizer circuit simulation algorithm that only traverses the circuit forward once. We introduce phase symbolization into stabilizer generators, which allows possible Pauli faults in the circuit to be accumulated explicitly as symbolic expressions. We show how to integrate symbolic phases into the stabilizer tableau and maintain them efficiently using bit-vector encoding.
  arXiv  Detail & Related papers  (2023-11-07T11:45:36Z)
• The Algebra for Stabilizer Codes [0.0]
  In the language of the stabilizer formalism, full rank stabilizer tableaux are exactly the bases for affine Lagrangian subspaces. We show that by splitting the projector for a stabilizer code we recover the error detection protocol and the error correction protocol with affine classical processing power.
  arXiv  Detail & Related papers  (2023-04-20T18:16:17Z)
• GPU-accelerated SIFT-aided source identification of stabilized videos [63.084540168532065]
  We exploit the parallelization capabilities of Graphics Processing Units (GPUs) in the framework of stabilised frames inversion. We propose to exploit SIFT features. to estimate the camera momentum and %to identify less stabilized temporal segments. Experiments confirm the effectiveness of the proposed approach in reducing the required computational time and improving the source identification accuracy.
  arXiv  Detail & Related papers  (2022-07-29T07:01:31Z)
• 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)
• Gaussian Process-based Min-norm Stabilizing Controller for Control-Affine Systems with Uncertain Input Effects and Dynamics [90.81186513537777]
  We propose a novel compound kernel that captures the control-affine nature of the problem. We show that this resulting optimization problem is convex, and we call it Gaussian Process-based Control Lyapunov Function Second-Order Cone Program (GP-CLF-SOCP)
  arXiv  Detail & Related papers  (2020-11-14T01:27:32Z)
• Learning Stabilizing Controllers for Unstable Linear Quadratic Regulators from a Single Trajectory [85.29718245299341]
  We study linear controllers under quadratic costs model also known as linear quadratic regulators (LQR) We present two different semi-definite programs (SDP) which results in a controller that stabilizes all systems within an ellipsoid uncertainty set. We propose an efficient data dependent algorithm -- textsceXploration -- that with high probability quickly identifies a stabilizing controller.
  arXiv  Detail & Related papers  (2020-06-19T08:58:57Z)
• Fine-Grained Analysis of Stability and Generalization for Stochastic Gradient Descent [55.85456985750134]
  We introduce a new stability measure called on-average model stability, for which we develop novel bounds controlled by the risks of SGD iterates. This yields generalization bounds depending on the behavior of the best model, and leads to the first-ever-known fast bounds in the low-noise setting. To our best knowledge, this gives the firstever-known stability and generalization for SGD with even non-differentiable loss functions.
  arXiv  Detail & Related papers  (2020-06-15T06:30:19Z)

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.