26 citations · 51 across the 14 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
quant-ph2023★ 1 cited
Approximation algorithms for noncommutative CSPs
Eric Culf, Hamoon Mousavi, Taro Spirig
Noncommutative constraint satisfaction problems (NC-CSPs) are higher-dimensional operator extensions of classical CSPs. Despite their significance in quantum information, their app…
quant-ph2023
New Approaches to Complexity via Quantum Graphs
Eric Culf, Arthur Mehta
Problems based on the structure of graphs -- for example finding cliques, independent sets, or colourings -- are of fundamental importance in classical complexity. Defining well-fo…
quant-ph2023
Uncloneable Cryptographic Primitives with Interaction
Anne Broadbent, Eric Culf
Much of the strength of quantum cryptography may be attributed to the no-cloning property of quantum information. We construct three new cryptographic primitives whose security is…