83 citations · 414 across the 29 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.CC2018★ 10 cited
Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
Sevag Gharibian, Miklos Santha, Jamie Sikora +2
The polynomial-time hierarchy () has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as $\m…
quant-ph2018★ 18 cited
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…