Quantum Information & Computation

Finite fields in a quantum setting have appeared in various papers with discussions for example, on

the complexity of performing Galois Field arithmetic in quantum black boxes (referred to by Shor in his factorisation algorithms for the IFP and DLP)
phase space (defined over finite fields as the scalar field),
maximally unbiased bases
Galois rings
Galois operators.

We focus on an alternative and (we believe) a more fundamental approach to the development and application of such primitives.

Recent Publications

JOSEPH SPRING, Polynomials in a Multipartite Setting, (to appear), (2008)

JOSEPH SPRING, Quantum Primitives, Quantum Communication, Measurement and Computing 9, AIP, (2008)

JOSEPH SPRING, Entanglement and Irreducibility, Quantum Communication, Measurement and Computing 8, AIP, (2007)