Scientific Activites

Emanuel H. Knill

Address:

Manny's email: gro knamilel llink (in reverse, insert 'at' and 'dot' where needed).

Contents

Education and Employment

1984 MS/BS Physics University of Massachusetts at Boston
1984-6 Res. Asst. Nuclear Physics Massachusetts Inst. Tech.
1991 Ph.D. Mathematics University of Colorado at Boulder
  Thesis: ``Generalized Degrees and Densities for Families of Sets''
  Adviser: R. Laver
1991-2 Res. Assoc. Computer Science Technical University of Nova Scotia
1992-5 Postdoc   Los Alamos Nat. Lab.
1995-7 Team leader   Los Alamos Nat. Lab.
1995-2003 Technical Staff Member   Los Alamos Nat. Lab.
2003-present Researcher   Nat. Inst. St. & Tech.

Research Areas

My work consists of developing and applying mathematical and physical tools to better understand the limitations and utilize the capabilities of information processing resources. I use ideas and results from discrete mathematics, linear and multilinear algebra, information theory, the theory of computation and theoretical physics, which I have applied to automated reasoning, learning theory, numerical methods and the human genome project. Since 1996, my focus has been on quantum information processing, with contributions to quantum coding theory, models of computation, algorithms and technology.


Quantum information processing: The theoretical, experimental and technological areas covering the use of quantum mechanics for communication and computation.

Research Papers

Papers are arranged by topic. The bibliographic information is sometimes followed by [x], where x (at least 4) is the total citations as of 02/06/06, according to the Science Citation Index (SCI). The SCI lists about 60 papers authored or coauthored by me where my contribution is significant. My papers and preprints have been cited about 3100 times in total. The number of papers in quantum information processing listed for 2000 and 2001 in the SCI are 329 and 406, respectively.1 Unpublished reports are offset and in small print. Links are for electronic versions of papers. The journal versions may require subscriptions. ArXiv versions are older but may contain additional information if there were space constraints.

Quantum Information Processing: Theory

Models and Schemes

.
M. D. Bowdrey, J. A. Jones, E. Knill, and R. Laflamme.
Compiling gate networks on an ising quantum computer.
Phys. Rev. A, 72:032315/1-5, 2005. Journal version. Reprint.

.
A. Imamoglu, E. Knill, L. Tian, and P. Zoller.
Optical pumping of quantum dot nuclear spins.
Phys. Rev. Lett., 91:017402/1-4, 2003.
cond-mat/0303575. [19] Journal version. Reprint. PrEprint from arXiv.

.
E. Knill, R. Laflamme, and G. Milburn.
A scheme for efficient linear optics quantum computation.
Nature, 409:46-52, 2001. [502] Journal version. Reprint.

.
E. Knill.
Quantum gates using linear optics and postselection.
Phys. Rev. A, 66(LAUR-01-5973):052306/1-5, 2002. [19] Journal version. Reprint. PrEprint from arXiv.

.
E. Knill.
Bounds on the probability of success of postselected non-linear sign shifts implemented with linear optics.
quant-ph/0307015, 2003. [7] Journal version. Reprint. PrEprint from arXiv.

.
E. Knill.
Fermionic linear optics and matchgates.
Technical Report LAUR-01-4472, Los Alamos National Laboratory, 2001.
quant-ph/0108033. PrEprint from arXiv.

.
E. Knill, R. Laflamme, and G. Milburn.
Efficient linear optics quantum computation.
Technical Report LAUR-00-2936, Los Alamos National Laboratory, 2000.
quant-ph/0006088. PrEprint from arXiv.

.
E. Knill, R. Laflamme, and G. Milburn.
Thresholds for linear optics quantum computation.
Technical Report LAUR-00-3477, Los Alamos National Laboratory, 2000.
quant-ph/0006120. PrEprint from arXiv.

.
L. Viola, E. Knill, and R. Laflamme.
Constructing qubits in physical systems.
J. Phys. A, 34:7067-7080, 2001. [16] Reprint. PrEprint from arXiv.

.
E. Knill and R. Laflamme.
On the power of one bit of quantum information.
Phys. Rev. Lett., 81:5672-5675, 1998. [44] Journal version. Reprint. PrEprint from arXiv.

.
J. A. Jones and E. Knill.
Efficient refocussing of one spin and two spin interactions for NMR.
J. Mag. Res., 141:322-325, 1999. [43] Journal version. Reprint. PrEprint from arXiv.

.
E. Knill, I. Chuang, and R. Laflamme.
Effective pure states for bulk quantum computation.
Phys. Rev. A, 57:3348-3363, 1998. [108] Journal version. Reprint. PrEprint from arXiv.

Controlling Errors

.
E. Knill.
Quantum computing with realistically noisy devices.
Nature, 434:39-44, 2005. [6] Journal version. Reprint. PrEprint from arXiv.

.
E. Knill.
Scalable quantum computation in the presence of large detected-error rates.
Phys. Rev. A, 71:042322/1-7, 2005. Journal version. Reprint. PrEprint from arXiv.

