Algebraic characterisation of one-way patterns

Vedran Dunjko, Elham Kashefi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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 [4], 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.
Original languageEnglish
Title of host publicationProceedings Sixth Workshop on Developments in Computational Models: Causality, Computation, and Physics,
Subtitle of host publicationDCM 2010, Edinburgh, Scotland, 9-10th July 2010.
Pages85-100
Number of pages16
DOIs
Publication statusPublished - 2010

Fingerprint Dive into the research topics of 'Algebraic characterisation of one-way patterns'. Together they form a unique fingerprint.

Cite this