Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2310.00762 · Quantum Information Processing

A note on the stabilizer formalism via noncommutative graphs

Roy Araiza, Jihong Cai, Yushan Chen, Abraham Thomas Holtermann, Chieh Hsu, Tushar Mohan, Peixue Wu, Zeyuan Yu

Published Feb 29, 2024• 0 citations
arXivHTMLPDF
DOI
10.1007/s11128-024-04291-3

Related papers

On inner geometry of noncommutative operator graphs

Grigori Gennadievich Amosov

The European Physical Journal Plus•Oct 1, 2020•2 citations

On Construction of Anticliques for Noncommutative Operator Graphs

Grigori Gennadievich Amosov, Мокеев Александр Сергеевич

arXiv:1709.08062•Journal of Mathematical Sciences•Aug 24, 2018•9 citations

Stabilizer Formalism and Its Applications

Keisuke Fujii

SpringerBriefs in mathematical physics•Jan 1, 2015•4 citations

Observation and Time

Yoshihiro Yamakawa

This note develops a mathematical formalization of observation through the frameworks of graph theory, vector bundles, and sheaf theory, deriving time from the noncommutativity of observation.

•Nov 8, 2026•0 citations

Lecture notes on quantum entanglement: From stabilizer states to stabilizer channels

Amir R. Arab

We study mathematical, physical and computational aspects of the stabilizer formalism arising in quantum information and quantum computation. The measurement process of Pauli observables with its algorithm is given. It is shown that to detect genuine entanglement we need a full set of stabilizer generators and the stabilizer witness is coarser than the GHZ (Greenberger–Horne–Zeilinger) witness. We discuss stabilizer codes and construct a stabilizer code from a given linear code. We also discuss quantum error correction, error recovery criteria and syndrome extraction. The symplectic structure of the stabilizer formalism is established and it is shown that any stabilizer code is unitarily equivalent to a trivial code. The structure of graph codes as stabilizer codes is identified by obtaining the respective stabilizer generators. The distance of embeddable stabilizer codes in lattices is obtained. We discuss the Knill–Gottesman theorem, tableau representation and frame representation. The runtime of simulating stabilizer gates is obtained by applying stabilizer matrices. Furthermore, an algorithm for updating global phases is given. Resolution of quantum channels into stabilizer channels is shown. We discuss capacity achieving codes to obtain the capacity of the quantum erasure channel. Finally, we discuss the shadow tomography problem and an algorithm for constructing classical shadow is given.

Frontiers of Physics•Apr 16, 2024•5 citations

Succinct Quantum Proofs for Graph Non-Isomorphism

KEISUKE TANAKA

•Jan 1, 2001•0 citations
We study mathematical, physical and computational aspects of the stabilizer formalism arising in quantum information and quantum computation. The measurement process of Pauli observables with its algorithm is given. It is shown that to detect genuine entanglement we need a full set of stabilizer generators and the stabilizer witness is coarser than the GHZ (Greenberger–Horne–Zeilinger) witness. We discuss stabilizer codes and construct a stabilizer code from a given linear code. We also discuss quantum error correction, error recovery criteria and syndrome extraction. The symplectic structure of the stabilizer formalism is established and it is shown that any stabilizer code is unitarily equivalent to a trivial code. The structure of graph codes as stabilizer codes is identified by obtaining the respective stabilizer generators. The distance of embeddable stabilizer codes in lattices is obtained. We discuss the Knill–Gottesman theorem, tableau representation and frame representation. The runtime of simulating stabilizer gates is obtained by applying stabilizer matrices. Furthermore, an algorithm for updating global phases is given. Resolution of quantum channels into stabilizer channels is shown. We discuss capacity achieving codes to obtain the capacity of the quantum erasure channel. Finally, we discuss the shadow tomography problem and an algorithm for constructing classical shadow is given.