You are cordially invited to the seminars organized by the Department of Mathematics.<\/p>\n
Speaker: Priyanga Ganesan (University of California-San Diego)<\/p>\n
\u201cQuantum Graphs and the Mathematics of Quantum Advantage\u201d<\/p>\n
Abstract: Quantum graphs are a non-commutative generalization of classical graphs that have recently emerged across several areas of mathematics, including operator algebras, non-commutative geometry, and quantum information theory. They are useful in modeling noise in quantum channels and thus play a central role in zero-error quantum information theory. In this talk, I will present an overview of the mathematical theory of quantum graphs and discuss their connections to different areas of mathematics. I will illustrate how classical notions such as graph coloring, homomorphisms and chromatic numbers can be translated into the quantum setting using tools from functional analysis, operator algebras and combinatorics. In particular, I will show that the quantum chromatic number of a quantum graph is always finite, whereas its classical counterpart may be infinite. This result highlights how analytical and algebraic methods in quantum graphs provide a powerful tool for studying quantum advantage and contribute to the mathematical foundations of quantum information theory.<\/p>\n
Date: February 3, Tuesday
\nTime: 19:00 (Ankara)
\nPlace: Zoom<\/p>\n
To request the event link, please send a message to gokhan.yildirim@bilkent.edu.tr<\/p>\n","protected":false},"excerpt":{"rendered":"
You are cordially invited to the seminars organized by the Department of Mathematics. Speaker: Priyanga Ganesan (University of California-San Diego) \u201cQuantum Graphs and the Mathematics of Quantum Advantage\u201d Abstract: Quantum graphs are a non-commutative generalization of classical graphs that have recently emerged across several areas of mathematics, including operator algebras, [\u2026] <\/p>\n