pith. machine review for the scientific record. sign in
structure

QuantumComputingDepthCert

definition
show as:
view math explainer →
module
IndisputableMonolith.Physics.QuantumComputingDepthFromRS
domain
Physics
line
35 · github
papers citing
none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.Physics.QuantumComputingDepthFromRS on GitHub at line 35.

browse module

All declarations in this module, on Recognition.

explainer page

Tracked in the explainer inventory; generation is lazy so crawlers do not trigger LLM jobs.

open explainer

depends on

used by

formal source

  32def universalGates : ℕ := 3
  33theorem universalGates_eq_D : universalGates = 3 := rfl
  34
  35structure QuantumComputingDepthCert where
  36  five_gates : Fintype.card QuantumGateType = 5
  37  pauli_8 : pauliGroupSize = 2 ^ 3
  38  universal_D : universalGates = 3
  39
  40def quantumComputingDepthCert : QuantumComputingDepthCert where
  41  five_gates := quantumGateTypeCount
  42  pauli_8 := pauliGroupSize_2cubed
  43  universal_D := universalGates_eq_D
  44
  45end IndisputableMonolith.Physics.QuantumComputingDepthFromRS

papers checked against this theorem

No papers in the current corpus map onto this theorem yet.