default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephen P. Jordan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j12]Aniruddha Bapat, Stephen P. Jordan:
Bang-bang control as a design principle for classical and quantum optimization algorithms. Quantum Inf. Comput. 19(5&6): 424-446 (2019)- 2018
- [j11]Stephen P. Jordan, Yi-Kai Liu:
Quantum Cryptanalysis: Shor, Grover, and Beyond. IEEE Secur. Priv. 16(5): 14-21 (2018) - [j10]Peter Bierhorst, Emanuel Knill, Scott Glancy, Yanbao Zhang, Alan Mink, Stephen P. Jordan, Andrea Rommal, Yi-Kai Liu, Bradley Christensen, Sae Woo Nam, Martin J. Stevens, Lynden K. Shalm:
Experimentally generated randomness certified by the impossibility of superluminal signals. Nat. 556(7700): 223-226 (2018) - 2016
- [j9]Stephen P. Jordan:
Black holes, quantum mechanics, and the limits of polynomial-time computability. XRDS 23(1): 30-33 (2016) - 2015
- [j8]Michael Jarret, Stephen P. Jordan:
Adiabatic optimization without local minima. Quantum Inf. Comput. 15(3&4): 181-199 (2015) - 2014
- [j7]Stephen P. Jordan, Keith S. M. Lee, John Preskill:
Quantum computation of scattering in scalar quantum field theories. Quantum Inf. Comput. 14(11-12): 1014-1080 (2014) - [j6]Stephen P. Jordan:
Strong equivalence of reversible circuits is coNP-complete. Quantum Inf. Comput. 14(15-16): 1302-1307 (2014) - [c3]Gorjan Alagic
, Stacey Jeffery, Stephen P. Jordan:
Circuit Obfuscation Using Braids. TQC 2014: 141-160 - [c2]Gorjan Alagic, Aniruddha Bapat, Stephen P. Jordan:
Classical Simulation of Yang-Baxter Gates. TQC 2014: 161-175 - 2013
- [i2]Stephen P. Jordan:
Strong equivalence of reversible circuits is coNP-complete. CoRR abs/1307.0836 (2013) - 2012
- [j5]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) - [i1]Gorjan Alagic, Stacey Jeffery, Stephen P. Jordan:
Partial-indistinguishability obfuscation using braids. CoRR abs/1212.6458 (2012) - 2011
- [c1]Stephen P. Jordan, Gorjan Alagic:
Approximating the Turaev-Viro Invariant of Mapping Tori is Complete for One Clean Qubit. TQC 2011: 53-72 - 2010
- [j4]Stephen P. Jordan:
Permutational quantum computing. Quantum Inf. Comput. 10(5&6): 470-497 (2010)
2000 – 2009
- 2009
- [j3]Stephen P. Jordan, Pawel Wocjan:
Estimating Jones and Homfly polynomials with one clean qubit. Quantum Inf. Comput. 9(3&4): 264-289 (2009) - [j2]Andrew M. Childs, Richard Cleve, Stephen P. Jordan, David L. Yonge-Mallo:
Discrete-Query Quantum Algorithm for NAND Trees. Theory Comput. 5(1): 119-123 (2009) - 2008
- [j1]Peter W. Shor, Stephen P. Jordan:
Estimating Jones polynomials is a complete problem for one clean qubit. Quantum Inf. Comput. 8(8): 681-714 (2008)
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 23:03 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:
