Jump to ContentJump to Main Navigation
Categories for Quantum TheoryAn Introduction$
Users without a subscription are not able to see the full content.

Chris Heunen and Jamie Vicary

Print publication date: 2019

Print ISBN-13: 9780198739623

Published to Oxford Scholarship Online: January 2020

DOI: 10.1093/oso/9780198739623.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 22 April 2021



(p.193) 6 Complementarity
Categories for Quantum Theory

Chris Heunen

Jamie Vicary

Oxford University Press

Complementarity is a property of a pair of observables being ‘maximally distinct’ from each other and, in this chapter, we analyse this property in categorical terms as a pair of interacting Frobenius structures. Complementary observables play a central role in quantum information theory, and we will see how they can be used to understand the structure of the Deutsch—Jozsa algorithm. We show that complementarity is closely linked to the theory of Hopf algebras. We discuss how many-qubit gates can be modelled using only complementary Frobenius structures, such as controlled negation, controlled phase gates and arbitrary single qubit gates. This leads to the ZX calculus, a sound and complete way to handle quantum computations using only equations in the graphical calculus.

Keywords:   Complementarity, Mutually unbiased bases, Deutsch—Jozsa algorithm, Bialgebra, Hopf algebra, ZX calculus

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .