Quantum and CircuitsReading edition

Complete numbered-result index

Reading tools

Reading library Find statements Inspect Lean

Switch work

Core papers

Paper ITyped operator systems, seed rank, and exact packet coordinates
Paper IIRefinement, weighted transfer, and integral separation
Paper IIITyped transfer, nonlinear packets, and obstruction theory
Paper IVCyclic analytic functions, reciprocal families, and spectral zero data
Paper VMultiresolution Signal Calculus
Paper VITransfer semigroups and memory
Paper VIIQuantum Seeds and Effective Dynamics
Paper VIIIPacket Operator Algorithms, Exact Compilation, and GPU Realization
Paper IXEuler Congruences
Paper XUniversal Residual Seeds
Paper XITame and Wild Packet Geometry for Local Langlands
Paper XIIPatching Support, Hecke Packets, and Conditional Automorphic Completion

Books and monographs

Special FunctionsSpecial Functions: Function families and their structure
Proof Path TheoryCertificates, compression, discovery fields, and mathematical memory
Komorebi SpaceCoherent realizations, obstructions, and descent
Realization BoundariesFinite Grammar, Infinite Groups, and the Limits of Reconstruction
Komorebi MethodologyMathematical Discovery, Realization, and the Discipline of Proof
Quantum and CircuitsQuantum and Circuits: Arithmetic, symmetry, and catalysis
Large Signal ModelRealization, refinement, and predictive closure
Machine-Native ReasoningEvidence, methods, and accountable revision
The K-COS MethodStructured Gaussian Quadratic Forms, Spectral Compression, and Certified Extreme-Tail Evaluation

Text settings

Text sizeText font

Saved in this browser for reading chapters. Browser zoom also works.

Saved reading

Read side by side

Quantum and Circuits201 of 207

← PreviousDependency structure Next →Baseline domains reproduced by the full run

Chapters

Full contents

Preface and volume guide (1)

Preface and volume guide

Chapter 1. Quantum–Arithmetic Bridge (17)

Overview
The mathematical object being transported
Fourier conventions and the finite proof chain
Coprimality becomes an integer signal
Rational character-order projectors
Selection, residuals, and information loss
Coefficient-residue lanes and polyphase transport
The exact modulus-twelve arithmetic calculation
Filtering a signal with something to remove
Normalized states and literal unitary transport
Relative phase is absent from one histogram and present in another
The selector as a projective measurement
Exact arithmetic coordinates and their complex meaning
The central finite bridge theorem
A continuous phase family with a fixed initial histogram
Phase replacement and dephasing are different operations
What is complete and what remains a separate question

Chapter 2. Arithmetic in Fourier space (25)

One arithmetic selector, three realizations
Coprimality selects primitive roots
The selected phases add and cancel
Interference yields an integer signal
Why the phase sum is an integer
The spectrum recovers the selector
A diagonal selector becomes a rational filter
Give the projector something to remove
Account for the entire input
Projection and unitary change are different operations
All twelve modes belong to six order classes
Six exact filters in one ambient space
A packet's capacity is not its occupied energy
The arithmetic signal is a coherent amplitude vector
Amplitudes and probabilities tell different stories
Identical histograms can hide orthogonal states
A basis change makes the hidden distinction observable
Move continuously between the two states
A real three-dimensional view of one amplitude
Rearrange twelve samples into three exact lanes
Phase factors connect the lane spectra
The construction extends beyond this picture
State exactly what each passage preserves
Exact data, floating rendering, and formal coverage
What the construction establishes

Chapter 3. Foundations of packet simulation (6)

The symmetry-collapse question
Projectors and quantum packets
Uniform circuits and the classical cost model
Exact packet simulation and polynomial collapse
Approximate symmetry and leakage certificates
Moving packets, dynamic frames, and sparse transfer graphs

Chapter 4. Exact symmetry families (11)

Fixed charge and exact-number circuits
The exact weight-two benchmark
Coarse packets and the honest limitation
Permutation-symmetric circuits and Dicke coordinates
Schur–Weyl coordinates and total-spin packets
Permutation-invariant mixed states and commutant compression
Orbit-quotient quantum walks
Few bosons and few fermions
Scaling phase diagrams for charge, particles, and local dimension
Stabilizer syndromes and Clifford packets
Gaussian, fermionic, and matchgate compression

Chapter 5. States, measurements, and open dynamics (4)

Density operators: populations and coherences
Channels, Kraus maps, and Lindblad generators
Measurement, conditioning, and classical feedback
Block encodings and polynomial operator transforms

Chapter 6. The complexity boundary (4)

