Quantum and Circuits

Download original file

This is the original TeX manuscript source. Use the paper’s PDF for typeset equations.

Included manuscript sections

• c_lean.tex
• c_macros.tex
• c_main.tex
• c_supplement.tex
• g_appendix.tex
• g_macros.tex
• g_main.tex
• glossary.tex
• q_lean.tex
• q_main.tex
• references.tex
• s_appendix.tex
• s_macros.tex
• s_main.tex
• source_notes.tex
• preamble.tex
• verification_status.tex

Read the typeset paper

Read this chapter with formatted equations

1 \input{preamble.tex}
2 \begin{document}
3 \VolumeCover
4 \frontmatter
5 \chapter*{Preface}\addcontentsline{toc}{chapter}{Preface}
6 A mathematical representation can expose a structure that is expensive to see in another set of coordinates. It can also hide the cost of reaching those coordinates, discarding a residual, or reconstructing an answer. This volume studies both sides of that passage.
7 
8 The first part follows an arithmetic selector through Fourier synthesis, rational projection, and a normalized complex state. The second asks when symmetry makes a quantum evolution accessible to classical computation. The third compares a restricted circuit with an ambient realization that may leave the restriction temporarily and return. The fourth studies restored reversible circuits, safe discrepancy covers, projection costs, and the limits of multiplicative summaries.
9 
10 These treatments share the language of realizations, transfers, residuals, and obstructions. Their models remain distinct. A finite Fourier identity is not a gate synthesis algorithm. A small invariant sector is useful for simulation only when its representation, updates, and measurements are accessible. A catalytic saving depends on the chosen gate alphabet and cost. A lower bound for a faithful linear summary has the hypotheses of that summary model.
11 
12 Each part gives its own definitions and proof conditions. Formal and computational companions follow the mathematical treatments. A shared glossary and collected references close the volume.
13 
14 \chapter*{How to read the volume}\addcontentsline{toc}{chapter}{How to read the volume}
15 For a concrete entry point, begin with the twelve-dimensional arithmetic example and its visual study. The symmetry treatment develops invariant packets, moving frames, and compressed representations. The catalytic treatment begins with nested realization models before giving the complete linear core and its quantum and reversible extensions. The circuit treatment supplies restoration conventions before deriving its cover and projection results.
16 
17 A proved statement has a written argument under explicit hypotheses. An exact finite computation concerns the declared bounded state space. A formal result identifies a specified Lean declaration and its proof record. A research proposal or conjecture remains open where its decisive obligation is not established. Panel titles state these distinctions directly.
18 
19 The mathematical notation is local to each part. In particular, circuit obstructions use the binary field by default, while linear gate theory also works over general fields and rings. Formal coverage applies to the selected declarations, rather than to every written theorem in the volume.
20 \tableofcontents
21 \mainmatter
22 \VolumePart{Arithmetic realizations}
23 {An arithmetic selector is followed through Fourier synthesis, exact rational projection, and a normalized complex state. The twelve-dimensional example makes each change of representation explicit.}
24 {
25 \VolumePartEntry{1}{Quantum--Arithmetic Bridge}
26 \VolumePartEntry{2}{Arithmetic in Fourier space}
27 }
28 \chapter{Quantum--Arithmetic Bridge}
29 \input{generated/q_main.tex}
30 \chapter{Arithmetic in Fourier space}
31 \VolumeVisualInput{generated/q_visual.tex}
32 \VolumePart{Symmetry collapse in quantum computation}
33 {Invariant packets, moving frames, and compressed representations organize quantum evolution. The treatment keeps the cost of coordinates, updates, and measurement alongside the dimension of the retained state space.}
34 {
35 \VolumePartEntry{3}{Foundations of packet simulation}
36 \VolumePartEntry{4}{Exact symmetry families}
37 \VolumePartEntry{5}{States, measurements, and open dynamics}
38 \VolumePartEntry{6}{The complexity boundary}
39 \VolumePartEntry{7}{Algorithms and open directions}
40 }
41 \begingroup\input{generated/s_macros.tex}
42 \input{generated/s_main.tex}
43 \endgroup
44 \VolumePart{Catalytic gate set distortion}
45 {A restricted realization can be compared with an ambient implementation that leaves the restriction and returns. The resulting savings depend on the gate alphabet, resource convention, and cost assigned to each step.}
46 {
47 \VolumePartEntry{8}{General theory of temporary escape}
48 \VolumePartEntry{9}{The complete linear core}
49 \VolumePartEntry{10}{Quantum and reversible gate families}
50 \VolumePartEntry{11}{Packets, types, holonomy, and restricted realization}
51 \VolumePartEntry{12}{The computational atlas and open directions}
52 }
53 \begingroup\input{generated/g_macros.tex}
54 \input{generated/g_main.tex}
55 \endgroup
56 \VolumePart{Circuit obstructions}
57 {Restored reversible circuits lead to cut comparisons, safe discrepancy covers, and projection costs. The later chapters examine faithful linear summaries and the obstruction to composing multiplicative descriptions.}
58 {
59 \VolumePartEntry{13}{Scope, notation, and computational model}
60 \VolumePartEntry{14}{Exact cut comparison and safe discrepancies}
61 \VolumePartEntry{15}{Complete safe-packet degree}
62 \VolumePartEntry{16}{Calibration families and exact small oracles}
63 \VolumePartEntry{17}{Homogeneous projection: cost and safety}
64 \VolumePartEntry{18}{Faithful linear gluing algebras}
65 \VolumePartEntry{19}{Weighted witness fingerprints}
66 \VolumePartEntry{20}{The overlap obstruction to composition}
67 \VolumePartEntry{21}{Circuit examples in view}
68 }
69 \begingroup\input{generated/c_macros.tex}
70 \input{generated/c_main.tex}
71 \endgroup
72 \chapter{Circuit examples in view}
73 \begingroup\input{generated/c_macros.tex}\renewcommand{\F}{\mathbb F}
74 \VolumeVisualInput{generated/c_visual.tex}\endgroup
75 \VolumePart{Formal and computational companions}
76 {The companions identify formal coverage, exact finite computations, and the obligations that remain open. Verification records establish the stated results within their declared models and bounds.}
77 {
78 \VolumePartEntry{A}{The formal arithmetic bridge}
79 \VolumePartEntry{B}{Symmetry: supplementary proofs and computation}
80 \VolumePartEntry{C}{Gate matrices, census data, and open obligations}
81 \VolumePartEntry{D}{The formal circuit model}
82 \VolumePartEntry{E}{Claim coverage and theorem index}
83 \VolumePartEntry{F}{Verification and proof boundaries}
84 }
85 \appendix
86 \chapter{The formal arithmetic bridge}
87 \input{generated/q_lean.tex}
88 \chapter{Symmetry: supplementary proofs and computation}
89 \begingroup\input{generated/s_macros.tex}\input{generated/s_appendix.tex}\endgroup
90 \chapter{Gate matrices, census data, and open obligations}
91 \begingroup\input{generated/g_macros.tex}\input{generated/g_appendix.tex}\endgroup
92 \chapter{The formal circuit model}
93 \begingroup\input{generated/c_macros.tex}\renewcommand{\F}{\mathbb F}\input{generated/c_lean.tex}\endgroup
94 \begingroup\input{generated/c_macros.tex}\input{generated/c_supplement.tex}\endgroup
95 \chapter{Verification and proof boundaries}
96 \input{verification_status.tex}
97 \backmatter
98 \renewcommand{\VolumeRunningPart}{References}
99 \chapter{Glossary}
100 \begin{description}[style=nextline]
101 \item[Ambient realization] A representation or implementation in a larger permitted model, with its maps and costs specified.
102 \item[Arithmetic selector] A diagonal choice of Fourier modes, transported to a signal projector by a unitary basis change.
103 \item[Complete safe cover] A family of detectors supported on the positive inputs and detecting every positive input.
104 \item[Gate set defect] The difference between minimum restricted and ambient implementation costs under a fixed gate alphabet and resource convention.
105 \item[Residual] The component not retained by a specified projection or coarse representation. Its recovery requires additional data.
106 \item[Restoration] The requirement that logical inputs and workspace return to their prescribed boundary values after computation.
107 \end{description}
108 \begingroup\input{generated/s_macros.tex}\input{generated/glossary.tex}\endgroup
109 \chapter{Sources and references}
110 \input{generated/source_notes.tex}
111 \begingroup\input{generated/g_macros.tex}\input{generated/references.tex}\endgroup
112 \end{document}

Back to source controls

Back to Quantum and Circuits