.
L. Viola and E. Knill.
Random decoupling schemes for quantum dynamical control and error suppression.
Phys. Rev. Lett., 94:060502/1-4, 2005. Journal version. Reprint. PrEprint from arXiv.

.
E. Knill.
Fault-tolerant postselected quantum computation: Threshold analysis.
quant-ph/0404104, 2004. PrEprint from arXiv.

.
E. Knill.
Fault-tolerant postselected quantum computation: Schemes.
quant-ph/0402171, 2004. PrEprint from arXiv.

.
L. Viola and E. Knill.
Robust dynamical decoupling of quantum systems with bounded controls.
Phys. Rev. Lett., 90:037901/1-4, 2003. [17] Journal version. Reprint. PrEprint from arXiv.

.
A. Ashikhmin and E. Knill.
Non-binary quantum stabilizer codes.
IEEE Trans. Inf. Theory, 47:3065-3072, 2001. [23] Reprint. PrEprint from arXiv.

.
L. Viola, E. Knill, and S. Lloyd.
Dynamical generation of noiseless quantum subsystems.
Phys. Rev. Lett., 85:3520-3523, 2000. [45] Journal version. Reprint. PrEprint from arXiv.

.
E. Knill, R. Laflamme, and L. Viola.
Theory of quantum error correction for general noise.
Phys. Rev. Lett., 84:2525-2528, 2000. [114] Journal version. Reprint. PrEprint from arXiv.

.
L. Viola, E. Knill, and S. Lloyd.
Dynamical decoupling of open quantum systems.
Phys. Rev. Lett., 82:2417-2421, 1999. [151] Journal version. Reprint. PrEprint from arXiv.

.
L. Viola, S. Lloyd, and E. Knill.
Universal control of decoupled quantum systems.
Phys. Rev. Lett., 83:4888-4891, 1999. [60] Journal version. Reprint. PrEprint from arXiv.

.
A. Ashikhmin, A. Barg, E. Knill, and S. Litsyn.
Quantum error detection I: Statement of the problem.
IEEE Trans. Inf. Theory, 46:778-788, 1999.
quant-ph/9906126. [8] Reprint. PrEprint from arXiv.

.
A. Ashikhmin, A. Barg, E. Knill, and S. Litsyn.
Quantum error detection II: Bounds.
IEEE Trans. Inf. Theory, 46:789-800, 1999.
quant-ph/9906131. [5] Reprint. PrEprint from arXiv.

.
E. Knill, R. Laflamme, and W. H. Zurek.
Resilient quantum computation.
Science, 279:342-345, 1998. [139] Journal version. Reprint.

See also: E. Knill, R. Laflamme, and W. H. Zurek.
Resilient quantum computation.
Science, 293:2395-2395, 2001.
Erratum to correct a misprinted exponent. Journal version.

.
E. Knill, R. Laflamme, and W. Zurek.
Resilient quantum computation: Error models and thresholds.
Proc. R. Soc. Lond. A, 454:365-384, 1998. [42] Journal version. Reprint. PrEprint from arXiv.

.
E. Knill.
Non-binary unitary error bases and quantum codes.
Technical Report LAUR-96-2717, Los Alamos National Laboratory, 1996.
quant-ph/9608048. [35] PrEprint from arXiv.

.
E. Knill.
Group representations, error bases and quantum codes.
Technical Report LAUR-96-2807, Los Alamos National Laboratory, http://www.c3.lanl.gov/~knill, 1996.
quant-ph/9608049. [20] PrEprint from arXiv.

.
E. Knill and R. Laflamme.
Concatenated quantum codes.
Technical Report LAUR-96-2808, Los Alamos National Laboratory, 1996.
quant-ph/9608012. [26] PrEprint from arXiv.

.
E. Knill and R. Laflamme.
Assumptions for fault tolerant quantum computing.
Technical Report LAUR-96-2718, Los Alamos National Laboratory, 1996. PrEprint.

.
E. Knill, R. Laflamme, and W. Zurek.
Accuracy threshold for quantum computation.
Technical Report LAUR-96-2199, Los Alamos National Laboratory, 1996.
quant-ph/9610011. PrEprint from arXiv.

.
E. Knill and R. Laflamme.
A theory of quantum error correcting codes.
Phys. Rev. A, 55:900-911, 1997. [287] Journal version. Reprint. PrEprint from arXiv.

Quantum Information Theory

.
R. Somma, G. Ortiz, H. Barnum, E. Knill, and L. Viola.
Nature and measure of entanglement in quantum phase transitions.
Phys. Rev. A, 70:042311/1-21, 2004. [7] Journal version. PrEprint from arXiv.

.
H. Barnum, E. Knill, G. Ortiz, R. Somma, and L. Viola.
A subsystem-independent generalization of entanglement.
Phys. Rev. Lett., 92:107902/1-4, 2004. [15] Journal version. PrEprint from arXiv.

