\documentclass{article}
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{slide-article-tom}


\ifx\pdfoutput\undefined
     \usepackage[dvips]{graphicx}
\else
     \usepackage[pdftex]{graphicx}
     \pdfcompresslevel9
\fi

\usepackage{hyperref}

%\definecolor{Emerald}{cmyk}{1,0,0.50,0}
\hypersetup{colorlinks,
            linkcolor=blue,
            %pdfpagemode=FullScreen
            pdfpagemode=None
            }



%\usepackage{hyper}
%\usepackage{hthtml}
%\def\hyperref#1#2#3#4{\hturl{#1}}


%\def\@linkcolor{red}
%\def\@linkcolor{blue}
%\def\@anchorcolor{black}
%\def\@citecolor{green}
%\def\@filecolor{cyan}
%\def\@urlcolor{magenta}
%\def\@menucolor{red}
%\def\@pagecolor{red}


\def\pagedone{\newpage}

\def\tthdump#1{#1}

\tthdump{\def\sectionhead#1{\begin{center}{\LARGE\hypertarget{#1}
     {#1}\hyperlink{Our general topics:}{\hfil$\leftarrow$}}\end{center}}}
     
%%tth:\def\sectionhead#1{{\LARGE#1\hypertarget{#1}{#1}}
%%tth:     \special{html: <A NAME="#1"></A><a href="\#Top of file">       Top</a>}}

\tthdump{\def\exercises#1{\begin{center}{\LARGE Exercises: \hypertarget{#1.ex}
     {#1}\hyperlink{Our general topics:}{\hfil$\leftarrow$}}\end{center}}}
     
%%tth:\def\exercises#1{{\LARGE Exercises: #1\hypertarget{#1.ex}{#1.ex}}
%%tth:     \special{html: <A NAME="#1.ex"></A><a href="\#Top of file">       Top</a>}}

\tthdump{\def\quotesection#1{\begin{center}{\LARGE\hypertarget{#1}
     {#1}\hyperlink{The quotes}{\hfil$\twoheadleftarrow$}}\end{center}}}
     
%%tth:\def\quotesection#1{{\LARGE#1\hypertarget{#1}{#1}}
%%tth:     \special{html: <A NAME="#1"></A><a href="\#The quotes">       <-</a>}}

%%tth:\def\makehyperlink#1{\special{html: <a href="\##1">}{\large#1}\special{html: </a>}}

%%tth:\def\makehyperlinkex#1{\ \ \special{html: <a href="\##1">}{\large (ex)}\special{html: </a>}}

%%tth:\def\binom#1#2{\left(\begin{array}{c}#1\\#2\end{array}\right)}

\tthdump{\def\httimes{\times}}
%%tth:\def\httimes{x\ }

\tthdump{\def\mybigtriangledown{\bigtriangledown}}
%%tth:\def\mybigtriangledown{\mathrm{Del}}

\tthdump{\def\htvec#1{\vec{#1}}}
%%tth:\def\htvec#1{{\bf #1}}

\def\myspan{\mathrm{span}}
\def\matrix{\mathrm{matrix}}

\tthdump{\def\myreal{\mathbb{R}}}
%%tth:\def\myreal{\mathbf{R}}
%%\def\myreal{\Re}
\tthdump{\def\mycomplex{\mathbb{C}}}
%%tth:\def\mycomplex{\mathbf{C}}
\tthdump{\def\myfield{\mathbb{F}}}
%%tth:\def\myfield{\mathbf{F}}
\tthdump{\def\myquaternions{\mathbb{H}}}
%%tth:\def\myquaternions{\mathbf{H}}
\tthdump{\def\myrationals{\mathbb{Q}}}
%%tth:\def\myrationals{\mathbf{Q}}
\tthdump{\def\myintegers{\mathbb{Z}}}
%%tth:\def\myintegers{\mathbf{Z}}

%\def\dim\mathrm{dim}
\def\im{\mathrm{im}}
\def\deriv{\mathrm{D}}
\def\trace{\mathrm{trace}}
\def\detm{\mathrm{det}_m}
\def\detv{\mathrm{det}_v}
\def\perm{\mathrm{perm}}
\def\sign{\mathrm{sign}}

% kets and bras etc.
\def\ket#1{|{#1}\rangle}
\def\bra#1{\langle{#1}|}
\def\braket#1#2{\langle{#1}|{#2}\rangle}

%\def\sectionhead#1{\begin{center}{\LARGE #1}\end{center}}
%\def\sectionhead#1{\section{#1}}

% defines a 2 element column vector.
\def\col#1#2{\left(\begin{array}{c}#1\\#2\end{array}\right)}
\def\tcol#1#2{(#1, #2)^T}



%Symbols
\def\hilbert{\mathit{H}}
\def\complex{\mathbb{C}}
\def\tensor{\otimes}
\def\lnanda{\land\negthickspace\negthickspace\negthinspace\sim}
\def\lnandb{\land\negthickspace\negthickspace\negmedspace\negthinspace\sim}
\def\lnandc{\land\negthickspace\negthickspace\negmedspace\negthinspace\negthinspace\sim}
\def\lnandd{\land\negthickspace\negthickspace\negmedspace\negthinspace\negthinspace\negthinspace\sim}


\begin{document}
\raggedright
%%tth:\special{html: <A NAME="Top of file"></A>}

\pagestyle{myfooters}
%\pagestyle{plain}

\thispagestyle{empty}

%%tth:\special{html:<title> Extended references on quantum computing</title>}

%Slide 1
\title{{\LARGE\bf Extended references on quantum computing}}
\author{By various people -- gathered here by\newline Tom Carter
\newline
\newline
\newline
\tthdump{\href
{http://cogs.csustan.edu/\~tom/quantum}{http://cogs.csustan.edu/\~\ tom/quantum}}
%%tth:\href{http://cogs.csustan.edu/~tom/quantum}{http://cogs.csustan.edu/\~tom/quantum}
\vfill
. . .\newline
\newline
\newline
...
}

\date{May, 1999}

\maketitle

%Slide 2
\sectionhead{Our general topics:}

%%tth:\begin{itemize}

%%tth:\item
\tthdump{\hyperlink{Extended references}
               {\ \ $\circledcirc$ Extended references\newline}}
%%tth:\makehyperlink{Extended references}
%%tth:\item
\tthdump{\hyperlink{Selected on-line references}
               {\ $\circledcirc$ Selected on-line references\newline}}
%%tth:\makehyperlink{Selected on-line references}
%%tth:\end{itemize}


This is an unedited collection of references on quantum computation and related
topics that I gathered in 1999 from a variety of sources.  I claim no originality
for this compilation, and, unfortunately, I didn't keep good notes about where
I found many of these references.  I apologize to those to whom credit should go.

I hope it is all right to make this large list available purely to assist
researchers in the field \ldots

\pagedone


\footnotesize
\bibliographystyle{plain}
 
\tthdump{\hypertarget{Extended references}{}\hyperlink{Our general topics:}{\hfil To top $\leftarrow$}}
%%tth:{\special{html: <A NAME="Extended references"></A><a href="\#Top of file">       Top</a>}}
 
\begin{thebibliography}{12}

%%tth:{\special{html: <font size="+0">}}

\bibitem{abrams}
Abrams D S and Lloyd S, 
Simulation of Many-Body Fermi Systems on a Universal Quantum
Computer, 
{\em Phys.Rev.Lett.} {\bf 79}  2586--2589, 1997


\bibitem{abrams2}
Abrams D S and Lloyd S, 
Non-Linear Quantum Mechanics implies Polynomial Time 
solution for NP-complete and $\#$P problems,
%in {\it LANL e-print} quant-ph/9801041, http://xxx.lanl.gov (1998)
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9801041}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9801041}
{http://xxx.lanl.gov/abs/quant-ph/9801041}


\bibitem{adleman}
Adleman L, Demarrais J and Huang M-D,
Quantum Computability,
{\em SIAM Journal of Computation}
{\bf 26} 5 pp 1524--1540 October, 1997  

\bibitem{adleman2}
Adleman L, 
Molecular computation of solutions to combinatorial problems, 
{\em Science}, 266, 1021--1024, Nov. 11, 1994

\bibitem{aharonov1}
Aharonov D and Ben-Or M,
 Fault-Tolerant Quantum Computation with Constant Error,
{\em Proc. of the 29th Annual ACM Symposium on Theory of Computing (STOC)}
 1997 


\bibitem{aharonov2}
Aharonov D and Ben-Or M,
Polynomial Simulations of Decohered Quantum Computers
{\em 37th Annual Symposium on Foundations of Computer Science}
 (FOCS) pp 46--55, 1996

\bibitem{aharonov3}
Aharonov D, Kitaev A Yu and  Nisan N,
Quantum Circuits with Mixed States,
{\em Proc. of the 30th Annual ACM Symposium on 
Theory of Computing (STOC)} 1998


\bibitem{aharonov4}
Aharonov D, Ben-Or M, Impagliazo R and Nisan N,
Limitations of Noisy Reversible Computation,
in {\it LANL e-print} quant-ph/9611028, http://xxx.lanl.gov (1996)


\bibitem{aharonov5}
Aharonov D, Beckman D, Chuang I and  Nielsen M,
What Makes Quantum Computers Powerful? 
%http://wwwcas.phys.unm.edu/~mnielsen/science.html
\hyperref{http://wwwcas.phys.unm.edu/\~mnielsen/science.html}{}{}
%\hyperURL{http}{wwwcas.phys.unm.edu/~mnielsen}{science.html}
{http://wwwcas.phys.unm.edu/\~mnielsen/science.html}


\bibitem{anderson}
Anderson P W, More Is Different,
		{\em Science},
		{\bf 177},
		4047,
		393--396,1972


\bibitem{aharonov}
Aharonov, D., Quantum Computation,
Annual Reviews of Computational Physics VI,
Edited by Dietrich Stauffer, World Scientific, 1998

\bibitem{aspect1}
Aspect A, Dalibard J and Roger G, 
Experimental test of Bell's inequalities using time-varying analyzers,
{\em Phys. Rev. Lett.} {\bf 49}, 1804--1807, 1982

\bibitem{aspect2}
Aspect A, 
Testing Bell's inequalities,
{\em Europhys. News.} {\bf 22}, 73--75, 1991

\bibitem{bara}
 Barahona F, in {\it J. Phys. A} vol. 15, (1982) 3241 

\bibitem{barenco1}
Barenco A 
A universal two-bit gate for quantum computation,
{\em Proc. R. Soc. Lond. A} {\bf 449} 679--683, 1995


\bibitem{barenco2}
Barenco A and Ekert A K 
Dense coding based on quantum entanglement,
{\em J. Mod. Opt.} {\bf 42} 1253--1259, 1995


\bibitem{barenco3}
Barenco A, Deutsch D, Ekert E and Jozsa R, 
Conditional quantum dynamics and quantum gates,
{\em Phys. Rev. Lett.} {\bf 74} 4083--4086, 1995


\bibitem{barenco4}
Barenco A, Bennett C H, Cleve R, DiVincenzo D P, Margolus N,
Shor P, Sleator T, Smolin J A and Weinfurter H, 
Elementary gates for quantum computation,
{\em Phys. Rev. A} {\bf 52}, 3457--3467, 1995


\bibitem{barenco5}
Barenco A 1996
Quantum physics and computers,
Contemp. Phys. {\bf 37} 375--389 1996


\bibitem{barenco6}
Barenco A, Ekert A, Suominen K A and Torma P, 
Approximate quantum Fourier transform and decoherence,
{\em Phys. Rev. A} {\bf 54}, 139--146, 1996

\bibitem{sym}
Barenco A, Berthiaume A, Deutsch D, Ekert A, Jozsa R, and  Macchiavello C,
Stabilization of Quantum Computations by Symmetrization,
{\em  SIAM J. Comp.}{\bf 26},5, 1541--1557, 1997


\bibitem{barenco7}
Barenco A, Brun T A, Schak R and Spiller T P, 
Effects of noise on quantum error correction algorithms,
{\em Phys. Rev. A} {\bf 56} 1177--1188, 1997


\bibitem{barnum1}
Barnum H, Fuchs C A, Jozsa R and Schumacher B 1996
A general fidelity limit for quantum channels,
Phys. Rev. A {\bf 54} 4707-4711

\bibitem{barnum2}
Barnum H, Caves C,
 Fuchs C A, Jozsa R and Schumacher B,
Non commuting mixed states cannot be broadcast,
{\em Phys. Rev. Lett.}{\bf 76} 2818--2822,  1996 


\bibitem{barnum3}
Barnum H, Nielsen M and Schumacher B,
 in {\it  Phys. Rev. A}, {\bf 57},6, 1998, pp. 4153--4175

\bibitem{beals1}
Beals R, 
Quantum computation of Fourier transform over symmetric groups
{\em Proc. of the 29th Annual ACM Symposium on Theory of Computing (STOC)}
 1997 


\bibitem{beals2}
Beals R, Buhrman H, Cleve R, Mosca M and de Wolf R, 
Quantum Lower Bounds by Polynomials,
in {\em 39th Annual Symposium on Foundations of Computer Science(FOCS)}, (1998)


\bibitem{beckman1}
Beckman D, Chari A, Devabhaktuni S and Preskill J 
Efficient networks for quantum factoring,
{\em Phys. Rev. A} {\bf 54}, 1034--1063, 1996


\bibitem{bell}
Bell J S
On the Einstein-Podolsky-Rosen paradox,
{\em Physics} {\bf 1} 195--200, 1964

\bibitem{bell1}
Bell J S 
On the problem of hidden variables in quantum theory,
Rev. Mod. Phys. {\bf 38} 447-52, 1966
{\em Speakable and unspeakable in quantum mechanics} 1987
(Cambridge University Press) 


\bibitem{benioff1}
Benioff P,
The Computer as a Physical Systems: A Microscopic
Quantum Mechanical Hamiltonian Model of
 Computers as Represented by Turing
Machines, 
{\em 
J. Stat. Phys.} {\bf 22} 563--591, 1980


\bibitem{benioff2}
Benioff P 
Quantum mechanical Hamiltonian models of Turing machines,
{\em J. Stat. Phys.} {\bf 29} 515-546 1982

%Quantum mechanical models of Turing machines that
%dissipate no energy,
%{\em Phys. Rev. Lett.} {\bf 48} 1581--1585 1982


\bibitem{bennett1}
Bennett C H, 
Logical reversibility of computation,
{\em IBM J. Res. Develop.} {\bf 17} 525--532, 1973

\bibitem{bennett2}
Bennett C H, 
The Thermodynamics of Computation - a Review, 
 {\em International Journal of Theoretical Physics,} 
{\bf 21}, No. 12, p 905, 1982

\bibitem{bennett3}
Bennett C H and Landauer R, 
The fundamental physical limits of computation,
{\em Scientific American,} July 38--46, 1985 

\bibitem{bennett4}
Bennett C H, 
Demons, engines and the second law,
{\em Scientific American} {\bf 257} no. 5 (November) pp 88--96,
1987

\bibitem{bennett5}
Bennett C H, Brassard G, Briedbart S and Wiesner S, 
Quantum cryptography, or unforgeable subway tokens,
 {\em Advances in Cryptology: Proceedings of Crypto '82}
(Plenum, New York) pp 267--275, 1982

\bibitem{bennett6}
Bennett C H and Brassard G, 
Quantum cryptography: public key distribution and coin tossing,
in {\em Proc. IEEE Conf. on Computers, Syst. and Signal Process.}
pp 175--179, 1984

\bibitem{bennett7}
Bennett C H and Wiesner S J,
Communication via one- and two-particle operations on
Einstein-Podolsky-Rosen states,
{\em Phys. Rev. Lett.} {\bf 69}, 2881--2884, 1992

\bibitem{bennett8}
Bennett C H,
Quantum information and computation,
{\em Phys. Today} {\bf 48 10} 24--30, 1995



\bibitem{bennett9}
C.H. Bennett, 
Time/Space Trade-offs for Reversible Computation, 
{\em SIAM Journal of Computation}, {\bf 18}, 4, pp 766--776, 1989

\bibitem{bennett10}
Bennett C H and Brassard G 1989,
SIGACT News {\bf 20}, 78-82



\bibitem{bennett11}
Bennett C H, Bessette F, Brassard G, Savail L and Smolin J 
Experimental quantum cryptography,
{\em J. Cryptology} {\bf 5}, pp 3--28, 1992

\bibitem{bennett12}
Bennett C H
Quantum Computers: Certainty from Uncertainty, 
Nature, 362, 1993 


\bibitem{bennett13}
Bennett C H, Brassard G, Cr\'epeau C, Jozsa R, Peres A and
Wootters W K 
Teleporting an unknown quantum state via dual classical and
Einstein-Podolsky-Rosen channels,
{\em Phys. Rev. Lett.} {\bf 70} 1895--1898, 1993

\bibitem{bennettdiv}
Bennett C H,
Progress towards quantum computation
1995


\bibitem{bennett12} 
Bennett C H, Brassard G, Popescu S,
Schumacher B, Smolin J A and Wootters W K 1996a
Purification of noisy entanglement and faithful
teleportation via noisy channels,
Phys. Rev. Lett. {\bf 76} 722-725

\bibitem{bennett14} 
Bennett C H, DiVincenzo D P, Smolin J A
and Wootters W K 
Mixed state entanglement and quantum error correction, 
{\em Phys. Rev. A} {\bf 54} 3825, 1996 

\bibitem{bbbv}
Bennett C H, Bernstein E, Brassard G and Vazirani U 
Strengths and Weaknesses of quantum computing,
{\em SIAM Journal of Computation}
{\bf 26} 5 pp 1510--1523 October, 1997  

\bibitem{berman1}
Berman G P, Doolen G D, Holm D D, Tsifrinovich V I 
Quantum computer on a class of one-dimensional Ising
systems,
{\em Phys. Lett.} {\bf 193} 444-450 1994


\bibitem{bv}
Bernstein E and Vazirani U, 1993,
Quantum complexity theory,
{\em SIAM Journal of Computation}
{\bf 26} 5 pp 1411--1473 October, 1997 


\bibitem{bert1}
Berthiaume A, Deutsch D and Jozsa R, 
The stabilization of quantum computation, in
{\em Proceedings of the Workshop on Physics and
Computation, PhysComp 94} 60-62 Los Alamitos: IEEE
Computer Society Press, 1994

\bibitem{bert2}
Berthiaume A and Brassard G, 
The quantum challenge to structural complexity theory,
in {\em Proc. of the Seventh Annual Structure in Complexity Theory
Conference} 1992
(IEEE Computer Society Press, Los Alamitos, CA) 132--137 

\bibitem{bert3}
Berthiaume A and Brassard G,
Oracle quantum computing,
in {\em Proc. of the Workshop on Physics of Computation: PhysComp '92}
(IEEE Computer Society Press, Los Alamitos, CA) 60--62, 1992



\bibitem{bogosian}
Boghosian B M and Taylor W,
Simulating quantum mechanics on a quantum computer
in {\it Physica D}, 120 (1998) pp. 30-42

\bibitem{bohm1}
Bohm D 1951
{\em Quantum Theory}
(Englewood Cliffs, N. J.)

\bibitem{bohm2}
Bohm D and Aharonov Y 1957
Phys. Rev. {\bf 108} 1070

\bibitem{bollinger}
Bollinger J J, Heinzen D J, Itano W M, Gilbert S L and Wineland D J, 
{\em Phys Rev Lett} 63 1031, 1989

\bibitem{boneh}
D. Boneh, R. Lipton,
Quantum Cryptoanalysis Of Hidden Linear Functions, 
{\em Proceedings of CRYPTO'95}


\bibitem{bouwmeester}
 Bouwmeester D, Pan J-W, Mattle K, Weinfurter H, Zeilinger A,
Experimental quantum teleportation
{\em Nature} {\bf 390}, 575-579 1997



\bibitem{boyer1}
Boyer M, Brassard G, Hoyer P and Tapp A,
Tight bounds on quantum searching,
in {\it Fortsch.Phys.} 46, (1998) pp. 493-506 


\bibitem{brassard1}
Brassard G,
Searching a quantum phone book, 
{\bf Science} {\bf 275} 627-628 1997

\bibitem{brassard2}
Brassard G and Crepeau C,
{\em SIGACT News} {\bf 27} 13-24 1996

\bibitem{brassard3}
Brassard G, Hoyer P and Tapp A,
Quantum Algorithm for the Collision Problem
in {\it LANL e-print} quant-ph/9705002, http://xxx.lanl.gov (1997)


\bibitem{brassard4}
Brassard G and Hoyer P, 
An Exact Quantum-Polynomail Algorithm for Simon's Problem
{\em Proceedings of the 5th Israeli Symposium on Theory 
of Computing and Systems (ISTCS)}, 1997 



\bibitem{brassard5}
Brassard G,
Teleportation as Quantum Computation,
in {\it Physica D}, 120 (1998) 43-47


\bibitem{brassard6}
Brassard G,
The dawn of a new era for quantum cryptography: {T}he
experimental
         prototype is working!,
Sigact News,
{\bf 20}(4), 78--82, 1989

\bibitem{braunstein1}
Braunstein S L, Mann A and Revzen M 1992
Maximal violation of Bell inequalities for mixed states,
Phys. Rev. Lett. {\bf 68}, 3259-3261

\bibitem{braunstein2}
Braunstein S L and Mann A 1995
Measurement of the Bell operator and quantum teleportation,
Phys. Rev. A {\bf 51}, R1727-R1730


\bibitem{brillouin}
Brillouin L 1956,
{\em Science and information theory}
(Academic Press, New York)


\bibitem{brune}
Brune M, Nussenzveig P, Schmidt-Kaler F, Bernardot F, Maali A,
Raimond J M and Haroche S,
From Lamb shift to light shifts: vacuum and subphoton cavity fields
measured by atomic phase sensitive detection,
{\em Phys. Rev. Lett.} {\bf 72}, 3339-3342 1994


\bibitem{cleve3}
Buhrman H, Cleve R and van Dam W,
Quantum Entanglement and Communication Complexity,
in {\it LANL e-print} quant-ph/9705033,  http://xxx.lanl.gov (1997)


\bibitem{buhrman}
Buhrman H, Cleve R and Wigderson A,
Quantum vs. Classical Communication and Computation, in
{\em Proc. of the 30th Annual ACM Symposium on 
Theory of Computing (STOC)} (1998)



\bibitem{calshor}
Calderbank A R and Shor P W,
Good quantum error-correcting codes exist, 
{\em Phys. Rev. A} {\bf 54} 1098-1105,  1996


\bibitem{calderbank3}
Calderbank A R, Rains E M, Shor P W and Sloane N J A 
Quantum error correction and orthogonal geometry,
{\em Phys. Rev. Lett.} {\bf 78} 405--408, 1997

 
\bibitem{gf4}
Calderbank A R, Rains E M, Shor P W and Sloane N J A,
Quantum error correction via codes over $GF(4)$
in {\it LANL e-print} quant-ph/9608006,  http://xxx.lanl.gov (1996), 
To appear in {\it IEEE Transactions on Information Theory.}


\bibitem{caves1}
Caves C M 1990
Quantitative limits on the ability of a Maxwell Demon
to extract work from heat,
Phys. Rev. Lett. {\bf 64} 2111-2114

\bibitem{caves2}
Caves C M, Unruh W G and Zurek W H 1990
comment,
Phys. Rev. Lett. {\bf 65} 1387

\bibitem{chernoff}
Chernoff. 
See 
Feller W, An Introduction to Probability Theory and Its Applications, Wiley, New York,1957

\bibitem{decoherence}
Chuang I L, Laflamme R, Shor P W and Zurek W H,
Quantum computers, factoring, and decoherence,
{\em Science} {\bf 270} 1633--1635, 1995

\bibitem{decoherence2}
 Chuang I L, Laflamme R and Paz J P, 
Effects of Loss and Decoherence on a Simple Quantum Computer,
%in {\it LANL e-print} quant-ph/9602018,  http://xxx.lanl.gov (1996)
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9602018}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9602018}
{http://xxx.lanl.gov/abs/quant-ph/9602018}



\bibitem{chuang1}
I.Chuang and W.C.D. Leung and Y. Yamamoto, 
Bosonic Quantum Codes for Amplitude Damping,
in {\it Phys. Rev. A}, {\bf 56}, 2, (1997) pp. 1114-1125

\bibitem{chuang2}
Chuang I L and Yamamoto 
Creation of a persistent qubit using error correction
Phys. Rev. A {\bf 55}, 114--127, 1997


\bibitem{chuang3}
Chuang I L ,Vandersypen L M K, Zhou X, Leung D W and Lloyd S, 
Experimental realization of a quantum algorithm, 
in {\it Nature}, 393, 143-146 (1998)

\bibitem{church}
Church A 
An unsolvable problem of elementary number theory,
{\em Amer. J. Math.} {\bf 58} 345--363, 1936

%\bibitem{church2}
%modern church thesis

\bibitem{cirac1}
Cirac I J and Zoller P
\newblock Quantum computations with cold trapped ions,
{\em Phys. Rev. Let.}, 74: 4091-4094, 1995.

\bibitem{cirac2}
Cirac J I, Pellizari T and Zoller P,
Enforcing coherent evolution in dissipative quantum dynamics,
{\em Science} {\bf 273}, 1207, 1996

\bibitem{cirac3}
Cirac J I, Zoller P, Kimble H J and Mabuchi H 
Quantum state transfer and entanglement distribution among distant
nodes of a quantum network,
{\em Phys. Rev. Lett.} {\bf 78}, 3221, 1997


\bibitem{tsirelson}
Cirel'son (Tsirelson) B, 
Reliable storage of information in a system of unreliable 
components with local interactions.
{\em Lecture notes in Mathematics}{\bf 653} 15--30 ,1978


\bibitem{clausen}
Clausen M, 
Fast Generalized Fourier transforms, 
{\em Theoret. Comput. Sci.} {\bf 56} 55--63 1989 

\bibitem{clauser}
Clauser J F, Holt R A, Horne M A and Shimony A 
Proposed experiment to test local hidden-variable theories,
{\em Phys. Rev. Lett.} {\bf 23} 880--884, 1969

\bibitem{clauser1}
Clauser J F and Shimony A,
Bell's theorem: experimental tests and implications,
{\em Rep. Prog. Phys.} {\bf 41} 1881--1927, 1978


\bibitem{cleve}
Cleve R and DiVincenzo D P,
Schumacher's quantum data compression as a quantum computation,
{\em Phys. Rev. A} {\bf 54} 2636, 1996


\bibitem{cleve2}
Cleve R and Buhrman H,
Substituting Quantum Entanglement for Communication
in{\em Phys rev A,}{\bf 56} 2, (1997) pp. 1201-1204



\bibitem{cleve4}
Cleve R, van Dam W, Nielsen M and Tapp A, 
 Quantum Entanglement and the Communication Complexity of
 the Inner Product Function,
in {\it LANL e-print} quant-ph/9708019,  http://xxx.lanl.gov (1997)


\bibitem{cohentan}
C. Cohen-Tanoudji, 
{\em Quantum Mechanics}, 
Wiley press, New York (1977)

\bibitem{coppersmith}
Coppersmith D, 
An approximate Fourier transform useful in quantum factoring,
IBM Research Report RC 19642, 1994


\bibitem{fft}
Cormen T, Leiserson C and Rivest R, 
{\em Introduction to Algorithms}, 
 (pp 776--800 for FFT, 837--844 for primality test, 812 for extended Euclid 
algorithm, 834--836 for RSA cryptosystem) MIT press, 1990 


\bibitem{cory4} Cory D G, Fahmy A F, and  Havel T F,
Nuclear magnetic resonance spectroscopy: an experimentally
accessible paradigm for quantum computing, in {\em Proc. of the 4th
Workshop on Physics and Computation} (Complex Systems Institute,
Boston, New England) 1996

\bibitem{cory1}
D.~G. Cory, M.~P. Price, and  Havel T F,
\newblock {\em Physica D}, 1998.
\newblock In press (quant-ph/9709001).

\bibitem{cory2}
 Cory D. G, Fahmy A F, and  Havel T F
\newblock {\em Proc. Nat. Acad. of Sciences of the U. S.},
 94:1634--1639, 1997.



\bibitem{cory3}
 Cory D G,  Mass W, Price M, Knill E, Laflamme R,  Zurek W H, and
 Havel T F and Somaroo S S,
Experimental quantum error correction
in {\it Phys. Rev. Let.}{\bf 81} 10, (1998)
pp. 2152-2155



\bibitem{coding}
Cover T M and Thomas J A, 
{\em Elements of Information Theory,}
John Wiley and Sons, New York, 1991


\bibitem{crandall}
R.~E.~Crandall 
\newblock The challenge of large numbers,
In {\em Scientific American} February 59-62, 1997

\bibitem{chupp}
Chupp T.E and Hoare R.J,
{\em  Phys Rev Lett} 64 2261 1990


\bibitem{vandam2}
van Dam W, 
A Universal Quantum Cellular Automaton, 
{\em Proceedings of the Fourth Workshop on Physics and Computation}, 1996



\bibitem{deutsch1}
Deutsch D,
Quantum theory, the Church-Turing principle and the
universal quantum computer,
In {\em Proc. Roy. Soc. Lond.} A {\bf 400} 97-117, 1985

\bibitem{deutsch2}
Deutsch D,
Quantum computational networks,
In {\em Proc. Roy. Soc. Lond.} A {\bf 425} 73-90, 1989

\bibitem{deutsch3}
Deutsch D and Jozsa R,
Rapid solution of problems by quantum computation,
In {\em Proc. Roy. Soc. Lond} A {\bf 439} 553-558, 1992


\bibitem{deutsch4}
Deutsch D, Barenco A and Ekert A,  
Universality in quantum computation,
In {\em  Proc. R. Soc. Lond.} A {\bf 449} 669-677, 1995

\bibitem{deutsch5}
D.~Deutsch D and A.~Ekert and R.~Jozsa and C.~Macchiavello 
and S.~Popescu and A.~Sanpera 
Quantum privacy amplification and the security of
quantum cryptography over noisy channels,
In {\em Phys. Rev. Lett.} {\bf 77} 2818, 1996

\bibitem{diaconis}
Diaconis P and Rockmore D, 
Efficient Computation of the Fourier transform on finite groups,
{\em J. AMS} {\bf 3} No. 2, 297--332, 1990

\bibitem{dieks}
Dieks D,
Communication by {EPR} Devices,
Phys Lett A, 
92(6) 271--272 1982

\bibitem{cooling}
Diedrich F, Bergquist J C, Itano W M and.
Wineland D J 1989
Laser cooling to the zero-point energy of motion,
Phys. Rev. Lett. {\bf 62} 403


\bibitem{dieks}
Dieks D 1982
Communication by electron-paramagnetic-resonance devices,
Phys. Lett. A {\bf 92} 271


\bibitem{twobit}
DiVincenzo D P,
Two-bit gates are universal for quantum computation,
{\em Phys. Rev. A} {\bf 51} 1015-1022 1995

\bibitem{div-rev}
DiVincenzo D P, 
Quantum computation,
{\em Science} {\bf 270} 255-261 1995

\bibitem{divincenzo1}
DiVincenzo D P and Shor P W,
Fault-tolerant error correction with efficient quantum codes,
{\em Phys. Rev. Lett.} {\bf 77} 3260-3263,  1996


\bibitem{divincenzo2}
DiVincenzo D P,
Quantum Gates and Circuits,
in {\it 
Proceedings of the ITP Conference
     on Quantum Coherence and Decoherence}, December, (1996), Proc. R. Soc. London A





\bibitem{durr}
Durr C and Hoyer P, 
A Quantum Algorithm for Finding the Minimum,
in {\it LANL e-print} quant-ph/9607014,  http://xxx.lanl.gov (1996)

\bibitem{durr1}
Durr C, LeThanh H and Santha M, 
A decision procedure for well formed linear quantum 
cellular automata, 
{\em Proceeding of the 37th IEEE Symposium on Foundations of Computer Science},
       38--45, 1996, and 
{\em Random Structures $\&$ Algorithms}, 1997


\bibitem{epr}
Einstein A, Rosen N and Podolsky B,
{\em Phys. Rev.} {\bf 47}, 777 1935


\bibitem{ekert1}
Ekert A,
Quantum cryptography based on Bell's theorem
{\em Phys. Rev. Lett.} {\bf 67}, 661--663,  1996

\bibitem{ekert2}
Ekert A and Jozsa R 
Quantum computation and Shor's factoring algorithm,
{\em Rev. Mod. Phys.} {\bf 68} 733 1996

\bibitem{ekert3}
Ekert A and Macchiavello C 1996
Quantum error correction for communication,
Phys. Rev. Lett. {\bf 77} 2585-2588

\bibitem{ekert4}
Ekert A 1997
From quantum code-making to quantum code-breaking,
(preprint quant-ph/9703035)


\bibitem{vanenk}
van Enk S J, Cirac J I and Zoller P 1997
Ideal communication over noisy channels: a quantum optical implementation,
Phys. Rev. Lett. {\bf 78}, 4293-4296

\bibitem{farhi}
Another proof of the  parity lower bound, using interesting techniques,  
was found recently by 
E. Farhi, J. Goldstone, S. Gutmann, M. Sipser 
A Limit on the Speed of Quantum Computation in Determining Parity
in {\it LANL e-print} quant-ph/9802045,  http://xxx.lanl.gov (1998)




\bibitem{feynman1}
Feynman R P
Simulating physics with computers,
In {\em Int. J. Theor. Phys.} {\bf 21} 467-488, 1982

\bibitem{feynman2}
 Feynman R P,
\newblock Quantum mechanical computers,
In {\em Found. of Phys.} {\bf 16} 507-531, 1986
see also Optics News February 1985, 11-20.

\bibitem{Feynman-96}
R. Feynman,
\newblock Feynman lectures on computation, 1996.


\bibitem{fortnow}
Fortnow L and Rogers J,
Complexity Limitations on quantum computation
Technical report 97-003, DePaul University, School of Computer science,
1997

\bibitem{fredkin}
Fredkin E and Toffoli T 1982
Conservative logic,
Int. J. Theor. Phys. {\bf 21} 219-253

\bibitem{freedman}
Freedman M, 
Logic, P/NP and the quantum field computer, 
preprint, 1997



\bibitem{gacs}
P. Ga'cs,
Self Correcting Two Dimensional Arrays,
in {\em Randomness and Computation},1989,
edited by S. Micali, vol 5,
in series ``Advances in Computing Research",
  pages 240-241,246-248,
 series editor: F.P.Preparata

\bibitem{gacs1}
P. Ga'cs,
one dimensional self correcting array.

\bibitem{gardiner}
 Gardiner C W, Quantum Noise, Springer-Verlag,
Berlin, 1991

\bibitem{grey}
Garey M R and Johnson D S,
Computers and Intractability, 
published by Freeman and Company,
		New York,
		1979

\bibitem{gaudi}
A. Gaud\'{i}. The set of ropes is presented in {\em la sagrada familia}
in Barcelona, Spain. Pictures of {\em la sagrada familia} can be found in:  
http://futures.wharton.upenn.edu/
\~jonath22/Gaudi/eltemple.html



\bibitem{geroch}
R. Geroch and G. Hartle
 Computability and Physical theories
in {\em Between Quantum and Cosmos}
edited by Zurek and Van der Merwe and Miller,
Princeton University Press, 1988, 549-566

\bibitem{gershenfeld}
Gershenfeld N A and  Chuang I L
\newblock Bulk spin-resonance quantum computation,
{\em Science}, 275:350--356, 1997.


\bibitem{glauber}
Glauber R J 1986, 
in {\em Frontiers in Quantum Optics}, Pike E R and Sarker S, eds
(Adam Hilger, Bristol)


\bibitem{golay}
Golay M J E 1949 
Notes on digital coding,
Proc. IEEE {\bf 37} 657


\bibitem{gottesman1}
Gottesman D 1996
Class of quantum error-correcting codes saturating the quantum Hamming
bound,
Phys. Rev. A {\bf 54}, 1862-1868


\bibitem{gottesman2}
Gottesman D 
A theory of fault-tolerant quantum computation, 
in {\it Phys. Rev. A},{\bf 57} 127--137

\bibitem{gottesman5}
Gottesman D, Evslin J, Kakade D and Preskill J,  preprint (1996)




\bibitem{ghz}
Greenberger D M, Horne M A and Zeilinger A 1989
Going beyond Bell's theorem,
in {\em Bell's theorem, quantum theory and conceptions of the universe},
Kafatos M, ed, (Kluwer Academic, Dordrecht) 73-76

\bibitem{greenberger2}
Greenberger D M, Horne M A, Shimony A and Zeilinger A 1990
Bell's theorem without inequalities,
Am. J. Phys. {\bf 58}, 1131-1143

\bibitem{griffiths}
R. B. Griffiths and C. S. Niu 1996
Semi classical Fourier transform for quantum computation
in {\em Phys. Rev. Lett.} ,76, pp. 3228--3231


\bibitem{grover1}
 Grover L K,
Quantum mechanics helps in searching for a needle in a haystack, 
Phys. Rev. Lett. {\bf 79}, 325-328  1997
and the original STOC paper:
A fast quantum mechanical algorithm for database search
{\em Proc. of the 28th Annual ACM Symposium on 
Theory of Computing (STOC)} 212--221, 1996


\bibitem{grover2}
 Grover L K, 
A framework for fast quantum mechanical algorithms,
%in {\it LANL e-print} quant-ph/9711043,  http://xxx.lanl.gov (1997)
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9711043}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9711043}
{http://xxx.lanl.gov/abs/quant-ph/9711043}



\bibitem{grover3}
 Grover L K,
Quantum computers can search arbitrarily large databases by a single query
in {\it Phys. Rev. Let.} {\bf 79} 23, 4709--4712, 1997


\bibitem{grover4}
 Grover L K, 
A fast quantum mechanical algorithm for estimating the median,
%in {\it LANL e-print} quant-ph/9607024,  http://xxx.lanl.gov (1997)
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9607024}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9607024}
{http://xxx.lanl.gov/abs/quant-ph/9607024}

\bibitem{hagley}
Hagley E et. al, 
Generation of Einstein Podolsky Rosen pairs of atoms, 
{\em Phys. Rev. Lett,} {\bf 79}, 1--5, 1997


\bibitem{hamming1}
Hamming R W 1950 
Error detecting and error correcting codes,
Bell Syst. Tech. J. {\bf 29} 147

\bibitem{hamming2}
Hamming R W 1986
{\em Coding and information theory}, 2nd ed,
(Prentice-Hall, Englewood Cliffs)


\bibitem{hardy}
Hardy G H and Wright E M 1979
{\em An introduction to the theory of numbers}
(Clarendon Press, Oxford)


\bibitem{haroche} 
Haroche S and Raimond J-M 1996
Quantum computing: dream or nightmare?
Phys. Today August 51-52


\bibitem{hellman}
Hellman M E 1979
The mathematics of public-key cryptography,
Scientific American {\bf 241} August 130-139


\bibitem{hill} ??????
Hill R 1986
{\em A first course in coding theory}
(Clarendon Press, Oxford)


\bibitem{hodges}
Hodges A 1983
{\em Alan Turing: the enigma}
(Vintage, London)


\bibitem{hughes}
Hughes R J, Alde D M, Dyer P, Luther G G, Morgan G L ans Schauer M 1995
Quantum cryptography,
Contemp. Phys. {\bf 36} 149-163

\bibitem{hungerford}
Hungerford T W, 1974
{\em Algebra}
(Springer-Verlag, New York)
 
\bibitem{jones}
Jones D S 1979
{\em Elementary information theory}
(Clarendon Press, Oxford)


\bibitem{jones2}
A. J. Jones, M. Mosca and R. H. Hansen, 
Implementation of a Quantum Search Algorithm on a Nuclear Magnetic
     Resonance Quantum Computer, in 
{\it Nature} 393 (1998) 344-346, and see also A. J. Jones and M. Mosca, 
Implementation of a Quantum Algorithm to Solve Deutsch's Problem on a
     Nuclear Magnetic Resonance Quantum Computer, 
in {\it J. Chem. Phys.} 109 (1998) 1648-1653


\bibitem{jozsa1}
Jozsa R and Schumacher B 1994
A new proof of the quantum noiseless coding theorem,
J. Mod. Optics {\bf 41} 2343

\bibitem{jozsa2}
Jozsa R 1997
Entanglement and quantum computation,
appearing in {\em Geometric issues in the foundations of science},
Huggett S {\em et. al.}, eds, (Oxford University Press)

\bibitem{jozsa3}
Jozsa R 1997
Quantum algorithms and the Fourier transform,
submitted to {\em Proc. Santa Barbara conference on quantum coherence
and decoherence} (preprint quant-ph/9707033)

\bibitem{tsirelson1}
Khalfin L A and Tsirelson B S,
Quantum/Classical Correspondence in the 
Light of Bell's Inequalities. 
{\em Foundations of physics,}{\bf 22} No. 7, 879--948
July 1992

\bibitem{kelvin}
Lord Kelvin,  differential analyzer (1870), presented in the Science Museum of Aarhus, 
Denmark (1998)

\bibitem{keyes1}
Keyes R W and Landauer R 1970
IBM J. Res. Develop. {\bf 14}, 152

\bibitem{keyes2}
Keyes R W 
Science {\bf 168}, 796, 1970


\bibitem{kholevo}
Kholevo A S 1973
Probl. Peredachi Inf {\bf 9}, 3; Probl. Inf. Transm. (USSR) {\bf 9}, 177



\bibitem{kitaev0}
Kitaev A Yu, Quantum Computations: Algorithms and Error Corrections, 
in {\it Russian Math. Serveys}, {\bf 52}:6, 1191-1249

\bibitem{kitaev1}
Kitaev A Yu, 
Quantum measurements and the Abelian stablizer problem,
in {\it LANL e-print} quant-ph/9511026,  http://xxx.lanl.gov (1995)


\bibitem{kitaev2}
 Kitaev. A. Yu
 Quantum error correction with imperfect gates,
{\em Quantum Communication, Computing, and 
Measurement},
		eds: Hirota, Holevo and Caves,
		181--188,
		Plenum Press,
		New York, 1997.

\bibitem{kitaev3}
Kitaev A Yu 1997
Fault-tolerant quantum computation by anyons,
in {\it LANL e-print} quant-ph/9707021,  http://xxx.lanl.gov (1997)


\bibitem{kitaevNP}
A. Yu. Kitaev, 
private communication


\bibitem{knill1}
Knill E and Laflamme R, 
Concatenated quantum codes,
in {\it LANL e-print} quant-ph/9608012,  http://xxx.lanl.gov (1996)

\bibitem{knill2}
Knill E, Laflamme R, and Zurek W,
\newblock Resilient quantum computation,
 {\em Science}, vol 279, p.342, 1998. 

\bibitem{knill3}
Knill E and Laflamme R 1997
A theory of quantum error-correcting codes,
Phys. Rev. A {\bf 55} 900-911

\bibitem{knill4}
Knill E, Laflamme R and Zurek W H 1997
Resilient quantum computation: error models and thresholds
%in {\it LANL e-print} quant-ph/9702058,  http://xxx.lanl.gov (1997)
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9702058}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9702058}
{http://xxx.lanl.gov/abs/quant-ph/9702058}



\bibitem{knill5}
E. Knill,
Non-Binary Unitary Error Bases and Quantum Codes,
in {\it LANL e-print} quant-ph/9608048,  http://xxx.lanl.gov (1996)



\bibitem{knuth} 
Knuth D E 1981
{\em The Art of Computer Programming, Vol. 2: Seminumerical Algorithms},
2nd ed (Addison-Wesley).

\bibitem{watrous}
Kondacs A and Watrous J
On the power of Quantum Finite State Automata
{\em 38th Annal Symposium on Foundations of Computer Science},(FOCS)
1997

\bibitem{kwiat}
Kwiat P G, Mattle K, Weinfurter H, Zeilinger A, Sergienko A and Shih Y 1995
New high-intensity source of polarization-entangled photon pairs
Phys. Rev. Lett. {\bf 75}, 4337-4341





\bibitem{laflamme1}
R. Laflamme, E. Knill, W.H. Zurek, P. Catasti and S. Marathan.
\newblock quant-ph/9709025, 1997.

\bibitem{laflamme2}
Laflamme R, Miquel C, Paz J P and Zurek W H 1996
Perfect quantum error correcting code,
Phys. Rev. Lett. {\bf 77}, 198-201


\bibitem{landauer1} 
Landauer R.
\newblock Is quantum mechanics useful? 
{\em Phil. Trans. Roy. Soc. of London},
  353:367--376, 1995.


\bibitem{landauer2}
Landauer R 1961 IBM J. Res. Dev. {\bf 5} 183, 
and 1970 IBM J. Res. Dev,  volume 14, page 152.

\bibitem{landauer3} ??????
Landauer R 1991
Information is physical,
Phys. Today May 1991 23-29

\bibitem{landauer4} ?????????????
Landauer R 1996
The physical nature of information,
Phys. Lett. A {\bf 217} 188


\bibitem{lecerf}
Lecerf Y 1963
Machines de Turing r\'eversibles . R\'ecursive insolubilit\'e
en $n \in N$ de l'equation $u=\theta^n u$, o\`u $\theta$ est un
isomorphisme de codes,
C. R. Acad. Francaise Sci. {\bf 257}, 2597-2600

\bibitem{leung}
Leung D W, Nielsen M A, Cuang I L and Yamamuto Y, 
Approximate quantum error correction can lead to better codes
in {\it Phys. Rev. A},{\bf 56}, 1, 2567--2573, 1997

\bibitem{levitin}
Levitin L B 1987
in {\em Information Complexity and Control in Quantum Physics},
Blaquieve A, Diner S, Lochak G, eds (Springer, New York) 15-47

\bibitem{lidar}
Lidar D A and Biham O 1996
Simulating Ising spin glasses on a quantum computer
(preprint quant-ph/9611038)

\bibitem{lint}
van Lint J H
Coding Theory, Springer-Verlag, 1982

\bibitem{lipton}
Lipton R J, 
Using DNA to solve NP-complete problems. 
{\em Science}, {\bf 268} 542--545, Apr. 28, 1995

\bibitem{lloyd2}
Lloyd S,
\newblock Universal quantum simulators, 
{\em Science}, 273:1073--1078, 1996.


\bibitem{lloyd3}
Lloyd S 1993
A potentially realisable quantum computer,
Science {\bf 261} 1569; see also Science {\bf 263} 695 (1994).

\bibitem{lloyd4}
Lloyd S 1995
Almost any quantum logic gate is universal,
Phys. Rev. Lett. {\bf 75}, 346-349

\bibitem{lloyd5}
Lloyd S 1997
The capacity of a noisy quantum channel,
Phys. Rev. A {\bf 55} 1613-1622

\bibitem{lo}
Lo H-K and Chau H F 1997
Is quantum bit commitment really possible?,
Phys. Rev. Lett. {\bf 78} 3410-3413



\bibitem{loss}
Loss D and DiVincenzo D P 
Quantum Computation with Quantum Dots,
in {\it Phys. Rev. A},{\bf 57},1,  pp. 120-126, 1997

\bibitem{macwilliams}
MacWilliams F J and Sloane N J A 1977
{\em The theory of error correcting codes},
(Elsevier Science, Amsterdam)


\bibitem{majumder} ??
Majumder et.al Phys. rev.lett. 65 2931 (1990)

\bibitem{mattle}
Mattle K, Weinfurter H, Kwiat P G and Zeilinger A 1996
Dense coding in experimental quantum communication,
Phys. Rev. Lett. {\bf 76}, 4656-4659.


\bibitem{margolus1}
Margolus N 1986
Quantum computation,
Ann. New York Acad. Sci. {\bf 480} 487-497

\bibitem{margolus2}
Margolus N 1990 
Parallel Quantum Computation,
in {\em Complexity, Entropy and the Physics of
Information, Santa Fe Institute Studies in the Sciences
of Complexity,} vol VIII p. 273
ed Zurek W H (Addison-Wesley)


\bibitem{maxwell}
Maxwell J C 1871
{\em Theory of heat} (Longmans, Green and Co, London)


\bibitem{mayers1}
Mayers D 1997
Unconditionally secure quantum bit commitment is impossible,
Phys. Rev. Lett. {\bf 78} 3414-3417

\bibitem{mayers2}
Mayers D 1997
secure key distribution


\bibitem{menezes}
Menezes A J, van Oorschot P C and Vanstone S A 1997
{\em Handbook of applied cryptography}
(CRC Press, Boca Raton)

\bibitem{mermin}
Mermin N D 1990
What's wrong with these elements of reality?
Phys. Today (June) 9-11


\bibitem{meyer}
Meyer D A 1996
Quantum mechanics of lattice gas automata I: one particle plane
waves and potentials,
(preprint quant-ph/9611005)


\bibitem{minsky}
Minsky M L 1967 
{\em Computation: Finite and Infinite Machines}
(Prentice-Hall, Inc., Englewood Cliffs, N. J.; also London 1972)


\bibitem{miquel1}
Miquel C, Paz J P and Perazzo 1996
Factoring in a dissipative quantum computer
Phys. Rev. A {\bf 54} 2605-2613

Miquel C, Paz J P and Zurek W H 1997
Quantum computation with phase drift errors,
Phys. Rev. Lett. {\bf 78} 3971-3974

\bibitem{monroe1}
Monroe C, Meekhof D M, King B E, Jefferts S R,
Itano W M, Wineland D J and Gould P 1995a
Resolved-sideband Raman cooling of a bound atom to the
3D zero-pointenergy,
Phys. Rev. Lett. {\bf 75} 4011-4014

\bibitem{monroe2}
Monroe C,  Meekhof D M, King B E,  Itano W M and  Wineland D J.
\newblock Demonstration of a universal quantum logic gate,
{\em Phys. Rev. Lett.}, 75:4714-4717, 1995.


\bibitem{mott}
N. F. Mott, 
The wave Mechanics of $\alpha$-Ray Tracks, 
in {\it Proc. Roy. Soc. London}, A126, 79-84, (1929), 
and in  {\it Quantum Theory and Measurement}, edited by 
Wheeler J A and Zurek W H, Princeton Univ. Press, Princeton, NJ (1983)


\bibitem{mukamel}
Mukamel D, private communication



\bibitem{myers}
Myers J M 1997.
Can a universal quantum computer be fully quantum?
Phys. Rev. Lett. {\bf 78}, 1823-1824



\bibitem{neumann}
von Neumann, 
Probabilistic logic and the synthesis of reliable organisms
		  from unreliable components,
in {\em automata studies( Shanon,McCarthy eds)}, 1956 


\bibitem{nisan}
Nisan N and Szegedy M, 
On the degree of Boolean functions as real polynomials, 
{\em Proc. of the 24th Annual ACM Symposium on 
Theory of Computing (STOC)} 1992

\bibitem{nielsen1}
Nielsen M A and Chuang I L 1997
Programmable quantum gate arrays,
Phys. Rev. Lett. {\bf 79}, 321-324

\bibitem{palma}
Palma G M, Suominen K-A \& Ekert A K 1996
Quantum computers and dissipation,
Proc. Roy. Soc. Lond. A {\bf 452} 567-584

\bibitem{papa}
Papadimitriou C H, 
Computational Complexity, 
Addison-Wesley,
1994

\bibitem{optic}
J. Mod. Opt. {\bf 41}, no 12 1994
Special issue: quantum communication 



\bibitem{ozhi}
See also in this context: 
Y. Ozhigov, 
Quantum computers cannot speed up iterated applications of a black box, 
in {\it LANL e-print} quant-ph/9712051,  http://xxx.lanl.gov (1997)


\bibitem{pellizzari}
Pellizzari T, Gardiner S A, Cirac J I and Zoller P 1995
Decoherence, continuous observation, and quantum
computing: A cavity QED model,
Phys. Rev. Lett. {\bf 75} 3788-3791

\bibitem{peres}
Peres A 1993
{\em Quantum theory: concepts and methods}
(Kluwer Academic Press, Dordrecht)


\bibitem{phoenix}
Phoenix S J D and Townsend P D 1995
Quantum cryptography: how to beat the code breakers using quantum mechanics,
Contemp. Phys. {\bf 36}, 165-195


\bibitem{pippenger}, 
Pippenger and Stamoulis and Tsitsiklis, 
On a Lower Bound for the Redundancy of Reliable Networks with Noisy Gates, 
in {\em IEEETIT: IEEE Transactions on Information Theory}, 
volume 37, 1991 

\bibitem{plenio}
Plenio M B and Knight P L 1996
Realisitic lower bounds for the factorization time of large numbers
on a quantum computer,
Phys. Rev. A {\bf 53}, 2986-2990.


\bibitem{polkinghorne}
Polkinghorne J 1994
{\em Quarks, chaos and Christianity}
(Triangle, London)

\bibitem{preskill1}
J.~Preskill.
\newblock {\em Proc. Roy. Soc. of London A}, in press.


\bibitem{preskill2}
Preskill J 1997
Fault tolerant quantum computation,
%in {\it LANL e-print} quant-ph/9712048,  http://xxx.lanl.gov (1997), 
to appear in {\it Introduction to Quantum
Computation},  edited by H.-K. Lo, S. Popescu, and T. P. Spiller
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9712048}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9712048}
{http://xxx.lanl.gov/abs/quant-ph/9712048}

\bibitem{preskill3}
Preskill J, Kitaev A, Course notes for Physics 229, Fall 1998, Caltech Univ.,
%http://www.theory.caltech.edu/ people/preskill/ph229
\hyperref{http://www.theory.caltech.edu/people/preskill/ph229}{}{}
%\hyperURL{http}{www.theory.caltech.edu/people/preskill}{ph229}
{http://www.theory.caltech.edu/people/preskill/ph229}



\bibitem{privman}
Privman V, Vagner I D and Kventsel G 1997
Quantum computation in quantum-Hall systems,
in {\it Phys. Lett. A}, 239 (1998) 141-146


\bibitem{rabin79} 
 Rabin M O, 
   Probabilistic Algorithms
{\em    Algorithms and Complexity: New Directions 
and Recent Results}, pp. 21-39,
   Academic Press, 1976.



\bibitem{rains1}
Rains E, Nonbinary quantum codes,
(quant-ph/9703048)

\bibitem{rains2}
Rains E, Hardin R H, Shor P W and  Sloane N J A, 
A non additive quantum code, 
Phys.Rev.Lett. 79 953--954 1997

\bibitem{rieffel}
Rieffel E, Polak W
An Introduction to Quantum Computing for Non-Physicists
%{\it LANL e-print} quant-ph/9809016,  http://xxx.lanl.gov (1998),
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9809016}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9809016}
{http://xxx.lanl.gov/abs/quant-ph/9809016}


\bibitem{rsa}
Rivest R, Shamir A and Adleman L 1979
On digital signatures and public-key cryptosystems,
MIT Laboratory for Computer Science, Technical Report, MIT/LCS/TR-212


\bibitem{sakurai}
J.J.Saqurai 
Modern Quantum Mechanics, revised edition.
Addison Wesley, 1994


\bibitem{shro}
Schroeder M R 1984
{\em Number theory in science and communication}
(Springer-Verlag, Berlin Heidelberg)


\bibitem{schumacher1}
Schumacher B 1995
Quantum coding,
Phys. Rev. A {\bf 51} 2738-2747


\bibitem{umesh}
L. J. Schulman and U. Vazirani
in {\it LANL e-print} quant-ph/9804060,  http://xxx.lanl.gov (1998), 


\bibitem{schumacher2}
Schumacher B W and Nielsen M A 1996
Quantum data processing and error correction
Phys Rev A {\bf 54}, 2629

\bibitem{shamir}
Shamir A 1979
Factoring Numbers in O(log(n)) Arithmetic Steps,
in {\it Information Processing Letters 8(1)}
28-31.

\bibitem{shankar}
Shankar R 1980
{\em Principles of quantum mechanics}
(Plenum Press, New York)

\bibitem{shannon}
Shannon C E 1948 
A mathematical theory of communication
Bell Syst. Tech. J. {\bf 27} 379; also p. 623



\bibitem{shor1}
Shor P W,
\newblock Polynomial-time algorithms for prime factorization and
discrete logarithms on a quantum computer,
 {\em SIAM J. Comp.}, {\bf 26}, No. 5, pp 1484--1509, 
October 1997




\bibitem{shor2}
Shor P W,
\newblock Scheme for reducing decoherence in quantum computer memory,
{\em Phys. Rev. A}, 52: 2493-2496, 1995.


\bibitem{shor3}
 Shor P W,
\newblock Fault tolerant quantum computation, 
In {\em Proceedings of the 37th Symposium on the Foundations of Computer
  Science}, pages 56--65, Los Alamitos, California, 1996. IEEE press.
\newblock quant-ph/9605011.

\bibitem{shor4}
Shor P W and Laflamme R 1997
Quantum analog of the MacWilliams identities for classical coding theory,
Phys. Rev. Lett. {\bf 78} 1600-1602



\bibitem{jsimon}
Simon J
On feasible numbers,
in 
{\em Proc. of the 9th Annual ACM Symposium on 
Theory of Computing (STOC)}  195-207, 1977

\bibitem{simon}
Simon D 1994
On the power of quantum computation,
 {\em SIAM J. Comp.}, {\bf 26}, No. 5, pp 1474--1483, 
October 1997

\bibitem{simon2}
Simon D 1998, private communication.

\bibitem{slepian}
Slepian D 1974 ed,
{\em Key papers in the development of information theory}
(IEEE Press, New York)

\bibitem{solovay}
R Solovay and A. C-C Yao,
preprint, 1996

\bibitem{spiller}
Spiller T P 1996
Quantum information processing: cryptography, 
computation and teleportation,
Proc. IEEE {\bf 84}, 1719-1746


\bibitem{steane1}
Steane A, 
\newblock Multiple particle interference and quantum error correction,
 {\em Proc. Roy. Soc. of London A}, 452:2551-2577, 1996.


\bibitem{steane2}
Steane A M,
Error correcting codes in quantum theory,
Phys. Rev. Lett. {\bf 77} 793-797, 1996,
Simple quantum error-correcting codes,
Phys. Rev. A {\bf 54}, 4741-4751, 1996,
Quantum Reed-Muller codes,
submitted to IEEE Trans. Inf. Theory (preprint in {\it LANL e-print} quant-ph/9608026, 
 http://xxx.lanl.gov)
Active stabilization, quantum computation, and quantum state synthesis,
Phys. Rev. Lett. {\bf 78}, 2252-2255, 1997

\bibitem{Steane-97}
Steane A,
Quantum Computation, Reports on Progress in Physics 61 (1998) 117, preprint in 
%{\it LANL e-print} quant-ph/9708022, http://xxx.lanl.gov)
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9708022}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9708022}
{http://xxx.lanl.gov/abs/quant-ph/9708022}

\bibitem{steane6}
Steane A M 
The ion trap quantum information processor,
Appl. Phys. B {\bf 64} 623-642 1997


\bibitem{steane7}
Steane A M 
Space, time, parallelism and noise requirements for reliable
quantum computing,
in {\it Fortsch. Phys.} {\bf 46} (1998) 443-458


\bibitem{stern1}
 Stern A, Aharonov Y and Imry Y, "Phase uncertainty and loss of
interference: a general picture" Phys. Rev. A {\bf 41}, 3436 (1990).
and
 "Dephasing of interference
by a back reacting environment" in "Quantum coherence" ed. J. Anandan,
World Scientific, 1990.


\bibitem{szilard}
Szilard L 1929 Z. Phys. {\bf 53} 840;
translated in Wheeler and Zurek (1983).

\bibitem{teich}
Teich W G, Obermayer K and Mahler G 1988
Structural basis of multistationary quantum systems II. Effective
few-particle dynamics,
Phys. Rev. B {\bf 37} 8111-8121

\bibitem{tittel}
W. Tittel, J. Brendel, B. Gisin, T. Herzog, H. Zbinden, N. Gisin
Experimental demonstration of quantum-correlations over more than 10
     kilometers, 
in {\it Phys. Rev. A},{\bf  57}, 3229 (1998)

\bibitem{toffoli}
Toffoli T 1980
Reversible computing,
in {\em Automata, Languages and Programming}, Seventh Colloquium,
Lecture Notes in Computer Science, Vol. 84, de Bakker J W and
van Leeuwen J, eds, (Springer) 632-644



\bibitem{turchette}
Turchette Q A, Hood C J, Lange W, Mabushi H and Kimble H J 1995
Measurement of conditional phase shifts for quantum logic,
Phys. Rev. Lett. {\bf 75} 4710-4713


\bibitem{turing}
Turing A M 1936
On computable numbers, with an application to the
Entschneidungsproblem,
Proc. Lond. Math. Soc. Ser. 2 {\bf 42}, 230 ; see also
Proc. Lond. Math. Soc. Ser. 2 {\bf 43}, 544 


\bibitem{unroh1}
 Unruh W G,
\newblock Maintaining coherence in quantum computers,
{\em Phys. Rev. A}, 51:992--997, 1995.

\bibitem{valiant}
Valiant, unpublished

\bibitem{valiant2}
Valiant L. G, 
Negation can be exponentially powerful.
{\em Theoretical Computer Science,}
       12(3):303-314, November 1980. 

\bibitem{valiant3}
Valiant L G and  Vazirani V V.
 NP is as easy as detecting unique solutions. 
{\em Theoretical
       Computer Science,} 47(1):85-93, 1986

\bibitem{vedral}
Vedral V, Barenco A and Ekert A 1996 
Quantum networks for elementary arithmetic operations,
Phys. Rev. A {\bf 54} 147-153


\bibitem{vergis} 
Vergis A, Steiglitz K and Dickinson B , "The Complexity of Analog
Computation", Math. Comput. Simulation 28, pp. 91-113. 1986


\bibitem{walsworth}
Walsworth et.al. Phys rev. lett. 64,2599, 1990.

\bibitem{warren1}
 Warren W S,
\newblock {\em Science}, 277:1688--1698, 1997.




\bibitem{watrous2}
Watrous J, 
On one Dimensional quantum cellular automata, 
{\em Complex Systems} {\bf 5} (1), pp 19--30, 1991



\bibitem{weinfurter}
Weinfurter H 1994
Experimental Bell-state analysis,
Europhys. Lett. {\bf 25} 559-564



\bibitem{weisner1}
Wiesner S 1983
Conjugate coding,
SIGACT News {\bf 15} 78-88


\bibitem{weisner2}
Wiesner S 1996
Simulations of many-body quantum systems by a quantum computer
in {\it LANL e-print} quant-ph/9603028, 
 http://xxx.lanl.gov (1996)


\bibitem{wheeler}
Wheeler J A and Zurek W H, eds, 1983
{\em Quantum theory and measurement}
(Princeton Univ. Press, Princeton, NJ)


\bibitem{wigderson}
A. Wigderson, private communication

\bibitem{wineland}
Wineland D J, Monroe C, Itano W M, Leibfried D, King B, and
Meekhof D M 1997
Experimental issues in coherent quantum-state manipulation of trapped
atomic ions,
preprint, submitted to Rev. Mod. Phys.


\bibitem{wootters}
Wootters W K and Zurek W H 1982
A single quantum cannot be cloned,
Nature {\bf 299}, 802

\bibitem{wootters1}
Wootters W K
A Measure of the Distinguishability of Quantum States
{\em 
Quantum Optics, General Relativity, and Measurement}
eds: Marlan O. Scully and Pierre Meystre,
145--154, Plenum Press, New York, 1983



\bibitem{yao}
Yao A C-C,
Quantum circuit complexity,
in {\em 33th Annual Symposium on Foundations of Computer Science(FOCS)}, (1993) pp. 352--361




\bibitem{zalka1}
Zalka C, 
Efficient simulation of quantum systems by quantum computers
{\em Proc. Roy. Soc. of London A}, in press,
in {\it LANL e-print} quant-ph/9603026,
 http://xxx.lanl.gov (1996)



\bibitem{zalka2}
Zalka C, 
Grover's quantum searching algorithm is optimal,
%in {\it LANL e-print} quant-ph/9711070 http://xxx.lanl.gov (1997)
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9711070}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9711070}
{http://xxx.lanl.gov/abs/quant-ph/9711070}

\bibitem{zbinden}
Zbinden H, Gautier J D, Gisin N, Huttner B, Muller A, Tittle W 1997
Interferometry with Faraday mirrors for quantum cryptography,
Elect. Lett. {\bf 33}, 586-588

\bibitem{zurek1}
 Zurek W H,  
Decoherence and the transition from quantum to classical, 
Physics Today 44(10), October, 1991 36--44. 


\bibitem{zurek2}
Zurek W H 1989 
Thermodynamic cost of computation, algorithmic complexity and the
information metric,
Nature {\bf 341} 119-124



\end{thebibliography}

\tthdump{\hyperlink{Our general topics:}{\hfil To top $\leftarrow$}}
%%tth:{\special{html: <a href="\#Top of file">       Back to top of file</a>}}

\pagedone

\sectionhead{Selected on-line references}


Some of the references listed above are available on line.
A few are listed again here for easy access:

%\bibitem{abrams2}
Abrams D S and Lloyd S, 
Non-Linear Quantum Mechanics implies Polynomial Time 
solution for NP-complete and $\#$P problems,
%in {\it LANL e-print} quant-ph/9801041, http://xxx.lanl.gov (1998)
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9801041}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9801041}
{http://xxx.lanl.gov/abs/quant-ph/9801041}


%\bibitem{aharonov5}
Aharonov D, Beckman D, Chuang I and  Nielsen M,
What Makes Quantum Computers Powerful? 
\hyperref{http://wwwcas.phys.unm.edu/\~mnielsen/science.html}{}{}
%\hyperURL{http}{wwwcas.phys.unm.edu/~mnielsen}{science.html}
{http://wwwcas.phys.unm.edu/\~mnielsen/science.html}
% 
% 

%\bibitem{decoherence2}
 Chuang I L, Laflamme R and Paz J P, 
Effects of Loss and Decoherence on a Simple Quantum Computer,
%in {\it LANL e-print} quant-ph/9602018,  http://xxx.lanl.gov (1996)
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9602018}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9602018}
{http://xxx.lanl.gov/abs/quant-ph/9602018}

%\bibitem{grover2}
 Grover L K, 
A framework for fast quantum mechanical algorithms,
%in {\it LANL e-print} quant-ph/9711043,  http://xxx.lanl.gov (1997)
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9711043}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9711043}
{http://xxx.lanl.gov/abs/quant-ph/9711043}

%\bibitem{grover4}
 Grover L K, 
A fast quantum mechanical algorithm for estimating the median,
%in {\it LANL e-print} quant-ph/9607024,  http://xxx.lanl.gov (1997)
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9607024}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9607024}
{http://xxx.lanl.gov/abs/quant-ph/9607024}


%\bibitem{knill4}
Knill E, Laflamme R and Zurek W H 1997
Resilient quantum computation: error models and thresholds
%in {\it LANL e-print} quant-ph/9702058,  http://xxx.lanl.gov (1997)
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9702058}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9702058}
{http://xxx.lanl.gov/abs/quant-ph/9702058}

\pagedone


%\bibitem{preskill2}
Preskill J 1997
Fault tolerant quantum computation,
%in {\it LANL e-print} quant-ph/9712048,  http://xxx.lanl.gov (1997), 
to appear in {\it Introduction to Quantum
Computation},  edited by H.-K. Lo, S. Popescu, and T. P. Spiller
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9712048}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9712048}
{http://xxx.lanl.gov/abs/quant-ph/9712048}

%\bibitem{preskill3}
Preskill J, Kitaev A, Course notes for Physics 229, Fall 1998, Caltech Univ.,
\hyperref{http://www.theory.caltech.edu/people/preskill/ph229}{}{}
%\hyperURL{http}{www.theory.caltech.edu/people/preskill}{ph229}
{http://www.theory.caltech.edu/people/preskill/ph229}


%\bibitem{rieffel}
Rieffel E, Polak W
An Introduction to Quantum Computing for Non-Physicists
%{\it LANL e-print} quant-ph/9809016,  http://xxx.lanl.gov (1998),
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9809016}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9809016}
{http://xxx.lanl.gov/abs/quant-ph/9809016}

%\bibitem{Steane-97}
Steane A,
Quantum Computation, Reports on Progress in Physics 61 (1998) 117,
%(preprint in {\it LANL e-print} quant-ph/9708022, http://xxx.lanl.gov)
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9708022}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9708022}
{http://xxx.lanl.gov/abs/quant-ph/9708022}

%\bibitem{zalka2}
Zalka C, 
Grover's quantum searching algorithm is optimal,
%in {\it LANL e-print} quant-ph/9711070http://xxx.lanl.gov (1997)
\hyperref{http://xxx.lanl.gov/abs/quant-ph/9711070}{}{}
%\hyperURL{http}{xxx.lanl.gov/abs/quant-ph}{9711070}
{http://xxx.lanl.gov/abs/quant-ph/9711070}

\tthdump{\hyperlink{Our general topics:}{\hfil To top $\leftarrow$}}
%%tth:{\special{html: <a href="\#Top of file">       Back to top of file</a>}}


\end{document}