Kitaev, shen and vyalyi, classical and quantum computation interesting but idiosyncratic. In this book, chris bernhardt offers an introduction to quantum computing that is accessible to anyone who is comfortable with high. I would start with quantum computing since democritus by scott aaronson. Classical and quantum computation graduate studies in.
Grovers algorithm, shors factoring algorithm, and the abelian hidden subgroup problem. Grovers algorithm, shors factoring algorithm, and the abelian hidden. Home browse by title books classical and quantum computation. Dawson school of physical sciences, the university of queensland, brisbane, queensland 4072, australia michael a. Related topics, such as parallel quantum computation, a quantum analog of np completeness, and quantum errorcorrecting codes, are discussed. Download classical and quantum computation graduate. Pdf classical and quantum computing download full pdf. Advanced undergraduates, graduate students, research mathematicians, physicists, and computer scientists interested in computer science and quantum theory. So computation is the main ingredient and component of both computational number theory and quantum computational number theory. In this chapter, we shall give an account of the basic concepts and results in both classical and quantum computation theories, that will be used in the rest of the book. Classical and quantum computation has 2 available editions to buy at half price books marketplace.
This is a collection of lecture notes from three lectures given by alexei kitaev at the 2008 les houches summer school exact methods in lowdimensional physics and quantum computing. The book begins with the basics of classical theory of computation. Topics in classical and quantum computing statistical. Classical and quantum computation american mathematical society. February 1, 2008 abstract a twodimensional quantum system with anyonic excitations can be considered as a quantum computer. For those of you interested in quantum information theory, the book by mark wilde, from classical to quantum shannon theory, is a great res ource, and it is also available online. Among other interesting topics are toric codes and their relation to the anyon approach to quantum computing. Turing machines, boolean circuits, parallel algorithms, probabilistic computation, npcomplete problems, and the idea of complexity of an algorithm. Alexei yu kitaev california institute of technology a h shen. Buy classical and quantum computation book at easons. While other books, such as nielsenchuang, serve as more or less comprehensive references, the present book by kitaev et al is focussed on complexity. John watrous, umesh vazirani, andrew childs, scott aaronson. Pdf classical and quantum computation download full. Other useful books are quantum computation and quantum information by nielsen and chuang nc, classical and quantum computation by kitaev, shen, and vyalyi ksv, quantum computing since democritus by aaronson, and quantum information theory by wilde.
For web page which are no longer available, try to retrieve content from the of the internet archive if available load content from web. Pdf classical and quantum computation download full pdf. John preskills quantum computation course at caltech. Kitaev, california institute of technology, pasadena, ca, a. Classical and quantum computation books publications of. Classical and quantum computation graduate studies in mathematics pdf download classical and quantum computation graduate studies in mathematics read. They provide a pedagogical introduction to topological phenomena in 1d superconductors and in the 2d topological phases of the toric code and honeycomb model. Lester j senechal this book presents a concise introduction to an emerging and increasingly important topic, the theory of quantum computing. Another great book is the book by kitaev, shen and vialyi, classical and quantum computation. Classical and quantum computation graduate studies in mathematics this book is an introduction to a new and rapidly developing topic. Unitary transformations can be performed by moving the excitations.
This book is an introduction to a new rapidly developing theory of quantum computing. Apr 15, 2010 kitaev s model became known as the toric code, because it is designed to correct errors in a quantum system which is constructed in the surface of a torus. The book starts with the basics of classical theory of computation, including npcomplete. Prerequisites include linear algebra, group theory and probability, and algorithms. This text presents an integrated development of co. Shen, independent university of moscow, moscow, russia and m. Other useful books are quantum computation and quantum information by nielsen and chuang nc, classical and quantum computation by kitaev, shen, and vyalyi ksv, quantum computing since democritus by aaronson, the theory of quantum information by watrous, and quantum. Our result indicates that strong quantum fluctuation melts the competing large unit.
It is informally known as mike and ike, after the candies of that name. Read or download classical and quantum computation. Classical and quantum computation books publications. Quantum computing is a beautiful fusion of quantum physics and computer science, incorporating some of the most stunning ideas from twentiethcentury physics into an entirely new way of thinking about computation. They describe what a quantum computer is, how it can be used to solve problems faster than familiar classical computers, and the realworld implementation of quantum computers. Included are a complete proof of the solovaykitaev theorem with accurate algorithm complexity bounds, approximation of unitary operators by circuits of doubly logarithmic depth. Nielsen and chuang, quantum computation and quantum information an encyclopedic reference for quantum information theory. Turing machines, boolean circuits, parallel algorithms, probabilistic computation, npcomplete problems. While other books, such as nielsenchuang, serve as more or lesscomprehensive references, the present book by kitaev et al is focussed on complexity. Classical and quantum computation semantic scholar. Classical and quantum computation about this title. Nielsen school of physical sciences, the university of queensland.
Vyalyi, independent university of moscow, moscow, russia. Sipser introduction to the theory of computation kitaev et al. Alexei yu kitaev california institute of technology. Vyalyi, booktitlegraduate studies in mathematics, year2002. A very rigorous book on the topic of quantum computation and complexity which builds up from classical complexity. Their book concludes with an explanation of how quantum states can be used to perform remarkable feats of communication, and of how it is possible to protect quantum. In analogy with classical computation, where an algorithm written in a. Other useful books are quantum computation and quantum information by nielsen and chuang nc, classical and quantum computation by kitaev, shen, and vyalyi ksv, quantum computing since democritus by aaronson, the theory of quantum information by watrous, and quantum information theory by wilde. By the end of the book, readers understand that quantum computing and classical computing are not two distinct disciplines, and that quantum computing is the fundamental form of.
M n vyalyi an introduction to a rapidly developing topic. The topic topological qc will require knowledge of some concepts of field theory. Yu kitaev, 9780821832295, available at book depository with free delivery worldwide. The canonical reference for learning quantum computing is the textbook quantum computation and quantum information by nielsen and chuang. Nielsen has also a free online book on neural network and deep learning. Another good book with more of a little yellow book experience is classical and quantum computation by kitaev, shen and vyalyi. Then the authors introduce general principles of quantum computing and pass to the study of main quantum computation algorithms.
Vyalyi american mathematical society providence, rhode island graduate studies in mathematics volume 47. The book is an introduction to a new rapidly developing topic. Kitaev s model became known as the toric code, because it is designed to correct errors in a quantum system which is constructed in the surface of a torus. Magnetic field induced quantum phases in a tensor network. Quantum computation and quantum information is a textbook about quantum information science written by michael nielsen and isaac chuang, regarded as a standard text on the subject. Classical and quantum computation ams bookstore american. This is a suitable textbook for a graduate course in quantum computing. Quantum computing theory is at the intersection of math.
Its a relatively light book that will teach you the basics of theoretical computer science, quantum mechanics and other topics in a fun and intuitive way, without going into. Dawson school of physical sciences, the university of queensland, brisbane, queensland 4072, australia. The book can be used by graduate and advanced undergraduate students and. He defines quantum gates, considers the speed of quantum algorithms, and describes the building of quantum computers.
Quantum computation and quantum information wikipedia. Download classical and quantum computation graduate studies. In the classical limit, the 8, 18, and 32site magnetic orders are stabilized in a similar parameter regime 28. Dec 19, 2002 included are a complete proof of the solovaykitaev theorem with accurate algorithm complexity bounds, approximation of unitary operators by circuits of doubly logarithmic depth.
The toric code belongs to a class of quantum errorcorrecting codes called stabilizer codes. I wouldnt recommend it as a first course but instead for a second course which focuses more on rigorous proofs. By the end of the book, readers understand that quantum computing and classical computing are not two distinct disciplines, and that quantum computing is the fundamental form of computing. Aim to use quantum mechanical phenomena that have no classical counterpart for computational purposes. Graduate studies in mathematics publication year 2002.
This book is an introduction to a new rapidly developing topic. Jan 01, 2002 a very rigorous book on the topic of quantum computation and complexity which builds up from classical complexity. Vyalyi american mathematical society providence, rhode island graduate studies in mathematics. The book starts with the basics of classical theory of computation, including np complete. The mathematical prerequisits are minimal, but a reader with some understanding of basic ideas from cs, and from quantum theory at the level of ch 1 in nielsenchuang, will get more out of kitaev et al. The book assumes minimal prior experience with quantum mechanics and with computer science, aiming instead to be a selfcontained introduction.
1502 243 1181 907 447 228 1333 1457 48 443 587 491 766 1189 238 1436 1178 1330 1510 1473 928 240 1276 1273 122 1321 1272 260 1273 403 270 378 93 325 32 1341 1302