default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Gottesman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j13]Daniel Gottesman
:
Technical perspective: Deciphering errors to reduce the cost of quantum computation. Commun. ACM 64(1): 105 (2021)
2010 – 2019
- 2016
- [j12]Daniel Gottesman:
Quantum computing: Efficient fault tolerance. Nat. 540(7631): 44-45 (2016) - 2014
- [j11]Daniel Gottesman:
Fault-tolerant quantum computation with constant overhead. Quantum Inf. Comput. 14(15-16): 1338-1372 (2014) - [j10]Robin Blume-Kohout, Sarah Croke, Daniel Gottesman:
Streaming Universal Distortion-Free Entanglement Concentration. IEEE Trans. Inf. Theory 60(1): 334-350 (2014) - 2013
- [j9]Daniel Gottesman, Sandy Irani:
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems. Theory Comput. 9: 31-116 (2013)
2000 – 2009
- 2009
- [c10]Daniel Gottesman, Sandy Irani:
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems. FOCS 2009: 95-104 - [c9]Richard Cleve, Daniel Gottesman, Michele Mosca, Rolando D. Somma, David L. Yonge-Mallo:
Efficient discrete-time simulations of continuous-time quantum query algorithms. STOC 2009: 409-416 - [i5]Daniel Gottesman, Sandy Irani:
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems. CoRR abs/0905.2419 (2009) - 2008
- [j8]Panos Aliferis, Daniel Gottesman, John Preskill:
Accuracy threshold for postselected quantum computation. Quantum Inf. Comput. 8(3): 181-244 (2008) - 2007
- [c8]Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe:
The Power of Quantum Systems on a Line. FOCS 2007: 373-383 - 2006
- [j7]Panos Aliferis, Daniel Gottesman, John Preskill:
Quantum accuracy threshold for concatenated distance-3 codes. Quantum Inf. Comput. 6(2): 97-165 (2006) - [j6]Andris Ambainis, Daniel Gottesman:
The minimum distance problem for two-way entanglement purification. IEEE Trans. Inf. Theory 52(2): 748-753 (2006) - [c7]Michael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, Adam D. Smith:
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority. FOCS 2006: 249-260 - 2005
- [c6]Claude Crépeau, Daniel Gottesman, Adam D. Smith:
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes. EUROCRYPT 2005: 285-301 - [i4]Claude Crépeau, Daniel Gottesman, Adam D. Smith:
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes. CoRR abs/quant-ph/0503139 (2005) - 2004
- [j5]Daniel Gottesman, Hoi-Kwong Lo, Norbert Lütkenhaus, John Preskill:
Security of quantum key distribution with imperfect devices. Quantum Inf. Comput. 4(5): 325-360 (2004) - [c5]Daniel Gottesman, Hoi-Kwong Lo, Norbert Lütkenhaus, John Preskill:
Security of quantum key distribution with imperfect devices. ISIT 2004: 136 - [i3]Scott Aaronson, Daniel Gottesman:
Improved Simulation of Stabilizer Circuits. CoRR quant-ph/0406196 (2004) - 2003
- [j4]Daniel Gottesman:
Uncloneable encryption. Quantum Inf. Comput. 3(6): 581-602 (2003) - [j3]Daniel Gottesman, Hoi-Kwong Lo:
Proof of security of quantum key distribution with two-way classical communications. IEEE Trans. Inf. Theory 49(2): 457-475 (2003) - 2002
- [j2]Daniel Gottesman:
Book review: On "Introduction to Quantum Computation and Information" edited by Hoi-Kwong Lo, Sandu Popescu, and Tim Spiller. Quantum Inf. Comput. 2(2): 177-178 (2002) - [c4]Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam D. Smith, Alain Tapp:
Authentication of Quantum Messages. FOCS 2002: 449-458 - [c3]Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam D. Smith:
Detectable byzantine agreement secure against faulty majorities. PODC 2002: 118-126 - [c2]Claude Crépeau, Daniel Gottesman, Adam D. Smith:
Secure multi-party quantum computation. STOC 2002: 643-652 - [i2]Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam D. Smith, Alain Tapp:
Authentication of Quantum Messages. CoRR quant-ph/0205128 (2002) - [i1]Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam D. Smith, Alain Tapp:
Authentication of Quantum Messages. IACR Cryptol. ePrint Arch. 2002: 82 (2002) - 2000
- [j1]Samuel L. Braunstein, Christopher A. Fuchs, Daniel Gottesman, Hoi-Kwong Lo:
A quantum analog of huffman coding. IEEE Trans. Inf. Theory 46(4): 1644-1649 (2000)
1990 – 1999
- 1998
- [c1]Daniel Gottesman:
Fault-Tolerant Quantum Computation with Higher-Dimensional Systems. QCQC 1998: 302-313
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-10-09 20:31 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:
