The kinematics of the one-dimensional finite Heisenberg magnetic ring with impurities is discussed in the light of the general recipe of Weyl (1952). The cyclic group generating the ring, and the group of all its automorphisms, play the roles of the obvious and hidden symmetry respectively. The hidden symmetry group imposes a property of the distribution of quantum states of a translationally invariant ensemble of magnets over the finite Brillouin zone. Inhomogeneities of the distribution arise from irregular orbits of the action of the cyclic group on the set of all magnetic configurations of the ensemble. Size-dependent effects, like rarefied bands, are classified using the arithmetic structure of integers, (prime numbers, socles and arithmetic exponents), which is more appropriate than the linear order in the ring of integers.
We analyse the number eld-theoretic properties of solutions of the eigenproblem of the Heisenberg Hamiltonian for the magnetic hexagon with the single-node spin 1/2 and isotropic exchange interactions.It follows that eigenenergies and eigenstates are expressible within an extension of the prime eld Q of rationals of degree 2 3 and 2 4 , respectively.In quantum information setting, each real extension of rank 2 represents an arithmetic qubit.We demonstrate in detail some actions of the Galois group on the eigenproblem.
We propose a framework to study models of computation of indeterministic data, represented by abstract "distributions". In these distributions, probabilities are replaced by "amplitudes" drawn from a fixed semi-ring
S, of which the non-negative reals, the complex numbers, finite fields
Fpr, and cyclic rings
Zk are examples. Varying
S yields different models of computation, which we may investigate to better understand the (likely) difference in power between randomised and quantum computation. The "modal quantum states" of Schumacher and Westmoreland [arXiv:1010.2929] are examples of such distributions, for
S a finite field. For
S=F2, Willcock and Sabry [arXiv:1102.3587] show that UNIQUE-SAT is solvable by polynomial-time uniform circuit families consisting of invertible gates. We characterize the decision problems solvable by polynomial uniform circuit families, using either invertible or "unitary" transformations over cyclic rings
S=Zk, or (in the case that
k is a prime power) finite fields
S=Fk. In particular, for
k a prime power, these are precisely the problems in the class
ModkP.