Quantum Logic: Efficient Implementation of Classical Computations
Daniel D. Stancil, Gregory T. Byrd · 2022
In this chapter, the authors describe how to implement classical computations, such as addition and multiplication, using quantum gates. However, there are very good reasons to consider efficient quantum implementations of classical logic. First, these operations are embedded as kernels in important quantum algorithms, such as Shor's algorithm for factoring large integers, and Grover's search algorithm. Second, classical computations can be performed on quantum information, and the authors show how logical operations operate on general quantum states. With a basic understanding of reversible logic, they discuss how to do arithmetic and logic operations on qubits. The authors focus on implementing common arithmetic operations on unsigned binary integers, using a binary adder as an example. They consider operations that affect the phase of the quantum state. Phase adds a quantum twist to the topic of computational logic.