.
H. Barnum, E. Knill, G. Ortiz, and L. Viola.
Generalizations of entanglement based on coherent states and convex sets.
Phys. Rev. A, 68:032308/1-21, 2003.
quant-ph/0207149. [6] Journal version. Reprint. PrEprint from arXiv.

.
G. J. Milburn, R. Laflamme, B. C. Sanders, and E. Knill.
Quantum dynamics of two coupled qubits.
Phys. Rev. A, 65:032316/1-10, 2003. [7] Journal version. Reprint. PrEprint from arXiv.

.
H. Barnum and E. Knill.
Reversing quantum dynamics with near-optimal quantum and classical fidelity.
J. Math. Phys., 43:2097-2106, 2002.
quant-ph/0004088. [4] Journal version. Reprint. PrEprint from arXiv.

.
H. Barnum, E. Knill, and M. A. Nielsen.
On quantum fidelities and channel capacities.
IEEE Trans. Inf. Theory, 46:1317-1329, 2000. [36] Reprint. PrEprint from arXiv.

Complexity and Algorithms

.
M. Ettinger, P. Høyer, and E. Knill.
The quantum query complexity of the hidden subgroup problem is polynomial.
Information Processing Letters, 91(LAUR-02-5088):438-48, 2004. PrEprint.

.
R. Somma, G. Ortiz, J. E. Gubernatis, E. Knill, and R. Laflamme.
Simulating physical phenomena by quantum networks.
Phys. Rev. A, 65:042323/1-17, 2002.
quant-ph/0108146. [4] Journal version. Reprint. PrEprint from arXiv.

.
G. Ortiz, E. Knill, and J. E. Gubernatis.
The challenge of quantum computer simulations of physical phenomena.
Nuc. Phys. B-Proc. Supp., 106:151-158, 2002.

.
G. Ortiz, J. E. Gubernatis, E. Knill, and R. Laflamme.
Quantum algorithms for fermionic simulations.
Phys. Rev. A, 64:022319/1-14, 2001. [6] Journal version. Reprint. PrEprint from arXiv.

See also: G. Ortiz, J. E. Gubernatis, E. Knill, and R. Laflamme.
Quantum algorithms for fermionic simulations.
Phys. Rev. A, 65:029902/1-1, 2002.
Erratum to add omitted term to universal fermionic Hamiltonian PRA 65 029902/1-1 (2002).. Journal version.

.
E. Knill and R. Laflamme.
Quantum computation and quadratically signed weight enumerators.
Information Processing Letters, 79:173-179, 2001.
quant-ph/9909094. Reprint. PrEprint from arXiv.

.
E. Knill.
Quantum randomness and nondeterminism?
Technical Report LAUR-96-2186, Los Alamos National Laboratory, 1996.
quant/ph/9610012. PrEprint from arXiv.

.
E. Knill and R. Hughes.
Quantum pseudo-code for factor finding and discrete logarithm.
preprint, 1996. PrEprint.

.
E. Knill.
Conventions for quantum pseudocode.
Technical Report LAUR-96-2724, Los Alamos National Laboratory, 1996. PrEprint.

.
E. Knill.
Approximation by quantum circuits.
Technical Report LAUR-95-2225, Los Alamos National Laboratory, 1995.
quant-ph/9508006. [4] PrEprint from arXiv.

.
E. Knill.
Bounds for approximation in total variation distance by quantum circuits.
Technical Report LAUR-95-2724, Los Alamos National Laboratory, 1995.
quant-ph/9508007. PrEprint from arXiv.

.
E. Knill.
An analysis of Bennett's pebble game.
Technical Report LAUR-95-2258, Los Alamos National Laboratory, 1995. PrEprint.

.
E. Knill.
On Shor's quantum factor finding algorithm: Increasing the probability of success and tradeoffs involving the Fourier transform modulus.
Technical Report LAUR-95-3350, Los Alamos National Laboratory, 1995. PrEprint.

Quantum Information Processing: Experiment

Benchmarking

.
L. Viola and E. Knill.
Verification procedures for quantum noiseless subsystems.
Phys. Rev. A, 68:032311/1-5, 2003.
quant-ph/0303165. Journal version. Reprint. PrEprint from arXiv.

.
E. Knill, R. Laflamme, R. Martinez, and C. Negrevergne.
Implementation of the five qubit error correction benchmark.
Phys. Rev. Lett., 86:5811-5814, 2001. [34] Journal version. Reprint. PrEprint from arXiv.

.
E. Knill, R. Laflamme, R. Martinez, and C.-H. Tseng.
An algorithmic benchmark for quantum information processing.
Nature, 404:368-370, 2000. [85] Journal version. Reprint. PrEprint from arXiv.

.
D. G. Cory, W. Maas, M. Price, E. Knill, R. Laflamme, W. H. Zurek, T. F. Havel, and S. S. Somaroo.
Experimental quantum error correction.
Phys. Rev. Lett., 81:2152-2155, 1998. [113] Journal version. Reprint. PrEprint from arXiv.

