45 citations · 66 across the 7 of their papers we have counts for
Showing 2012 · quant-phShow all
2 papers · 2 filters
quant-ph2012★ 1 cited
QMA-complete problems
Adam D. Bookatz
In this paper we give an overview of the quantum computational complexity class QMA and a description of known QMA-complete problems to date. Such problems are believed to be diffi…
quant-ph2012
Testing quantum expanders is co-QMA-complete
Adam D. Bookatz, Stephen P. Jordan, Yi-Kai Liu +1
A quantum expander is a unital quantum channel that is rapidly mixing, has only a few Kraus operators, and can be implemented efficiently on a quantum computer. We consider the pro…