An Introduction to Quantum Computing. Yanofsky, N. S *arXiv*, quant-ph, 2007. abstract bibtex Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics. It concerns a utilization of quantum mechanics to improve the efficiency of computation. Here we present a gentle introduction to some of the ideas in quantum computing. The paper begins by motivating the central ideas of quantum mechanics and quantum computation with simple toy models. From there we move on to a formal presentation of the small fraction of (finite dimensional) quantum mechanics that we will need for basic quantum computation. Central notions of quantum architecture (qubits and quantum gates) are described. The paper ends with a presentation of one of the simplest quantum algorithms: Deutsch's algorithm. Our presentation demands neither advanced mathematics nor advanced physics.

@Article{Yanofsky2007,
author = {Yanofsky, Noson S},
title = {An Introduction to Quantum Computing},
journal = {arXiv},
volume = {quant-ph},
number = {},
pages = {},
year = {2007},
abstract = {Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics. It concerns a utilization of quantum mechanics to improve the efficiency of computation. Here we present a gentle introduction to some of the ideas in quantum computing. The paper begins by motivating the central ideas of quantum mechanics and quantum computation with simple toy models. From there we move on to a formal presentation of the small fraction of (finite dimensional) quantum mechanics that we will need for basic quantum computation. Central notions of quantum architecture (qubits and quantum gates) are described. The paper ends with a presentation of one of the simplest quantum algorithms: Deutsch\'s algorithm. Our presentation demands neither advanced mathematics nor advanced physics.},
location = {},
keywords = {quant-ph}}

Downloads: 0

{"_id":"9AL6RxpWpJ6qvStng","bibbaseid":"yanofsky-anintroductiontoquantumcomputing-2007","authorIDs":[],"author_short":["Yanofsky, N. S"],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Yanofsky"],"firstnames":["Noson","S"],"suffixes":[]}],"title":"An Introduction to Quantum Computing","journal":"arXiv","volume":"quant-ph","number":"","pages":"","year":"2007","abstract":"Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics. It concerns a utilization of quantum mechanics to improve the efficiency of computation. Here we present a gentle introduction to some of the ideas in quantum computing. The paper begins by motivating the central ideas of quantum mechanics and quantum computation with simple toy models. From there we move on to a formal presentation of the small fraction of (finite dimensional) quantum mechanics that we will need for basic quantum computation. Central notions of quantum architecture (qubits and quantum gates) are described. The paper ends with a presentation of one of the simplest quantum algorithms: Deutsch's algorithm. Our presentation demands neither advanced mathematics nor advanced physics.","location":"","keywords":"quant-ph","bibtex":"@Article{Yanofsky2007,\nauthor = {Yanofsky, Noson S}, \ntitle = {An Introduction to Quantum Computing}, \njournal = {arXiv}, \nvolume = {quant-ph}, \nnumber = {}, \npages = {}, \nyear = {2007}, \nabstract = {Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics. It concerns a utilization of quantum mechanics to improve the efficiency of computation. Here we present a gentle introduction to some of the ideas in quantum computing. The paper begins by motivating the central ideas of quantum mechanics and quantum computation with simple toy models. From there we move on to a formal presentation of the small fraction of (finite dimensional) quantum mechanics that we will need for basic quantum computation. Central notions of quantum architecture (qubits and quantum gates) are described. The paper ends with a presentation of one of the simplest quantum algorithms: Deutsch\\'s algorithm. Our presentation demands neither advanced mathematics nor advanced physics.}, \nlocation = {}, \nkeywords = {quant-ph}}\n\n\n","author_short":["Yanofsky, N. S"],"key":"Yanofsky2007","id":"Yanofsky2007","bibbaseid":"yanofsky-anintroductiontoquantumcomputing-2007","role":"author","urls":{},"keyword":["quant-ph"],"downloads":0},"bibtype":"article","biburl":"https://gist.githubusercontent.com/stuhlmueller/a37ef2ef4f378ebcb73d249fe0f8377a/raw/6f96f6f779501bd9482896af3e4db4de88c35079/references.bib","creationDate":"2020-01-27T02:13:34.599Z","downloads":0,"keywords":["quant-ph"],"search_terms":["introduction","quantum","computing","yanofsky"],"title":"An Introduction to Quantum Computing","year":2007,"dataSources":["hEoKh4ygEAWbAZ5iy"]}