Basics of Quantum Computation
A. O. Pittenger · Birkhäuser Boston eBooks · 2001
In this chapter we build on the basic model developed in Chapter 1 by extending the notation to handle quantum systems with multiple qubits. With that terminology in place, we can illustrate the ideas which are basic to quantum algorithms and can confirm theoretically that the unitary transformations we need can be implemented as a sequence of operations involving only one or two qubits. Quantum algorithms can be constructed using a small number of quantum gates, and we discuss those gates next. We then use quantum gates to construct an addition subroutine and complete the chapter with a teleportation subroutine, which is the first illustration of the potential importance of entanglement for communication.