.
Y. Sharf, D. G. Cory, S. S. Somaroo, E. Knill, R. Laflamme, W. H. Zurek, and T. F. Havel.
A study of quantum error correction by geometric algebra and liquid-state NMR spectroscopy.
Mol. Phys., 98:1347-1363, 2000. [12] Journal version. Reprint. PrEprint from arXiv.

Ion Trap Demonstrations

.
D. Leibfried, E. Knill, S. Seidelin, J. Britton, R. B. Blakestad, J. Chiaverini, D. B. Hume, W. M. Itano, J. D. Jost, C. Langer, R. Ozeri, R. Reichle, and D. J. Wineland.
Creation of a six-atom``schrödinger cat'' state.
Nature, 438:639-642, 2005. Journal version. Reprint.

.
T. Schaetz, M. D. Barrett, D. Leibfried, J. Britton, J. Chiaverini, W. M. Itano, J. D. Jost, E. Knill, C. Langer, and D. J. Wineland.
Enhanced quantum state detection efficiency through quantum information processing.
Phys. Rev. Lett., 94:010501/1-4, 2005. Journal version. Reprint.

.
J. Chiaverini, D. Leibfried, T. Schaetz, M. D. Barrett, R. B. Blakestad, J. Britton, W. M. Itano, J. D. Jost, E. Knill, C. Langer, R. Ozeri, and D. J. Wineland.
Realization of quantum error correction.
Nature, 432:602-605, 2004. [16] Journal version. Reprint.

.
M. D. Barrett, J. Chiaverini, T. Schaetz, J. Britton, W. M. Itano, J. D. Jost, E. Knill, C. Langer, D. Leibfried, R. Ozeri, and D. J. Wineland.
Deterministic quantum teleportation of atomic qubits.
Nature, 429:737-739, 2004. [62] Journal version. Reprint.

NMR Demonstrations

.
C. Negrevergne, R. Somma, G. Ortiz, E. Knill, and R. Laflamme.
Liquid-state NMR simulations of quantum many-body problems.
Phys. Rev. A, 71:032344/1-11, 2005. Journal version. Reprint.

.
E. M. Fortunato, L. Viola, M. A. Pravia, E. Knill, R. Laflamme, T. F. Havel, and D. G. Cory.
Exploring noiseless subsystems via nuclear magnetic resonance.
Phys. Rev. A, 67:062303/1-16, 2003. Journal version. Reprint.

.
C. Miquel, J. P. Paz, M. Saraceno, E. Knill, R. Laflamme, and C. Negrevergne.
Interpretation of tomography and spectroscopy as dual forms of quantum computations.
Nature, 418:59-62, 2002.
quant-ph/0109072. [26] Journal version. Reprint. PrEprint from arXiv.

.
L. Viola, E. M. Fortunato, M. A. Pravia, E. Knill, R. Laflamme, and D. G. Cory.
Experimental realization of noiseless subsystems for quantum information processing.
Science, 293:2059-2063, 2001. [47] Journal version. Reprint.

.
M. A. Nielsen, E. Knill, and R. Laflamme.
Complete quantum teleportation.
Nature, 396:52-55, 1998. [141] Journal version. Reprint. PrEprint from arXiv.

.
C.-H. Tseng, S. Somaroo, Y. Sharf, E. Knill, R. Laflamme, T. F. Havel, and D. G. Cory.
Quantum simulation with natural decoherence.
Phys. Rev. A, 62:032309/1-9, 2000. [17] Journal version. Reprint.

.
C.-H. Tseng, S. Somaroo, Y. Sharf, E. Knill, R. Laflamme, T. F. Havel, and D. G. Cory.
Quantum simulation of a three-body interaction Hamiltonian on an NMR quantum computer.
Phys. Rev. A, 61:012302/1-6, 2000. [20] Journal version. Reprint. PrEprint from arXiv.

.
R. Laflamme, E. Knill, W. H. Zurek, P. Catasti, and S. V. S. Mariappan.
NMR Greenberger-Horne-Zeilinger states.
Phil. Trans. R. Soc. Lond. A, 356:1941-1948, 1997. [38] Journal version. Reprint. PrEprint from arXiv.

.
R. Laflamme, E. Knill, W. H. Zurek, P. Catasti, and S. V. S. Mariappan.
NMR-GHZ.
In Lecture Notes in Computer Science, volume 1509, pages 357-363, 1999.

Evaluation

.
R. J. Hughes, D. F. V. James, E. Knill, R. Laflamme, and A. G. Petschek.
Decoherence bounds on quantum computation with trapped ions.
Phys. Rev. Lett., 77:3240-3243, 1996. [40] Journal version. Reprint. PrEprint from arXiv.

Discrete Mathematics

Grouptesting for Molecular Biology

.
M. Farach, S. Kannan, E. Knill, and S. Muthukrishnan.
Group testing problems with sequences in experimental molecular biology.
In B. Carpentieri et al, editor, Compression and Complexity of SEQUENCES 1997, pages 11-13, Los Alamitos, CA, 1997. IEEE Comput. Soc.

