Stim: a fast stabilizer circuit simulator

• URL: http://arxiv.org/abs/2103.02202v3
• Date: Fri, 18 Jun 2021 05:03:01 GMT
• Title: Stim: a fast stabilizer circuit simulator
• Authors: Craig Gidney
• Abstract summary: Stim is a fast simulator for quantum stabilizer circuits. It can analyze a distance 100 surface code circuit in 15 seconds and then begin sampling full circuit shots at a rate of 1 kHz.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper presents ``Stim", a fast simulator for quantum stabilizer circuits. The paper explains how Stim works and compares it to existing tools. With no foreknowledge, Stim can analyze a distance 100 surface code circuit (20 thousand qubits, 8 million gates, 1 million measurements) in 15 seconds and then begin sampling full circuit shots at a rate of 1 kHz. Stim uses a stabilizer tableau representation, similar to Aaronson and Gottesman's CHP simulator, but with three main improvements. First, Stim improves the asymptotic complexity of deterministic measurement from quadratic to linear by tracking the {\em inverse} of the circuit's stabilizer tableau. Second, Stim improves the constant factors of the algorithm by using a cache-friendly data layout and 256 bit wide SIMD instructions. Third, Stim only uses expensive stabilizer tableau simulation to create an initial reference sample. Further samples are collected in bulk by using that sample as a reference for batches of Pauli frames propagating through the circuit.

Related papers

• Finding Transformer Circuits with Edge Pruning [71.12127707678961]
  We propose Edge Pruning as an effective and scalable solution to automated circuit discovery. Our method finds circuits in GPT-2 that use less than half the number of edges compared to circuits found by previous methods. Thanks to its efficiency, we scale Edge Pruning to CodeLlama-13B, a model over 100x the scale that prior methods operate on.
  arXiv  Detail & Related papers  (2024-06-24T16:40:54Z)
• Faster Computation of Stabilizer Extent [3.8061090528695543]
  We propose fast numerical algorithms to compute the stabilizer extent. Our algorithm can compute the stabilizer fidelity and the stabilizer extent for random pure states up to $n=9$ qubits.
  arXiv  Detail & Related papers  (2024-06-24T14:28:15Z)
• FastMAC: Stochastic Spectral Sampling of Correspondence Graph [55.75524096647733]
  We present the first study that introduces graph signal processing into the domain of correspondence graph. We exploit the generalized degree signal on correspondence graph and pursue sampling strategies that preserve high-frequency components. As an application, we build a complete 3D registration algorithm termed FastMAC, that reaches real-time speed.
  arXiv  Detail & Related papers  (2024-03-13T17:59:56Z)
• 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)
• Speedy Contraction of ZX Diagrams with Triangles via Stabiliser Decompositions [0.30938904602244344]
  We use the ZX calculus to iteratively decompose magic states into stabiliser terms. We show that this technique greatly speeds up the simulation of quantum circuits involving multi-controlled gates. We also use our software to contract diagrams representing the gradient variance of parametrised quantum circuits.
  arXiv  Detail & Related papers  (2023-07-04T16:13:53Z)
• Parallel Sampling of Diffusion Models [76.3124029406809]
  Diffusion models are powerful generative models but suffer from slow sampling. We present ParaDiGMS, a novel method to accelerate the sampling of pretrained diffusion models by denoising multiple steps in parallel.
  arXiv  Detail & Related papers  (2023-05-25T17:59:42Z)
• Rapid Person Re-Identification via Sub-space Consistency Regularization [51.76876061721556]
  Person Re-Identification (ReID) matches pedestrians across disjoint cameras. Existing ReID methods adopting real-value feature descriptors have achieved high accuracy, but they are low in efficiency due to the slow Euclidean distance computation. We propose a novel Sub-space Consistency Regularization (SCR) algorithm that can speed up the ReID procedure by 0.25$ times.
  arXiv  Detail & Related papers  (2022-07-13T02:44:05Z)
• 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)
• High-speed calibration and characterization of superconducting quantum processors without qubit reset [0.0]
  Active qubit reset increases the speed at which data can be gathered but requires additional hardware and/or calibration. In this case, the outcome of a first measurement serves as the initial state for the next experiment. We show how to efficiently analyze restless measurements and correct distortions to achieve an identical outcome and accuracy as compared to measurements in which the superconducting qubits are reset.
  arXiv  Detail & Related papers  (2020-10-13T17:50:09Z)
• 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)

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.