76 citations · 83 across the 4 of their papers we have counts for
4 papers
Bounds for codes and designs in complex subspaces
Aidan Roy
We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which…
On the epistemic view of quantum states
Michael Skotiniotis, Aidan Roy, Barry C. Sanders
We investigate the strengths and limitations of the Spekkens toy model, which is a local hidden variable model that replicates many important properties of quantum dynamics. First,…
Two characterizations of crooked functions
Aidan Roy, Chris Godsil
We give two characterizations of crooked functions: one based on the minimum distance of a Preparata-like code, and the other based on the distance-regularity of a crooked graph.
Weighted complex projective 2-designs from bases: optimal state determination by orthogonal measurements
Aidan Roy, A. J. Scott
We introduce the problem of constructing weighted complex projective 2-designs from the union of a family of orthonormal bases. If the weight remains constant across elements of th…