Abstract
We provide a brief review of Boolean logic, the circuit model of computation, and I show how to assemble logic gates from their Boolean components. I present examples of classical circuits, including the half, full and ripple adder, and discuss reversible and irreversible gates. Quantum logic gates, including the Pauli, Hadamard and controlled-not gates are introduced, and we learn how to construct quantum circuits from them. The notions of quantum parallelism and interference enable Deutsch’s algorithm, the first proof-of-principle for quantum advantage. We dissect the quantum circuit for the Deutsch-Josza algorithm and demonstrate its ability to perform massively parallel computations; a capability inaccessible to machines based on the bit paradigm. We introduce and discuss the unitary time development of quantum states.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Michael E. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Information, Cambridge U. Press, 2011
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Zygelman, B. (2018). Circuit Model of Computation. In: A First Introduction to Quantum Computing and Information. Springer, Cham. https://doi.org/10.1007/978-3-319-91629-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-91629-3_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91628-6
Online ISBN: 978-3-319-91629-3
eBook Packages: Computer ScienceComputer Science (R0)