Algebraic characterisation of one-way patterns

Vedran Dunjko
Elham Kashefi

We give a complete structural characterisation of the map the positive branch of a one-way pattern implements. We start with the representation of the positive branch in terms of the phase map decomposition, which is then further analysed to obtain the primary structure of the matrix M, representing the phase map decomposition in the computational basis. Using this approach we obtain some preliminary results on the connection between the columns structure of a given unitary and the angles of measurements in a pattern that implements it. We believe this work is a step forward towards a full characterisation of those unitaries with an efficient one-way model implementation.

In S. Barry Cooper, Prakash Panangaden and Elham Kashefi: Proceedings Sixth Workshop on Developments in Computational Models: Causality, Computation, and Physics (DCM 2010), Edinburgh, Scotland, 9-10th July 2010, Electronic Proceedings in Theoretical Computer Science 26, pp. 85–100.
Published: 9th June 2010.

ArXived at: http://dx.doi.org/10.4204/EPTCS.26.8 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org