5 citations · 7 across the 2 of their papers we have counts for
6 papers
Practical Quantum Computing: The value of local computation
James R. Cruise, Neil I. Gillespie, Brendan Reid
As we enter the era of useful quantum computers we need to better understand the limitations of classical support hardware, and develop mitigation techniques to ensure effective qu…
Equiangular lines, Incoherent sets and Quasi-symmetric designs
Neil I. Gillespie
The absolute upper bound on the number of equiangular lines that can be found in is . Examples of sets of lines that saturate this bound are only known to…
-Neighbour-Transitive Codes with Small Blocks of Imprimitivity
Neil I. Gillespie, Daniel R. Hawtin, Cheryl E. Praeger
A code in the Hamming graph is if acts transitively on each of , and , the first three…
Construction of the outer automorphism of S6 via a complex Hadamard matrix
Neil Gillespie, Padraig Ó Catháin, Cheryl Praeger
We give a new construction of the outer automorphism of the symmetric group on six points. Our construction features a complex Hadamard matrix of order six containing third roots o…
Conway's groupoid and its relatives
Nick Gill, Neil I. Gillespie, Jason Semeraro +1
In 1997, John Conway constructed a -fold transitive subset of permutations on a set of size for which the subset fixing any given point was isomorphic to the Mathi…
Classification of a family of completely transitive codes
Neil I. Gillespie, Michael Giudici, Cheryl E. Praeger
The completely regular codes in Hamming graphs have a high degree of combinatorial symmetry and have attracted a lot of interest since their introduction in 1973 by Delsarte. This…