Topological Structure of Quantum Algorithms

Jamie Vicary

Abstract:

We use a topological formalism to examine the Deutsch-Jozsa, hidden subgroup and Grover algorithms. This reveals important structures hidden by conventional algebraic presentations, and allows short and visual proofs of correctness via local topological operations. The resulting transparency makes generalizations of these algorithms clear, which gives rise to simpler descriptions of generalized Deutsch-Jozsa and hidden subgroup algorithms already in the literature, and a new generalization of Grover's algorithm.

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Vicary, J. (2013). Topological Structure of Quantum Algorithms. Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 35.

MLA Style

Vicary, Jamie. “Topological Structure of Quantum Algorithms.” Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013, p. 35.

Chicago Style

Vicary, Jamie. 2013. “Topological Structure of Quantum Algorithms.” Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 35.
Tweet
Print

Authors

+ Jamie Vicary More by this author

Role:

Author

Bibliographic Details

Journal:: Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Pages:: 35
Publication date:: 2013-01-01
URN:: uuid:348105fc-74bf-4fb1-bc39-889192af05d6
Local pid:: cs:6260

Terms of use

License:: Terms and Conditions of Use for Oxford University Research Archive

Metrics

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record