 | 2009 |
| 22 |  | Daniel Gottesman,
Sandy Irani:
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems.
FOCS 2009: 95-104 |
| 21 |  | 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 |
| 20 |  | Daniel Gottesman,
Sandy Irani:
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems
CoRR abs/0905.2419: (2009) |
| 2008 |
| 19 |  | Panos Aliferis,
Daniel Gottesman,
John Preskill:
Accuracy threshold for postselected quantum computation.
Quantum Information & Computation 8(3): 181-244 (2008) |
| 2007 |
| 18 |  | Dorit Aharonov,
Daniel Gottesman,
Sandy Irani,
Julia Kempe:
The Power of Quantum Systems on a Line.
FOCS 2007: 373-383 |
| 2006 |
| 17 |  | Michael Ben-Or,
Claude Crépeau,
Daniel Gottesman,
Avinatan Hassidim,
Adam Smith:
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority.
FOCS 2006: 249-260 |
| 16 |  | Andris Ambainis,
Daniel Gottesman:
The minimum distance problem for two-way entanglement purification.
IEEE Transactions on Information Theory 52(2): 748-753 (2006) |
| 15 |  | Panos Aliferis,
Daniel Gottesman,
John Preskill:
Quantum accuracy threshold for concatenated distance-3 codes.
Quantum Information & Computation 6(2): 97-165 (2006) |
| 2005 |
| 14 |  | Claude Crépeau,
Daniel Gottesman,
Adam Smith:
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes.
EUROCRYPT 2005: 285-301 |
| 13 |  | Claude Crépeau,
Daniel Gottesman,
Adam Smith:
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
CoRR abs/quant-ph/0503139: (2005) |
| 2004 |
| 12 |  | Scott Aaronson,
Daniel Gottesman:
Improved Simulation of Stabilizer Circuits
CoRR quant-ph/0406196: (2004) |
| 11 |  | Daniel Gottesman,
Hoi-Kwong Lo,
Norbert Lütkenhaus,
John Preskill:
Security of quantum key distribution with imperfect devices.
Quantum Information & Computation 4(5): 325-360 (2004) |
| 2003 |
| 10 |  | Daniel Gottesman,
Hoi-Kwong Lo:
Proof of security of quantum key distribution with two-way classical communications.
IEEE Transactions on Information Theory 49(2): 457-475 (2003) |
| 9 |  | Daniel Gottesman:
Uncloneable encryption.
Quantum Information & Computation 3(6): 581-602 (2003) |
| 2002 |
| 8 |  | Howard Barnum,
Claude Crépeau,
Daniel Gottesman,
Adam Smith,
Alain Tapp:
Authentication of Quantum Messages.
FOCS 2002: 449-458 |
| 7 |  | Matthias Fitzi,
Daniel Gottesman,
Martin Hirt,
Thomas Holenstein,
Adam Smith:
Detectable byzantine agreement secure against faulty majorities.
PODC 2002: 118-126 |
| 6 |  | Claude Crépeau,
Daniel Gottesman,
Adam Smith:
Secure multi-party quantum computation.
STOC 2002: 643-652 |
| 5 |  | Howard Barnum,
Claude Crépeau,
Daniel Gottesman,
Adam Smith,
Alain Tapp:
Authentication of Quantum Messages
CoRR quant-ph/0205128: (2002) |
| 4 |  | Howard Barnum,
Claude Crépeau,
Daniel Gottesman,
Adam Smith,
Alain Tapp:
Authentication of Quantum Messages.
IACR Cryptology ePrint Archive 2002: 82 (2002) |
| 3 |  | Daniel Gottesman:
Book review.
Quantum Information & Computation 2(2): 177-178 (2002) |
| 2000 |
| 2 |  | Samuel L. Braunstein,
Christopher A. Fuchs,
Daniel Gottesman,
Hoi-Kwong Lo:
A quantum analog of huffman coding.
IEEE Transactions on Information Theory 46(4): 1644-1649 (2000) |
| 1998 |
| 1 |  | Daniel Gottesman:
Fault-Tolerant Quantum Computation with Higher-Dimensional Systems.
QCQC 1998: 302-313 |