Quantum Circuit Simulation Book by John P. Hayes
Home > Technology & Engineering > Electronics & communications engineering > Electronics engineering > Electronic devices & materials > Quantum Circuit Simulation
Quantum Circuit Simulation

Quantum Circuit Simulation


     0     
5
4
3
2
1



International Edition


About the Book

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.
About 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.


Best Sellers



Product Details
  • ISBN-13: 9789048130641
  • Publisher: Springer
  • Publisher Imprint: Springer
  • Depth: 19
  • Height: 234 mm
  • No of Pages: 190
  • Series Title: English
  • Weight: 512 gr
  • ISBN-10: 9048130646
  • Publisher Date: 01 Dec 2009
  • Binding: Hardback
  • Edition: 2009 ed.
  • Language: English
  • Returnable: N
  • Spine Width: 13 mm
  • Width: 156 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Quantum Circuit Simulation
Springer -
Quantum Circuit Simulation
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Quantum Circuit Simulation

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!