4 citations · 8 across the 6 of their papers we have counts for
6 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…
Demonstrating Quantum Homomorphic Encryption Through Simulation
Sohrab Ganjian, Connor Paddock, Anne Broadbent
Quantum homomorphic encryption (QHE), allows a quantum cloud server to compute on private data as uploaded by a client. We provide a proof-of-concept software simulation for QHE, a…
Satisfiability problems and algebras of boolean constraint system games
Connor Paddock, William Slofstra
Mermin and Peres showed that there are boolean constraint systems (BCSs) which are not satisfiable, but which are satisfiable with quantum observables. This has led to a burgeoning…
An operator-algebraic formulation of self-testing
Connor Paddock, William Slofstra, Yuming Zhao +1
We give a new definition of self-testing for correlations in terms of states on -algebras. We show that this definition is equivalent to the standard definition for any class…
Rounding near-optimal quantum strategies for nonlocal games to strategies using maximally entangled states
Connor Paddock
We establish approximate rigidity results for several well-known families of nonlocal games. In particular, we show that near-perfect quantum strategies for boolean constraint syst…
A Characterization of Antidegradable Qubit Channels
Connor Paddock, Jianxin Chen
This paper provides a characterization for the set of antidegradable qubit channels. The characterization arises from the correspondence between the antidegradability of a channel…