Phased outcome-complete simulation

• URL: http://arxiv.org/abs/2603.24717v1
• Date: Wed, 25 Mar 2026 18:41:35 GMT
• Title: Phased outcome-complete simulation
• Abstract summary: We generalize the-time outcome-complete simulation algorithm for stabilizer circuits in arXiv:2309.08676 to track global phases exactly.<n>The original algorithm enabled equivalence checking of stabilizer circuits with intermediate measurements and conditional Pauli corrections for all input states and all measurement outcomes simultaneously.<n>Our generalization removes this limitation and enables equivalence checking for an important family of non-stabilizer circuits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We generalize the polynomial-time outcome-complete simulation algorithm for stabilizer circuits in arXiv:2309.08676 to track global phases exactly, yielding what we call phased outcome-complete simulation. The original algorithm enabled equivalence checking of stabilizer circuits with intermediate measurements and conditional Pauli corrections for all input states and all measurement outcomes simultaneously, but it tracked quantum states only up to a global phase. Our generalization removes this limitation and enables equivalence checking for an important family of non-stabilizer circuits: stabilizer circuits augmented with single-qubit rotations $\exp(iαZ)$ by symbolic angles. Two such circuits are equivalent if they implement the same quantum channel for all values of the symbolic angles and all measurement outcomes, given a one-to-one correspondence between rotation angles in the two circuits and a mapping between measurement outcomes. This model enables testing of compilation algorithms that transform the Clifford portions of a computation while preserving rotation angles. Examples include Pauli-based computation, edge-disjoint path compilation for surface codes, and custom compilation strategies for reversible circuits such as adders, multipliers, and table lookups. Our efficient classical verification methods extend naturally to circuits with outcome-parity-conditional Pauli gates and intermediate measurements, features that are ubiquitous in fault-tolerant quantum computing but are rarely addressed by existing equivalence-checking approaches.

Related papers

• SyQMA: A memory-efficient, symbolic and exact universal simulator for quantum error correction [0.0]
  SyQMA simulates universal quantum circuits with incoherent Pauli noise.<n>It computes exact expectation values and measurement probabilities as symbolic functions of circuit parameters.
  arXiv  Detail & Related papers  (2026-04-16T14:10:29Z)
• Efficient equivalence checking of Clifford-U circuits with shared single-qubit unitaries [5.016480897268685]
  We present an equivalence-checking method for circuits formed by arbitrary single-qubit layers interleaved with Clifford layers.<n>This pattern is common in variational quantum algorithms and Hamiltonian simulation via Trotter decomposition.<n>We prove the existence of an efficient classical algorithm that determines whether a pair of circuits with shared single-qubit layers are equivalent for every possible choice of the shared single-qubit unitaries.
  arXiv  Detail & Related papers  (2026-03-13T06:25:26Z)
• Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions [45.88028371034407]
  Block encoding provides the standard method for accessing matrix data within quantum circuits.<n>We present a unified framework for efficiently block encoding finite-difference discretizations of the Laplacian.
  arXiv  Detail & Related papers  (2026-03-12T19:35:16Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose $Zotimes n$ exponentials of arbitrary length into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions.<n>We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases [0.7873629568804646]
  We propose a family of explicit geometrically local circuits on a 2-dimensional planar grid of qudits.<n>These circuits are constructed from measuring 1-form symmetries in discrete fixed-point path integrals.<n>We prove fault tolerance under arbitrary local (including non-Pauli) noise for a very general class of topological circuits.
  arXiv  Detail & Related papers  (2024-03-18T18:00:00Z)
• Stabilizer circuit verification [0.0]
  We propose a set of efficient classical algorithms to fully characterize and exhaustively verify stabilizer circuits. We provide an algorithm for checking the equivalence of stabilizer circuits. All of our algorithms provide relations of measurement outcomes among corresponding circuit representations.
  arXiv  Detail & Related papers  (2023-09-15T18:06:17Z)
• Sufficient condition for universal quantum computation using bosonic circuits [44.99833362998488]
  We focus on promoting circuits that are otherwise simulatable to computational universality. We first introduce a general framework for mapping a continuous-variable state into a qubit state. We then cast existing maps into this framework, including the modular and stabilizer subsystem decompositions.
  arXiv  Detail & Related papers  (2023-09-14T16:15:14Z)
• Adaptive constant-depth circuits for manipulating non-abelian anyons [65.62256987706128]
  Kitaev's quantum double model based on a finite group $G$. We describe quantum circuits for (a) preparation of the ground state, (b) creation of anyon pairs separated by an arbitrary distance, and (c) non-destructive topological charge measurement.
  arXiv  Detail & Related papers  (2022-05-04T08:10:36Z)
• Relating Measurement Patterns to Circuits via Pauli Flow [0.0]
  We show that Pauli flow can be efficiently identified and transformed into a gate-based quantum circuit. We then use this relationship to derive simulation results for the effects of graph-theoretic rewrites in the ZX-calculus.
  arXiv  Detail & Related papers  (2021-09-13T00:48:24Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.