QUANTUM COMPUTING - Bio-Inspired and Nanoscale Integrated Computing - page 69

3.1.3. Surveys of QC
The following are reviews and surveys have been made of QC: Bennett [10],
Barenco [11], Benio [12], Brassard [13, 14], Haroche, Raimond [15], Brassard [16],
Preskill [17], Scarani [18], Steane [19], and Vedral, Plenio [20]. Also, Taubes [21]
and Gershenfeld, Chuang [22] give popular press descriptions of QC. The
following are texts on quantum computing.
Overviews: [23-26]
Quantum information processing: [27-34]
Quantum cryptography: [35-37]
Quantum coding theory: [38, 39]
Quantum algorithms: [40]
Experimental implementation of quantum computation: [41-45]
3.1.4. Initial Work in QC
Feynman [46, 47] and Benioff [48] were the first to suggest the use of quantum
mechanical principles for doing computation. Deutsch and Jozsa [49] give the first
example of a quantum algorithm that gave a rapid solution of an example
problem, where the problem (for a given a black box function) is not quickly
solvable by any deterministic conventional computing machine. But their problem
could be quickly solved using randomization. Bernstein and Vazirani [50] then
provided the first example of a fast quantum algorithm for a problem that could
not be quickly solved by conventional computing machines even using randomi-
zation. (See also Costantini, Smeraldi [51] for a generalization of Deutsch's
example and see Collins et al. [52] for a simplified Deutsch-Jozsa algorithm,
and Jozsa [53-55] for further work in quantum computation and complexity.)
3.1.5. Organization of this Chapter
In Section 3.1 we introduced QC. In Section 3.2 we introduce formal quantum
computing models and in Section 3.3 we discuss quantum complexity classes. Next
we overview key topics concerning quantum information processing: Section 3.4
discusses bounds for quantum communication; Section 3.5 discusses methods
for quantum errorless compression; Section 3.6 discusses methods for quantum
error coding; and Section 3.7 describes methods for quantum cryptography. In
Section 3.8 we discuss further algorithmic applications of QC. In Section 3.9 we
enumerate various technologies for doing QC. In Section 3.10 we review of the
resource bounds of quantum computing as compared with the resources required
by classical methods for computation. In Section 3.11 we conclude the chapter. In
Appendix 3.12 we discuss the challenge of providing volume bounds for observa-
tion apparatus when doing QC.