Best Place To BuildQuantum Mechanics, qubits, superposition & superconductors with Prof. Prabha Mandayam | BP2B S2 E11
Prabha Mandayam on quantum computing basics, hardware progress, and India’s path forward today.
In this episode of Best Place To Build, featuring Prabha Mandayam, Quantum Mechanics, qubits, superposition & superconductors with Prof. Prabha Mandayam | BP2B S2 E11 explores quantum computing basics, hardware progress, and India’s path forward today Prof. Prabha Mandayam explains qubits via the Bloch-sphere intuition—superposition expands information states beyond classical 0/1 and enables certain algorithmic speedups.
At a glance
WHAT IT’S REALLY ABOUT
Quantum computing basics, hardware progress, and India’s path forward today
- Prof. Prabha Mandayam explains qubits via the Bloch-sphere intuition—superposition expands information states beyond classical 0/1 and enables certain algorithmic speedups.
- The conversation traces why quantum computing became strategically important: Deutsch’s early algorithm, Shor’s factoring threat to RSA, and Grover’s quadratic speedup for search/optimization.
- A central bottleneck is decoherence (noise) and the resulting need for quantum error correction, which is harder than classical coding because arbitrary quantum states cannot be cloned.
- The episode surveys leading hardware architectures—photonic, superconducting, trapped ions, and neutral atoms—highlighting why superconducting platforms currently lead in qubit counts but still fall far short of fault-tolerant scale.
- India’s National Quantum Mission is presented as a concrete, hub-based effort (computing, communication, sensing, materials), with near-term deliverables like city-to-city quantum key distribution links and mid-scale prototype processors.
IDEAS WORTH REMEMBERING
5 ideasA qubit is best understood as a point on a sphere, not a number between 0 and 1.
Mandayam uses the Bloch-sphere picture: classical bits sit at the poles (0 and 1), while quantum states occupy infinitely many surface points parameterized by two angles, enabling superposition states.
Quantum advantage is primarily about reducing computational steps/time, not replacing billions of transistors with a few qubits.
Even with relatively modest qubit counts, certain algorithms can reduce query complexity (e.g., Grover’s √N search), but meaningful real-world advantage still depends on circuit depth, error rates, and fault tolerance.
Shor’s algorithm is the inflection point that made quantum computing a security and geopolitics issue.
Factoring large integers threatens RSA-based public-key encryption; this catalyzed government and industry funding, shifting quantum computing from “toy problems” to strategic infrastructure.
Decoherence is the core engineering obstacle: isolation helps, but control/measurement reintroduce noise.
You want qubits shielded from the environment, yet you must interact with them to compute and read out results—creating a fundamental trade-off that drives hardware design and error-correction needs.
Quantum error correction is harder than classical coding because you cannot copy unknown quantum states.
Classical repetition codes rely on redundancy via copying; the No-Cloning Theorem blocks a “quantum Xerox,” so protection must be achieved through entanglement-based encodings and syndrome-style measurements.
WORDS WORTH SAVING
5 quotesImagine the coin in flight, and let’s say you capture it in a box as it is in flight. That’s a quantum state.
— Prof. Prabha Mandayam
Last year, with Google’s, like, 100 qubit experiment… that’s like a first proof of principle that you can put 100 qubits on a chip.
— Prof. Prabha Mandayam
Take your friend’s notes… and make a copy of the entire notebook. No, not possible. So you cannot copy quantum information.
— Prof. Prabha Mandayam
If you had very ideal qubits… you could, for example, crack today’s RSA with about tens of thousands of qubits… [with] error-corrected qubits… at least a million qubits.
— Prof. Prabha Mandayam
Today, it’s very much an engineering problem.
— Prof. Prabha Mandayam
QUESTIONS ANSWERED IN THIS EPISODE
5 questionsIn your Bloch-sphere explanation, what’s the most common misconception people form about “being between 0 and 1,” and how do you correct it without heavy math?
Prof. Prabha Mandayam explains qubits via the Bloch-sphere intuition—superposition expands information states beyond classical 0/1 and enables certain algorithmic speedups.
When you say quantum speedups come from fewer queries/steps, what practical bottleneck usually dominates first in today’s devices: qubit count, gate fidelity, or circuit depth?
The conversation traces why quantum computing became strategically important: Deutsch’s early algorithm, Shor’s factoring threat to RSA, and Grover’s quadratic speedup for search/optimization.
You mention factoring 15 and 21 as proofs of principle—what specific missing capability prevents scaling to even a 20-bit number demonstration?
A central bottleneck is decoherence (noise) and the resulting need for quantum error correction, which is harder than classical coding because arbitrary quantum states cannot be cloned.
Can you walk through (conceptually) how syndrome measurements let quantum error correction work without violating the No-Cloning Theorem?
The episode surveys leading hardware architectures—photonic, superconducting, trapped ions, and neutral atoms—highlighting why superconducting platforms currently lead in qubit counts but still fall far short of fault-tolerant scale.
Among superconducting, trapped-ion, neutral-atom, and photonic approaches, what single engineering breakthrough would most quickly change the “leading architecture” ranking?
India’s National Quantum Mission is presented as a concrete, hub-based effort (computing, communication, sensing, materials), with near-term deliverables like city-to-city quantum key distribution links and mid-scale prototype processors.
Chapter Breakdown
Setting the stage at IIT Madras + Prof. Prabha Mandayam’s focus
The host introduces the Best Place To Build Podcast and frames the episode as a crash course in quantum computing. Prof. Prabha Mandayam is introduced along with her work in quantum information and (especially) quantum error correction.
From classical bits to qubits: the Bloch-sphere intuition
Prof. Mandayam contrasts classical bits (0/1) with qubits using a sphere model (Bloch sphere). The key idea is that a qubit can occupy infinitely many states between 0 and 1, which is captured by the notion of superposition.
Superposition made tangible: coin-in-flight and polarization of light
To make superposition feel less abstract, the discussion uses a coin toss analogy (capturing the coin mid-flight) and then a more physical example: photon polarization. This links the math of superposition to a real lab system people can imagine and measure.
Why it’s called ‘quantum’: single-particle physics and photons
The word ‘quantum’ is tied to behavior at microscopic scales—single photons, single electron spins, single atoms—where outcomes become fundamentally probabilistic. The conversation explains how bulk light behaves classically, but reducing to single-photon regimes reveals quantum effects.
100 years of quantum mechanics + the birth of quantum algorithms
The episode situates quantum mechanics historically (Schrödinger/Heisenberg era; roots in photoelectric effect) and then distinguishes modern quantum computing as ~40 years old. It highlights early algorithmic milestones that demonstrated computational advantage.
Why quantum computing mattered to the world: Shor, Grover, and RSA
The discussion moves from toy speedups to real-world impact: Shor’s factoring algorithm threatens RSA-based security, while Grover’s algorithm accelerates search. These results are presented as catalysts for major government and industry investment.
Hardware reality check: architectures and the ‘transistor moment’
Attention shifts from algorithms to building machines—what it takes to create controllable qubits on chips. The episode surveys leading qubit architectures and explains why superconducting qubits became prominent as an engineering path toward scalable processors.
Decoherence: why qubits are fragile and error correction is central
Prof. Mandayam explains decoherence as the process by which quantum states leak into classical behavior due to environmental interactions. The conversation frames error correction as the defining challenge: isolate qubits enough to preserve states, but still control and measure them.
How many qubits are ‘enough’: from 100 today to millions for RSA-scale tasks
The host compares billions of transistors to ~100-qubit quantum chips and asks what scale is required for meaningful advantage. Prof. Mandayam clarifies that advantage is usually in time/steps, but practical factoring at scale requires large numbers of error-corrected qubits.
Quantum error correction: redundancy without copying + the no-cloning theorem
Classical error correction uses redundancy by copying bits, but quantum states can’t be duplicated arbitrarily due to the no-cloning theorem. The episode explains why quantum error correction must encode information differently—protecting an entire state space, not just 0/1.
Entanglement as the workaround: encoding information into the whole system
Entanglement is introduced as the key ingredient enabling quantum error correction. By spreading information across multiple qubits in a way that can’t be decomposed into independent parts, systems can detect/correct errors while respecting quantum constraints.
Will quantum computers be personal devices? Likely ‘facilities’ first
The conversation explores whether quantum computers could become handheld like smartphones. Prof. Mandayam predicts specialized shared facilities in the near term—similar to early mainframe access—before any consumer-scale transformation becomes plausible.
What to learn + programming the stack: linear algebra, VQAs, and Qiskit
The episode becomes a practical guide for learners: linear algebra is the core language of quantum computing, with probability theory as support. It also touches on variational quantum algorithms for chemistry/biology use cases and how people can program real devices via platforms like IBM Qiskit.
Quantum research in India: National Quantum Mission, hubs, and milestones
Prof. Mandayam outlines India’s position in the global race and argues India can still catch up, especially in hardware. She explains the National Quantum Mission structure (four hubs) and gives concrete deliverables for communication and computing targets.
Prof. Mandayam’s journey into quantum + women in the field + closing advice
The episode closes with Prof. Mandayam’s personal path—from Chennai to IITM to Caltech—and her emphasis on following curiosity rather than trends. She discusses gender representation challenges and encourages students to enter quantum now as skills will remain valuable regardless of how the field evolves.
EVERY SPOKEN WORD
Install uListen for AI-powered chat & search across the full episode — Get Full Transcript
Get more out of YouTube videos.
High quality summaries for YouTube videos. Accurate transcripts to search & find moments. Powered by ChatGPT & Claude AI.
Add to Chrome