You are cordially invited to the Quantum Computing Seminar organized by the Department of Mathematics.<\/p>\n
Speaker: Selman Ipek (Bilkent University)<\/p>\n
\u201cCategorical treatment of the Deutsch-Jozsa algorithm\u201d<\/p>\n
Abstract: The Deutsch-Jozsa problem is a canonical example of a problem that can be solved by a quantum computer exponentially faster than a classical deterministic computer. Here we begin by describing the Deutsch-Jozsa problem and its solution according to standard quantum theory [1, \u00a7I.B]. We then describe how the solution works in categorical terms by building off of the notion of complementary structures and Frobenius algebras built up in the previous talks.<\/p>\n
References:<\/p>\n
1. Vicary, Jamie. Topological structure of quantum algorithms. arXiv preprint arXiv:1209.3917 (2013).
\n2. Heunen, Chris, and Jamie Vicary. Categories for Quantum Theory: an introduction. Oxford University Press, 2019. Chapter 6<\/p>\n
Date: Friday, April 19, 2024
\nTime: 14:00
\nPlace: SA141 \u2013 Mathematics Seminar Room & ZOOM<\/p>\n
To request the event link, please send a message to\u00a0selman.ipek@bilkent.edu.tr<\/a><\/p>\n","protected":false},"excerpt":{"rendered":" You are cordially invited to the Quantum Computing Seminar organized by the Department of Mathematics. Speaker: Selman Ipek (Bilkent University) \u201cCategorical treatment of the Deutsch-Jozsa algorithm\u201d Abstract: The Deutsch-Jozsa problem is a canonical example of a problem that can be solved by a quantum computer exponentially faster than a classical [\u2026] <\/p>\n