Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Share This Author

Fast amplification of QMA

- Daniel Nagaj, P. Wocjan, Y. Zhang
- Computer Science, Mathematics
- Quantum Inf. Comput.
- 9 April 2009

Given a verifier circuit for a problem in QMA, we show how to exponentially amplifythe gap between its acceptance probabilities in the 'yes' and 'no' cases, with a methodthat is quadratically faster… Expand

Hamiltonian quantum cellular automata in one dimension

- Daniel Nagaj, P. Wocjan
- Physics
- 6 February 2008

We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of ten-dimensional qudits that makes it possible to realize universal quantum computing without any external… Expand

Quantum 3-SAT Is QMA1-Complete

- D. Gosset, Daniel Nagaj
- Mathematics, Computer Science
- IEEE 54th Annual Symposium on Foundations of…
- 1 February 2013

TLDR

Fast universal quantum computation with railroad-switch local Hamiltonians

- Daniel Nagaj
- Physics
- 28 August 2009

We present two universal models of quantum computation with a time-independent, frustration-free Hamiltonian. The first construction uses 3-local (qubit) projectors and the second one requires only… Expand

Criticality without frustration for quantum spin-1 chains.

- S. Bravyi, Libor Caha, R. Movassagh, Daniel Nagaj, P. Shor
- Physics, Medicine
- Physical review letters
- 26 March 2012

TLDR

Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems

- S. Jordan, H. Kobayashi, Daniel Nagaj, H. Nishimura
- Computer Science, Mathematics
- Quantum Inf. Comput.
- 22 November 2011

This paper proves that classical-witness quantum Merlin-Arthur proof systems can achieve perfect completeness. That is, QCMA = QCMA1. This holds under any gate set with which the Hadamard and… Expand

Unfrustrated qudit chains and their ground states

- R. Movassagh, E. Farhi, J. Goldstone, Daniel Nagaj, T. Osborne, P. Shor
- Physics, Mathematics
- 6 January 2010

We investigate chains of d-dimensional quantum spins (qudits) on a line with generic nearest-neighbor interactions without translational invariance. We find the conditions under which these systems… Expand

Quantum speedup by quantum annealing.

- R. Somma, Daniel Nagaj, Mária Kieferová
- Computer Science, Medicine
- Physical review letters
- 28 February 2012

TLDR

HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL

- E. Farhi, J. Goldstone, S. Gutmann, Daniel Nagaj
- Mathematics, Physics
- 19 December 2005

TLDR

Quantum algorithm for approximating partition functions

- P. Wocjan, Chen-Fu Chiang, A. Abeyesinghe, Daniel Nagaj
- Physics
- 4 November 2008

We achieve a quantum speed-up of fully polynomial randomized approximation schemes (FPRAS) for estimating partition functions that combine simulated annealing with the Monte-Carlo Markov Chain method… Expand

...

1

2

3

4

5

...