September 26, 2025 • 25 mins
A comprehensive guide for individuals seeking to understand and implement quantum programs using Python and the IBM Quantum platform. It explores fundamental quantum computing principles like superposition, entanglement, and interference, detailing how these concepts underpin the creation of quantum circuits. The text also provides practical instruction on utilizing Qiskit, an open-source framework, for programming quantum systems, and examines methods for optimizing circuits, simulating noise models, and applying error suppression and mitigation techniques. Finally, the book introduces various quantum algorithms, from foundational oracle-based examples to more advanced applications in areas like search and periodicity, equipping readers with the skills to develop their own quantum solutions.
You can listen and download our episodes for free on more than 10 different platforms:
https://linktr.ee/cyber_security_summary
Get the Book now from Amazon:
https://www.amazon.com/Learn-Quantum-Computing-Python-IBM/dp/1803244801?&linkCode=ll1&tag=cvthunderx-20&linkId=4495bc678826629a99739ff78e5b130f&language=en_US&ref_=as_li_ss_tl
You can listen and download our episodes for free on more than 10 different platforms:
https://linktr.ee/cyber_security_summary
Get the Book now from Amazon:
https://www.amazon.com/Learn-Quantum-Computing-Python-IBM/dp/1803244801?&linkCode=ll1&tag=cvthunderx-20&linkId=4495bc678826629a99739ff78e5b130f&language=en_US&ref_=as_li_ss_tl
Mark as Played
Transcript
Episode Transcript
Available transcripts are automatically generated. Complete accuracy is not guaranteed.
Speaker 1 (00:00):
You know that feeling right when you need to get
up to speed on something really complex fast, but you're
just drowning in articles and papers.
Speaker 2 (00:06):
Yeah, totally information overload exactly.
Speaker 1 (00:09):
So we're here to give you that shortcut, that deep
dive to get you properly informed. Today we're jumping into
a field that's honestly reshaping how we even think about computation.
Speaker 2 (00:19):
It really is. We're talking quantum computing, and our mission
today is to untack the core ideas, look at the
tools making it accessible, which is amazing, and even touch
on some algorithms that sound like science.
Speaker 1 (00:32):
Fiction, they really do. Our main guide here is the
second edition of Learn Quantum Computing with Python and IBM
Quantum by Robert Laredo. He's an IBM Mastered inventor, a
quantum ambassador, just brilliant and.
Speaker 2 (00:46):
A great guy too. Donated his previous books royalties to
Doctors Without Borders. We're also pulling in insights from reviewers
like Haci Norlen, Mikhail Grossey, Sean Wagner, all deep in
the IBM Quantum and caskit world.
Speaker 1 (00:58):
So whether you're prepping for that big meeting or just
trying to figure out what all the buzz is about.
Or maybe you're just super curious, which you should be. Huh. Yeah,
this deep dive should give you those aha moments. We're
aiming to show how these really abstract ideas are becoming concrete.
Speaker 2 (01:15):
Tools, right without making your head explode hopefully.
Speaker 1 (01:19):
Okay, so let's start at the beginning. Quantum mechanics sounds intimidating,
but it's the bedrock of all this. We're talking about
the rules governing the universe at the tiniest scales, the
sub atomic level.
Speaker 2 (01:29):
Yeah, the foundations laid by you know, the giants Schrodinger, Plank, Heisenberg,
Drach Einstein. Their work described a world that's just fundamentally
weird compared to our everyday experience, and that weirdness is key, right,
Like the double slit experiment exactly, that's a classic. You
fire single particles like photons at two slits, you'd expect
two lines on the screen behind it, right, Yeah, it
(01:51):
makes sense, but you don't get that. You get an
interference pattern like waves canceling out and adding up. It
shows particles behaving like waves. This wave part duality. It's
not just a cool fact, it's something Quantum computers actively use.
Speaker 1 (02:05):
So we all get classical bits on off zero one
transistors doing their thing. But the quantum version, the quibit. Yeah,
that's the heart of it. What makes it so different.
Speaker 2 (02:16):
Well, the huge difference is superposition Equibit isn't just zero
or one. It can be zero, it can be one,
or it can be a combination of both at the
exact same.
Speaker 1 (02:26):
Time, both like simultaneously.
Speaker 2 (02:28):
Kind of think of it less like a hidden state
like a spinning coin before it lands, and more like, well,
the quantum state itself is a blend of possibilities until
you measure it. Measuring forces it to choose zero or one.
Speaker 1 (02:40):
You mentioned a spinning coin, but you said it's not
like that. Yeah, that the quantum outcome is truly random.
That sounds profound. Are we saying there's no hidden instruction
determining the outcome?
Speaker 2 (02:51):
That's exactly what standard quantum mechanics says. Yeah, it's fundamentally probabilistic,
not just we don't know enough, but actually random. And
that's a massive conceptual leap. It means quantum computers work
with probabilities directly.
Speaker 1 (03:03):
Wow, Okay, that changes things.
Speaker 2 (03:05):
It does, and that leads to the second key, difference entanglement.
This is the one Einstein called famously spooky action at
a distance.
Speaker 1 (03:13):
Spooky action. I love that phrase. What does it actually
mean for quibits?
Speaker 2 (03:17):
It means you can link two or more quibits together
in a special way, so intimately linked that measuring the
state of one quibbit instantly tells you the state of
the other, no matter how far apart they are, instantly
across any distance, instantly. If you have two entangled quibits
and measure one is zero, you know the other is zero.
If one's one, the other's one, always correlate. It's like
(03:38):
they're still connected, sharing the same fate. It's a crucial resource.
Speaker 1 (03:41):
Okay, superposition entanglement. Yeah, and you mentioned interference. Going back
to the double slit thing. How does that play into algorithms?
Speaker 2 (03:50):
Right? Interference Quantum algorithms are designed to leverage this. Think
of it like paths leading to the wrong answer interfere
destructively and cancel each other out.
Speaker 1 (03:59):
Ah, so they just disappear effectively.
Speaker 2 (04:01):
Yeah, while the paths leading to the right answer interfere constructively,
reinforcing each other. So the probability of measuring the correct
answer gets amplified. It's a way to sift through possibilities incredibly.
Speaker 1 (04:12):
Efficiently and visualizing this yeah, it's hard to picture. Are
there tools for that?
Speaker 2 (04:18):
There are. For a single quibut, we often use the
block sphere. It helps visualize its state, including its amplitude
and phase, like a point on a globe. But for
multiple entangled quibits that gets complicated. So there's a more
powerful tool called the q sphere, which can show the
combined state of many quibits, including those crucial phase relationships
(04:40):
between them.
Speaker 1 (04:40):
This is fascinating, but maybe a bit abstract. How do
people actually use this stuff? Where do you start?
Speaker 2 (04:46):
Great question? For many. The entry point is the IBM
Quantum Platform or IQP, and it's got a cool history.
IBM actually put the first quantum computer on the cloud
free for anyone to use, back in May twenty sixteen.
Speaker 1 (05:01):
Wow, twenty sixteen. That feels like ages ago in this field, right.
Speaker 2 (05:04):
It was called the IBM Quantum Experience.
Speaker 1 (05:06):
Then.
Speaker 2 (05:07):
Now it's this much more developed platform, the ITP.
Speaker 1 (05:09):
What's actually on the platform.
Speaker 2 (05:11):
It's got a few key parts. The main platform view
is your dashboard. You can see which quantum computers are online,
how busy they are, check on your jobs, see how
much computing time you've.
Speaker 1 (05:20):
Used, like a mission control kind of. Yeah.
Speaker 2 (05:22):
Then there's the documentation which is huge. Everything you need
to set up your coding environment, understand Kuskit, which we'll
get to its APIs. It's all there.
Speaker 1 (05:31):
And you mentioned learning resources.
Speaker 2 (05:33):
Oh yeah, the learning section is fantastic courses, tutorials from
beginner stuff right up to advanced topics, even quantum safe cryptography.
It really lowers the barrier to entry inside the platform.
Speaker 1 (05:45):
I heard there's something called the composer, like a drag
and drop interface.
Speaker 2 (05:49):
That's right. The composer is brilliant for visual learners or
just starting out. It's a graphical interface where you literally
drag quantum gates onto quibit lines to build a circuit.
Speaker 1 (06:00):
Oh cool.
Speaker 2 (06:00):
And the best part is the real time feedback. As
you build, you see visualizations update instantly, the state vector
view showing amplitudes, the probabilities view predicting outcomes. Even that
q sphere we talked about, you can pop a not
t git on there and see the probability flip from
one hundred percent zero to one hundred percent one right away.
Speaker 1 (06:19):
So you can really see cause and effects.
Speaker 2 (06:20):
Exactly. It makes it much more intuitive.
Speaker 1 (06:22):
Okay, but what if you want to go beyond dragging
and dropping. You mentioned quiske It.
Speaker 2 (06:26):
Yes, kiss git. That's IBM's open source software development kit
for quantum computing. It's built on Python, which makes it
accessible to a huge community of developers. It's really the
standard for working with IBM's quantum systems programmatically.
Speaker 1 (06:42):
Is it just one monolithic.
Speaker 2 (06:43):
Thing or no, It's cleverly layered. They think about different
developer roles. At the lowest level. You have kernel developers.
They're working right down near the hardware, figuring out the
precise microwave pulses needed to manipulate the quibbits.
Speaker 1 (06:57):
Really deep stuff, okay, Hardware whisperers, ah yeah.
Speaker 2 (07:00):
Then you have algorithm developers. They're using quiskit to design
the quantum circuits themselves. The algorithms. A big focus for
them is minimizing the impact of noise, making things run
better on today's imperfect hardware.
Speaker 1 (07:12):
Right noise. We'll definitely need to talk more about that
and the third layer model developers.
Speaker 2 (07:17):
These are folks who might be say chemists or financial analysts.
They want to use a quantum algorithm as part of
a larger workflow. They use quisk it to integrate quantum
computation into their existing applications, focusing on getting data in
and results out, often without needing to know every single
gate detail.
Speaker 1 (07:37):
That makes a lot of sense. Can you run quiske
it on your own machine?
Speaker 2 (07:40):
You can. You set it up locally, usually with Anaconda
for Python and Jupiter notebooks. It's great for simulating circuits,
but crucially you need your IBM Quantum API token to
actually send jobs to the real quantum computers in the cloud.
Speaker 1 (07:54):
Gotcha, And if you get stuck.
Speaker 2 (07:55):
There is a huge, very active community the quiskeuters on Slack.
It's amazing. You can ask questions, get help, see what
others are working on, connect with researchers. It's a really
supportive environment.
Speaker 1 (08:05):
That's great to know. So we have quippits, we have
platforms like IBM Quantum and tools like quisket. Now, how
do we actually control the quibbuts? You mentioned gates in
the composer.
Speaker 2 (08:15):
Right, Quantum logic gates. They are the fundamental operations you
perform on quibbots. But unlike classical gates, which just flip
bits based on simple rules, quantum gates are well, they're different.
They perform unitary transformations.
Speaker 1 (08:28):
Unitary transformations sounds fancy. What does that mean? Practically?
Speaker 2 (08:34):
It essentially means there are rotations in the Quibbets abstract
mathematical space. Think of the block sphere. A gate rotates
the Quibbitts state vector to a different point on that sphere.
And crucially, these transformations preserve the vector's length, which relates
to probability.
Speaker 1 (08:50):
Okay, rotations, and you mentioned they're.
Speaker 2 (08:52):
Reversible, almost all of them. Yes, reversibility is a key property.
If you apply a gate, you can almost always apply
another related gate its complex conjugator inverse to get back
exactly where you started. A HaTamar gate, for instance, applied twice,
brings you back to the initial state, unlike some classical
gates exactly think of a classical A and D gate.
If the output is zero, you don't know if the
(09:13):
inputs were zero, zero, zero, one, or ten. Information is lost.
Quantum gates generally don't lose information like that.
Speaker 1 (09:21):
Okay, So what are some of the essential gates the
building blocks.
Speaker 2 (09:25):
Well, for single clivits, the HaTamar gate or H gate
is absolutely fundamental. It's the main way we create superposition.
It takes a definite zero A state or one eight
to state and puts it into an equal mix of both.
Speaker 1 (09:38):
The superposition workhorse. Got it.
Speaker 2 (09:40):
Then you have the polygates X, Y, and Z. These
are basic rotations by one hundred and eighty degrees around
the respective axes on the block sphere. The X gate
is the quantum equivalent of the classical not T gate.
It flips zero to one a's and vice versa.
Speaker 1 (09:54):
Simple flips what else.
Speaker 2 (09:56):
For more precise control, especially over the quibt phase, which
is cre interference, you have phase gates, the ES gate,
the T gate, and their inversus s dagger T tigger.
They rotate the state around the z axis by specific.
Speaker 1 (10:08):
Amounts, fine tuning the phase exactly.
Speaker 2 (10:10):
And then there's the universal U gate. It's the most
general single quibut gate. With just three angle parameters, it
can perform any possible rotation, any single quibbit operation you
can imagine.
Speaker 1 (10:21):
Wow, Okay, so that covers single quibts. But the real
power comes from interactions, right.
Speaker 2 (10:26):
Entanglement precisely, yeah, and that requires multiquibit gates. The absolute
cornerstone here is the controlled knot gate or.
Speaker 1 (10:34):
Cnot controlled not. What does it do?
Speaker 2 (10:36):
It acts on two quibbits, a control quibbit and a
target quibt. If the control clibit is in the zero state,
it does nothing to the target. But if the control
quibit is in the one A state, it applies an
X gate a not gate to the target quibt flipping it.
Speaker 1 (10:51):
Ah. So one quibt state controls an operation on another.
Speaker 2 (10:54):
Yes, and this is the primary way we create entanglement
between equipbitts. It's fundamental.
Speaker 1 (10:59):
What are the multiquibit gates are important?
Speaker 2 (11:01):
Well, there's the Tafoli gate or CCX. It's like a
cnot but with two control quibots. The target quibit only
flips if both control quibots are one.
Speaker 1 (11:10):
A okay, double control.
Speaker 2 (11:12):
It's significant because the Toafoli gate is actually a universal
classical gate. You can build any classical circuit using just
to fullness in quantum. It shows how complex operations are
built up, often requiring decomposition into many simpler gates like hadamards, cnots.
Speaker 1 (11:27):
And T gates interesting any others.
Speaker 2 (11:30):
The swapgate is sometimes useful. It just swaps the states
of two quibuts. Does exactly what it says on the tin.
Speaker 1 (11:35):
Okay, So you said almost all gates are reversible. What's
the exception where does the information get lost?
Speaker 2 (11:41):
The exception is measurement. When you measure a quiboit to
find out if it's a zero or a one, the
quantum state collapses. All that complex superposition information, the amplitudes,
the phase. It's gone. You just get a classical bit
zero or one based on the probabilities dictated by the
state before measurement. It's the one irreversible step that makes sense.
Speaker 1 (12:02):
You have to look eventually, and looking.
Speaker 2 (12:04):
Changes things exactly. And you know, a really beautiful simple
circuit that uses these basic gates is the one that
creates the Bell state.
Speaker 1 (12:11):
Bell states.
Speaker 2 (12:11):
They're the four fundamental states of maximum entanglement. For two quibits.
For example, the A plus A state is an equal
superposition of zero, zero and eleven air. Both quibits are
zero or both are one perfectly correlated.
Speaker 1 (12:24):
And how do you make that.
Speaker 2 (12:25):
It's surprisingly simple. You start with two quibits and the
zero zero state, apply a Hadamar gate to the first
quibut to put it in superposition. Then apply a Cnot
gate with the first quibut as control and the second
is target boom bell state maximally entangled.
Speaker 1 (12:39):
Wow, just two gates for that spooky action.
Speaker 2 (12:42):
Yep, it's foundational for so many quantum algorithms and protocols.
Speaker 1 (12:47):
Okay, so we've got the theory, the gates, the tools.
But running this on actual hardware, I imagine it's not
quite as clean as the simulations. You mentioned Noise earlier.
Speaker 2 (12:57):
Oh yeah, noise is the big, big, big challenge in
the current era of quantum computing. These quantum states are
incredibly fragile. But first, let's talk about how you run
things efficiently on real hardware. That's where quisket run time
comes in.
Speaker 1 (13:12):
Run time, what's that about.
Speaker 2 (13:13):
It's IBM service designed to execute quantum circuits more effectively
on their cloud systems. It's about getting better performance and
managing the whole process better than just sending individual isolated jobs.
Speaker 1 (13:24):
How does it do that?
Speaker 2 (13:25):
One key feature is sessions. Imagine you have an algorithm
that needs to run a quantum circuit, then do some
classical processing, then run another related circuit, maybe iteratively.
Speaker 1 (13:35):
Right, like machine learning or optimization.
Speaker 2 (13:37):
Exactly if you submitted each circuit as a separate job
you keep going back to the end of the queue.
For the quantum computer, it would take forever and the
system's state might change between your runs. Sessions guarantee you
dedicated access to a quantum processor for a block of
related computations. It's huge for reducing weight times and ensuring consistency.
Speaker 1 (13:57):
That sounds essential for complex tasks really is.
Speaker 2 (14:00):
And within run time you interact using primitives. These are
like standardized interfaces for common quantum tasks. They abstract away
some of the hardware variation, like what kind of tasks.
The main ones currently are the sampler and the estimator.
The sampler primitive, for example, is designed for algorithms where
you primarily care about the probability distribution of the measurement outcomes.
(14:20):
You run the search up many times and it gives
you back the counts or quasi probabilities for each result.
Speaker 1 (14:26):
Okay, so run time and primitives help manage the execution,
But what about the noise itself? What are we actually
fighting against?
Speaker 2 (14:32):
Right the noise? There are a few main culprits. The
big one is decoherence. This is the general loss of
that delicate quantumness.
Speaker 1 (14:40):
Losing the quantum magic.
Speaker 2 (14:41):
Pretty much It breaks down into two main types. There's
T one time, or relaxation time. That's a long it
takes for a quibit in an excited state like one,
you to naturally decay back down to its ground state zero,
like a hot cup of coffee.
Speaker 1 (14:54):
Cooling down, okay, losing energy.
Speaker 2 (14:56):
Then there's T two time, or dephasing time. This is
about losing the phase coherence, the precise alignment of the
quantum wave. It's caused by random fluctuations in the Quibbitts environment.
Think of it like trying to keep a group of
spinners perfectly synchronized. When there's random jittering, they drift apart.
T two is usually much shorter than T one, making
phase control really tricky.
Speaker 1 (15:18):
So energy loss and phase drift what else?
Speaker 2 (15:21):
You also have gate errors. The physical pulses used to
implement quantum gits aren't perfectly precise, so rotation might be
slightly off or introduce unwanted phase shifts and finally, readout errors.
Even measuring the quibet's final state isn't perfect. Sometimes you
measure a zero when it was actually a one, or
vice versa.
Speaker 1 (15:38):
Well, it sounds like a mindfield. How do you even
know how bad the noise is on a particular machine.
Speaker 2 (15:42):
Quisket actually lets you characterize the noise. You can run
calibration experiments to measure T one T two gate errors,
readout errors for a specific device, and then build a
noise model based on that data. You can use this
model in simulations to predict how noise will affect your
algorithm before running it on the real thing.
Speaker 1 (16:01):
That's useful. So knowing the enemy, how do you fight it?
Speaker 2 (16:05):
Two main strategies, error suppression and aer mitigation suppression. First,
air suppression techniques try to actively reduce the effect of
noise during the computation itself. A key example is dynamical decoupling.
During times when equip it is supposed to be idle
waiting for other operations, it's vulnerable to dephasing. Dynamical decoupling
inserts sequences of carefully timed pulses, often simple excates that
(16:29):
effectively refocus the corbet's phase, canceling out some of the
slow drift caused by noise.
Speaker 1 (16:34):
Like constantly nudging it back on track.
Speaker 2 (16:36):
Kind of yeah. It actively fights the diffusion of the
quantum state.
Speaker 1 (16:39):
Okay, and error mitigation, how is that different?
Speaker 2 (16:42):
Aerror. Mitigation doesn't necessarily prevent the errors from happening. Instead,
it assumes errors will happen, runs the computation anyway, often
multiple times with variations, and then uses classical post processing
techniques to estimate what the ideal noise free result would
have been.
Speaker 1 (16:58):
AH, so you clean up the results afterwards using.
Speaker 2 (17:01):
Statistics essentially yes techniques like zero noise extrapolation ZNE, where
you deliberately amplify the noise and extrapolate back to the
zero noise point, or probabilistic error cancelation PECK, which learns
the errors and tries to invert them statistically. Quis GET
run Time incorporates these into different resilience levels you can choose.
They use extra classical computation, but are crucial for getting
(17:24):
useful answers from today's noisy intermediate scale quantum and ice
Q devices and ice Q that's.
Speaker 1 (17:30):
The current era, right noisy, not quite fault tolerant yet exactly.
Speaker 2 (17:34):
We don't have enough quibits or low enough error rates
for full quantum error correction yet, so suppression and mitigation
are absolutely vital.
Speaker 1 (17:41):
This battle against noise really highlights the engineering challenge, but
it's leading somewhere exciting the idea of quantum advantage right.
Speaker 2 (17:50):
Quantum advantage is the point where a quantum computer can
solve a specific problem faster or more accurately than the
best possible classical computer, regardless of how big or powerful
that classical computer is.
Speaker 1 (18:01):
And are we seeing signs of that we are?
Speaker 2 (18:04):
IBM Quantum had a significant result in twenty twenty three
using their one hundred and twenty seven quo bit Eagle processor.
They demonstrated calculations related to material science that were complex
enough to be beyond exact simulation by even the most
powerful classical supercomputers using brute force methods. It was a
major step showing potential for quantum utility even before fault tolerance.
Speaker 1 (18:27):
That's huge. So what kinds of algorithms actually deliver this
speed up? Can we look at some example?
Speaker 2 (18:32):
Absolutely, some of the earliest foundational algorithms really showed the
potential for speed up, even if the problems they solved
were a bit academic.
Speaker 1 (18:39):
Like Deutsch's algorithm okay, wud that do?
Speaker 2 (18:41):
It solves a very simple problem. You have a function
that takes one bit in and gives one bit out.
Is the function constant always output zero or always outputs
one or balanced output zero for one input one for
the other.
Speaker 1 (18:51):
Classically, you'd have to test both inputs.
Speaker 2 (18:53):
Right, two checks exactly two queries to the function. Quantumly,
Deutsch's algorithm solves it with just one query. It uses
superposition and interference to check both possibilities at once.
Speaker 1 (19:05):
One query instead of two. Okay, maybe not world changing,
but it proved the concept.
Speaker 2 (19:09):
It was revolutionary at the time. Then came Deutsch Jozza.
It generalizes the idea to functions with ended inputs. Determining
if that kind of function is constant or balanced Classically
could take potentially many queries up to two to the
power of n one plus one in the worst.
Speaker 1 (19:26):
Case, exponentially harder.
Speaker 2 (19:27):
Right, quantumly still just one query.
Speaker 1 (19:30):
One query. That's astonishing.
Speaker 2 (19:32):
It really demonstrates the power of quantum parallelism. And then
there's Bernstein Vaserani. It finds a hidden secret string used
in a specific type of function. Classically, you need end
queries where n is the length of the string. Quantumly,
again just one query.
Speaker 1 (19:46):
Okay. These sound amazing, but maybe like mathematical puzzles, did
they connect to real world problems?
Speaker 2 (19:52):
They were crucial stepping stones. They proved speed ups were
possible and inspired further insearch. They laid the groundwork for
algorithms with more or direct applications, like the quantum Fourier
transform QFT.
Speaker 1 (20:04):
QFT related to the classical Fouria transform.
Speaker 2 (20:08):
Very much, so it's a quantum version that operates on
quibit amplitudes. It's incredibly important because it's a key component
in some of the most powerful quantum algorithms we know,
most famously Shores algorithm for factoring large numbers.
Speaker 1 (20:21):
AH, the one that potentially breaks modern cryptography.
Speaker 2 (20:25):
That's the one. QFT allows Shores algorithm to find the
period of a function exponentially faster than any known classical method,
and finding that period is the key to factoring.
Speaker 1 (20:35):
So QFT is a vital subroutine. What about searching? Is
there a quantum way to find a needle in a
haystack faster?
Speaker 2 (20:41):
There is? That's Grover's search algorithm. Imagine you have a
huge unsorted database or list with n items, and you're
looking for one specific item.
Speaker 1 (20:50):
Classically, you might have to check on average half of
them right and two worst case all in correct.
Speaker 2 (20:55):
Grover's algorithm gives you a quadratic speed up. It can
find the item in roughly the square root of n iterations,
so for a million items, instead of five hundred thousand checks,
it's more like one thousand.
Speaker 1 (21:08):
Square root en that's still a significant speed up for
large end. How does it work.
Speaker 2 (21:12):
It's clever. It uses two main steps repeatedly. First, an
oracle operation marks the target item, usually by flipping its phase,
making it negative. It doesn't know which item is right,
but it can recognize it if.
Speaker 1 (21:23):
It sees it, so it tags the winner right.
Speaker 2 (21:26):
Then. The second step is a diffusion operator, sometimes called
amplitude amplification. This operation essentially takes the average amplitude of
all items and reflects every item's amplitude about that average.
The result is that the tagged items amplitude, which was negative,
gets boosted significantly, while all the others get reduced using
interference again exactly. You repeat these two steps about sen
(21:48):
in times, and the probability of measuring the correct item
becomes very high.
Speaker 1 (21:51):
Okay, these algorithms are powerful, but building them gate by
gait dealing with noise models, it sounds complex for someone
who just wants to apply quantum to their field.
Speaker 2 (22:02):
It definitely can be, and that's why IBM introduced quisket patterns.
It's a higher level way of thinking about and building
quantum applications patterns.
Speaker 1 (22:10):
Like design patterns and software.
Speaker 2 (22:12):
Engineering sort of.
Speaker 1 (22:13):
Yeah.
Speaker 2 (22:13):
The idea is to provide reusable templates or workflows that
abstract away a lot of the low level complexity. It
lets computational scientists or domain experts focus more on their
problem and less on the nitty gritty quantum circuit details
or hardware specifics.
Speaker 1 (22:29):
How does it work? Is their standard process?
Speaker 2 (22:31):
Yes. Quisket patterns generally follows four steps. First is map.
This is where you define your problem and figure out
the best way to encode your classical data or problem
structure into a quantum circuit or.
Speaker 1 (22:43):
State, getting the problem into quantum language precisely.
Speaker 2 (22:47):
Second is optimize. This step takes the con sexual circuit
and adapts it for the real world. It involves transpiling
it for the specific quantum hardware you'll use, and crucially
applying those error suppression and mitigation techniques.
Speaker 1 (22:59):
We talk making it robust.
Speaker 2 (23:01):
Third is execute. This is where you actually run the
optimized circuit, usually using qris gut runtime, and it's primitives
like the sampler on your chosen back end could be
a simulator or a real quantum device.
Speaker 1 (23:13):
Run the job, and.
Speaker 2 (23:15):
Fourth is post process. You take the raw results from
the quantum computer, which might be probability distributions or measurement counts,
and process them, analyze them, maybe feed them into a
classical algorithm, and format them into the answer you need
for your application.
Speaker 1 (23:30):
Map, optimize, execute, post process. That sounds much more manageable.
Can you give an example?
Speaker 2 (23:37):
Sure, The book uses a fun one called the rock
band problem. Imagine you have a logical expression describing which
musicians can play together. Maybe the drummer and bassis have issues,
but the singer needs the guitarist. Things like that. You
want to find valid band combinations.
Speaker 1 (23:51):
Okay, a constraint satisfaction problem exactly.
Speaker 2 (23:54):
Using quiskit patterns with Grover's algorithm, you wouldn't necessarily need
to manually build the oracle circuit that recognizes valid bands.
You could potentially just define the logical expression itself and
the pattern would handle mapping it to the appropriate Grover instance,
optimizing it, running it, and giving you back the satisfying
(24:14):
assignments with valid band lineups.
Speaker 1 (24:17):
Wow, so it abstracts away the oracle construction. That's huge
for Grover's algorithm.
Speaker 2 (24:21):
It aims too. Yes, it makes these powerful algorithms much
more accessible for solving practical problems.
Speaker 1 (24:27):
So what a journey We've gone from the weirdness of
quantum mechanics superposition, entanglement.
Speaker 2 (24:33):
Interference all the way through the practical tools like the
IBM Quantum platform and crisket, the gates that manipulate quibits, tackle.
Speaker 1 (24:41):
The challenge of noise and how we fight it with
suppression and.
Speaker 2 (24:44):
Mitigation, and explore these incredible algorithms like Deutsche Jersa Grovers
and the concepts behind QFT showing real quantum speed ups.
And finally, how things like quisket patterns are trying to
make it all easier to use.
Speaker 1 (24:57):
It really feels like we're moving into a new phase,
doesn't it, This era of quantum utility where even noisy
machines can start tackling problems classical computers.
Speaker 2 (25:05):
Struggle with absolutely And that brings us to the final
thought for you, the listener. As these quantum computers become
more capable, even before they're perfectly fault tolerant, think about this,
what problem in your field? Something that seems computationally intractable today, Yeah,
could potentially be unlocked by this technology. How might you
(25:27):
start thinking about mapping that problem onto a quantum state,
preparing for this next wave of computation.
Speaker 1 (25:33):
That's a fantastic question to ponder. The journey really has
just begun, and who knows what possibilities will open up next.
It's an exciting time to be watching this space.
You know that feeling right when you need to get
up to speed on something really complex fast, but you're
just drowning in articles and papers.
Speaker 2 (00:06):
Yeah, totally information overload exactly.
Speaker 1 (00:09):
So we're here to give you that shortcut, that deep
dive to get you properly informed. Today we're jumping into
a field that's honestly reshaping how we even think about computation.
Speaker 2 (00:19):
It really is. We're talking quantum computing, and our mission
today is to untack the core ideas, look at the
tools making it accessible, which is amazing, and even touch
on some algorithms that sound like science.
Speaker 1 (00:32):
Fiction, they really do. Our main guide here is the
second edition of Learn Quantum Computing with Python and IBM
Quantum by Robert Laredo. He's an IBM Mastered inventor, a
quantum ambassador, just brilliant and.
Speaker 2 (00:46):
A great guy too. Donated his previous books royalties to
Doctors Without Borders. We're also pulling in insights from reviewers
like Haci Norlen, Mikhail Grossey, Sean Wagner, all deep in
the IBM Quantum and caskit world.
Speaker 1 (00:58):
So whether you're prepping for that big meeting or just
trying to figure out what all the buzz is about.
Or maybe you're just super curious, which you should be. Huh. Yeah,
this deep dive should give you those aha moments. We're
aiming to show how these really abstract ideas are becoming concrete.
Speaker 2 (01:15):
Tools, right without making your head explode hopefully.
Speaker 1 (01:19):
Okay, so let's start at the beginning. Quantum mechanics sounds intimidating,
but it's the bedrock of all this. We're talking about
the rules governing the universe at the tiniest scales, the
sub atomic level.
Speaker 2 (01:29):
Yeah, the foundations laid by you know, the giants Schrodinger, Plank, Heisenberg,
Drach Einstein. Their work described a world that's just fundamentally
weird compared to our everyday experience, and that weirdness is key, right,
Like the double slit experiment exactly, that's a classic. You
fire single particles like photons at two slits, you'd expect
two lines on the screen behind it, right, Yeah, it
(01:51):
makes sense, but you don't get that. You get an
interference pattern like waves canceling out and adding up. It
shows particles behaving like waves. This wave part duality. It's
not just a cool fact, it's something Quantum computers actively use.
Speaker 1 (02:05):
So we all get classical bits on off zero one
transistors doing their thing. But the quantum version, the quibit. Yeah,
that's the heart of it. What makes it so different.
Speaker 2 (02:16):
Well, the huge difference is superposition Equibit isn't just zero
or one. It can be zero, it can be one,
or it can be a combination of both at the
exact same.
Speaker 1 (02:26):
Time, both like simultaneously.
Speaker 2 (02:28):
Kind of think of it less like a hidden state
like a spinning coin before it lands, and more like, well,
the quantum state itself is a blend of possibilities until
you measure it. Measuring forces it to choose zero or one.
Speaker 1 (02:40):
You mentioned a spinning coin, but you said it's not
like that. Yeah, that the quantum outcome is truly random.
That sounds profound. Are we saying there's no hidden instruction
determining the outcome?
Speaker 2 (02:51):
That's exactly what standard quantum mechanics says. Yeah, it's fundamentally probabilistic,
not just we don't know enough, but actually random. And
that's a massive conceptual leap. It means quantum computers work
with probabilities directly.
Speaker 1 (03:03):
Wow, Okay, that changes things.
Speaker 2 (03:05):
It does, and that leads to the second key, difference entanglement.
This is the one Einstein called famously spooky action at
a distance.
Speaker 1 (03:13):
Spooky action. I love that phrase. What does it actually
mean for quibits?
Speaker 2 (03:17):
It means you can link two or more quibits together
in a special way, so intimately linked that measuring the
state of one quibbit instantly tells you the state of
the other, no matter how far apart they are, instantly
across any distance, instantly. If you have two entangled quibits
and measure one is zero, you know the other is zero.
If one's one, the other's one, always correlate. It's like
(03:38):
they're still connected, sharing the same fate. It's a crucial resource.
Speaker 1 (03:41):
Okay, superposition entanglement. Yeah, and you mentioned interference. Going back
to the double slit thing. How does that play into algorithms?
Speaker 2 (03:50):
Right? Interference Quantum algorithms are designed to leverage this. Think
of it like paths leading to the wrong answer interfere
destructively and cancel each other out.
Speaker 1 (03:59):
Ah, so they just disappear effectively.
Speaker 2 (04:01):
Yeah, while the paths leading to the right answer interfere constructively,
reinforcing each other. So the probability of measuring the correct
answer gets amplified. It's a way to sift through possibilities incredibly.
Speaker 1 (04:12):
Efficiently and visualizing this yeah, it's hard to picture. Are
there tools for that?
Speaker 2 (04:18):
There are. For a single quibut, we often use the
block sphere. It helps visualize its state, including its amplitude
and phase, like a point on a globe. But for
multiple entangled quibits that gets complicated. So there's a more
powerful tool called the q sphere, which can show the
combined state of many quibits, including those crucial phase relationships
(04:40):
between them.
Speaker 1 (04:40):
This is fascinating, but maybe a bit abstract. How do
people actually use this stuff? Where do you start?
Speaker 2 (04:46):
Great question? For many. The entry point is the IBM
Quantum Platform or IQP, and it's got a cool history.
IBM actually put the first quantum computer on the cloud
free for anyone to use, back in May twenty sixteen.
Speaker 1 (05:01):
Wow, twenty sixteen. That feels like ages ago in this field, right.
Speaker 2 (05:04):
It was called the IBM Quantum Experience.
Speaker 1 (05:06):
Then.
Speaker 2 (05:07):
Now it's this much more developed platform, the ITP.
Speaker 1 (05:09):
What's actually on the platform.
Speaker 2 (05:11):
It's got a few key parts. The main platform view
is your dashboard. You can see which quantum computers are online,
how busy they are, check on your jobs, see how
much computing time you've.
Speaker 1 (05:20):
Used, like a mission control kind of. Yeah.
Speaker 2 (05:22):
Then there's the documentation which is huge. Everything you need
to set up your coding environment, understand Kuskit, which we'll
get to its APIs. It's all there.
Speaker 1 (05:31):
And you mentioned learning resources.
Speaker 2 (05:33):
Oh yeah, the learning section is fantastic courses, tutorials from
beginner stuff right up to advanced topics, even quantum safe cryptography.
It really lowers the barrier to entry inside the platform.
Speaker 1 (05:45):
I heard there's something called the composer, like a drag
and drop interface.
Speaker 2 (05:49):
That's right. The composer is brilliant for visual learners or
just starting out. It's a graphical interface where you literally
drag quantum gates onto quibit lines to build a circuit.
Speaker 1 (06:00):
Oh cool.
Speaker 2 (06:00):
And the best part is the real time feedback. As
you build, you see visualizations update instantly, the state vector
view showing amplitudes, the probabilities view predicting outcomes. Even that
q sphere we talked about, you can pop a not
t git on there and see the probability flip from
one hundred percent zero to one hundred percent one right away.
Speaker 1 (06:19):
So you can really see cause and effects.
Speaker 2 (06:20):
Exactly. It makes it much more intuitive.
Speaker 1 (06:22):
Okay, but what if you want to go beyond dragging
and dropping. You mentioned quiske It.
Speaker 2 (06:26):
Yes, kiss git. That's IBM's open source software development kit
for quantum computing. It's built on Python, which makes it
accessible to a huge community of developers. It's really the
standard for working with IBM's quantum systems programmatically.
Speaker 1 (06:42):
Is it just one monolithic.
Speaker 2 (06:43):
Thing or no, It's cleverly layered. They think about different
developer roles. At the lowest level. You have kernel developers.
They're working right down near the hardware, figuring out the
precise microwave pulses needed to manipulate the quibbits.
Speaker 1 (06:57):
Really deep stuff, okay, Hardware whisperers, ah yeah.
Speaker 2 (07:00):
Then you have algorithm developers. They're using quiskit to design
the quantum circuits themselves. The algorithms. A big focus for
them is minimizing the impact of noise, making things run
better on today's imperfect hardware.
Speaker 1 (07:12):
Right noise. We'll definitely need to talk more about that
and the third layer model developers.
Speaker 2 (07:17):
These are folks who might be say chemists or financial analysts.
They want to use a quantum algorithm as part of
a larger workflow. They use quisk it to integrate quantum
computation into their existing applications, focusing on getting data in
and results out, often without needing to know every single
gate detail.
Speaker 1 (07:37):
That makes a lot of sense. Can you run quiske
it on your own machine?
Speaker 2 (07:40):
You can. You set it up locally, usually with Anaconda
for Python and Jupiter notebooks. It's great for simulating circuits,
but crucially you need your IBM Quantum API token to
actually send jobs to the real quantum computers in the cloud.
Speaker 1 (07:54):
Gotcha, And if you get stuck.
Speaker 2 (07:55):
There is a huge, very active community the quiskeuters on Slack.
It's amazing. You can ask questions, get help, see what
others are working on, connect with researchers. It's a really
supportive environment.
Speaker 1 (08:05):
That's great to know. So we have quippits, we have
platforms like IBM Quantum and tools like quisket. Now, how
do we actually control the quibbuts? You mentioned gates in
the composer.
Speaker 2 (08:15):
Right, Quantum logic gates. They are the fundamental operations you
perform on quibbots. But unlike classical gates, which just flip
bits based on simple rules, quantum gates are well, they're different.
They perform unitary transformations.
Speaker 1 (08:28):
Unitary transformations sounds fancy. What does that mean? Practically?
Speaker 2 (08:34):
It essentially means there are rotations in the Quibbets abstract
mathematical space. Think of the block sphere. A gate rotates
the Quibbitts state vector to a different point on that sphere.
And crucially, these transformations preserve the vector's length, which relates
to probability.
Speaker 1 (08:50):
Okay, rotations, and you mentioned they're.
Speaker 2 (08:52):
Reversible, almost all of them. Yes, reversibility is a key property.
If you apply a gate, you can almost always apply
another related gate its complex conjugator inverse to get back
exactly where you started. A HaTamar gate, for instance, applied twice,
brings you back to the initial state, unlike some classical
gates exactly think of a classical A and D gate.
If the output is zero, you don't know if the
(09:13):
inputs were zero, zero, zero, one, or ten. Information is lost.
Quantum gates generally don't lose information like that.
Speaker 1 (09:21):
Okay, So what are some of the essential gates the
building blocks.
Speaker 2 (09:25):
Well, for single clivits, the HaTamar gate or H gate
is absolutely fundamental. It's the main way we create superposition.
It takes a definite zero A state or one eight
to state and puts it into an equal mix of both.
Speaker 1 (09:38):
The superposition workhorse. Got it.
Speaker 2 (09:40):
Then you have the polygates X, Y, and Z. These
are basic rotations by one hundred and eighty degrees around
the respective axes on the block sphere. The X gate
is the quantum equivalent of the classical not T gate.
It flips zero to one a's and vice versa.
Speaker 1 (09:54):
Simple flips what else.
Speaker 2 (09:56):
For more precise control, especially over the quibt phase, which
is cre interference, you have phase gates, the ES gate,
the T gate, and their inversus s dagger T tigger.
They rotate the state around the z axis by specific.
Speaker 1 (10:08):
Amounts, fine tuning the phase exactly.
Speaker 2 (10:10):
And then there's the universal U gate. It's the most
general single quibut gate. With just three angle parameters, it
can perform any possible rotation, any single quibbit operation you
can imagine.
Speaker 1 (10:21):
Wow, Okay, so that covers single quibts. But the real
power comes from interactions, right.
Speaker 2 (10:26):
Entanglement precisely, yeah, and that requires multiquibit gates. The absolute
cornerstone here is the controlled knot gate or.
Speaker 1 (10:34):
Cnot controlled not. What does it do?
Speaker 2 (10:36):
It acts on two quibbits, a control quibbit and a
target quibt. If the control clibit is in the zero state,
it does nothing to the target. But if the control
quibit is in the one A state, it applies an
X gate a not gate to the target quibt flipping it.
Speaker 1 (10:51):
Ah. So one quibt state controls an operation on another.
Speaker 2 (10:54):
Yes, and this is the primary way we create entanglement
between equipbitts. It's fundamental.
Speaker 1 (10:59):
What are the multiquibit gates are important?
Speaker 2 (11:01):
Well, there's the Tafoli gate or CCX. It's like a
cnot but with two control quibots. The target quibit only
flips if both control quibots are one.
Speaker 1 (11:10):
A okay, double control.
Speaker 2 (11:12):
It's significant because the Toafoli gate is actually a universal
classical gate. You can build any classical circuit using just
to fullness in quantum. It shows how complex operations are
built up, often requiring decomposition into many simpler gates like hadamards, cnots.
Speaker 1 (11:27):
And T gates interesting any others.
Speaker 2 (11:30):
The swapgate is sometimes useful. It just swaps the states
of two quibuts. Does exactly what it says on the tin.
Speaker 1 (11:35):
Okay, So you said almost all gates are reversible. What's
the exception where does the information get lost?
Speaker 2 (11:41):
The exception is measurement. When you measure a quiboit to
find out if it's a zero or a one, the
quantum state collapses. All that complex superposition information, the amplitudes,
the phase. It's gone. You just get a classical bit
zero or one based on the probabilities dictated by the
state before measurement. It's the one irreversible step that makes sense.
Speaker 1 (12:02):
You have to look eventually, and looking.
Speaker 2 (12:04):
Changes things exactly. And you know, a really beautiful simple
circuit that uses these basic gates is the one that
creates the Bell state.
Speaker 1 (12:11):
Bell states.
Speaker 2 (12:11):
They're the four fundamental states of maximum entanglement. For two quibits.
For example, the A plus A state is an equal
superposition of zero, zero and eleven air. Both quibits are
zero or both are one perfectly correlated.
Speaker 1 (12:24):
And how do you make that.
Speaker 2 (12:25):
It's surprisingly simple. You start with two quibits and the
zero zero state, apply a Hadamar gate to the first
quibut to put it in superposition. Then apply a Cnot
gate with the first quibut as control and the second
is target boom bell state maximally entangled.
Speaker 1 (12:39):
Wow, just two gates for that spooky action.
Speaker 2 (12:42):
Yep, it's foundational for so many quantum algorithms and protocols.
Speaker 1 (12:47):
Okay, so we've got the theory, the gates, the tools.
But running this on actual hardware, I imagine it's not
quite as clean as the simulations. You mentioned Noise earlier.
Speaker 2 (12:57):
Oh yeah, noise is the big, big, big challenge in
the current era of quantum computing. These quantum states are
incredibly fragile. But first, let's talk about how you run
things efficiently on real hardware. That's where quisket run time
comes in.
Speaker 1 (13:12):
Run time, what's that about.
Speaker 2 (13:13):
It's IBM service designed to execute quantum circuits more effectively
on their cloud systems. It's about getting better performance and
managing the whole process better than just sending individual isolated jobs.
Speaker 1 (13:24):
How does it do that?
Speaker 2 (13:25):
One key feature is sessions. Imagine you have an algorithm
that needs to run a quantum circuit, then do some
classical processing, then run another related circuit, maybe iteratively.
Speaker 1 (13:35):
Right, like machine learning or optimization.
Speaker 2 (13:37):
Exactly if you submitted each circuit as a separate job
you keep going back to the end of the queue.
For the quantum computer, it would take forever and the
system's state might change between your runs. Sessions guarantee you
dedicated access to a quantum processor for a block of
related computations. It's huge for reducing weight times and ensuring consistency.
Speaker 1 (13:57):
That sounds essential for complex tasks really is.
Speaker 2 (14:00):
And within run time you interact using primitives. These are
like standardized interfaces for common quantum tasks. They abstract away
some of the hardware variation, like what kind of tasks.
The main ones currently are the sampler and the estimator.
The sampler primitive, for example, is designed for algorithms where
you primarily care about the probability distribution of the measurement outcomes.
(14:20):
You run the search up many times and it gives
you back the counts or quasi probabilities for each result.
Speaker 1 (14:26):
Okay, so run time and primitives help manage the execution,
But what about the noise itself? What are we actually
fighting against?
Speaker 2 (14:32):
Right the noise? There are a few main culprits. The
big one is decoherence. This is the general loss of
that delicate quantumness.
Speaker 1 (14:40):
Losing the quantum magic.
Speaker 2 (14:41):
Pretty much It breaks down into two main types. There's
T one time, or relaxation time. That's a long it
takes for a quibit in an excited state like one,
you to naturally decay back down to its ground state zero,
like a hot cup of coffee.
Speaker 1 (14:54):
Cooling down, okay, losing energy.
Speaker 2 (14:56):
Then there's T two time, or dephasing time. This is
about losing the phase coherence, the precise alignment of the
quantum wave. It's caused by random fluctuations in the Quibbitts environment.
Think of it like trying to keep a group of
spinners perfectly synchronized. When there's random jittering, they drift apart.
T two is usually much shorter than T one, making
phase control really tricky.
Speaker 1 (15:18):
So energy loss and phase drift what else?
Speaker 2 (15:21):
You also have gate errors. The physical pulses used to
implement quantum gits aren't perfectly precise, so rotation might be
slightly off or introduce unwanted phase shifts and finally, readout errors.
Even measuring the quibet's final state isn't perfect. Sometimes you
measure a zero when it was actually a one, or
vice versa.
Speaker 1 (15:38):
Well, it sounds like a mindfield. How do you even
know how bad the noise is on a particular machine.
Speaker 2 (15:42):
Quisket actually lets you characterize the noise. You can run
calibration experiments to measure T one T two gate errors,
readout errors for a specific device, and then build a
noise model based on that data. You can use this
model in simulations to predict how noise will affect your
algorithm before running it on the real thing.
Speaker 1 (16:01):
That's useful. So knowing the enemy, how do you fight it?
Speaker 2 (16:05):
Two main strategies, error suppression and aer mitigation suppression. First,
air suppression techniques try to actively reduce the effect of
noise during the computation itself. A key example is dynamical decoupling.
During times when equip it is supposed to be idle
waiting for other operations, it's vulnerable to dephasing. Dynamical decoupling
inserts sequences of carefully timed pulses, often simple excates that
(16:29):
effectively refocus the corbet's phase, canceling out some of the
slow drift caused by noise.
Speaker 1 (16:34):
Like constantly nudging it back on track.
Speaker 2 (16:36):
Kind of yeah. It actively fights the diffusion of the
quantum state.
Speaker 1 (16:39):
Okay, and error mitigation, how is that different?
Speaker 2 (16:42):
Aerror. Mitigation doesn't necessarily prevent the errors from happening. Instead,
it assumes errors will happen, runs the computation anyway, often
multiple times with variations, and then uses classical post processing
techniques to estimate what the ideal noise free result would
have been.
Speaker 1 (16:58):
AH, so you clean up the results afterwards using.
Speaker 2 (17:01):
Statistics essentially yes techniques like zero noise extrapolation ZNE, where
you deliberately amplify the noise and extrapolate back to the
zero noise point, or probabilistic error cancelation PECK, which learns
the errors and tries to invert them statistically. Quis GET
run Time incorporates these into different resilience levels you can choose.
They use extra classical computation, but are crucial for getting
(17:24):
useful answers from today's noisy intermediate scale quantum and ice
Q devices and ice Q that's.
Speaker 1 (17:30):
The current era, right noisy, not quite fault tolerant yet exactly.
Speaker 2 (17:34):
We don't have enough quibits or low enough error rates
for full quantum error correction yet, so suppression and mitigation
are absolutely vital.
Speaker 1 (17:41):
This battle against noise really highlights the engineering challenge, but
it's leading somewhere exciting the idea of quantum advantage right.
Speaker 2 (17:50):
Quantum advantage is the point where a quantum computer can
solve a specific problem faster or more accurately than the
best possible classical computer, regardless of how big or powerful
that classical computer is.
Speaker 1 (18:01):
And are we seeing signs of that we are?
Speaker 2 (18:04):
IBM Quantum had a significant result in twenty twenty three
using their one hundred and twenty seven quo bit Eagle processor.
They demonstrated calculations related to material science that were complex
enough to be beyond exact simulation by even the most
powerful classical supercomputers using brute force methods. It was a
major step showing potential for quantum utility even before fault tolerance.
Speaker 1 (18:27):
That's huge. So what kinds of algorithms actually deliver this
speed up? Can we look at some example?
Speaker 2 (18:32):
Absolutely, some of the earliest foundational algorithms really showed the
potential for speed up, even if the problems they solved
were a bit academic.
Speaker 1 (18:39):
Like Deutsch's algorithm okay, wud that do?
Speaker 2 (18:41):
It solves a very simple problem. You have a function
that takes one bit in and gives one bit out.
Is the function constant always output zero or always outputs
one or balanced output zero for one input one for
the other.
Speaker 1 (18:51):
Classically, you'd have to test both inputs.
Speaker 2 (18:53):
Right, two checks exactly two queries to the function. Quantumly,
Deutsch's algorithm solves it with just one query. It uses
superposition and interference to check both possibilities at once.
Speaker 1 (19:05):
One query instead of two. Okay, maybe not world changing,
but it proved the concept.
Speaker 2 (19:09):
It was revolutionary at the time. Then came Deutsch Jozza.
It generalizes the idea to functions with ended inputs. Determining
if that kind of function is constant or balanced Classically
could take potentially many queries up to two to the
power of n one plus one in the worst.
Speaker 1 (19:26):
Case, exponentially harder.
Speaker 2 (19:27):
Right, quantumly still just one query.
Speaker 1 (19:30):
One query. That's astonishing.
Speaker 2 (19:32):
It really demonstrates the power of quantum parallelism. And then
there's Bernstein Vaserani. It finds a hidden secret string used
in a specific type of function. Classically, you need end
queries where n is the length of the string. Quantumly,
again just one query.
Speaker 1 (19:46):
Okay. These sound amazing, but maybe like mathematical puzzles, did
they connect to real world problems?
Speaker 2 (19:52):
They were crucial stepping stones. They proved speed ups were
possible and inspired further insearch. They laid the groundwork for
algorithms with more or direct applications, like the quantum Fourier
transform QFT.
Speaker 1 (20:04):
QFT related to the classical Fouria transform.
Speaker 2 (20:08):
Very much, so it's a quantum version that operates on
quibit amplitudes. It's incredibly important because it's a key component
in some of the most powerful quantum algorithms we know,
most famously Shores algorithm for factoring large numbers.
Speaker 1 (20:21):
AH, the one that potentially breaks modern cryptography.
Speaker 2 (20:25):
That's the one. QFT allows Shores algorithm to find the
period of a function exponentially faster than any known classical method,
and finding that period is the key to factoring.
Speaker 1 (20:35):
So QFT is a vital subroutine. What about searching? Is
there a quantum way to find a needle in a
haystack faster?
Speaker 2 (20:41):
There is? That's Grover's search algorithm. Imagine you have a
huge unsorted database or list with n items, and you're
looking for one specific item.
Speaker 1 (20:50):
Classically, you might have to check on average half of
them right and two worst case all in correct.
Speaker 2 (20:55):
Grover's algorithm gives you a quadratic speed up. It can
find the item in roughly the square root of n iterations,
so for a million items, instead of five hundred thousand checks,
it's more like one thousand.
Speaker 1 (21:08):
Square root en that's still a significant speed up for
large end. How does it work.
Speaker 2 (21:12):
It's clever. It uses two main steps repeatedly. First, an
oracle operation marks the target item, usually by flipping its phase,
making it negative. It doesn't know which item is right,
but it can recognize it if.
Speaker 1 (21:23):
It sees it, so it tags the winner right.
Speaker 2 (21:26):
Then. The second step is a diffusion operator, sometimes called
amplitude amplification. This operation essentially takes the average amplitude of
all items and reflects every item's amplitude about that average.
The result is that the tagged items amplitude, which was negative,
gets boosted significantly, while all the others get reduced using
interference again exactly. You repeat these two steps about sen
(21:48):
in times, and the probability of measuring the correct item
becomes very high.
Speaker 1 (21:51):
Okay, these algorithms are powerful, but building them gate by
gait dealing with noise models, it sounds complex for someone
who just wants to apply quantum to their field.
Speaker 2 (22:02):
It definitely can be, and that's why IBM introduced quisket patterns.
It's a higher level way of thinking about and building
quantum applications patterns.
Speaker 1 (22:10):
Like design patterns and software.
Speaker 2 (22:12):
Engineering sort of.
Speaker 1 (22:13):
Yeah.
Speaker 2 (22:13):
The idea is to provide reusable templates or workflows that
abstract away a lot of the low level complexity. It
lets computational scientists or domain experts focus more on their
problem and less on the nitty gritty quantum circuit details
or hardware specifics.
Speaker 1 (22:29):
How does it work? Is their standard process?
Speaker 2 (22:31):
Yes. Quisket patterns generally follows four steps. First is map.
This is where you define your problem and figure out
the best way to encode your classical data or problem
structure into a quantum circuit or.
Speaker 1 (22:43):
State, getting the problem into quantum language precisely.
Speaker 2 (22:47):
Second is optimize. This step takes the con sexual circuit
and adapts it for the real world. It involves transpiling
it for the specific quantum hardware you'll use, and crucially
applying those error suppression and mitigation techniques.
Speaker 1 (22:59):
We talk making it robust.
Speaker 2 (23:01):
Third is execute. This is where you actually run the
optimized circuit, usually using qris gut runtime, and it's primitives
like the sampler on your chosen back end could be
a simulator or a real quantum device.
Speaker 1 (23:13):
Run the job, and.
Speaker 2 (23:15):
Fourth is post process. You take the raw results from
the quantum computer, which might be probability distributions or measurement counts,
and process them, analyze them, maybe feed them into a
classical algorithm, and format them into the answer you need
for your application.
Speaker 1 (23:30):
Map, optimize, execute, post process. That sounds much more manageable.
Can you give an example?
Speaker 2 (23:37):
Sure, The book uses a fun one called the rock
band problem. Imagine you have a logical expression describing which
musicians can play together. Maybe the drummer and bassis have issues,
but the singer needs the guitarist. Things like that. You
want to find valid band combinations.
Speaker 1 (23:51):
Okay, a constraint satisfaction problem exactly.
Speaker 2 (23:54):
Using quiskit patterns with Grover's algorithm, you wouldn't necessarily need
to manually build the oracle circuit that recognizes valid bands.
You could potentially just define the logical expression itself and
the pattern would handle mapping it to the appropriate Grover instance,
optimizing it, running it, and giving you back the satisfying
(24:14):
assignments with valid band lineups.
Speaker 1 (24:17):
Wow, so it abstracts away the oracle construction. That's huge
for Grover's algorithm.
Speaker 2 (24:21):
It aims too. Yes, it makes these powerful algorithms much
more accessible for solving practical problems.
Speaker 1 (24:27):
So what a journey We've gone from the weirdness of
quantum mechanics superposition, entanglement.
Speaker 2 (24:33):
Interference all the way through the practical tools like the
IBM Quantum platform and crisket, the gates that manipulate quibits, tackle.
Speaker 1 (24:41):
The challenge of noise and how we fight it with
suppression and.
Speaker 2 (24:44):
Mitigation, and explore these incredible algorithms like Deutsche Jersa Grovers
and the concepts behind QFT showing real quantum speed ups.
And finally, how things like quisket patterns are trying to
make it all easier to use.
Speaker 1 (24:57):
It really feels like we're moving into a new phase,
doesn't it, This era of quantum utility where even noisy
machines can start tackling problems classical computers.
Speaker 2 (25:05):
Struggle with absolutely And that brings us to the final
thought for you, the listener. As these quantum computers become
more capable, even before they're perfectly fault tolerant, think about this,
what problem in your field? Something that seems computationally intractable today, Yeah,
could potentially be unlocked by this technology. How might you
(25:27):
start thinking about mapping that problem onto a quantum state,
preparing for this next wave of computation.
Speaker 1 (25:33):
That's a fantastic question to ponder. The journey really has
just begun, and who knows what possibilities will open up next.
It's an exciting time to be watching this space.
Popular Podcasts
My Favorite Murder with Karen Kilgariff and Georgia Hardstark
My Favorite Murder is a true crime comedy podcast hosted by Karen Kilgariff and Georgia Hardstark. Each week, Karen and Georgia share compelling true crimes and hometown stories from friends and listeners. Since MFM launched in January of 2016, Karen and Georgia have shared their lifelong interest in true crime and have covered stories of infamous serial killers like the Night Stalker, mysterious cold cases, captivating cults, incredible survivor stories and important events from history like the Tulsa race massacre of 1921. My Favorite Murder is part of the Exactly Right podcast network that provides a platform for bold, creative voices to bring to life provocative, entertaining and relatable stories for audiences everywhere. The Exactly Right roster of podcasts covers a variety of topics including historic true crime, comedic interviews and news, science, pop culture and more. Podcasts on the network include Buried Bones with Kate Winkler Dawson and Paul Holes, That's Messed Up: An SVU Podcast, This Podcast Will Kill You, Bananas and more.
24/7 News: The Latest
The latest news in 4 minutes updated every hour, every day.
Dateline NBC
Current and classic episodes, featuring compelling true-crime mysteries, powerful documentaries and in-depth investigations. Follow now to get the latest episodes of Dateline NBC completely free, or subscribe to Dateline Premium for ad-free listening and exclusive bonus content: DatelinePremium.com