69 citations · 191 across the 4 of their papers we have counts for
5 papers
Fast Amplification of QMA
Daniel Nagaj, Pawel Wocjan, Yong Zhang
Given a verifier circuit for a problem in QMA, we show how to exponentially amplify the gap between its acceptance probabilities in the `yes' and `no' cases, with a method that is…
Hamiltonian Quantum Cellular Automata in 1D
Daniel Nagaj, Pawel Wocjan
We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing with…
The Quantum Transverse Field Ising Model on an Infinite Tree from Matrix Product States
Daniel Nagaj, Edward Farhi, Jeffrey Goldstone +2
We give a generalization to an infinite tree geometry of Vidal's infinite time-evolving block decimation (iTEBD) algorithm for simulating an infinite line of quantum spins. We nume…
A new construction for a QMA complete 3-local Hamiltonian
Daniel Nagaj, Shay Mozes
We present a new way of encoding a quantum computation into a 3-local Hamiltonian. Our construction is novel in that it does not include any terms that induce legal-illegal clock t…
How to Make the Quantum Adiabatic Algorithm Fail
Edward Farhi, Jeffrey Goldstone, Sam Gutmann +1
The quantum adiabatic algorithm is a Hamiltonian based quantum algorithm designed to find the minimum of a classical cost function whose domain has size N. We show that poor choice…