Quantum Operation Counts

E.g. quantum Fourier transforms
Operation count is affected by size n of the transform, and the precision p (measured by the maximum denominator):
classical ops: 2^n * 4 * p quantum: 1 (or p)

Two Approaches to Experiments

1. You explicitly (conceptually) set up a state [imagine the experimenter has free will]

Analogous to generational multiway system where you insist on having done all the updates necessary to reach a classical state

2. You wait for the universe to deliver the state you want to study

You wait for causal invariance to deliver you the classical state

By inserting completions, you are going to case #1

Analogous to adding completions in theorem proving
(i.e. adding lemmas; but adding lemmas is an exponential speedup)

Visualizing Branchial Space

In[]:=
GridGraph[{2,2,2},VertexLabelsAutomatic]
Out[]=
In[]:=
HighlightGraph[GridGraph[{2,2,2}],Subgraph[GridGraph[{2,2,2}],{1,3,5}]]
Out[]=
In[]:=
HighlightGraph[GridGraph[{2,2,2,2}],Subgraph[GridGraph[{2,2,2,2}],{1,3,5}]]
Out[]=
In[]:=
GridGraph[Table[2,7]]
Out[]=
In[]:=
Graph3D[%]
Out[]=
https://en.wikipedia.org/wiki/Petrie_polygon
In[]:=
ResourceFunction["MultiwaySystem"][{"A""AB"},"AA",3,"StatesGraph"]
Out[]=
In[]:=
GridGraph[{2,2,2},VertexLabels->Automatic]
Out[]=
Take the ancestry distance, and the further back they branch, the further apart they should be.
Ancestry distance k between nodes; 1 - k/(total history)

Enumerate SSs

[[[ Of possible substitution systems, how many correspond to named quantum operators? ]]]

Analog of Event Horizons in Branchial / Multiway Space

Simple event horizon: superselection rule
Disconnection in branchial graph

Superselection sector

Validation for a quantum circuit

Geometrization of correctness proofs

Computability is topology of branchial space; computational complexity of rulial space

Systematic Measurement