3 papers
quant-ph2025
Geometrical constructions of purity testing protocols and their applications to quantum communication
Róbert Trényi, Simeon Ball, David G. Glynn +1
Purity testing protocols (PTPs), i.e., protocols that decide with high probability whether or not a distributed bipartite quantum state is maximally entangled, have been proven to…
math.CO2017
A construction for directed in-out subgraphs of optimal size
David Glynn, Michael Haythorpe, Asghar Moeini
We discuss the recently introduced concept of k-in-out graphs, and provide a construction for k-in-out graphs for any positive integer k. We derive a lower bound for the number of…
cs.IT2016
Counting generalized Reed-Solomon codes
Peter Beelen, David Glynn, Tom Høholdt +1
In this article we count the number of generalized Reed-Solomon (GRS) codes of dimension k and length n, including the codes coming from a non-degenerate conic plus nucleus. We com…