Sep 15, 2026 · 1 hr 13 min · 11 segments
Most quantum computers being built today chase more qubits and better error correction. Marta Estarellas's company Qilimanjaro went the other way: an analog system that lets physics do the…
Marta EstarellasGuest
Anders IndsetHost
And he talks about, you know, the abstraction of the universal computer and his idea of that universal quantum computing.

But I think I know computing, like, abandons universality, and it's basically you elect to physic be the computation.

So in David Deutsch's sense, is then your machine a computer at all, or is it more like a programmable physical experiment, if you like?

So actually, you can prove the equivalence between gate-based quantum computing and adiabatic quantum computing.

You, of course, need to have the programmability and topology that allows you to embed problems at either platforms, but technically you could make an analog quantum computer that is universal.

You probably want to tailor those systems to the specific applications that you believe will excel for.

So if I have a short algorithm, I wouldn't get into the fuss of trying to fit that algorithm into an analog quantum computer.

Because the Schrodinger algorithm was invented to be running the gabe-based system and it's very nice and it's very neat.

Yes, you can do it and you can find papers of people that found a way of doing this, but probably it's not so efficient, so you get too much overhead to do so.

It's the same thing with other algorithms that have been specifically invented and thought for gate-based quantum computing.

And depending how physically based the problem is, it will go into an analog QPU.

Do you think you can draw a line then between just, I mean, simulating a system and then simply just building it? Because, I mean, the arguments that you have, I hear those in the industry, but then you see the conventional GPUs get more efficient.

And he talks about, you know, the abstraction of the universal computer and his idea of that universal quantum computing.

But I think I know computing, like, abandons universality, and it's basically you elect to physic be the computation.

So in David Deutsch's sense, is then your machine a computer at all, or is it more like a programmable physical experiment, if you like?

So actually, you can prove the equivalence between gate-based quantum computing and adiabatic quantum computing.

You, of course, need to have the programmability and topology that allows you to embed problems at either platforms, but technically you could make an analog quantum computer that is universal.

You probably want to tailor those systems to the specific applications that you believe will excel for.

So if I have a short algorithm, I wouldn't get into the fuss of trying to fit that algorithm into an analog quantum computer.

Because the Schrodinger algorithm was invented to be running the gabe-based system and it's very nice and it's very neat.

Yes, you can do it and you can find papers of people that found a way of doing this, but probably it's not so efficient, so you get too much overhead to do so.

It's the same thing with other algorithms that have been specifically invented and thought for gate-based quantum computing.

And depending how physically based the problem is, it will go into an analog QPU.

Do you think you can draw a line then between just, I mean, simulating a system and then simply just building it? Because, I mean, the arguments that you have, I hear those in the industry, but then you see the conventional GPUs get more efficient.
The rest of this transcript — segmented and speaker-labeled, so you land on the exact moment something was said
Search every transcript — by keyword, by phrase, or by meaning, across every show Radar indexes
Trends — what is surging across podcasts, measured against its own baseline
Alerts — when a name you follow appears in a newly indexed episode
No account is needed to search Radar.