The following gives the relative weightings of edges emanating from a node:
In[]:=
Graph[MultiwaySystem[{"A""AA","A""A"},"A",4,"EvolutionGraphWeighted"],EdgeLabels"EdgeWeight",EdgeLabelStyleDirective[Red,Large]]
Out[]=
In[]:=
Graph[MultiwaySystem[{"A""AA","A""A"},"A",4,"EvolutionGraphFull"],EdgeLabels"EdgeWeight",EdgeLabelStyleDirective[Red,Large]]
Out[]=
In[]:=
MultiwaySystem[{"A""AA","A""A"},"A",4,"EvolutionGraphFull"]
Out[]=
In[]:=
Graph[MultiwaySystem[{"A""AA","A""A"},"A",4,"EvolutionGraphFull","IncludeStateWeights"True],VertexLabels"VertexWeight"]
Out[]=
In[]:=
Graph[MultiwaySystem[{"A""AA","A""A"},"A",4,"EvolutionGraph","IncludeStateWeights"True],VertexLabels"VertexWeight"]
»
{(0A)1,(1AA)1,(1A)1,(2AAA)2,(2AA)3,(2A)1,(3AAAA)6,(3AAA)12,(3AA)7,(3A)1,(4AAAAA)24,(4AAAA)60,(4AAA)50,(4AA)15,(4A)1}
»
{(0A)1,(1AA)1,(1A)1,(2AAA)2,(2AA)3,(2A)1,(3AAAA)6,(3AAA)12,(3AA)7,(3A)1,(4AAAAA)24,(4AAAA)60,(4AAA)50,(4AA)15,(4A)1}
Out[]=
In[]:=
Graph[MultiwaySystem[{"A""AA","A""A"},"A",4,"StatesGraph","IncludeStateWeights"True],VertexLabels"VertexWeight"]
Out[]=
In[]:=
Graph[MultiwaySystem[{"A""AA","A""A"},"A",4,"StatesGraph","IncludeStatePathWeights"True],VertexLabels"VertexWeight"]
Out[]=
In[]:=
Graph[MultiwaySystem[{"A""AA","A""A"},"A",4,"EvolutionGraph","IncludeStateWeights"True],VertexLabels"VertexWeight"]
Out[]=
In[]:=
Graph[MultiwaySystem[{"A""AA","A""A"},"A",4,"StatesGraph","IncludeStateWeights"True],VertexLabels"VertexWeight"]
Out[]=
In[]:=
Counts/@MultiwaySystem[{"A""AA","A""A"},"A",5,"AllStatesListUnmerged"]
Out[]=
{A1,AA1,A1,AAA2,AA3,A1,AAAA6,AAA12,AA7,A1,AAAAA24,AAAA60,AAA50,AA15,A1,AAAAAA120,AAAAA360,AAAA390,AAA180,AA31,A1}
In[]:=
Counts[Flatten[MultiwaySystem[{"A""AA","A""A"},"A",4,"AllStatesListUnmerged"]]]
Out[]=
A5,AA26,AAA64,AAAA66,AAAAA24
In[]:=
Graph[MultiwaySystem[{"A""AB","B""A"},"A",5,"StatesGraph","IncludeStatePathWeights"True],VertexLabels"VertexWeight"]
Out[]=
StatesGraph
StatesGraph
Branchial graph
Branchial graph
Each node is a ray in Hilbert space .....
The weight is the norm of the state; the direction of the state is determined by edges in the [[[multiway graph]]] branchial graph
The weight is the norm of the state; the direction of the state is determined by edges in the [[[multiway graph]]] branchial graph
< state1 | state2 > : inner product
What is the interpretation of distance in branchial space?
Insofar as ancestry distance, 1/“entanglement distance”
What is the interpretation of distance in branchial space?
Insofar as ancestry distance, 1/“entanglement distance”
In a Hilbert space, we have elements a and b.
They are represented by complex numbers. We know their norms a* b
They are represented by complex numbers. We know their norms a* b
Each node carries an amplitude, together with entanglement information with other nodes....
The magnitude squared of the amplitude is the path weight of the branchial node
We might want to know the scalar product of a node with another node.....
For this we need “direction” info as well as magnitude
The magnitude squared of the amplitude is the path weight of the branchial node
We might want to know the scalar product of a node with another node.....
For this we need “direction” info as well as magnitude
Unitarity is guaranteed by path counting [and then we normalize]
<Unitarity in relativity nontrivial> [ e.g. BH information paradox ]
<Unitarity in relativity nontrivial> [ e.g. BH information paradox ]
The Hamiltonian is the transformation from one branchial graph to the next....
An operator represents that an event that one does, which changes the branchial graph
An operator represents that an event that one does, which changes the branchial graph
Apply some operator from the outside: that corresponds to some updating event....
Failure of causal invariance = rule not commuting with itself
Commuting of updating events implies 1-step CI : U1 U2 == U2 U1
In a causal invariant system, eventually things will commute : therefore you perceive definite things to happen
Locally may not commute....
And the way to measure the amount is how far away you end up on the branchial graph
Curvature in multiway graph => noncommuting operators
In a causal invariant system, eventually things will commute : therefore you perceive definite things to happen
Locally may not commute....
And the way to measure the amount is how far away you end up on the branchial graph
Curvature in multiway graph => noncommuting operators
Distance in branchial space
Distance in branchial space
Assume a grid branchial graph....
(u-v).(u-v)
Each vertex has an associated vector (which is supposed to correspond to a ray in a Hilbert space)
We can to compute the distance between nodes in the Hilbert space metric (which just involves taking the vectors and computing (u-v) .(u - v) )
Each vector has a norm^2 given by the weight on the branchial graph
We can to compute the distance between nodes in the Hilbert space metric (which just involves taking the vectors and computing (u-v) .(u - v) )
Each vector has a norm^2 given by the weight on the branchial graph
With a branchial graph that is an equally weighted grid .... i.e. a pure branching multiway graph
What is the actual quantum inner product
IS the dot product of the vectors attached to different nodes
Geodesic in the multiway graph that goes through a particular point in the branchial graph.....
What is the actual quantum inner product
IS the dot product of the vectors attached to different nodes
Geodesic in the multiway graph that goes through a particular point in the branchial graph.....
Summing paths doesn’t work if the paths have common history.... and they have common history if they’re close on the branchial graph.....
No shared history = disconnected branchial graph
Assume a single critical pair: what is the angle between the vectors