Quantum correlations and entanglement
Approximate representation theory
My current research focus is on algebraic characterizations of quantum entanglement. Recent developments have shown that questions about quantum correlations can be reduced to computational problems about non-commutative algebras. Understanding the limitations and structure of this algebraic framework for quantum correlations has important applications for cryptographic primitives for quantum devices, quantum computational complexity theory, and quantum information theory.
Near-optimal quantum strategies and approximate representations of the nonlocal game algebra
For synchronous, binary constraint systems, and XOR nonlocal games, there is a correspondence between optimal finite-dimensional quantum strategies and matrix representations of the affiliated game algebra with a maximally-entangled state. Based on the work of Slofstra and Vidick we extend the robustness of this correspondence by showing that near-optimal strategies are near or approximate representations of the game algebra with respect to the normalized Hilbert-Schmidt norm.
Paddock, Connor. "Rounding near-optimal quantum strategies for nonlocal games to strategies using maximally entangled states." arXiv preprint, 2022. (arXiv)
Antidegradable qubit channels
Subspaces of anticoherent spin states
Anticoherence of spin states is a separate but related notion to the degree of entanglement in a symmetric product of fermions. Upon stereographically projecting the Majorana representation, anticoherent spin states appear as collections of points on the 3-sphere with certain symmetries. Rajesh Pereira and I used ideas from polynomial invariant theory to construct subspaces of anticoherent spin states of various degrees. A connection to anticoherent subspaces and the higher-rank numerical range of certain spin observables was also found. This work was partially supported by an NSERC USRA.
Pereira, Rajesh, and Connor Paul-Paddock. "Anticoherent subspaces." Journal of Mathematical Physics 58.6 (2017): 062107. (arXiv link)
Nonlocal games from graphs
Perfect strategies for linear constraint system nonlocal games manifest in the structure of a group associated with the game. Based on the interesting work of Alex Arkhipov on forbidden graph minors and the existence of perfect quantum strategies of the Magic Square and Magic Pentagram nonlocal games. Vincent Russo, Turner Silverthorne, William Slofstra, and I initiated a study of linear constraint system nonlocal games arising from the incidence matrix of 2-coloured graphs. In this case, we found that certain group properties are characterized by the combinatorial structure of the associated graphs describing the game. This work was part of my M.Math thesis at the University of Waterloo under the supervision of Jon Yard and William Slofstra.
Expanding on my master's thesis my co-authors and I have written a more extensive article based on graph minors, linear system nonlocal games, and Arkhipov's theorem.