A theoretical dataset formalizing the concept of magic, or non-stabilizerness, in quantum computing. The work provides an exact, decidable, and machine-checked account of the resource a quantum circuit must spend to escape efficient classical simulation. It was authored by Richard Goodman of IAOM and last updated on July 11, 2026.
Use Cases
- Formal verification of quantum state properties based on the described stabilizer 2-purity functional.
- Characterizing the resource cost of quantum circuits based on the concept of magic/non-stabilizerness.
- Studying the Gottesman-Knill theorem's boundary conditions based on the formalization of stabilizer states.
- Analyzing the characteristic distribution of quantum states based on the described Pauli expectation probability law.
Strengths
- The description provides a detailed theoretical framework for a core quantum computing concept.
- The work is described as having a formal, machine-checked proof for its central result.
- The dataset is associated with a specific author (Richard Goodman) and organization (IAOM).
Limitations
- Description metadata is limited; actual data quality requires manual inspection after download.
- Column-level documentation is absent; field semantics must be inferred after download.
- Row count is unknown, which may limit suitability assessment.
Provenance
- Source
- dataverse
- Freshness
- Last updated 2026-07-11 22:54:22; freshness should be verified