default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmanuel Knill
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i5]Mohammad A. Alhejji
, Emanuel Knill:
Towards a resolution of the spin alignment problem. CoRR abs/2307.06894 (2023)
2010 – 2019
- 2018
- [j20]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
- [j19]Martin Sandberg, Emanuel Knill, Eliot Kapit, Michael R. Vissers, David P. Pappas:
Efficient quantum state transfer in an engineered chain of quantum bits. Quantum Inf. Process. 15(3): 1213-1224 (2016) - 2013
- [j18]Adam M. Meier, Bryan Eastin, Emanuel Knill:
Magic-state distillation with the four-qubit code. Quantum Inf. Comput. 13(3-4): 195-209 (2013) - 2012
- [j17]Michael Mullan, Emanuel Knill:
Improving quantum clocks via semidefinite programming. Quantum Inf. Comput. 12(7-8): 553-574 (2012)
2000 – 2009
- 2009
- [j16]Sergio Boixo, Emanuel Knill, Rolando D. Somma:
Eigenpath traversal by phase randomization. Quantum Inf. Comput. 9(9&10): 833-855 (2009) - 2004
- [j15]Mark Ettinger, Peter Høyer, Emanuel Knill:
The quantum query complexity of the hidden subgroup problem is polynomial. Inf. Process. Lett. 91(1): 43-48 (2004) - 2001
- [j14]Emanuel Knill, Raymond Laflamme:
Quantum computing and quadratically signed weight enumerators. Inf. Process. Lett. 79(4): 173-179 (2001) - [j13]Gerard J. Milburn, Timothy C. Ralph, Andrew G. White, Emanuel Knill, Raymond Laflamme:
Efficient linear optics quantum computation. Quantum Inf. Comput. 1(4): 13-19 (2001) - [j12]Alexei E. Ashikhmin, Emanuel Knill:
Nonbinary quantum stabilizer codes. IEEE Trans. Inf. Theory 47(7): 3065-3072 (2001) - [i4]Emanuel Knill:
Fermionic Linear Optics and Matchgates. CoRR quant-ph/0108033 (2001) - 2000
- [j11]Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn:
Quantum error detection I: Statement of the problem. IEEE Trans. Inf. Theory 46(3): 778-788 (2000) - [j10]Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn:
Quantum error detection II: Bounds. IEEE Trans. Inf. Theory 46(3): 789-800 (2000) - [j9]Howard Barnum, Emanuel Knill, Michael Nielsen:
On quantum fidelities and channel capacities. IEEE Trans. Inf. Theory 46(4): 1317-1329 (2000)
1990 – 1999
- 1999
- [i3]Emanuel Knill, Raymond Laflamme:
Quantum Computation and Quadratically Signed Weight Enumerators. CoRR quant-ph/9909094 (1999) - 1998
- [j8]Emanuel Knill, William J. Bruno, David C. Torney:
Non-adaptive Group Testing in the Presence of Errors. Discret. Appl. Math. 88(1-3): 261-290 (1998) - [j7]David H. Wolpert, Emanuel Knill, Tal Grossman:
Some results concerning off-training-set and IID error for the Gibbs and the Bayes optimal generalizers. Stat. Comput. 8(1): 35-54 (1998) - [c4]Raymond Laflamme, Emanuel Knill, Wojciech H. Zurek, P. Catasti, S. V. S. Mariappan:
NMR GHZ. QCQC 1998: 357-363 - 1996
- [j6]Emanuel Knill, Alexander Schliep, David C. Torney:
Interpretation of Pooling Experiments Using the Markov Chain Monte Carlo Method. J. Comput. Biol. 3(3): 395-406 (1996) - [j5]Vance Faber, Wayne Joubert, Emanuel Knill, Thomas A. Manteuffel:
Minimal Residual Method Stronger than Polynomial Preconditioning. SIAM J. Matrix Anal. Appl. 17(4): 707-729 (1996) - 1995
- [j4]Emanuel Knill, Andrzej Ehrenfeucht, David Haussler:
The size of k-pseudotrees. Discret. Math. 141(1-3): 185-194 (1995) - [j3]Emanuel Knill:
Extreme k-families. Eur. J. Comb. 16(1): 23-33 (1995) - [c3]Emanuel Knill:
Lower Bounds for Identifying Subset Members with Subset Queries. SODA 1995: 369-377 - [i2]Emanuel Knill:
An analysis of Bennett's pebble game. CoRR abs/math/9508218 (1995) - 1994
- [j2]Emanuel Knill:
Families of sets with locally bounded width. Graphs Comb. 10(2-4): 145-157 (1994) - [c2]William Y. C. Chen, Vance Faber, Emanuel Knill:
Restricted routing and wide diameter of the cycle prefix network. Interconnection Networks and Mapping and Scheduling Parallel Computations 1994: 31-46 - [i1]Emanuel Knill:
Lower bounds for identifying subset members with subset queries. CoRR abs/math/9411219 (1994) - 1993
- [j1]Emanuel Knill, Philip T. Cox, Tomasz Pietrzykowski:
Equality and Abductive Residua for Horn Clauses. Theor. Comput. Sci. 120(1): 1-44 (1993) - 1992
- [c1]Philip T. Cox, Emanuel Knill, Tomasz Pietrzykowski:
Abduction in Logic Programming with Equality. FGCS 1992: 539-545
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-25 05:53 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:
