26 citations · 51 across the 14 of their papers we have counts for
5 papers · 1 filter
The quantum smooth label cover problem is undecidable
Eric Culf, Kieran Mastel, Connor Paddock +1
We show that the quantum smooth label cover problem is undecidable and RE-hard. This sharply contrasts the quantum unique label cover problem, which can be decided efficiently by a…
Optimal Untelegraphable Encryption and Implications for Uncloneable Encryption
Anne Broadbent, Eric Culf, Denis Rochette
We investigate the notion of untelegraphable encryption (UTE), a quantum encryption primitive that is a special case of uncloneable encryption (UE), where the adversary's capabilit…
Existence and nonexistence of commutativity gadgets for entangled CSPs
Eric Culf, Josse van Dobben de Bruyn, Matthijs Vernooij +1
Commutativity gadgets allow NP-hardness proofs for classical constraint satisfaction problems (CSPs) to be carried over to undecidability proofs for the corresponding entangled CSP…
Uncloneable Encryption from Decoupling
Archishna Bhattacharyya, Eric Culf
We show that uncloneable encryption exists with no computational assumptions, with security in the security parameter .
Quantum expanders and property (T) discrete quantum groups
Michael Brannan, Eric Culf, Matthijs Vernooij
Families of expander graphs were first constructed by Margulis from discrete groups with property (T). Within the framework of quantum information theory, several authors have gene…