.
D. J. Balding, W. J. Bruno, E. H. Knill, and D. C. Torney.
A comparative survey of non-adaptive pooling designs.
In Genetic Mapping and DNA Sequencing, volume 81 of IMA Volumes in Mathematics and its Applications, pages 133-155. Springer Verlag, 1995.

.
E. Knill.
Lower bounds for identifying subset members with subset queries.
In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 369-377. Association for Computing Machinery & Society for Industrial and Applied Mathematics, 1995. [9] PrEprint.

.
E. Knill, A. Schliep, and D. Torney.
Interpretation of pooling experiments using the Markov chain Monte Carlo method.
Journal of Computational Biology, 3(LAUR-95-2402):395-406, 1996. [6] PrEprint.

.
W. J. Bruno, D. J. Balding, E. H. Knill, D. Bruce, C. Whittaker, N. Doggett, R. Stallings, and D. C. Torney.
Efficient pooling designs for library screening.
Genomics, 26:21-30, 1995. [37]

.
E. Knill and S. Muthukrishnan.
Group testing problems in experimental computational biology.
Technical Report LAUR-95-1503, Los Alamos National Laboratory, 1994. PrEprint.

Extremal Combinatorics

.
E. Knill.
Extreme k-families.
Europ. J. Combinatorics, 16:23-33, 1995. PrEprint.

.
E. Knill, A. Ehrenfeucht, and D. Haussler.
The size of k-pseudotrees.
Discrete Mathematics, 141:185-194, 1995. Reprint. PrEprint.

.
W. Y. C. Chen, V. Faber, and E. Knill.
Restricted routing and wide diameter of the cycle prefix network.
In DIMACS Interconnection Networks and Mapping, pages 31-46, 1995. PrEprint.

.
E. Knill.
Notes on the connectivity of Cayley coset digraphs.
Technical Report LAUR-94-3719, Los Alamos National Laboratory, 1994. PrEprint.

.
E. Knill.
Invertible families of sets of bounded degree.
Congressus Numerantium, 100-104, 1994. PrEprint.

.
E. Knill.
Graph generated union-closed families and the union-closed sets conjecture.
Technical Report LAUR-93-2297, Los Alamos National Laboratory, 1993. PrEprint.

.
V. Faber, M. K. Goldberg, E. Knill, and T. H. Spencer.
Inverting sets and the packing problem.
In Conference on Graph Theory, Combinatorics, Algorithms and Applications, pages 351-366, 1992.

.
E. Knill.
Generalized Degrees and Densities for Families of Sets.
PhD thesis, University of Colorado at Boulder, 1991. PrEprint.

Other Contributions

Molecular Biology

.
N. A. Doggett, L. A. Goodwin, J. G. Tesmer, L. J. Meincke, D. C. Bruce, L. M. Clark, M. R. Altherr, A. A. Ford, H. C. Chi, B. L. Marrone, J. L. Longmire, S. A. Lane, S. A. Whitmore, M. G. Lowenstein, R. D. Sutherland, M. O. Mundt, E. H. Knill, W. J. Bruno, C. A. Macken, D. C. Torney, J. R. Wu, J. Griffith, G. R. Sutherland, L. L. Deaven, D. F. Callen, and R. K. Moyzis.
An integrated physical map of human-chromosome-16.
Nature, 377:335-365, 1995. [93]

Numerical Methods

.
V. Faber, W. Joubert, E. Knill, and T. Manteuffel.
Minimal residual method stronger than polynomial preconditioning.
SIAM J. Matrix An. and App., 17:707-729, 1995. [7] Journal abstract PrEprint.

Learning Theory

.
D. H. Wolpert, E. Knill, and T. Grossman.
Some results concerning off-training-set and IID error for the Gibbs and the Bayes optimal generalizers.
Statistics and Computing, 8:35-54, 1998. Reprint. PrEprint.

Computer Logic

.
E. Knill, P. T. Cox, and T. Pietrzykowski.
Equality and abductive residua for horn clauses.
Theoretical Computer Science, 120:1-44, 1993. PrEprint.

.
P. T. Cox, E. Knill, and T. Pietrzykowski.
Abduction in logic programming with equality.
In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 539-545, 1992.

.
E. Knill, P. T. Cox, and T. Pietrzykowski.
Transformational methods for clausal theorem proving with equality.
Technical Report LAUR-95-1983, Los Alamos National Laboratory, 1992. PrEprint.

.
E. Knill, P. T. Cox, and T. Pietrzykowski.
Completing fault models for abductive diagnosis.
Technical Report LAUR-92-3370, Los Alamos National Laboratory, 1992. PrEprint.

Miscellaneous

