We Study Billionaires - The Investor’s Podcast Network - BTC020: Bitcoin & Quantum Computing w/ Andrew Fursman (Bitcoin Podcast)
Episode Date: April 7, 2021IN THIS EPISODE, YOU'LL LEARN: What is a quantum computer and why is it important for the future How does quantum computer threaten encryption What is a Bloch Sphere and why is it important Why is... quantum so good at solving specific problems What is the potential timeline for Quantum to achieve the processing required to pose a threat to Bitcoin What other application are there for Quantum computers beyond cracking encryption The differences between cracking elliptical curve key generation versus 2048 bit RSA. What are the energy impacts of quantum computing BOOKS AND RESOURCES Join the exclusive TIP Mastermind Community to engage in meaningful stock investing discussions with Stig, Clay, and the other community members. What is a Bloch Sphere Andrew Fursman's Company 1Qbit Andrew Fursman's bio An interesting paper that addresses Bitcoin and the impact of quantum computing Browse through all our episodes (complete with transcripts) here. SPONSORS Support our free podcast by supporting our sponsors: SimpleMining Hardblock AnchorWatch Human Rights Foundation Unchained Vanta Shopify Onramp Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm Learn more about your ad choices. Visit megaphone.fm/adchoices Support our show by becoming a premium member! https://theinvestorspodcastnetwork.supportingcast.fm
Transcript
Discussion (0)
You're listening to TIP.
Hey, everyone. Welcome to our Wednesday release of the podcast where we're talking about Bitcoin.
One of the risks that you'll hear many outsiders the Bitcoin raise is the idea of quantum computing potentially jeopardizing the integrity of the Bitcoin encryption.
Although many experts in the space quickly write this risk off due to the very low technical maturation today,
I thought it might be fun to interview an expert in quantum computing about this particular field of research and development and then how it applies to Bitcoin potentially in the
the future. I found this conversation with my guest, Andrew Furzman, to be a fascinating topic
and something that was all around exciting to learn about. This definitely isn't my area of
expertise. So come join us as we learn all about quantum computing and what it might mean for the
future. You're listening to Bitcoin Fundamentals by the Investors Podcast Network. Now for your host,
Preston Pish. Hey, everyone, welcome to the show. I'm here with Andrew. Really, it's
excited to have this conversation because this is definitely not my area of expertise. So,
Andrew, welcome to the show. Hey, thank you so much. I'm really nervous about this conversation
because you're interested in talking about something that's outside of my area of expertise.
So we're on even footing. I think it's going to be a great mix. So, Andrew, here's where I want
to start this conversation. Have you ever watched the show The Office with Michael Scott?
Oh, I see.
Now we're getting to the, do I prefer the North America or UK version of the office?
But I'm familiar with the concept.
In one of the shows, Michael's sitting there.
He's the boss.
He's sitting there.
And his accountant comes in.
And he starts explaining something to him.
And Michael says, just stop, just stop.
Explain this to me like I'm five years old.
For me, this is the perfect example for quantum computing, at least for myself.
Maybe some in the audience are a whole lot smarter.
but if you were going to explain this to somebody in a really simple way, and I know you're
taking something that's extremely complex in trying to make it accessible, but how would you
explain that to just start off the conversation and level set, everybody?
Thanks for that.
I think it's a great place to start.
And it's also actually not as difficult if you take it really literally.
And so if I were actually speaking to, you know, someone in fifth grade, I would say quantum
Computers are a new type of computer that work different than what we normally call
computers, and they have different strengths and weaknesses than our standard computers.
So getting a quantum computer is like getting a new type of computer that augments what we're
capable of doing because it's good at things that regular computers are bad at and vice versa.
Okay, so pulling on the thread, everyone's probably heard of a qubit, and we're used to regular
processors dealing with ones and zeros, and now all of a sudden we're doing.
dealing with like a third variable here where it's both off and on. Explain to us kind of what's
going on there. So this is where the introduction that you gave is so useful because one of the
things that I found is when I'm listening to people talk about how a cubit works and even just
the description that you just gave, you almost immediately run into challenges where everyday
language doesn't do a very good job of describing what's actually happening because regular
language wasn't really invented to talk about quantum phenomena. And in some sense, quantum
phenomena didn't exist to the people who were building up language. So it's not exactly
correct to say that a qubit is a zero and a one at the same time. Instead, it behaves in some
way that's a little bit outside of what we think of as, you know, the concepts like simultaneous
or things like that. But the way I like to think about it is just that if you think about something
like a regular bit of a computer as being anything that can be in two different states where you can
write it for one of those two different states and you can read it in those two different states.
So when you describe it that way, it sounds confusing. But like, imagine a cup. A cup.
can be upside down or right side up. You can tell if it's upside down or right side up,
and you can change it from upside down to right side up. If you have a cup, then you have a bit
of information. And a cubit is a little bit different in that the information it contains
is kind of more like an arrow that starts at the core of the earth and points to any place on the
surface. It has more robust information than just being upside down or inside out. But in the
all that you can extract from it is information that's like, am I more up or down?
So you could imagine the idea of it being multiple things at once, you can think about it more
like an arrow that's pointing sideways, like to somewhere exactly on the equator.
It's not that it's pointing up and down at the same time in some sort of weird way.
it's that it's pointing away that sort of makes it equally likely to be grouped into up or down.
And even these things are not exactly, like technically exactly what's happening.
But if you think about it more as like it contains a richer amount of information,
then you can extract out by asking, is it up or down?
Then you kind of get a sense of it's a device that contains a different sort of information than a regular bit.
And because of that, you can do different types of calculations with it.
So for me, when you were describing that, it immediately sounded like a vector.
Instead of the vector only pointing left or right, you're able to kind of point it in many
different directions in order to capture more data or more information inside of that,
we'll call it a thing right now.
Is that an accurate description?
Yeah.
For your readers who are hanging out or your listeners who are hanging out in front of a computer,
there's a thing called a block sphere.
And if you Google that, you'll come up with this picture that's basically exactly what you
describe.
It's like a vector that starts in the center of the sphere and reaches out and points to some
place on the outside of it.
And that's the framework that people use to visualize what's happening inside a quantum
computer.
But I hesitate to go much further in this direction because in some sense, I feel like a lot
of the conversations around quantum computers really kind of die.
into what is a quantum computer in the sense that it would be like if you asked me what a car was
and I described that it was 1.2 tons of aluminum that was foraged at this location and mined from
this place. That's all interesting and it's all true. And if you want to build a car, you need to know
that. But if you want to know why you should care about a car, it's kind of the exact wrong place
to be able to start because in some sense, you should want to care about a car before.
or you want to know how a car works, you know, you need to be motivated to actually invest the time
and understanding how to build one of these things by saying, I have this problem.
My horse is only capable of going a certain number of kilometers in a day.
I wish there was a better way.
And that's, I think, actually, a much more interesting place to talk about, especially the
overlap between my interests and your interests and how they sort of come together in this
interesting world. So in some ways, I think maybe talking about what quantum computers do is an
interesting way in order to motivate people to care about how they work.
Let's pull on that thread a little bit. Let's talk about the applications as they exist today
for quantum computers, and then we'll go a little bit deeper after that.
Well, the thing that's really great is we don't have to go deep into the applications for quantum
computers because at present, there aren't many. And the applications that
do exist are really only capable of being run at a very small scale. So you could think of it.
I like to use the analogy of if you had a calculator that only had one digit slot, you could
appreciate the power of a calculator by using this calculator, even though this calculator
probably not actually make you better at doing your taxes or more or less any useful thing
that you can do. And that's where quantum computers really sort of sit today is they're at the
stage where the quantum computers that you use presently, you can do the equivalent of 2 plus 2.
You can see it gets 4. You can know that quantum computer is behaving correctly because it's doing
that. But if you try to do the equivalent of 5 plus 5, you'll get an error and you'll realize,
you know, this is sort of gone beyond the scope that we have right now. Now, what we're usually
doing instead of 1 plus 1, 2, 2, 2, we're usually using these quantum computers and the quantum
information that they contain to simulate the interaction of quantum information in the real world.
What we're mostly at one cubit, the company that I'm working at right now, what we're doing
here is mostly thinking about how to build better quantum computers and how to help quantum computers
be better at doing the things that we're interested in using them for, and building applications
that really take advantage of these fledgling capabilities. And we're almost entirely in terms
of using these things for real applications focused on the emergence of chemistry from physics.
And that's extremely interesting because that's really something where, you know, the way the
universe actually works is that there are these physics properties that come together in nature
and in reality. And based on how physics works, all of chemistry sort of emerges based on these
calculations and their calculations that are vastly more complex than any traditional computer
is likely to ever be capable of. And so what's really exciting is if you're interested in moving
from a chemistry laboratory to a chemistry laboratory simulation in software, like I said at the
very beginning, you need a computer, which is good at things that classical computers are really
bad at. And it happens that one of the strengths of quantum computers is manipulating quantum
information and manipulating quantum information gives you a great insight into understanding
how the world around us is constructed at that sort of chemical material level. And so that's
one of the things that we're really excited about. In fact, if you listen to a lot of talks,
there's sort of primers on quantum computers. It's often kind of noted anecdotally that the reason that
people really think about quantum computers is largely stemmed back to or credited to Richard
Feynman, who was saying, not we want to build a quantum computer initially, but we want to build a
quantum simulator. And what he meant by that was not that we want to build a computer that can
simulate the quantum world. He was saying we want to take quantum materials and build them into a
simulating device. And so that's really the original idea behind a quantum computer and the first
applications of sort of what we call large-scale fault-tolerant quantum computers are likely to
also be in this realm. Now, more interesting probably to the conversation that I think we're going to get
into is the fact that after that idea was proposed, but before the first quantum computer had been
built, a gentleman named Peter Shore came up with this idea of using quantum computers to
actually do something else that computers, traditional computers are not very good at. And that thing
ends up being related to factoring, which becomes related to encryption. And that's one of the other
sort of well-known things that a quantum computer of a sufficient size is capable of doing.
And it's certainly one of the reasons why people who are interested in cryptography and cryptocurrencies
are close watchers of the progress of quantum computers, because, as I think we'll get into
discussing, if you can do things that traditional computers are bad at, there's the possibility
that what we considered hard tasks become easy, and that has ramifications for people
who are interested in cryptography, privacy, and cryptocurrencies.
So let's go ahead and talk about that, because I think that's where most of my audience has
a genuine interest is on the security side. So not even talking Bitcoin, just talking encryption
in general. And you think about e-commerce, you think about everything that's going over the
internet in a secure way. It's doing it through encryption that is pretty much been standardized
on global finance. So when we start thinking about what those implications are and how
disruptive quantum computing could be to that, we're not just talking about Bitcoin. We're
talking about everything. We're talking about Amazon. We're talking about the big banks, literally
everything. So talk about the implications of this. How far off from a timeline are we? And I know
that's insanely difficult to project, but just give us some of your thoughts on some of those ideas.
Maybe the first thing to say that almost sounds condescending, but I feel like if I just keep saying
this to myself, then it really helps anchor me in understanding that we're talking about quantum
computers and not magic. And so the refrain is quantum computers are not magic. And the reason that
that's really helpful is because there's sort of all the crazy spookiness of the quantum world. And in some
ways, the quantum world itself, when you learn some of the things that are just true as far as we can
understand, quantum itself and it's the ways that we describe it are very strange. And there's a tendency
to sort of just import the sort of mystical weirdness of the interpretations of the quantum world
into quantum computing. And that's a bit of a mistake. It's really better to think about it as a
device that works based on the principles of the quantum world, but which is capable of doing
some very specific things and is incapable of doing most things. So one thing that a quantum computer
isn't is a better computer. And I say that because computers are really good at almost everything
and pretty bad at a fairly small number of types of things. If you have a computer, you can calculate
almost anything. And because of that, when people were initially trying to think about
encryption and basically being able to communicate things securely, one of the first things that
people had to really question is, well, what are computers bad at? And essentially, they took the
approach of if we just make it so that decrypting our private information requires you to do
something that computers are bad at. Then in some sense, it shouldn't be that difficult to build
a process where even if you have a computer, you're incapable of reading my message because
the message requires you to do something that computers are bad at. Now, it's a lot of. It's a computer. It's
even slightly more tricky than that, because it not only needs to be something where, let's call it,
unzipping your message is something that computers are bad at, also has to be something
where actually locking these messages is something that your computers are good at. And so people,
I'm sure your listeners are really familiar with the idea of one-way functions or sometimes
referred to as track door functions. But that's kind of exactly what people did. They said,
if we can figure out some of these different types of algorithms that are easy to do one direction
and hard to do the other direction, then we can use that in order to make secrets. And as long as what's
hard for computers today is hard for computers in the future, then we should be able to rely on
these as being generally good methods. And that's how most of what we think of is exchanging
private information or keeping secrets kind of works. And it goes back to that first point that we
we were talking about, which is that it just happens that quantum computers are good at doing
a small number of things that classical computers are pretty bad at. And one of those things
is exactly related to that process of sort of unzipping that message without having the
requisite knowledge that's necessary to do it efficiently on a classical computer. So that's why,
sort of at a high level, why cryptography and quantum computers are related is because it's
not even just that it's hypothesized that if you had a quantum computer, you might be able to do
these things. In some sense, the theory came ahead of the realization of the device itself, and it's
mathematically proven that if you have a device that looks like the kind of quantum computers that
people want to build, then you'll be capable of decrypting this information significantly better
than could ever be possible with a classical device. And that's sort of the interesting piece.
So when I look at, and I think this is important for the audience, you had mentioned the one-way
functions. I'm just going to explain this as simply as I can. And if you find that my definition is in
air here, please correct me. But for folks that aren't familiar with what we're talking about,
with Bitcoin, when you have a private key and you have a public address, think of it like,
this. If I told you my address to mail me a piece of mail, that's obviously my public
information. Anybody can know that. But to open the door to my house and to get in, there's
a key that's associated with that address. The person who has that private key can then
open the house to come in. When you think about encryption and you think about how is that
private key generated, it's generated through a one-way function. So think of it like if you
provide some inputs into this function and it produces an output.
it's really easy to kind of generate that output. But to go the opposite direction, once you know
what that output is and to figure out what the inputs were in order to generate it, it's extremely,
extremely difficult. And the only way to figure it out is through a bunch of guessing.
And so that's where the computer comes in. The computer is making millions upon trillions of guesses
or whatever those numbers are in order to try to figure out what the original inputs were
in order to generate that private key.
So, Andrew, if I missed anything or you think that that's a kind of a bad description,
please chime in.
No, it's great.
That's absolutely the definition of a one-way function.
And to make it even more real, you know, you can think about it like this.
One of the ways that we actually use this and specifically how sort of what's at the core
of the RSA method of privacy that's commonly used is actually to say if you have a very
large number that has only two factors, then being able to find those two factors is very hard,
and yet being able to create a very large number that is the result of multiplying together two
primes is extremely easy. So think about it. If I give you a number, let's say we want to encrypt
this conversation, then my public key can be 8,633. And what's interesting is there's only two
factors that actually multiply together to make that number. I chose that number because of that fact.
It's to try and figure it out, really just to say, okay, well, is it even? Is it divisible by two?
No, is it divisible by three? No, is it divisible by four? And we have to keep kind of counting
that way until we actually find one number that divides into it. And of course, that gives you
the other number. So in this instance, even though it's very easy to multiply 89 and 97, if I should
just give you 8,633 and ask you for that, it'll take you a pretty long time to be able to give me
8997, which are the only two numbers that are divisible or that number is divisible by.
So I think that sort of really helps to kind of get a sense of it when you realize,
if I give you a pen and a piece of paper, it might not be trivial to multiply two numbers together,
but you can do it so much faster than you can do the reverse, which is to break that number
down into its components. And that feature, the fact that even for humans, it's easier to multiply
it than to be able to find out what two prime numbers multiply together to create this larger
number. That's something that is easy to experience the one wayness of that function.
We've built most of the internet on top of that. Let's take a quick break and hear from today's
sponsors. All right. I want you guys to imagine spending three days in Oslo at the height of the summer.
You've got long days of daylight, incredible food, floating saunas on the Oslo Fjord, and every
conversation you have is with people who are actually shaping the future.
That's what the Oslo Freedom Forum is.
From June 1st through the 3rd, 2026, the Oslo Freedom Forum is entering its 18th year,
bringing together activists, technologists, journalists, investors, and builders from all over
the world, many of them operating on the front lines of history.
This is where you hear firsthand stories from people using.
Bitcoin to survive currency collapse, using AI to expose human rights abuses, and building
technology under censorship and authoritarian pressures. These aren't abstract ideas. These are
tools real people are using right now. You'll be in the room with about 2,000 extraordinary
individuals, dissidents, founders, philanthropists, policymakers, the kind of people you don't just
listen to but end up having dinner with. Over three days, you'll experience powerful mainstaged
talks, hands-on workshops on freedom tech and financial sovereignty, immersive art installations,
and conversations that continue long after the sessions end. And it's all happening in Oslo in June.
If this sounds like your kind of room, well, you're in luck because you can attend in person.
Standard and patron passes are available at Osloof Freedom Forum.com with patron passes offering
deep access, private events, and small group time with the speakers. The Oslo Freedom Forum isn't just a
conference, it's a place where ideas meet reality and where the future is being built by people
living it.
If you run a business, you've probably had the same thought lately.
How do we make AI useful in the real world?
Because the upside is huge, but guessing your way into it is a risky move.
With NetSuite by Oracle, you can put AI to work today.
NetSuite is the number one AI cloud ERP, trusted by over 43,000 businesses.
It pulls your financials, inventory, commerce,
HR and CRM into one unified system. And that connected data is what makes your AI smarter. It can
automate routine work, surface actionable insights, and help you cut costs while making fast
AI-powered decisions with confidence. And now with the NetSuite AI connector, you can use the AI of
your choice to connect directly to your real business data. This isn't some add-on, it's AI built
into the system that runs your business. And whether your company does millions or even hundreds
of millions, NetSuite helps you stay ahead. If your revenues are at least in the seven figures,
get their free business guide, demystifying AI at netsuite.com slash study. The guide is free to you
at net suite.com slash study. NetSuite.com slash study. When I started my own side business,
it suddenly felt like I had to become 10 different people overnight wearing many different hats.
Starting something from scratch can feel exciting, but also incredibly overwhelming and lonely.
That's why having the right tools matters.
For millions of businesses, that tool is Shopify.
Shopify is the commerce platform behind millions of businesses around the world and 10% of all
e-commerce in the U.S. from brands just getting started to household names.
It gives you everything you need in one place, from inventory to payments to analytics.
So you're not juggling a bunch of different platforms.
You can build a beautiful online store with hundreds of ready-to-use templates, and Shopify is packed with helpful AI tools that write product descriptions and even enhance your product photography.
Plus, if you ever get stuck, they've got award-winning 24-7 customer support.
Start your business today with the industry's best business partner, Shopify, and start hearing...
Sign up for your $1 per month trial today at Shopify.com slash WSB.
Go to Shopify.com slash WSB.
That's Shopify.com slash WSB.
All right.
Back to the show.
You know how it helped me really understand it?
So there's websites that have various encryption functions on them.
So like the Shaw-256 encryption that Bitcoin uses.
What I did is I went on there and there was just a text input.
And you could literally enter anything and then it would produce the output of the hash function.
And so, you know, I just went in there and I played around with it. I typed the word the
and there's the hash function. And so I wrote down what that hash function was. And then I changed
it to something much longer like a paragraph. And it still output a hash function that had the same
number of string variables inside of it. Is that the correct terminology that used? However many outputs
there was, it was the same whether I put the word the in there or I put a whole paragraph or
put a whole page or an entire book, it's still producing a hash of the same length. And so when I went back
and I put the word the back in, it produced the exact same output that I had used before.
And that was kind of a lightbulb moment for me to kind of really understand this one-way
function, hash function, that encryption techniques use so that it produces this same output
based on the input that was provided in this public and private key kind of situation.
You kind of touched on two concepts, which are really closely related, but it's meaningful.
And I think one of the answers to a question that will likely come up later where we can refer
back to this moment, but encryption and hashing are very closely related, but slightly different.
And so probably from most of this conversation, we're not actually going to be talking about
hatching functions like SHA or MD5 people might be familiar with. Those are all like
Merkel-Dangard construction-based mathematical methods that are slightly different from encryption.
And the reason is because exactly like you described, if you put in the, then you're likely to get a fixed string
of characters. And if you put just the one, like maybe a one character at the end of the,
it completely changes what the hash that you receive at the end looks like, right? So a small
change makes it completely different. But what's also interesting is because of the fact that
it's giving you a fixed length output, there's actually many different things that could be
hashed into the same output. And so even if you know exactly what the,
hash function is and had the ability to run it backwards and to be able to see the outputs,
there's many possible things that could have done that. So it's actually not the case that even
if you sort of know how to reverse that out, that you can be certain which of those inputs
were used to be able to create it. Whereas with encryption, and I think we'll probably be talking
more about RSA and elliptic curve cryptography and things like that, what's interesting is that they are
also based on sort of that complex mathematics and kind of a one-way style function, but it's literally
a mapping where you can both put something into the encrypted format and then take it back to the
unencrypted format, which is slightly different from hashing. And so given that cryptocurrencies
touch on both encryption and hashing, it's important to sort of have that slight distinction
because it becomes meaningful for especially quantum computers.
Very fascinating point. I was not aware of that. Let's talk about where some of this is today. So the last I read on this big Google announcement, they had a 63-cubit quantum computer. On the surface of this, I'm looking at this as an outsider who really doesn't understand any of this stuff in any type of depth. And I'm saying to myself, this is getting crazy. Like they could probably do 100 or 500 or a thousand in the coming years. In fact, I saw IBM is making an announcement that they're trying to have a,
a thousand cubic computer by 2023. So what is your opinions on that? How meaningful is that?
Just in general, what are your thoughts? My first thought is that when you said the G word there,
my G-powered home picked you up and started giving you answers about quantum computers. So I feel
like Google's really gunning for me from a couple different angles here. Yeah, absolutely. The thing
That's really great about what we're doing presently as a community of researchers thinking about quantum computers is that in addition to really thinking about the algorithm side, stuff like the Shores algorithm that we talked about before or the modeling of the emergence of quantum information.
There's also great work that's being done to actually build different types of these devices.
So some companies are interested in being able to take an approach that's really kind of.
kind of take the computing technologies that we currently have and make them quantum.
And so you could think about Google's approach of using superconducting materials to build
computers.
They're actually not exactly the same, but they're similar in terms of how you would build
them to a traditional computer.
There's a lot of technology that's come from building computers that were capable of
reusing in that style of quantum device.
But there's also some people who have taken a very different approach of saying start with something that's quantum and make it into a computer.
So people have been trying to build computers that work on photonics for a long time.
But if you could build a computer that calculated utilizing photons, since photons are inherently quantum mechanical, you've kind of got a leg up that way.
Or you might have heard of ion trap quantum computers.
There's a company called ion queue that's making a lot of waves right now for the devices they've built.
They're actually about the bits that they have are atoms that are suspended in sort of a trap is why it's called an ion trap.
And addressed with lasers.
They work very different than how the computers that were familiar with operate.
And again, that's not surprising because quantum computers are just computers built a different way that have different.
strengths and weaknesses than the computer we traditionally use. And so there's a few different ways
that you can build these devices. At this moment, there's this really exciting race that's going on
in order to figure out not just how many of these quantum bits you can produce, but also
what ways of producing these bits look most scalable, which ways are the most stable,
which ways are, you can think of it as a tortoise and a hair sort of situation where someone could
blast out the gates with something that's very good in the short term. They get to one,
two, three, four cubits before everybody else, but that it's never capable of getting to
the thousands of cubits that you might need. So I guess I try and give that introduction in order
to frame the fact that my answer of I don't know is based on the fact that there are so many
variables that are happening right now where the first usable quantum computer might actually be
based on techniques that we're not aware of right now.
Or it might be the fact that the thing that Google has just done to be able to show quantum
supremacy, which is a term that was really coined in order to talk about the first time
the quantum computer is able to out-compete a classical computer on the quantum computer's
home turf, really, basically saying if we tilt everything in the quantum computer's favor,
are we capable of giving a quantum computer any problem, whether it's useful or not,
that a classical computer can't do better. Because of course, if a quantum computer can't even
do useless things faster than a classical computer, then it's going to be really hard to find
useful things for it to do. So this is sort of where we sit, is that now people have been able
to show on a few different types of computing devices that they're able to do fairly
unuseful or, let's say, not generally applicable functions that out-compete classical devices.
And so the idea that a quantum computer will never be capable of doing anything that can't be done better, faster, cheaper on a classical device, that's sort of out the window based on these latest results.
But we're still not at a part where we've actually built quantum devices that are capable of doing something useful better than we can currently do with classical devices.
And this is sort of a really interesting middle time where, you know, the success that we've had to date
suggests that we should be able to get there. They're being making quantum computers do useful
things for us in society. But because we haven't actually reached that point yet,
knowing exactly what it looks like when we achieve that point is really something that's up for grabs
based on all the different approaches and all the groups that are working at it presently.
The one thing that's pretty clear, though, is that when we think about something like Shores algorithm, it's not like we're 50% of the way there or 80% of the way there.
We're sort of that like the 1% 0.1% of the way there where it's kind of like, you know, going back to this idea of having a calculator with only one digit place.
What are you capable of doing with that device?
understanding why calculators are valuable.
What are you not capable of doing with that device?
Your taxes.
So going back to your comment there, we're 0.01% of the way there when you're talking
about Shores formula and we're talking about elliptical curve, you know, it being able
to crack elliptical curves at that point.
So if, let's just say IBM's claim that they're going to be at a thousand cubit here
by 2023, if that would play out, let's just say that that's a valid assumption on their
part, where would we be in that percentage, if we're 0.01% today, where would we be in that
percentage if that was true in 2023? Well, one of the things that's really interesting to note,
and again, I'm going to draw on traditional computers, classical computers for this,
is because of the fact that our individual bits are susceptible to some errors and computers
are a little bit imperfect. When we talk about having a bit of information that's stored in your
computer, you actually store that bit a little bit redundantly. You can think about many of your
listeners will be familiar with that movie Minority Report, where, you know, there'd be occasionally
of the three people who are supposed to three, somebody is going to dissent. And this is why it's
good to have three people, because you can always check, you know, who's the outlier. But the less
reliable any individual person is, the more people you need and the more redundancy you need
in order to be statistically likely to be able to ferret out any errors. And so with quantum computers,
because they're so unstable, it's actually hypothesized that you could need on the order of
a thousand or even more cubits to represent what we call one logical cubit, meaning you might
need to take something like a thousand-cubit IBM device and actually turn all of those cubits
into a device that's through something like the minority report style redundancy, able to
firmly hold the data of one cubit within it. And so that's one of the first things is that
when we think about error correction or sometimes people will talk about surface codes,
Essentially, they're all different ways of trying to make it so that you can believe that when
you're on computer gives you the value of a qubit, that it's giving you the appropriate value
that you want. That requires some redundancy, and that redundancy sort of instantly kneecaps
the total amount of usable cubits that you have out the gate. Then you have the next piece,
which is, so let's assume that a thousand cubit equals one cubic for sake of calculations.
then you might need a couple thousand cubits or beyond in order to be able to do these types of
calculations. We might need actually significantly more cubits than are currently available.
And like I sort of alluded to, we might be at the point where the largest computers that we're
building today end up really becoming the foundation of one logical cubit for one of these large
devices. So if we need a thousand times more cubits than we might have in a few years,
then you sort of have to be thinking about the growth of these things from both that error
correction standpoint and the number of logical cubits that you need to go forward. And I should say
some people even put the number as high as millions that you might need in order to do useful
stuff. So we're definitely, we're not right around the corner from
this. It's not going to happen next week. But there's sort of a lively debate right now about,
you know, in most technologies, going from zero to crappy is kind of the hard part. And then
going from crappy to good is something that happens quickly. And some people hypothesize that
actually with quantum computers, going from not existing to crappy might actually be the easy
part and going from crappy to good could be really difficult. A lot of that, again, depends on what
type of quantum computer you're going for, whether you're looking at ion traps or photons or
superconducting devices. And that's why there's no real easy answer to questions like how far in the
future for such and such an application is because as much as, you know, this doesn't fit into a
tweet, being able to say, well, depending on the overhead of error correction, depending on the
total number of cubits from a logical cubits standpoint that you would need to run your device,
And depending on what type of underlying quantum information you're using, like a photon or an ion, the answer is very different.
But all of the devices that we've built to date are really more like proof of concepts for being able to show that we should be able to build an error corrected cubic.
So what you just said was so important to my own understanding of this, because in preparation for this discussion, I was doing research and I'm coming up.
with the questions, like, how many cubits is it going to take in order to crack elliptical
curve cryptography? How many cubits is it going to take to crack 2048 bit RSA? And because that's
what shot 256 uses. When I was finding the answers to these questions, I saw, oh, it's 1,300 to
1,600 cubits to crack elliptical curve cryptology, and it's 4,100 cubits to crack the shot
256. And I'm thinking to myself, all right, so that number's not real high compared to these
numbers that I'm reading that IBM and Google are saying they're going to be creating here in the
next three years. And I'm thinking, this doesn't jive with the general narrative that I've heard
about Bitcoin and just encryption in general and how it marries up with quantum computing.
But based on what you just said, now it's crystal clear to me because if IBM's creating
a thousand-cubit computer here in the next three years,
and a thousand cubic computer might equal one reliable cubit when you're comparing it to these numbers
that I just stated. Now all of a sudden, things look like the 0.01% of the way there that you were
describing earlier. It all makes sense to me. So when I'm looking at this, and I'm looking at the
problem that they're obviously trying to solve, which is not an easy problem. And from my understanding,
it all comes down to the ability in order to synthesize that information. So what are some of the
the ideas, and I know so much of this is theoretical, but how are they going to synthesize
these thousand-cubit computers in order to get to this eventual 500 or thousand cubits of
processing speed? Again, the nice thing is, although there's so many unknowns, we can really
take a lot of guidance from the traditional computers that were built way back in the day.
I'm thinking about when computers were vacuum tubes, for example, we had the same sorts of problems where error correction was desirable and also where these machines were not capable.
It wasn't feasible to imagine building something, say, as powerful as an iPhone, but out of vacuum tubes because, you know, it's like the sorts of things where you'd hear like, oh, we just need to turn like all of the glass in the world into vacuum tubes.
And then we'd have, you know, enough vacuum tubes to do this stuff.
So one of the things that's pretty clear is that it's unlikely that future quantum computers
are going to be big versions of the small quantum computers that we have right now.
And you also never know what you don't know.
So on the sort of pessimistic side, there are some people who point out the fact that
there might be theoretical limits that we don't understand that make it so it's really
impossible to ever build anything beyond kind of a proof of concept quantum computer.
But on the other hand, somebody could make a fault-tolerant cubit tomorrow that's inherently scalable.
And then you'd be in a situation where, you know, you're really much closer to these things.
So hence the huge error bars on most of these conversations around, you know, how closer we are, how far away are we?
It really depends on whether or not our unknown unknowns sort of fall in our favor as quantum computing enthusiasts or fall against us.
And there's really nothing to do to find the answer to that question, except for either
heads down, do the work, or probably pay attention and watch what sort of results are coming
out of the leading institutions that are building these devices.
Let's take a quick break and hear from today's sponsors.
No, it's not your imagination.
Risk and regulation are ramping up.
And customers now expect proof of security just to do business.
That's why VANTA is a game changer.
VANTA automates your compliance process and brings compliance, risk, and customer trust together
on one AI-powered platform.
So whether you're prepping for a stock two or running an enterprise GRC program, VANTA
keeps you secure and keeps your deals moving.
Instead of chasing spreadsheets and screenshots, VANTA gives you continuous automation across
more than 35 security and privacy frameworks.
Companies like Ramp and Ryder spend 82% less time on audits with Vantta.
That's not just faster compliance, it's more time for growth.
If I were running a startup or scaling a team today, this is exactly the type of platform
I'd want in place.
Get started at vanta.com slash billionaires.
That's vanta.com slash billionaires.
Ever wanted to explore the world of online trading, but haven't dared try?
The futures market is more active now than ever before, and plus 500 futures is the perfect
place to start. Plus 500 gives you access to a wide range of instruments, the S&P 500, Nasdaq, Bitcoin,
gas, and much more. Explore equity indices, energy, metals, 4X, crypto, and beyond. With a simple and
intuitive platform, you can trade from anywhere, right from your phone. Deposit with a minimum of
$100 and experience the fast, accessible futures trading you've been waiting for. See a trading
opportunity, you'll be able to trade it in just two clicks once your account is open. Not
sure if you're ready, not a problem. Plus 500 gives you an unlimited, risk-free demo account
with charts and analytic tools for you to practice on. With over 20 years of experience,
Plus 500 is your gateway to the markets. Visit Plus500.com to learn more. Trading in futures
involves risk of loss and is not suitable for everyone. Not all applicants will qualify.
Plus 500, it's trading with a plus.
Billion dollar investors don't typically park their cash in high-yield savings accounts.
Instead, they often use one of the premier passive income strategies for institutional investors,
private credit.
Now, the same passive income strategy is available to investors of all sizes, thanks to the Fundrise
income fund, which has more than $600 million invested in a 7.97% distribution rate,
With traditional savings yields falling, it's no wonder private credit has grown to be a trillion
dollar asset class in the last few years. Visit fundrise.com slash WSB to invest in the Fundrise
Income Fund in just minutes. The fund's total return in 2025 was 8%, and the average annual total
return since inception is 7.8%. Past performance does not guarantee future results, current
distribution rate as of 1231, 2025.
Carefully consider the investment material before investing, including objectives, risks,
charges, and expenses.
This and other information can be found in the income funds prospectus at fundrise.com
slash income.
This is a paid advertisement.
All right.
Back to the show.
So as an investor, I'm always trying to calculate what are my risks and I'm trying to
think of that left and right limit.
And so what you just described, let's just say on the one side of the spectrum,
we got, this isn't even solvable from a physics standpoint. And it's so far off that it's just
nothing to even be concerned with. On the left side of that risk curve, there could be a
breakthrough in the coming year that could have a profound impact on just the speed that this
could take place. Let's play around with that narrative. And so let's say that that happened.
How much time, let's say that that plays out when you think about how the technology has progressed
to date and the implementation of then doing this at scale to get something that could actually
produce a thousand cubits of actual processing power, which might be a million cubic computer.
Once the breakthrough is achieved, what is that? Typically a three-year lag before they could
actually implement and build this thing physically in the world that we would see it, or is it a 10-year
horizon? Because the reason that that's such an important question for not only myself, but
probably everybody who's listening to this, is they're thinking about the speed at which the
adaption to that breakthrough would have to be built into my understanding is that you'd have to
then go to some type of multi-dimensional elliptical curve generation in order to be built into
today's private key generation in order to protect against something like this. So what's that
timeline? And I know this is another timeline question, but it's so important to the investment
thesis for people that are thinking about the risks. Because of the fact that
It's not just about cryptocurrencies, but cryptography just generally.
It kind of is like a question that's analogous to, okay, we believe in climate change.
It's not going to do something catastrophic for us today.
But you never know when it sort of reaches some tipping point.
So when is the right time to start taking action about something that you know is inevitable?
You're just not sure how far into the future it is.
probably the answer is that it makes sense to do something about it now, right?
Especially one of the things that's really interesting to think about is this sounds more
spooky than it actually is, but we're kind of being hacked now by quantum computers of the
future.
And the way that that works is, you know, if you're right now on, say, a Wi-Fi network,
or if you're making a banking transaction and, you know, you're doing it from a coffee shop
or something. You're sending information. It's not like it's, you know, in a tunnel that's private
only to you in some like real sense. Everybody can see the information that you're sending.
It's possible just to sort of flip open a laptop and see all the communication that's going
back and forth. We just can't know what the content of that communication is now, but we can store
that. And in the future, we can use these devices in order to be able to decrypt it. And so one of
the things that's interesting is the question of what's the shelf life of your secrecy.
So it's especially important because my guess is that the NSA or some government organization
might have secrets that they're interested in keeping for a prolonged period of time.
And whether quantum computers come out tomorrow or in five years or in 10 years that are
capable of being cryptographically useful, those devices are going to be capable of.
of doing something that you might not want if you're somebody that's keeping a secret.
Now, because of the way that the blockchain works or blockchains tend to work, there are some
things where actually being able to know old secrets is not particularly damaging. So it's worth
kind of getting into what are the different ways that the blockchains rely on cryptography
and which of those are specifically relevant to things that quantum computers of the future might do,
and how much is that really a problem for people today versus not a problem at all?
And what things are maybe not a problem yet, but we might want to be thinking about working on them
because better do it now and sort of better safe. I'm sorry. And we can get into all those topics.
So when we talk about making things quantum proof, the thing that, that,
for me is just an intuitive response is double encryption, triple encryption, just using the same
shot 256. So if I take something, I encrypt it once, I take it again and I encrypt it again.
Is that getting twice as hard, three times harder every time you do it, or is this some type of
exponential curve when you're double or quadruple or triple encrypting something?
A quick point on just the idea of, of course, we talked a little before about how hashing functions
are a little bit different than encryption functions.
And so if we think more about, say, RSA, then one of the other things that's really helpful
is going back to kind of one of our first principles of quantum computers aren't magic.
So even if quantum computers are capable of doing something in some amount of time,
it doesn't mean that it's capable of doing everything in no time.
So just like a regular computer might take some amount of time to be able to generate or answer
a tough mathematical question, there's still some amount of time. It might be eight minutes. It might
be eight hours, but quantum computers will still have a clock speed, sort of a pace at which they're
capable of doing their primitives. And they need to be able to do a bunch of those operations in a row
in order to answer these sorts of questions. Now, they might be trillions of times faster than
classical computers, but that's still not the same thing as instantaneous.
So even if there's something that a quantum computer is capable of doing relatively
trivially with a particular key length, it's likely the case that it would take longer
to do the same thing for a longer key.
And so even though it's maybe doesn't scale the same way that we'd expect, and there's a lot
of questions about this in practice, like what is the actual device that's working on
this?
It's what is the clock speed?
What are the ways that these things can interact?
But what's important to note is that it's still going to take some amount of time and there's still some number of procedures that have to happen one after another in a quantum computer to be able to answer these problems.
And so to your point, it might not be very sensible to, for example, a regular computer.
If you said like, okay, well, it's easy for a regular computer to multiply something once, but what if I make it multiply it a million times?
The answer is that's still really, really easy because computers are really, really good at multiplying.
And so in practice, it's going to be interesting to see, you know, how much time did it take for, say,
ion Q's actual large-scale quantum computer to be able to tackle, say, a particular key length of a, whatever,
a Diffy-Hellman style encryption method.
It's still likely going to be that there's some.
scaling approach that says that as you make those things more and more difficult, that it still
takes longer and longer for the quantum computer. But that might not be a very sensible way to be
able to protect against quantum computers, because it might be the fact that quantum computers
are so good at doing this compared to classical computers, that these encryption methods start to
become kind of infeasible, like it's harder for a regular computer to do the encryption than it
is for a quantum computer to do the decryption, in which case it still makes sense to try and find
things that, you know, we talked earlier, all encryption is was recognizing that there are some things
that computers can do one direction much faster than they can do another direction. If there are
things that are hard for a classical computer to do one direction and easy the other direction,
and quantum computers can't do it all, for example, then that kind of a problem solved. And that's what
most people mean when they talk about post-quantum encryption methods, they're not talking about
making the current encryption methods just that much harder. They're actually talking about
finding something where the crux of the new encryption method doesn't align with the capabilities
of proposed future quantum computers. Got it. And from what I've read, and I didn't read a whole
bunch, but the little bit that I've read is the multi-dimensional elliptical curve generation
is kind of what you just described in that it's a different approach that would make it
extremely difficult for quantum computing to crack. Is that true in the sense that in the way
that I'm describing it there? Yeah. In fact, the National Institute of Standards and Technology
started, I think, with 69 submissions of potential new encryption methods that
for them to endorse.
And I think it's down to the third round of public review right now.
It's expected that within the next year or so, there will be the final release of these
are the methods that we should all be moving toward in order to protect against these future
problems.
And actually, like you say, you know, our current elliptic curve cryptography, which is
a method that is favored now over RSA.
It has a slightly different method where, you know, we talked about RSAs, about multiplying prime numbers together is easy, but finding those prime numbers again, it's really hard.
Elliptic curve cryptography, which people might know of these, you know, Diffy Hellman is, as I think one of the ones that people are familiar with.
There actually are some, I want to say, subtle changes, but they're fairly complicated.
And by that, I just mean beyond my understanding.
But they've got, you know, great names like, I think the post-quantial.
Quantum super singular, isogynid Diffy Hellman Protocol is something that proposed by Microsoft in 2016.
And lots of work is being done, you know, within private industry.
I went to school at the University of Waterloo and at their Institute for Quantum Computing and the Perimeter Institute.
They're doing lots of work on that method specifically.
But ultimately, I think when the initial standard for quantum resistant cryptography is released in 2022,
they probably will have found a range of different methods, which as far as we can see are both
the one-way function still preserved for classical computers and also that it doesn't have
this feature of what essentially comes down to the ability for something like Shores algorithm
to be able to sort of unzip that information.
And that's what we're really looking for.
And I suspect that that's going to actually be particularly.
particularly useful for some of these new methods, although, I'm sorry, when I say these new methods,
I mean new methods of encryption baked into cryptocurrencies, but I think there's also some clever
stuff that's being done. For example, I know that the P2PK and P2PK addresses that were used really
early on within Bitcoin, those are actually vulnerable to quantum attacks, although the P2PK
addresses, I think, are just straight up vulnerable because they kind of expose the public key.
And if you have the public key, that's kind of like the equivalent of that really big number
where you need to find the components that kind of go into making it up. Once you have that
exposed, then you can sort of attack it. So I think that's one of the real sort of interesting things
is have people made available the information that is itself susceptible to these quantum attacks?
And in the case of Bitcoin, all of those original addresses are actually still are proposed
to be vulnerable to New York cut term quantum computer.
You know, it's interesting that you bring that up because inside the Bitcoin community,
there's a best practice of not reusing the same public address to use it one time and then
to switch to another address.
And this is really kind of what it's getting at.
Is there anything else that you would add on to that?
I mean, I think you kind of already covered it.
but is there anything else that you would add to that?
Yeah, so that's especially true for those P2P-KH addresses,
where those addresses are vulnerable to quantum attacks
once they've been used to spend bitcoins,
because up until the point when you spend from those addresses,
the public keys aren't made public.
And so really, it's only once the public key is available that you can tack it.
So if you transfer your bitcoins to a new P2P-KH address, like you just described,
then they shouldn't be vulnerable to a quantum attack until you make that public key available.
And just so people know, P2PKH, this is pays to public key hash is what that stands for,
versus just pays to public key without the H on the end with the hash.
So just think of it as being run through another one way.
function is kind of probably the best way to think about that.
You know, one of the things that's interesting is I was just looking at apparently fairly
recently, I saw a number of different consultancy reports on this, but it looks like somewhere
between 20 and 25 percent of the bitcoins currently in circulation are vulnerable to quantum
attacks right now because they're still sitting in these potentially vulnerable address
styles as opposed to moving to the CigWitt, I think is the new method that sort of has already
done a good job at making this a more challenging process. And that would be true if we had a
quantum computer at 1,300 to 1,600 cubits because of the amount of processing power required
to crack elliptical curve cryptography. Is that correct? Or are you saying that that's already
in existence today?
It's actually just more that, you know, there's sort of the security by obscurity, which is the idea that if I don't even know the large prime number, again, this is using the RSA version of a one-way function, but it's more helpful than going into what an elliptic curve actually is.
But if I don't know your large prime number, then there's nothing for me to find the factors out.
And so that's one of the ways of keeping these things secret.
But of course, people would probably prefer to say, even if you learn my public key,
I still don't want you to be able to figure out my private keys.
And so because of this, I would like to move to another method.
And those other methods can be the newer type addresses, which my understanding is that
they're already significantly better at dealing with this.
And then on top of that, I suspect that for the actual encryption, we're going to find
that some of these methods, especially the methods that are going to be endorsed by the
National Institute of Standards and Technology will just become integrated in. And so it's not that
this isn't a real issue, but the nice thing is because cryptocurrencies are not sort of created
as one immutable form, instead it's sort of a process that a community of people agree on.
The community can agree to change the way that these things work. And because, again, quantum computers
aren't magic, they're not just about destroying cryptography. They're about doing some things that
classical computers do poorly well. And so if we just change the hard thing to be outside of the
realm of what quantum computers are good at, then that sort of solves the problem. And that's
probably the best practice would be to both abandon those really old addresses that make public key
available and then move to a method of encryption within Bitcoin that makes it so that even when
quantum computers come in the future, even if they're able to find your public key, that you're
still unable to be able to find the private keys that go with it.
I'm kind of curious about the energy requirements on this. I know it's kind of hard to
have any idea what this might look like in 10 years from now as far as the technologies that
kind of evolve and come out. But is this going to be something that's very energy intensive
that only are at the Googles and the IBMs of the world? Or is the idea that this is going to be
not a huge energy demand.
Because of the fact that the first devices are likely to be pretty large, just physically speaking,
they're probably not going to be as efficient as you might imagine from sort of seeing one
of these little quantum chips because you might need a very large number of chips or ion
traps or whatever else interacting.
But generally speaking, when you think about something like the energy requirements that we've all
become familiar with from things like mining cryptocurrency, the idea of having millions of
GPUs or ASICs all sort of doing these hashing functions and taking up energy requirements of
small countries, that's not really the path that quantum computers are on.
And in fact, I think the desirability is that there are some applications which might be
be amenable to both quantum devices and classical devices, but where quantum devices, one of the first
things they might offer is significant decreases in the amount of energy required in order to get
those answers. And so you'll see a lot of people who are interested in quantum computers are actually
interested in them to see whether very power-hungry, large-scale supercomputing tasks can be
ported over to a quantum infrastructure specifically because of the power system.
Interesting. Okay, so for this question, I'm just kind of curious, Bitcoin, cryptocurrency stuff aside,
what is something that in this space you're most excited about or something that you're looking at and just saying,
this is just going to be incredible to see it develop from here?
Well, I kind of alluded to this at the very beginning, but I think that long before we're using quantum computers to sort of reign on the parade of all people who love cryptography and cryptocurrencies,
we're going to be using them to do these really interesting practical things related to
this emergence of chemistry from physics. And the reason that's so interesting is because
a lot of the way that people have traditionally worked in material, I think someone has referred
to as material design, but which has traditionally actually been material discovery, is you
kind of accidentally create Teflon and then you figure out what it's for. And so there's
this kind of weird thing where I joke that sometimes like drug discovery feels like go to the
Amazon, lick a bunch of trees and report back which ones made you feel funny. That's kind of the
limitations that we have right now where there certainly are amazing companies and amazing
researchers thinking about computer-aided material design. But the reason that most of this work
still happens in laboratories is because if we actually want to do experiments,
where we kind of ask the quantum world what the answer is to pouring this speaker into this bucket.
Easiest way that we can do that right now is just to literally do it.
It's like a simulation by simulating it in the actual world.
We think of the laboratory as being in some ways like a simulation environment.
And so that means that, you know, one researcher is capable of doing as many experiments as one researcher can do.
one robot is capable of doing as many experiments as one robot can do.
So you've probably seen those things where there's an array of like a hundred little pipets
that are sucking up liquid and then going and then pouring them into these little microfluid
storage areas.
And these are essentially running 100 parallelized experiments, which imagine the amazing
benefit that you get if you're a materials researcher and all of a sudden you can do
100 experiments when you used to be able to do one.
But we all know from using computers that computers aren't about doing something where it's like you try 100 things and you used to be able to try one thing.
It's more like you try 100 trillion things when you used to be able to do one thing.
And so part of what I think quantum computers legacy, the early legacy of quantum devices are going to be, is the ability to say you can combine all of the wrong gradients of reality into an infinity of forms.
And we've explored such a small percentage of that.
We kind of did all the easy ones, all the ones that kind of come about naturally.
But there should be a near infinity of like exotic forms that we can produce.
And we found some of those by mistake.
But now we should actually be able to say like, I'm looking for a material as these properties,
then simulate bigillions of materials and then be able to like filter by saying, you know,
which one of these is the stretchiest, which one of these is the bouncing?
If you're trying to build something like a car chassis, you would love something that's stronger
than steel, but lighter than styrofoam. Does such a material exist? This is going to be a great
way to be able to start doing that. The way that I kind of hope that this rolls out is first you
end up building these really small things like maybe catalysts. I usually say for the sake of
being boring that might help paint dry faster. So the most exciting thing about quantum computers is
they're going to help you watch paint drive, but for slightly less time.
But that's just the very beginning.
Then it's from building tiny catalysts that are very simple things that you toss in to make
chemical reactions go faster or slower.
Maybe you start being able to build new types of two-dimensional materials, things that are
kind of like sandwiches of stuff like graphite.
And eventually, we hope that we can actually move into small molecules for drugs and drug design
and finally really simulating down at a quantum mechanical level some of the biological systems
to make it so that we can build better drugs and understand more how these things interact.
I think all of that really gets well underway before we start being able to think about
some of these more abstract uses of quantum computers like the encryption stuff that we talked about,
even though the encryption algorithm was written before many of the algorithms that are
going to underpin the materials revolution. Fascinating stuff. What size of a computer are you talking
a thousand cubits for some of that basic, just at a molecular level, like two molecules interacting?
How many cubit computer are you looking at? We are starting to do experiments right now where we have
small, non-error corrected devices. So devices kind of like you just described, that's sort of in that
from 20 to 100 cubit range. And part of what people are trying to understand is, are we capable
of doing small enough calculations that if we run them a bunch of times, you know, we can still kind
of get the right answers because they're sort of just quick and fast use of these devices.
Like, we ran it 100 times and 70% of the time this was the result. So that's probably the
actual result. Is that what you're saying? Yeah, although it's probably more like run it a thousand
times and one time it gets you a really interesting result because that's the sort of challenges
that you're working with. But a lot of what it really comes down to is that's sort of this era of
noisy intermediate scale quantum devices where we sit right now. A lot of people think that we're
going to have to move into something where we have more like on the order of between 100 and 200
error corrected cubits. So that could be anywhere from best case scenario. You could find
a very stable quantum bit that's close to able to be its own lone cubit, or it could be
a thousand or 10,000 times more than that, depending on what the overhead looks like.
But that kind of gives you a sense of, you know, if we're thinking about 100 fault-tolerant
cubits or 200 fault-tolerant cubits, that's still pretty different than, say, the 10,000
might be needed in order to start to do interesting photography.
Just so I'm understanding the math here.
So 100 error-proof cubic, is it about 100,000 cubic computer?
Is that right?
Between 10,000 to 100,000?
Based on what we understand right now and the methods, some device has roughly those
characteristics, and that's a pretty good sort of back-of-the-napkin calculation.
Okay, gotcha.
I'll tell you, Andrew, this has been super enlightening for me.
This is fascinating stuff.
and I have a deep interest in the chemistry stuff, but I'm not so sure that my audience will.
They're definitely encryption people.
This was excellent.
This was awesome.
And I just really appreciate you making time to come on the show.
And for people who don't know, I got introduced to you from Jeff Booth.
I'm curious, how do you know Jeff?
Jeff's a general man about town in Vancouver and probably Canada more broadly.
So I don't even know how I know Jeff.
I just know that I know him.
What a great guy, I'll tell you.
I'm a huge Jeff Booth fan.
Andrew, thank you so much for making time.
Real fast, give us a resource or something that you think would help out.
Just somebody who's curious about this field, maybe a book that does a great job just
kind of summarizing the high points and makes it accessible.
And then also give us a handoff to where people can learn more about you.
Great.
Well, first of all, I'd say, no jokes.
There's a book called Quantum Computing for Babies.
And what's interesting about it is it absolutely does not assume that you know anything about
quantum computers.
It looks awesome on your coffee table.
It shows that you're a sophisticated individual who's thinking about deep things.
But it really does sort of start at kind of a fun place.
And that's, I think, a great thing just to dig into.
If you want to have a book to get yourself going, that's a fun thing to be able to pull up.
And maybe I would say the other thing is, you know, you talked about your interest in chemistry.
Maybe you can start imparting some of that to your audience because your audience should
absolutely be observing the world of chemistry.
Because if chemistry is exploding because of quantum computing, then you know that it's not
long before encryption is sort of the next target out.
So I think of material science as being the Canarian whole mine for cryptography.
I really like that point. That's a great post or a milestone for people to kind of lit in this test for them to pay attention to as this continues to progress. Because like we said, that would be about, let's just call it 100,000 cubic computer that would be doing those calculations. And then pretty much next on deck is elliptical curve, at least the elliptical curve that's being used for Bitcoin, which is the SECP-256K-1 elliptical curve. So if people want to learn more about you, tell them about your company or maybe a buy-
or something that they can read online.
Great.
Well, if anyone's interested in learning more about this,
one of the things that I think is probably not to say that everything in quantum computing
isn't somewhat challenging, but one of the challenges that we've set for ourselves at
1Cubit is trying to make some nice infographics that we think does a great job of taking
the best of what's easy to communicate about quantum computers and making it as easy as possible,
but no easier.
And so if you go to OneCubit.com over the next little bit, we're going to try and be taking people on a bit of a journey through these infographics that hopefully teach you what you need to know that don't take shortcuts that sort of are nice to say but inaccurate. And I feel like that's really nice. I also think that anyone who's heard a little bit about quantum computers and kind of wants to check themselves, there's a researcher named Scott Aronson who was involved with a,
web comic. And if you look at the talk, it's basically a mom who comes and has a kind of
conversation with our son saying, hey, I know you're hearing a lot about quantum computers
lately, honey, and I think it's time that we have the talk so I can help you understand
much more about it. If you've got five minutes and are interested in knowing what you think
you know about quantum computers that might be wrong, or some easy ways to start
kind of digging into a little bit more meat. The talk by Scott Aronson, I think is great.
Awesome. We'll have that in the show notes. I looked up the book, Quantum Computing for Babies,
and I flipped through the digital pages there, and it looks hilarious and awesome all at the same
time. And Worley and Chris will love that you're promoting it. I think it's hilarious and I love it.
All right. Andrew, thanks so much for making time and coming on the show. This was really a pleasure.
Thanks so much for having me, Preston.
Hey, so thanks for everybody listening to the show. If you enjoyed the conversation, be sure to
subscribe to the show on whatever podcast app you're using. We really appreciate that. And if you
have time, leave us a review. So thanks for joining us this week. And we'll catch you next Wednesday.
Thank you for listening to TIP. To access our show notes, courses or forums, go to theinvestorspodcast.com.
This show is for entertainment purposes only. Before making any decisions, consult a professional. This
show is copyrighted by the Investors Podcast Network. Written permissions must be granted before syndication or rebroadcasting.
