An analysis of the test results of forty master of science students on the NLN graduate nurse qualifying examination

Thesis (M.S.)--Boston Universit

Code loops in dimension at most 8

Code loops are certain Moufang $2$-loops constructed from doubly even binary codes that play an important role in the construction of local subgroups of sporadic groups. More precisely, code loops are central extensions of the group of order $2$ by an elementary abelian $2$-group $V$ in the variety of loops such that their squaring map, commutator map and associator map are related by combinatorial polarization and the associator map is a trilinear alternating form. Using existing classifications of trilinear alternating forms over the field of $2$ elements, we enumerate code loops of dimension $d=\mathrm{dim}(V)\le 8$ (equivalently, of order $2^{d+1}\le 512$) up to isomorphism. There are $767$ code loops of order $128$, and $80826$ of order $256$, and $937791557$ of order $512$

Recognition of finite exceptional groups of Lie type

Let $q$ be a prime power and let $G$ be an absolutely irreducible subgroup of $GL_d(F)$, where $F$ is a finite field of the same characteristic as \F_q, the field of $q$ elements. Assume that $G \cong G(q)$, a quasisimple group of exceptional Lie type over \F_q which is neither a Suzuki nor a Ree group. We present a Las Vegas algorithm that constructs an isomorphism from $G$ to the standard copy of $G(q)$. If $G \not\cong {}^3 D_4(q)$ with $q$ even, then the algorithm runs in polynomial time, subject to the existence of a discrete log oracle

Efficient experimental design for the Behrens-Fisher problem with application to bioassay

A common approach in the design of experiment for the problem of comparing two means from a normal distribution is to assume knowledge of the ratio of the population variances. The optimal sampling ratio is proportional to the square root of this quantity. In this paper it is demonstrated that a misspecification of this ratio can cause a substantial loss in power of the corresponding tests. As a robust alternative a maximin approach is used to construct designs, which are efficient, whenever the experimenter is able to specify a specific region for the ratio of the population variances. The advantages of the robust designs for inference in the Behrens-Fisher problem are illustrated by means of a simulation study and an application to the design of experiment for bioassay is presented. --Behrens-Fisher problem,bioassay,design of experiment,local optimal design,robust designs

Majorana-based fermionic quantum computation

Because Majorana zero modes store quantum information non-locally, they are protected from noise, and have been proposed as a building block for a quantum computer. We show how to use the same protection from noise to implement universal fermionic quantum computation. Our architecture requires only two Majoranas to encode a fermionic quantum degree of freedom, compared to alternative implementations which require a minimum of four Majoranas for a spin quantum degree of freedom. The fermionic degrees of freedom support both unitary coupled cluster variational quantum eigensolver and quantum phase estimation algorithms, proposed for quantum chemistry simulations. Because we avoid the Jordan-Wigner transformation, our scheme has a lower overhead for implementing both of these algorithms, and the simulation of Trotterized Hubbard Hamiltonian in $\mathcal{O}(1)$ time per unitary step. We finally demonstrate magic state distillation in our fermionic architecture, giving a universal set of topologically protected fermionic quantum gates.Comment: 4 pages + 4 page appendix, 4 figures, 2 table

Interaction-Round-a-Face Models with Fixed Boundary Conditions: The ABF Fusion Hierarchy

We use boundary weights and reflection equations to obtain families of commuting double-row transfer matrices for interaction-round-a-face models with fixed boundary conditions. In particular, we consider the fusion hierarchy of the Andrews-Baxter-Forrester models, for which we find that the double-row transfer matrices satisfy functional equations with an su(2) structure.Comment: 48 pages, LaTeX, requires about 79000 words of TeX memory. Submitted to J. Stat. Phy