.
K. Dow, S. Dytman, D. Beck, A. Bernstein, I. Blomqvist, H. Caplan, D. Day, M. Deady, P. Demos, W. Dodge, G. Dodson, M. Farkhondeh, J. Flanz, K. Giovanetti, R. Goloskie, E. Hallin, E. Knill, S. Kowalski, J. Lightbody, R. Lindgren, X. Maruyama, J. Mccarthy, B. Quinn, G. Retzlaff, W. Sapp, C. Sargent, D. Skopik, I. The, D. Tieger, W. Turchinetz, T. Ueng, N. Videla, K. Vonreden, R. Whitney, and C. Williamson.
Longitudinal response functions and sum-rules for quasielastic electron-scattering from H-3 and He-3.
Phys. Rev. Lett., 61:1706-1709, 1988. [30]

.
D. Beck, A. Bernstein andn I. Blomqvist, H. Caplan, D. Day, P. Demos, W. Dodge, G. Dodson, K. Dow, S. Dytman, M. Farkhondeh, J. Flanz, K. Giovanetti, R. Goloskie, E. Hallin, E. Knill, S. Kowalski, J. Lightbody, R. Lindgren, X. Maruyama, J. Mccarthy, B. Quinn, G. Retzlaff, W. Sapp, C. Sargent, D. Skopik, I. The, D. Tieger, W. Turchinetz, T. Ueng, N. Videla, K. Vonreden, R. Whitney, and C. Williamson.
Isoscalar and isovector form-factors of H-3 and He-3 for q below 2.9 fm-1 from electron-scattering measurements.
Phys. Rev. Lett., 59:1537-1540, 1987. [59]

Survey Papers

.
E. Knill, R. Laflamme, H. Barnum, D. Dalvit, J. Dziarmaga, J. Gubernatis, L. Gurvits, G. Ortiz, L. Viola, and W. Zurek.
Introduction to quantum information processing.
LA Science, 27(LAUR-01-4761):2-45, 2002.
quant-ph/0207171. Hypertext prEprint.

.
E. Knill, R. Laflamme, A. Ashikhmin, H. Barnum, L. Viola, and W. Zurek.
Introduction to quantum error correction.
LA Science, 27(LAUR-01-6115 and LAUR-02-4311):188-225, 2002.
quant-ph/0207170. Hypertext prEprint.

.
R. Laflamme, E. Knill, D. Cory, E. M. Fortunato, T. Havel, C. Miquel, R. Martinez, C. Negrevergne, G. Ortiz, M. A. Pravia, S. Sinha, R. Somma, and L. Viola.
Introduction to NMR quantum information processing.
LA Science, 27(LAUR-02-6132):226-259, 2002.
quant-ph/0207172. Hypertext prEprint.

.
E. Knill and M. Nielsen.
Quantum information processing.
Technical Report LAUR-00-5265, Los Alamos National Laboratory, 2000.
quant-ph/0010058, accepted for Supplement III, Encyclopedia of Mathematics, Kluwer. PrEprint from arXiv.

.
E. Knill and M. Nielsen.
Theory of quantum computation.
Technical Report LAUR-00-5267, Los Alamos National Laboratory, 2000.
quant-ph/0010057, accepted for Supplement III, Encyclopedia of Mathematics, Kluwer. PrEprint from arXiv.

.
D.G. Cory, R. Laflamme, E. Knill, L. Viola, T.F. Havel, N. Boulant, G. Boutis, E. Fortunato, S. Lloyd, R. Martinez, C. Negrevergne, M. Pravia, Y. Sharf, G. Teklemariam, Y.S. Weinstein, and W.H. Zurek.
NMR based quantum information processing: Achievements and prospects.
Fort. Phys., 48:875-907, 2000. [72] Journal version Reprint.

Mathematical Reviews

Access to the following links requires a subscription to Mathematical Reviews.
2 124 199 2 094 539          
2 074 737 2 054 894 2 021 223 1 964 701 1 938 240 1 919 964  
1 918 623 1 896 351 1 883 334 1 876 610 1 858 433 1 856 559  
1 823 662 1 819 941 1 818 599 1 811 278 1 808 341 1 803 634  
1 802 440 1 801 548 1 792 931 1 792 930 1 792 929 1 792 202  
1 792 200 2001g:81043b 2001g:81043a 2001g:81042 2001g:81039 2001g:81038  
2001f:81034 2001f:81033 2001f:68029 2001c:81022 2001b:68048 2001a:81045  
2000m:81022 2000k:94061 2000k:81047 2000j:81026 2000g:81038 2000g:81032  
2000g:81031 2000g:81030 2000f:81019 2000e:81024 2000e:81020 2000d:81018  
2000c:81045 2000b:81018 2000b:05052 2000a:81026 2000a:81012 99m:94053  
99m:81025 99k:81044 99i:81023 99h:81026 99h:68074 99g:81029  
99g:81028 99g:81009 99e:81065 99e:81029 99e:81006 99d:81028  

Invited Lectures

Quantum Information Processing

.
``Fault-tolerant Architecture for Very Noisy Gates''
Fault-tolerant quantum computation workshop,
IBM, Yorktown Heights, New York, Aug 29, 2005. Visuals of talk at IBM

.
``Quantum Computing with Linear Optics''
SPRC Annual Meeting, Stanford, Sept 13, 2004.

