Homotopical quantum computation (2024-2029)
Theory of simplicial distributions and applications in quantum computing and foundations
Topology of quantum resources (2020-2024)
Homotopical methods in resource theories for quantum information and quantum computing
Group Members
Current members
Group leader: Cihan Okay, Ph.D. Mathematics (2014), University of British Columbia
Postdoctoral researcher: Moises Bermejo-Moran (Feb 2025 - ), Ph.D. Quantum Information (2024), Jagiellonian University of Krakow
Postdoctoral researcher: Aziz Kharoof (Oct 2021 - ), Ph.D. Pure Mathematics (2019), University of Haifa
Postdoctoral researcher: Selman Ipek (Oct 2021 - ), Ph.D. Physics (2021), University at Albany, SUNY
Ph.D. student: Farzad Shahi (Sep 2024 - )
M.S. student: Atak Talay Yucel (Sep 2025 - )
M.S. student: Behzat Deniz Ozyoruk (Sep 2025 - )
M.S. student: Serkan Dogan (Sep 2024 - )
Undergraduate: Cagdas Ozdemir
Undergraduate: Ege Erciftci
Former members
Postdoctoral researcher: Redi Haderi (Oct 2023 - Sep 2024), Ph.D. Mathematics (2023), Bilkent University
Postdoctoral researcher: Victor Castillo (Oct 2023 - Sep 2024), Ph.D. Mathematics (2023), Centro de Investigación en Matemáticas
Postdoctoral researcher: Walker Stern (Oct 2023 - Sep 2024), Ph.D. Mathematics (2019), Universität Bonn
Postdoctoral researcher: Igor Sikora (Sep 2022 - Aug 2023), Ph.D. Mathematics (2022), University of Warwick
Postdoctoral researcher: Ho Yiu Chung (Sep 2021 - Feb 2023), Ph.D. Mathematics (2020), University of Southampton
Code
Our simulation approach is based on maximal Closed Non-Contextual (CNC) operators [Raussendorf et al., 2020], objects which subsume stabilizer states, therefore promising less negativity and more efficient classical simulation. Central to our implementation is a novel tableau structure, called the CNC tableau. This structure efficiently represents (in the number of qubits, n) CNC operators in a tableau of size O(n2), much in the same way that the Aaronson-Gottesman tableau [Aaronson-Gottesman, 2004] efficiently represents stabilizer states. The update rules of the CNC tableau under application of Clifford unitaries O(n) and measurement of Pauli observables O(n2) are also efficient.
This repository contains easy-to-use code for computing geometric and combinatorial properties of the convex set of simplicial distributions when the underlying spaces are two-dimensional in a sense that is defined in Examples.ipynb. Properties of two-dimensional simplicial distributions have been studied in some detail. In [Kharoof, et al. 2023] the Bell inequalities for certain types of two-dimensional scenarios, called flower scenarios, were explicitly characterized, whereas in [Okay 2023] graph-theoretical constructions were used to characterize the vertices of two-dimensional twisted scenarios.
This is the GitHub repository companion to [Okay, et al. 2024] "Classical simulation of universal measurement-based quantum computation using multipartite Bell scenarios" by Okay, Yücel, Ipek, arXiv:2410.23734.
The central focus of this repository is the jupyter notebook ClassicalLambda which demonstrates the double description (DD) method described in arXiv:2312.10734 to obtain vertices of Λ2, the 2-qubit Λ polytope. In particular, we characterize vertices of Λ2 that can be described by a noncontextual hidden variable model. For this we take advantage of the fact that for all n∈N we have that Λn⊂Λn(l), where Λn(l)⊂R4n−1 can be identified with the nonsignaling polytope for the n-partite Bell scenario with three binary outcome observables per party. Certain vertices of Λnℓ, the so-called deterministic vertices, provide a noncontextual hidden variable model (ncHVM) and the corresponding classical (or Bell) polytope is defined as the convex hull of deterministic vertices. In this repository we study the vertices Aα∈Λ2 that admit an ncHVM in the sense that Aα is in the classical polytope of the bipartite (2,3,2) Bell scenario.
Highlighted Publications
The distribution monad defined on the category of sets can be extended to the category of (locally small) categories, which also turns out to be a monad. This crucial observation gives the notion of a convex category allowing us to place the theory of simplicial distributions in a more abstract categorical setting. In this way, contextuality and related notions, such as contextual fraction, can be studied abstractly. Simplicial distributions have an additional monoid structure absent in the sheaf-theoretic description of non-signaling distributions.Then the contextual fraction of simplicial distributions can be described as a measure of the non-invertibility of monoid elements.
Mermin square scenario is a fundamental and simple example of a contextual linear system. The existence of classical solutions to this linear system depends on the parity of the linear system. In the even case, a classical solution always exists. However, odd parity leads to no classical solution but admits a solution in the 2-qubit Pauli group. Considering all possible non-signaling distributions respecting the parity of the linear system gives a polytope. Up to isomorphism, there are two kinds distinguished by parity. The even parity Mermin polytope only has deterministic vertices, whereas the odd parity Mermin polytope has two kinds of contextual vertices. The former can be utilized to give new proof of the celebrated Fine theorem characterizing noncontextual distributions on the CHSH scenario. The latter is a toy model for a polytope used in classical simulation and can be used to capture the vertices of that more complicated polytope.
An essential distinction between qubits and quantum systems of odd local dimension (qudits) is the structure of the Pauli group. In odd dimensions, this algebraic structure allows for classical solutions to any linear system with a solution in the Pauli group. However, this is not the case for qubits due to the celebrated Mermin square and star linear systems. The state-dependent version of the Mermin star has a further connection to computation. For a contextual state, the resulting computation, given in the measurement-based quantum computation scheme, elevates classical binary computation to classical universal computation. However, this phenomenon fails in odd local dimensions. We provide an example of a group that can give a computational advantage but is noncontextual: Any linear system admitting a solution in this group admits a classical solution.
The theory of simplicial distributions is a framework for studying quantum contextuality that generalizes both the sheaf-theoretic of Brandenburger and Abramsky's approach and the topological approach of Okay et al. In this framework, measurements and outcomes are represented by spaces. The name simplicial comes from the combinatorial objects known as simplicial sets that are used in modern homotopy theory. The notion of contextuality can be generalized to simplicial distributions, and celebrated scenarios such as the CHSH scenario can be realized in various ways. The figure represents the realization of this scenario as a punctured torus. The main benefit of this approach is that the usual ad-hoc arguments relating different sets of inequalities specifying a polytope can be studied using topological intuition.