## Abstract

Measurement-based quantum computation has emerged from the physics community as a new approach to quantum computation where measurements rather than unitary transformations are the main driving force of computation. Among measurement-based quantum computation methods the recently introduced one-way quantum computer [RB01] stands out as basic and fundamental.

In this work we a concrete syntax and an algebra of these patterns derived from a formal semantics. We developed a rewrite theory and proved a general standardization theorem which allows all patterns to be put in a semantically equivalent standard form.

In this work we a concrete syntax and an algebra of these patterns derived from a formal semantics. We developed a rewrite theory and proved a general standardization theorem which allows all patterns to be put in a semantically equivalent standard form.

Original language | English |
---|---|

Title of host publication | Automata, Languages and Programming |

Subtitle of host publication | 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II |

Editors | Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener |

Publisher | Springer Berlin Heidelberg |

Pages | 13-21 |

Number of pages | 9 |

Volume | 4052 |

ISBN (Electronic) | 978-3-540-35908-1 |

ISBN (Print) | 978-3-540-35907-4 |

DOIs | |

Publication status | Published - 2006 |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Publisher | Springer Berlin Heidelberg |

Volume | 4052 |