.
``Postselected Quantum Computation''
Quantum Information and Control Conference, Toronto, July 22, 2004

.
``Overview of Linear Optics Quantum Computation.''
NIST Gaithersburg, January 22, 2003. Transparencies and recording of talk (realplayer) from NIST
NIST Boulder, December 3, 2002.
Oregon Center for Optics, U. Oregon, November 11, 2002.

.
``On the Power of Models of Quantum Computation.''
NIST Boulder, December 4, 2002.
NANO2002 Workshop II, IPAM, UCLA, October 21, 2002. Transparencies from IPAM.

.
``Extended Linear Optics Quantum Computation.''
QIP2002, IBM NY, January 15, 2002.

.
``Models of Quantum Computation: Monoidal Coprocessors.''
Math Colloquium, Univ. of Cal. at Santa Barbara, November 29, 2001.
Math. Phys and Stat. Mech. Seminar, Univ. of Cal. at Davis, November 27, 2001. Transparencies.

.
``Models of Quantum Computation: Sum Estimation Oracles.''
CS Colloquium, U. of Colorado, Boulder, March 13, 2003.
CS Colloquium, U. Oregon, November 14, 2002.
CS Colloquium, Univ. of Cal. at Santa Barbara, November 19, 2001. Transparencies.

.
``Algebraic Methods for Quantum Noise Control.''
Mathematics Department Seminar, Univ. of New Mexico, February 27, 2002.
Mathematics Department Colloquium, Univ. of Cal. at Santa Barbara, May 31, 2001. Transparencies.

.
``Linear Optics Quantum Computation.''
CEPI Seminar, Santa Fe Institute, October 4, 2000.

.
``Controlling Noise in Quantum Systems.''
ACS National Meeting, Washington DC, August 24, 2000. Transparencies.

.
``Quantum Information Processing.''
Mathematics Department Colloquium, University of Nevada at Reno, December 2, 1999. Transparencies.

.
``Classical and Quantum Error-Correcting Codes as Subsystems.''
DIMACS Workshop, Rutgers University, November 11, 1999.

.
``On the Control of Quantum Noise.''
Complexity, Comp. and the Phys. of Inf., Newton Inst., Cambridge, Eng., July 22, 1999. Transparencies.

.
``Adventures in Experimental Quantum Error-Correction.''
Institute for Mathematics and its Applications, University of Minnesota, July, 1998. Transparencies from the IMA.

.
``Quantum Computing.''
Instituto Superior Tecnico, Lisbon, Portugal, May 20, 1998.

.
``NMR Quantum Computing.''
ETH, Zürich, Switzerland, May 18, 1998.

.
``Quantum Computing with One Bit.''
Dagstuhl, Germany, May 14, 1998. Transparencies.

.
``Quantum Computing.''
The Conference on High Speed Computing, Salishan Lodge, Oregon, April 23, 1998. Transparencies.

.
``NMR Quantum Computing: Results and Prospects''
Quantum Technologies Seminar, Los Alamos Nat. Lab., April 8, 1998. Transparencies.

.
``Quantum Error Correction.''
APS Tutorial on Quantum Computation, Los Angeles, March 16, 1998.

.
``NMR Quantum Computing.''
APS Tutorial on Quantum Computation, Los Angeles, March 16, 1998.

.
``Resilient Quantum Computation I and II.''
UNM Physics Colloquium, Albuquerque, May 5/24, 1997.

.
``Threshold Accuracies for Quantum Computation.''
Workshop on Q. Coh. and Comp., ITP, Univ. of Cal. at Santa Barbara, October, 1996.

.
``Assumptions for Fault Tolerant Quantum Computing.''
Workshop on Quantum Computation, ISI, Torino, Italy, June, 1996.

.
``Demonstration of Quantum Control using NMR.''
SQUINT Workshop, Albuquerque, May 1, 1999.

.
``Quantum Control using NMR.''
Workshop on Q. Inf. Proc. and NMR, Harvard Smithsonian, February 24, 1999 Transparencies.

.
``Effective Pure States for Bulk Quantum Computation.''
Quantum Computation Workshop, ISI, Torino, Italy, July 17, 1997.

Discrete Mathematics

.
``Asymptotic Relationships between Superimposed Distance Codes and Packings.''
Eight Quadr. Int. Conf. on Gr. Th., Comb., Alg. and App., West. Mich. University, June, 1996.

.
``On the Asymptotics of Superimposed Distance Codes.''
26'th SE Int. Conf. on Comb., Gr. Th. and Comp., Boca Raton, Florida, March, 1995.

.
``Lower Bounds for Identifying Subset Members with Subset Queries.''
SODA'95, January, 1995.

.
``Combinatorial Strategies for Screening Libraries of Clones.''
DIMACS Workshop on Sequencing and Mapping, DIMACS, October, 1994.

.
``Bounds for Non-adaptive Group Testing.''
DIMACS Computational Biology Colloquium, DIMACS, October, 1994.