Compressed packet simulation
Global interference and the failure of local packet collapse
Simulation complexity versus decision complexity
Existence defects and quantum combinatorial realizations

Chapter 7. Algorithms and open directions (5)

Architecture of a symmetry-collapse compiler
Benchmark and validation protocol
Atlas of candidate symmetry collapses
Open problems
Conclusion

Chapter 8. General theory of temporary escape (4)

Nested gate models and distortion invariants
Catalytic holonomy, excursion geometry, and resource reuse
First arrival, spectral packets, algebraic rarity, and tensor regularization
Matroidal state geometry, quiver factorizations, and root-system catalysis

Chapter 9. The complete linear core (14)

Introduction
Circuit model and metric comparison
The universal six-row atom
Catalytic normal forms and the six-role threshold
Exact finite enumeration
Projective, matroidal, and spectral structure
Interval-tree certificates and connected higher-dimensional families
Bounded and weighted catalytic resources
Algebraic rarity of catalytic defects
Recursive, block, and tensor amplification
Discussion and open problems
The twenty binary dimension-six defects
Search algorithms and correctness
Reproducibility ledger

Chapter 10. Quantum and reversible gate families (6)

Qudit SUM gates and ring-valued linear logic
Catalytic basis escape in symplectic Clifford synthesis
Temporary nonlinearity: affine logic versus Toffoli-assisted synthesis
Phase-polynomial and Clifford+T catalysis
Gaussian, matchgate, and fermionic catalytic models
Symmetry, ancillas, measurement, and architecture

Chapter 11. Packets, types, holonomy, and restricted realization (1)

Packets, types, holonomy, and restricted realization

Chapter 12. The computational atlas and open directions (3)

The exact computational atlas
Reusable theorem templates
Research program and paper architecture

Chapter 13. Scope, notation, and computational model (5)

Scope, notation, and computational model
The restored classical oracle
Comparison with ordinary circuits
The degree bound used throughout
A degree invariant that retains sharing

Chapter 14. Exact cut comparison and safe discrepancies (2)

Exact cut comparison and safe discrepancies
What the comparison does and does not require

Chapter 15. Complete safe-packet degree (4)

Complete safe-packet degree
The restored lower bound
Exact evaluation-span certificates
Monotone specialization

Chapter 16. Calibration families and exact small oracles (3)

Calibration families and exact small oracles
An explicit moment certificate
All functions on at most three inputs

Chapter 17. Homogeneous projection: cost and safety (3)

Homogeneous projection: cost and safety
A compact whole function
Extracting the quadratic grade

Chapter 18. Faithful linear gluing algebras (2)

Faithful linear gluing algebras
The quantified model boundary

Chapter 19. Weighted witness fingerprints (3)

Weighted witness fingerprints
Exact top-coefficient extraction
The conditional algorithmic consequence

Chapter 20. The overlap obstruction to composition (1)

The overlap obstruction to composition

Chapter 21. Circuit examples in view (25)

The model: boundary restoration and Boolean degree
An arbitrary cut compares two reversible computations
Why completeness is pointwise, and why no decoder is needed
A dirty scratch wire can be fully restored
The output direction can move away from the target
Degree bounds must retain shared register products
The invariant handles duplicates, NOT, and CNOT
One safe packet need not cover every accepting point
Balanced cuts turn coverage into a Toffoli bound
An affine shift reveals a harder accepting point
A degree-one dual certificate for two-input AND
The finite evaluation-span dual in full
Every function through three inputs has a matching oracle
Projection is defined in the original coordinates
Exact nonlinear projection costs versus actual input length
At m=10, the total-gate accounting points the other way
Quadratic projection can destroy safety
Witness indicators are orthogonal idempotents
Faithful linear multiplicative summaries need 2^m dimensions
Distinct witness monomials prevent formal cancellation
A short expression inside a trace is not a computed trace
Disjoint-variable factorization uses each predicate's own block
Overlap breaks the attempted context-free product rule
Randomized detection is conditional on efficient evaluation
Reproduce the figures and inspect their exact evidence

Appendix A. The formal arithmetic bridge (19)

What this guide certifies
The typed mathematical target
Revision reconciliation
Architecture of the proof
The rational signal and its filter
The exact phase arithmetic
Finite indices and normalized Fourier certificates
Why the coordinate certificates mean complex identities
Matrix transport and actual unitarity
The exponential sign and square-root normalization
Hermitian projection and phase-sensitive states
Two exact information-loss statements
The publication theorem in full
Manuscript-to-Lean concordance
Trust boundary and current verification
Controls, failed attempts, and reproducibility
Complete active theorem inventory
What completion means here
The original finite bridge and its extension

