Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Quantum Computing Algorithms
  • Table Of Contents Toc
  • Feedback & Rating feedback
Quantum Computing Algorithms

Quantum Computing Algorithms

By : Barry Burd
4.6 (7)
close
close
Quantum Computing Algorithms

Quantum Computing Algorithms

4.6 (7)
By: Barry Burd

Overview of this book

Navigate the quantum computing spectrum with this book, bridging the gap between abstract, math-heavy texts and math-avoidant beginner guides. Unlike intermediate-level books that often leave gaps in comprehension, this all-encompassing guide offers the missing links you need to truly understand the subject. Balancing intuition and rigor, this book empowers you to become a master of quantum algorithms. No longer confined to canned examples, you'll acquire the skills necessary to craft your own quantum code. Quantum Computing Algorithms is organized into four sections to build your expertise progressively. The first section lays the foundation with essential quantum concepts, ensuring that you grasp qubits, their representation, and their transformations. Moving to quantum algorithms, the second section focuses on pivotal algorithms — specifically, quantum key distribution and teleportation. The third section demonstrates the transformative power of algorithms that outpace classical computation and makes way for the fourth section, helping you to expand your horizons by exploring alternative quantum computing models. By the end of this book, quantum algorithms will cease to be mystifying as you make this knowledge your asset and enter a new era of computation, where you have the power to shape the code of reality.
Table of Contents (19 chapters)
close
close
Lock Free Chapter
2
Part 1 Nuts and Bolts
7
Part 2 Making Qubits Work for You
10
Part 3 Quantum Computing Algorithms
14
Part 4 Beyond Gate-Based Quantum Computing

Chapter 7, Deutsch’s Algorithm

      1. This circuit is not reversible. When x = y, the output is 01 regardless of whether x and y are both 0 or x and y are both 1. When x y, the output is 10 regardless of which input is 0 and which is 1.
      2. The number of correct shots varies quite a lot because the amount of noise isn’t predictable. Also, some quantum computers tend to be less noisy than others. On IBM devices, the number of correct shots out of 100 is typically in the 90s but sometimes in the 80s.
      3. The CNOT gate affects both the top and bottom qubits. But when we add an X gate, we add it to the bottom qubit. The top qubit (the qubit that we eventually measure) remains unchanged.
      4. This circuit implements the Opposite_of function. The leftmost X gate reverses the roles of inputs 0 and 1 from what they’d be with the Identity function. Then, the rightmost X gate restores the top qubit to its original 0 value or 1 value. That rightmost X gate has no effect on...
Visually different images
CONTINUE READING
83
Tech Concepts
36
Programming languages
73
Tech Tools
Icon Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.
Icon Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.
Icon 50+ new titles added per month and exclusive early access to books as they are being written.
Quantum Computing Algorithms
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist download Download options font-size Font size

Change the font size

margin-width Margin width

Change margin width

day-mode Day/Sepia/Night Modes

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Confirmation

Modal Close icon
claim successful

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY

Submit Your Feedback

Modal Close icon
Modal Close icon
Modal Close icon