67 citations · 111 across the 12 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
quant-ph2018
Mathematical methods for resource-based type theories
Aarthi Sundaram, Brad Lackey
With the wide range of quantum programming languages on offer now, efficient program verification and type checking for these languages presents a challenge -- especially when clas…
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…