2,112 research outputs found
Symplectic spreads, planar functions and mutually unbiased bases
In this paper we give explicit descriptions of complete sets of mutually
unbiased bases (MUBs) and orthogonal decompositions of special Lie algebras
obtained from commutative and symplectic semifields, and
from some other non-semifield symplectic spreads. Relations between various
constructions are also studied. We show that the automorphism group of a
complete set of MUBs is isomorphic to the automorphism group of the
corresponding orthogonal decomposition of the Lie algebra .
In the case of symplectic spreads this automorphism group is determined by the
automorphism group of the spread. By using the new notion of pseudo-planar
functions over fields of characteristic two we give new explicit constructions
of complete sets of MUBs.Comment: 20 page
Modular symbols and Hecke operators
We survey techniques to compute the action of the Hecke operators on the
cohomology of arithmetic groups. These techniques can be seen as
generalizations in different directions of the classical modular symbol
algorithm, due to Manin and Ash-Rudolph. Most of the work is contained in
papers of the author and the author with Mark McConnell. Some results are
unpublished work of Mark McConnell and Robert MacPherson.Comment: 11 pp, 2 figures, uses psfrag.st
Isogeny graphs of ordinary abelian varieties
Fix a prime number . Graphs of isogenies of degree a power of
are well-understood for elliptic curves, but not for higher-dimensional abelian
varieties. We study the case of absolutely simple ordinary abelian varieties
over a finite field. We analyse graphs of so-called -isogenies,
resolving that they are (almost) volcanoes in any dimension. Specializing to
the case of principally polarizable abelian surfaces, we then exploit this
structure to describe graphs of a particular class of isogenies known as
-isogenies: those whose kernels are maximal isotropic subgroups
of the -torsion for the Weil pairing. We use these two results to write
an algorithm giving a path of computable isogenies from an arbitrary absolutely
simple ordinary abelian surface towards one with maximal endomorphism ring,
which has immediate consequences for the CM-method in genus 2, for computing
explicit isogenies, and for the random self-reducibility of the discrete
logarithm problem in genus 2 cryptography.Comment: 36 pages, 4 figure
On obtaining classical mechanics from quantum mechanics
Constructing a classical mechanical system associated with a given quantum
mechanical one, entails construction of a classical phase space and a
corresponding Hamiltonian function from the available quantum structures and a
notion of coarser observations. The Hilbert space of any quantum mechanical
system naturally has the structure of an infinite dimensional symplectic
manifold (`quantum phase space'). There is also a systematic, quotienting
procedure which imparts a bundle structure to the quantum phase space and
extracts a classical phase space as the base space. This works straight
forwardly when the Hilbert space carries weakly continuous representation of
the Heisenberg group and recovers the linear classical phase space
. We report on how the procedure also allows
extraction of non-linear classical phase spaces and illustrate it for Hilbert
spaces being finite dimensional (spin-j systems), infinite dimensional but
separable (particle on a circle) and infinite dimensional but non-separable
(Polymer quantization). To construct a corresponding classical dynamics, one
needs to choose a suitable section and identify an effective Hamiltonian. The
effective dynamics mirrors the quantum dynamics provided the section satisfies
conditions of semiclassicality and tangentiality.Comment: revtex4, 24 pages, no figures. In the version 2 certain technical
errors in section I-B are corrected, the part on WKB (and section II-B) is
removed, discussion of dynamics and semiclassicality is extended and
references are added. Accepted for publication on Classical and Quantum
Gravit
On the structure of Clifford quantum cellular automata
We study reversible quantum cellular automata with the restriction that these
are also Clifford operations. This means that tensor products of Pauli
operators (or discrete Weyl operators) are mapped to tensor products of Pauli
operators. Therefore Clifford quantum cellular automata are induced by
symplectic cellular automata in phase space. We characterize these symplectic
cellular automata and find that all possible local rules must be, up to some
global shift, reflection invariant with respect to the origin. In the one
dimensional case we also find that every uniquely determined and
translationally invariant stabilizer state can be prepared from a product state
by a single Clifford cellular automaton timestep, thereby characterizing these
class of stabilizer states, and we show that all 1D Clifford quantum cellular
automata are generated by a few elementary operations. We also show that the
correspondence between translationally invariant stabilizer states and
translationally invariant Clifford operations holds for periodic boundary
conditions.Comment: 28 pages, 2 figures, LaTe
- …