152 citations · 334 across the 18 of their papers we have counts for
19 papers
Root-Hadamard transforms and complementary sequences
Luis A. Medina, Matthew G. Parker, Constanza Riera +1
In this paper we define a new transform on (generalized) Boolean functions, which generalizes the Walsh-Hadamard, nega-Hadamard, -Hadamard, consta-Hadamard and all -transf…
Mixed graph states
Constanza Riera, Ramij Rahaman, Matthew G. Parker
We have generalised the concept of graph states to what we have called mixed graph states, which we define in terms of mixed graphs, that is graphs with both directed and undirecte…
Quantum secret sharing based on local distinguishability
Ramij Rahaman, Matthew G. Parker
In this paper we analyze the (im)possibility of the exact distinguishability of orthogonal multipartite entangled states under {\em restricted local operation and classical communi…
A complementary construction using mutually unbiased bases
Gaofei Wu, Matthew G. Parker
We present a construction for complementary pairs of arrays that exploits a set of mutually-unbiased bases, and enumerate these arrays as well as the corresponding set of complemen…
Device-independent quantum key distribution based on measurement inputs
Ramij Rahaman, Matthew G. Parker, Piotr Mironowicz +1
We provide an analysis of a new family of device independent quantum key distribution (QKD) protocols with several novel features: (a) The bits used for the secret key do not come…
Exclusivity structures and graph representatives of local complementation orbits
Adan Cabello, Matthew G. Parker, Giannicola Scarpa +1
We describe a construction that maps any connected graph G on three or more vertices into a larger graph, H(G), whose independence number is strictly smaller than its Lovász number…