activity
20182022
most citedA constant lower bound for any quantum protocol for secure function evaluation

2 citations · 2 across the 1 of their papers we have counts for

collaborators

5 papers

quant-ph20222 cited

A constant lower bound for any quantum protocol for secure function evaluation

Sarah Osborn, Jamie Sikora

Secure function evaluation is a two-party cryptographic primitive where Bob computes a function of Alice's and his respective inputs, and both hope to keep their inputs private fro…

quant-ph2020

A fidelity measure for quantum states based on the matrix geometric mean

Sam Cree, Jamie Sikora

Uhlmann's fidelity function is one of the most widely used similarity measures in quantum theory. One definition of this function is that it is the minimum classical fidelity assoc…

quant-ph2019

Fundamental limitations to local energy extraction in quantum systems

Álvaro M. Alhambra, Georgios Styliaris, Nayeli A. Rodriguez-Briones +2

We examine when it is possible to locally extract energy from a bipartite quantum system in the presence of strong coupling and entanglement, a task which is expected to be restric…

quant-ph2019

On the impossibility of coin-flipping in generalized probabilistic theories via discretizations of semi-infinite programs

Jamie Sikora, John H. Selby

Coin-flipping is a fundamental cryptographic task where a spatially separated Alice and Bob wish to generate a fair coin-flip over a communication channel. It is known that ideal c…

quant-ph2018

How to make unforgeable money in generalised probabilistic theories

John H. Selby, Jamie Sikora

We discuss the possibility of creating money that is physically impossible to counterfeit. Of course, "physically impossible" is dependent on the theory that is a faithful descript…