XVI Figures 17.15 Representation of computational complexity 660 17.16 Boolean transformation of an initial bit Device for solving Deutsch's problem 17.18 Device for solving Deutsch's problem for n+1 input states 17.19 Device for solving Deutsch's problem for n+m input states 17.20 Representation of Shor's theorem 17.21 Implementation of Grover's algorithm 17.22 Computational steps in Grover's algorithm 17.23 Classical error correction 667 17.24 Quantum circuit for error correction 669 17.25 Environmental wave functions and their overlapping as a function of time in quantum computation 670 xvi Figures 17.15 Representation of computational complexity 660 17.16 Boolean transformation of an initial bit 660 17.17 Device for solving Deutsch’s problem 661 17.18 Device for solving Deutsch’s problem for n + 1 input states 662 17.19 Device for solving Deutsch’s problem for n + m input states 662 17.20 Representation of Shor’s theorem 664 17.21 Implementation of Grover’s algorithm 666 17.22 Computational steps in Grover’s algorithm 666 17.23 Classical error correction 667 17.24 Quantum circuit for error correction 669 17.25 Environmental wave functions and their overlapping as a function of time in quantum computation 670