116 citations · 190 across the 12 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
quant-ph2017
Shorter unentangled proofs for Ground State Connectivity
Libor Caha, Daniel Nagaj, Martin Schwarz
Can one considerably shorten a proof for a quantum problem by using a protocol with a constant number of unentangled provers? We consider a frustration-free variant of the QCMA-com…
quant-ph2017★ 31 cited
The Feynman-Kitaev computer's clock: bias, gaps, idling and pulse tuning
Libor Caha, Zeph Landau, Daniel Nagaj
We present a collection of results about the clock in Feynman's computer construction and Kitaev's Local Hamiltonian problem. First, by analyzing the spectra of quantum walks on a…