.
``Pooling Strategies for Unique Sequence Screening.''
Sandia National Lab. Workshop on Comp. Molec. Biology, Albuquerque, NM, June 1994.

.
``Pooling Schemes for Group Testing.''
Computer Science Colloquium, Ransselaer Polytechnic Institute, September, 1993.

.
``Applications of Linear Programming to Extremal Problems in Combinatorics and Complexity.'',
NYU, New York, October, 1994.

.
Double Counting and Linear Programming for Bounding Covering Numbers of Regular Hypergraphs.''
7'th SIAM conference on Discrete Mathematics, Albuquerque, NM, June, 1994. Transparencies.

Others

.
``Minimal Residual Method Stronger than Polynomial Preconditioning.''
Colorado Conference on Iterative Methods, Breckenridge, Colorado, April, 1994.

.
``Abduction in Logic Programming with Equality.''
Conference for Fifth Generation Computer Systems, Tokyo, Japan, June, 1992.

.
``Hypothetical Reasoning and Equality.''
Los Alamos National Laboratory, Los Alamos, New Mexico, March, 1992.

Tutorials and Teaching

.
``Introduction to Quantum Information''
Univ. of Colorado Physics Dept., One credit course, Spring 2004.

.
``Hopf Algebra Pictures'', with applications to models of q. comp. and q. codes.
For the ``Coherent Tangles'', 2003. Transparencies

.
``Linear Optics Quantum Computation I-V.''
IAP Seminars, MIT, January 18-25, 2002.

.
``Linear Optics Quantum Computation I-V.''
Six tutorial lectures, ITP at the Univ. of Cal. at Santa Barbara, Nov. 14, Dec 3, 2001.
Transparencies from the ITP: Overview, I, II, III, IV, V.

.
``Fault Tolerant Quantum Error Correction I and II.''
Quantum Computing Summer School, The Fields Institute, Toronto, May 15/16, 2001. Transparencies from the Fields Institute.

.
``Introduction to Quantum Error Correction I, II and III.''
IAP Seminars, MIT, January 21-24, 1999.

.
``Artificial Intelligence II: Hypothetical Reasoning.''
3 credit course, Tech. Univ. of Nova Scotia, Spring 1992.

.
``Introduction to the Design and Analysis of Algorithms.''
3 credit course, Tech. Univ. of Nova Scotia, Fall 1991.

.
``Combinatorics Seminar'', Informal course, Univ. of Colorado at Boulder, Fall, 1990.

.
``Calculus'', Teaching assistant, Univ. of Colorado at Boulder, 1989-90.

.
``Physics Lab'', Teaching assistant, Univ. of Mass. at Boston, 1983-84.

Advising

.
Mentor of Scott Glancy, NRC postdoc, NIST, Boulder.

.
PhD thesis committee of Chris Langer (Physics, CU Boulder, in progress).

.
PhD thesis defense committee of Jae I. Park (Physics, CU, 2004)

.
At LANL: Comentored three postdocs (A. Ashikmin, L. Viola and H. Barnum) and six graduate students (S. Hallgren, M. Nielsen, A. Coates, R. Rosenbaum, F. Souza, R. Somma).

Software Development

.
Pulse program parser and user interface modifications for ion trap quantum computing.
Language: C++. (2005)

.
Quantum stabilizer code and fault-tolerant architecture simulator.
Languages: Mathematica, Octave. (2004)

.
A system for compiling pulse sequences from logical specifications of quantum networks.
Languages: Matlab, Perl. (2000)

.
A pooling experiment analyzer based on a Monte Carlo method for maximum likelihood inference of positives.
Languages: C++. (1994)

.
The LACES preprint server for combinatorics and discrete mathematics. LACES is now absorbed in the arXiv preprint server system.
Languages: Perl, HTML. (1992)

Miscellaneous

.
APS Fellow, 2005

.
Professor Adjoint, Physics Dept., Univ. of Col. at Boulder

.
Associate editor for quantum information of IEEE Transactions on Information Theory since October 2002.

.
Adjunct Professor, Electrical & Computer Engineering, Univ. New Mexico 1994-2003.

.
Refereeing: More than 10 papers a year for many journals covering quantum information, including the Phys. Rev. series and Nature.

.
Listed on program committees of three conferences.

.
Member of the American Physical Society, the American Mathematical Society, the Mathematical Association of America, and IEEE.

.
Chancellor's Doctoral Fellowship, University of Colorado at Boulder, 1986-87.

.
Three LANL performance awards.

.
PI or co-PI on four LANL internal and one external project in quantum information science in the last five years.

.
I am regularly contacted by reporters for comments on quantum information topics. A sample of notable news items: A report on our NMR experiments in the New York Times (G. Johnson, D1-2, 03/27/01). One of the top ten ``breakthroughs'' of the year according to Science in 1998.

Document information: Last revised 7 February 2006.


Footnotes

... respectively.1
Search terms in title, abstract or subject: "quantum information" or "quantum communication" or "quantum algorithm" or "quantum computing" or "quantum computation" or "quantum complexity"

2006-02-07