Quantum Circuit Simulation / Edition 1

Hardcover (Print)
Buy New
Buy New from BN.com
Used and New from Other Sellers
Used and New from Other Sellers
from $117.55
Usually ships in 1-2 business days
(Save 26%)
Other sellers (Hardcover)
  • All (8) from $117.55   
  • New (6) from $117.55   
  • Used (2) from $194.80   


Quantum Circuit Simulation covers the fundamentals of linear algebra and introduces basic concepts of quantum physics needed to understand quantum circuits and algorithms. It requires only basic familiarity with algebra, graph algorithms and computer engineering. After introducing necessary background, the authors describe key simulation techniques that have so far been scattered throughout the research literature in physics, computer science, and computer engineering. Quantum Circuit Simulation also illustrates the development of software for quantum simulation by example of the QuIDDPro package, which is freely available and can be used by students of quantum information as a "quantum calculator."

Read More Show Less

Editorial Reviews

From the Publisher

From the reviews:

“The book serves as an indispensable guide to efficient quantum information processing simulation, but is also a great starting point for both learning the area and pursuing future research. … this is an extremely useful, stimulating and readable book that has been compiled with great care and attention to detail. It is greatly recommended for anyone interested in using or researching computer simulations of quantum information processing systems.” (Zeljko Zilic, Quantum Information Processing, Vol. 12, 2013)

Read More Show Less

Product Details

  • ISBN-13: 9789048130641
  • Publisher: Springer Netherlands
  • Publication date: 12/2/2009
  • Edition description: 2009
  • Edition number: 1
  • Pages: 190
  • Product dimensions: 6.40 (w) x 9.30 (h) x 0.80 (d)

Meet the Author

George Viamontes has a Ph.D. in Computer Science and Enginering from the University of Michigan where his research was focused on quantum circuit simulation. Through a Department of Energy fellowship for high-performance computer science, he completed a portion of his graduate research at Los Alamos National Laboratory. Upon graduation, Dr. Viamontes spent a year at Lockheed Martin Advanced Technology Laboratories where he continued to work on quantum circuit simulation.Currently he develops and implements algorithms for high-frequency automated trading and continues to consult for Lockheed Martin on quantum computing projects.

Igor L. Markov is an associate professor of Electrical Engineering and Computer Science at the University of Michigan. He received his Ph.D. in Computer Science from UCLA. Currently he is a member of the Executive Board of ACM SIGDA, Editorial Board member of Communications of ACM, ACM TODAES, IEEE Transactions on Computers, IEEE Transactions on CAD, as well as IEEE Design & Test. Prof. Markov researches computers that make computers. He has co-authored two books and more than 160 refereed publications, some of which were honored by the best-paper awards at the Design Automation and Test in Europe Conference (DATE), the Int'l Symposium on Physical Design (ISPD) and IEEE Trans. on Computer-Aided Design. Prof. Markov is the recipient of a DAC Fellowship, an ACM SIGDA Outstanding New Faculty award, an NSF CAREER award, an IBM Partnership Award, and a Microsoft A. Richard Newton Breakthrough Research Award.

John P. Hayes received the B.E. degree from the National University of Ireland, Dublin, and the M.S. and Ph.D. degrees from the University of Illinois, Urbana-Champaign, all in electrical engineering. While at the University of Illinois, he participated in the design of the ILLIAC III computer. In 1970 he joined the Operations Research Group at the Shell Benelux Computing Center in The Hague, where he worked on mathematical programming and software development. From 1972 to 1982 he was a faculty member of the Departments of Electrical Engineering–Systems and Computer Science of the University of Southern California, Los Angeles. Since 1982 he has been with the Electrical Engineering and Computer Science Department of the University of Michigan, Ann Arbor, where he holds the Claude E. Shannon Endowed Chair in Engineering Science.

Read More Show Less

Table of Contents

1 Introduction. 1.1 Quantum Circuits. 1.2 Quantum Simulation. 1.3 Book. 2 Gate Modeling and Circuit Simulation. 2.1 Classical Digital Circuits. 2.2 Simulation with Binary Decision Diagrams. 2.3 Sequential Circuits and Synchronization. 2.4 Summary. 3 Linear Algebra and Quantum Mechanics. 3.1 Linear Algebra. 3.2 Quantum Mechanics. 3.3 Summary. 4 Quantum Information Processing. 4.1 Quantum Gates. 4.2 Quantum Circuits. 4.3 Synchronization of Quantum Circuits. 4.4 Sample Algorithms. 4.5 Summary. 5 Special Case: Simulating Stabilizer Circuits. 5.1 Basics of a Quantum Circuit Simulator. 5.2 Stabilizer States, Gates and Circuits. 5.3 Data structures. 5.4 Algorithms. 5.5 Summary. 6 Generic Circuit Simulation Techniques. 6.1 Qubit-wise Multiplication. 6.2 P-blocked Simulation. 6.3 Tensor Networks. 6.4 Slightly-entangled Simulation. 6.5 Summary. 7 State-Vector Simulation with Decision Diagrams. 7.1 Quantum Information Decision Diagrams. 7.2 Scalability of QuIDD-based Simulation. 7.3 Empirical Validation. 7.4 Related Decision Diagrams. 7.5 Summary. 8 Density-Matrix Simulation with QuIDDs. 8.1 QuIDD Properties and Density Matrices. 8.2 QuIDD-based Outer Product. 8.3 QuIDD-based Partial Trace. 8.4 Empirical Validation. 8.5 Summary. 9 Checking Equivalence of States and Circuits. 9.1 Quantum Equivalence Checking. 9.2 Global-Phase Equivalence. 9.3 Relative-Phase Equivalence. 9.4 Empirical Validation. 9.5 Summary. 10 Improving QuIDD-based Simulation. 10.1 Gate Algorithms. 10.2 Dynamic Tensor Products and Partial Tracing. 10.3 Empirical Validation. 10.4 Summary. 11 Closing Remarks. A QuIDDPro Simulator. A.1 Running the Simulator. A.2 Functions and Code in Multiple Files. A.3 Language Reference. B QuIDDPro Examples. B.1 Well-known Quantum States. B.2 Grover’s Search Algorithm. B.3 Shor’s Integer Factoring Algorithm. References. Index.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)