PhyslibAlpha.ProbabilisticTheory.Examples.GBit
The generalized bit
i. Overview
The generalized bit is the norm cone over `ℝ³` with the sup norm in place of the Euclidean norm of the qubit. Its states form an octahedron with `6` pure states, its vertices. That is finitely many, but too many for a simplex in a `4`-dimensional space. So the gbit is not classical, and not a qubit either: the shape of the cone matters, not just the dimension.
ii. Key results
- `GBit` : the generalized bit.
- `GBit.stateEquiv` : the states are the octahedron.
- `GBit.isPure_purePoint` : the vertices of the octahedron are pure states.
- `GBit.not_isSimplex_stateSpace` : the state space is not a simplex.
iii. Table of contents
- A. The gbit as a norm cone
- B. Too many pure states
iv. References
- J. Barrett, *Information processing in generalized probabilistic theories*, Phys. Rev. A 75, 032304 (2007). - P. Janotta and H. Lal, *Generalized probabilistic theories without the no-restriction hypothesis*, Phys. Rev. A 87, 052131 (2013).
A. The gbit as a norm cone
B. Too many pure states
9 declarations
The generalized bit (gbit) as a sup-norm cone over
The generalized bit (gbit) is an order-unit space defined on the product . It is constructed as a norm cone where is equipped with the supremum norm . An element is non-negative if and only if it satisfies the condition .
The state space is equivalent to the octahedron
The state space of the generalized bit (gbit), denoted as , is equivalent to the octahedron in defined by the closed unit ball .
Linear isomorphism between the dual space and
There is a linear equivalence between the space of continuous linear functionals on , denoted , and the vector space itself. This isomorphism maps a functional to a vector whose components are the values of on the standard basis, i.e., for .
The inverse dual isomorphism maps the unit ball to the dual unit ball
Let be the inverse of the linear isomorphism between the dual space of and . The image of the unit ball under is equal to the unit ball of the dual space .
Pure states (vertices) of the generalized bit
Let be an index where and . The function `GBit.purePoint` defines a state on the generalized bit . For an element , the state is given by the formula: where is the -th coordinate of , and is the sign determined by the boolean . These six states correspond to the vertices of the octahedron that forms the state space of the gbit, where the underlying functional is times a coordinate projection.
The states are pure states of the generalized bit
Let be the generalized bit, an order-unit space defined on equipped with the supremum norm. For any index where and , the state defined by (where if is true and if is false) is a pure state. That is, is an extreme point of the state space .
Injectivity of the mapping to pure states of the generalized bit
The function `GBit.purePoint`, which maps each index to a state on the generalized bit , is injective. That is, for any indices , if , then .
The dimension (finite rank) of the generalized bit as a vector space over the real numbers is .
The state space of is not a simplex
The algebraic state space of the generalized bit is not a simplex. This implies that the is a non-classical system, as its state space has 6 pure states (vertices) in a 4-dimensional vector space, which exceeds the number of vertices allowed for a simplex in that dimension.
