default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Nagaj
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j9]Libor Caha
, Daniel Nagaj, Martin Schwarz:
Shorter unentangled proofs for ground state connectivity. Quantum Inf. Process. 17(7): 174 (2018)- 2016
- [j8]Daniel Nagaj, Or Sattath, Aharon Brodutch, Dominique Unruh:
An adaptive attack on Wiesner's quantum money. Quantum Inf. Comput. 16(11&12): 1048-1070 (2016) - [j7]David Gosset, Daniel Nagaj:
Quantum 3-SAT Is QMA1-Complete. SIAM J. Comput. 45(3): 1080-1128 (2016) - 2015
- [j6]Andrew M. Childs, David Gosset, Daniel Nagaj, Mouktik Raha, Zak Webb:
Momentum switches. Quantum Inf. Comput. 15(7&8): 601-621 (2015) - [j5]Yudong Cao, Daniel Nagaj:
Perturbative gadgets without strong interactions. Quantum Inf. Comput. 15(13&14): 1197-1222 (2015) - 2013
- [j4]Sean Hallgren, Daniel Nagaj, Sandeep Narayanaswami:
The local Hamiltonian problem on a line with eight states is QMA-complete. Quantum Inf. Comput. 13(9-10): 721-750 (2013) - 2012
- [j3]Stephen P. Jordan, Hirotada Kobayashi, Daniel Nagaj, Harumichi Nishimura:
Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems. Quantum Inf. Comput. 12(5-6): 461-471 (2012) - 2010
- [j2]Chen-Fu Chiang, Daniel Nagaj, Pawel Wocjan:
Efficient circuits for quantum walks. Quantum Inf. Comput. 10(5&6): 420-434 (2010) - 2009
- [j1]Daniel Nagaj, Pawel Wocjan, Yong Zhang:
Fast amplification of QMA. Quantum Inf. Comput. 9(11&12): 1053-1068 (2009)
Conference and Workshop Papers
- 2017
- [c3]Andris Ambainis, Janis Iraids, Daniel Nagaj:
Exact Quantum Query Complexity of \text EXACT_k, l^n. SOFSEM 2017: 243-255 - 2014
- [c2]Dorit Aharonov, Aram W. Harrow, Zeph Landau, Daniel Nagaj, Mario Szegedy, Umesh V. Vazirani:
Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law. FOCS 2014: 246-255 - 2013
- [c1]David Gosset, Daniel Nagaj:
Quantum 3-SAT Is QMA1-Complete. FOCS 2013: 756-765
Informal and Other Publications
- 2024
- [i6]Dorian Rudolph, Sevag Gharibian, Daniel Nagaj:
Quantum 2-SAT on low dimensional systems is QMA1-complete: Direct embeddings and black-box simulation. CoRR abs/2401.02368 (2024) - 2016
- [i5]Andris Ambainis, Janis Iraids, Daniel Nagaj:
Exact quantum query complexity of EXACTk, ln. CoRR abs/1608.02374 (2016) - 2015
- [i4]Tomoyuki Morimae, Daniel Nagaj, Norbert Schuch:
Quantum proofs can be verified using only single qubit measurements. CoRR abs/1510.06789 (2015) - 2014
- [i3]Aharon Brodutch, Daniel Nagaj, Or Sattath, Dominique Unruh:
An adaptive attack on Wiesner's quantum money. CoRR abs/1404.1507 (2014) - 2013
- [i2]David Gosset, Daniel Nagaj:
Quantum 3-SAT is QMA1-complete. CoRR abs/1302.0290 (2013) - [i1]Marco Bardoscia, Daniel Nagaj, Antonello Scardicchio:
The SAT-UNSAT transition in the adversarial SAT problem. CoRR abs/1310.0967 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
