Fast amplification of QMA. - Daniel Nagaj; Pawel Wocjan; Yong Zhang (Quantum Inf. Comput., 2009)

Efficient circuits for quantum walks. - Chen-Fu Chiang; Daniel Nagaj; Pawel Wocjan (Quantum Inf. Comput., 2010)

Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems. - Stephen P. Jordan; Hirotada Kobayashi; Daniel Nagaj; Harumichi Nishimura (Quantum Inf. Comput., 2012)

Quantum 3-SAT Is QMA1-Complete. - David Gosset; Daniel Nagaj (FOCS, 2013)

The SAT-UNSAT transition in the adversarial SAT problem. - Marco Bardoscia; Daniel Nagaj; Antonello Scardicchio (CoRR, 2013)

The local Hamiltonian problem on a line with eight states is QMA-complete. - Sean Hallgren; Daniel Nagaj; Sandeep Narayanaswami (Quantum Inf. Comput., 2013)

Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law. - Dorit Aharonov; Aram W. Harrow; Zeph Landau; Daniel Nagaj; Mario Szegedy; Umesh V. Vazirani (FOCS, 2014)

Quantum proofs can be verified using only single qubit measurements. - Tomoyuki Morimae; Daniel Nagaj; Norbert Schuch (CoRR, 2015)

Perturbative gadgets without strong interactions. - Yudong Cao; Daniel Nagaj (Quantum Inf. Comput., 2015)

Momentum switches. - Andrew M. Childs; David Gosset; Daniel Nagaj; Mouktik Raha; Zak Webb (Quantum Inf. Comput., 2015)

Exact quantum query complexity of EXACTk, ln. - Andris Ambainis; Janis Iraids; Daniel Nagaj (CoRR, 2016)

An adaptive attack on Wiesner's quantum money. - Daniel Nagaj; Or Sattath; Aharon Brodutch; Dominique Unruh (Quantum Inf. Comput., 2016)

Quantum 3-SAT Is QMA1-Complete. - David Gosset; Daniel Nagaj (SIAM J. Comput., 2016)

Exact Quantum Query Complexity of text EXACT_k, l^n. - Andris Ambainis; Janis Iraids; Daniel Nagaj (SOFSEM, 2017)

Shorter unentangled proofs for ground state connectivity. - Libor Caha; Daniel Nagaj; Martin Schwarz (Quantum Inf. Process., 2018)

Quantum 2-SAT on low dimensional systems is QMA1-complete: Direct embeddings and black-box simulation. - Dorian Rudolph; Sevag Gharibian; Daniel Nagaj (CoRR, 2024)

Quantum 2-SAT on Low Dimensional Systems Is QMAsubscript{1}-Complete: Direct Embeddings and Black-Box Simulation. - Dorian Rudolph; Sevag Gharibian; Daniel Nagaj (ITCS, 2025)

Quantum SAT Problems with Finite Sets of Projectors are Complete for a Plethora of Classes. - Ricardo Rivera Cardoso; Alex Meiburg; Daniel Nagaj (CoRR, 2025)