Appendix B. Symmetry: supplementary proofs and computation (4)

Proof details and auxiliary derivations
Python API and reproduction commands
Benchmark data ledger
Theorem and evidence-status ledger

Appendix C. Gate matrices, census data, and open obligations (4)

Gate matrices and symbolic conventions
Finite census tables and witnesses
Python and C++ interface
Conjecture and obligation ledger

Appendix D. The formal circuit model (22)

The purpose and evidence contract
The formal endpoint
Model and definitions
Why sharing does not break the degree bound
From the cut to a numerical lower bound
Affine output adjustment is an actual circuit
Verification and proof boundaries
Reading the formal model literally
Certificates, semantic minima and natural arithmetic
The proof dependency route
Formal and computational evidence
Negative controls and the trust boundary
Reproduce and inspect the authoritative files
Complete declaration register
Gates: 16 declarations
CutComparison: 13 declarations
Examples: 11 declarations
Degree: 19 declarations
MultiplicativeDegree: 12 declarations
SafeDegree: 22 declarations
AffineOutput: 14 declarations
DegreeChecks: 8 declarations

Appendix E. Claim coverage and theorem index (5)

Claim coverage and theorem index
Dependency structure
Complete numbered-result index
Baseline domains reproduced by the full run
Excluded inferences

Appendix F. Verification and proof boundaries (1)

Verification and proof boundaries

Shared glossary (1)

Shared glossary

Sources and references (1)

Source lineage

References (1)

References

Verification statements describe the retained edition and its recorded evidence. This HTML presentation adds no Lean execution or proof review.

Start reading

Resources & source

Read and explore

Start here
Visual guide
Read PDF
Worked examples
Notation

Proofs and implementation

Written proofs
Lean
Code

About this work

Work overview
Evidence
Search this work

Other resources

Inspect Lean

Original TeX with line links · Download TeX

The wording and mathematics follow the retained manuscript. This reading format does not add a proof review or extend Lean coverage.

Show source and reference links

Show each passage’s permalink, source line, claim record and related resources. Proof links, atlas links, and chapter navigation are always available.

Skip contents and start reading

Notation index

On this page

E.3 Complete numbered-result index

← Previous Work overview Full contents Next →

E.3 Complete numbered-result index

On this page · Permalink · Source line 45

Complete numbered-result index — table 2
No.	Result	Scope	Page
13.1	Classical/restored simulation comparison	Base	220
13.2	Degree per multiplication	Base	220
13.3	Register-product degree invariant	Base / formal	221
14.1	Cut-comparison identity and complete coverage	C01	222
15.1	Basic size bounds	C02	223
15.2	Affine input invariance	C02	224
15.3	Affine-optimized complete-cover bound	C02	224
15.4	Dual certificate for failure of safe detection	C02	225
15.5	Finite support of a dual witness	C02	225
15.6	Safe monomial ideal for a monotone function	C02	225
15.7	Exact monomial oracle cost	C02	226
16.1	Raw calibration parameters	C03	227
16.2	Affine optimization of the one-packet parameter	C03	227
16.3	Affine optimization of complete coverage	C03	228
16.4	Restored cost interval for the calibration family	C03	228
16.5	Exact small restored-oracle calibration	C04	229
17.1	Affine subspace after multiplication restrictions	C05	230
17.2	Exact cost of a nondegenerate paired quadratic	C05	230
17.3	Exact nonlinear cost of the whole function	C05	231
17.4	Exact cost of the extracted grade	C05	231
17.5	Projection does not preserve safe support	C05	231
18.1	Dimension of a faithful multiplicative summary	C06	233
18.2	Scalar unital summaries are evaluations	C06	233
19.1	Exact witness fingerprint	C07	235
19.2	Top coefficient as a Boolean-cube sum	C07	235
19.3	Weighted top-coefficient identity	C07	235
19.4	Finite-field root bound	C07	236
19.5	Conditional randomized satisfiability test	C07	236
20.1	Disjoint-variable factorization	C08	237
20.2	Shared-variable multiplication fails	C08	237

Permalink · Source line 47

Quantum and Circuits201 of 207

← PreviousDependency structure Next →Baseline domains reproduced by the full run

Full contents

Source and conversion record

Source SHA-256: 7a57885ceba9975c17337b8cfa9f53ea8e340ddb7423ab22cf39cc0d7e5071c3

Unsupported prose commands stop the build. The mathematical expression sequence is checked against the source, with manuscript macros expanded for display.

Conversion records

Notation in Quantum and Circuits

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Symbol or name

Search this work’s notation.

Symbols can have different meanings in different passages. Read each result in its own context.

Open the full notation index