Best Place To BuildQuantum Mechanics, qubits, superposition & superconductors with Prof. Prabha Mandayam | BP2B S2 E11
CHAPTERS
- 0:49 – 2:04
Show setup and framing the “explain quantum computing in 30 minutes” challenge
The host introduces the BP2B podcast setting at IIT Madras and sets a beginner-friendly challenge for Prof. Prabha Mandayam: explain quantum computing in an intuitive way. Prof. Mandayam’s background in quantum information and error correction is briefly established.
- •Podcast premise: meet builders at IIT Madras and learn what they’re building
- •Guest intro: Prof. Prabha Mandayam, quantum information & error correction
- •Host positions himself as a novice to keep explanations accessible
- •The conversation will connect fundamentals to real-world impact
- 2:04 – 6:56
From bits to qubits: the Bloch-sphere picture of superposition
Prof. Mandayam contrasts classical bits (0/1) with qubits using a sphere model: instead of two poles, a qubit can occupy any point on the sphere’s surface. Superposition is introduced as the key reason the information space expands beyond binary states.
- •Classical computing encodes information strictly as 0 or 1
- •Qubit visualized as a point on a sphere (two angles specify the state)
- •Superposition enables “in-between” states rather than only endpoints
- •Coin-toss-in-a-box analogy for probabilistic outcomes upon measurement
- 6:56 – 10:53
Why quantum gives speedups: Deutsch’s oracle example and scaling intuition
Using the constant-vs-balanced function problem, Prof. Mandayam explains how superposition can reduce the number of required queries. The discussion emphasizes how a small toy example generalizes to larger inputs and hints at exponential speedups in certain settings.
- •Oracle/black-box model: classical needs two queries; quantum can need one
- •Superposition as “computing both branches” in a controlled way
- •Scaling from 1-bit to n-bit functions can yield dramatic advantages
- •Positioning: the value proposition is faster computation for specific problems
- 10:53 – 13:27
Physical meaning of “quantum”: single photons, polarization, and probabilistic laws
The term “quantum” is grounded in microscopic physics—single photons, electron spins, and atoms—where measurement outcomes are inherently probabilistic. Polarization is used to show how single-particle behavior differs from classical intensity-based descriptions.
- •Bulk light behaves classically; single-photon behavior reveals quantum effects
- •A single photon cannot ‘partly pass’ and ‘partly block’—outcomes are discrete
- •Superposition is the right description at the single-particle level
- •Quantum computing uses quantum-mechanics-governed objects as information carriers
- 13:27 – 16:17
Origins and milestones: from photoelectric effect to Schrödinger and Heisenberg
The conversation places quantum mechanics in historical context, explaining why the field marks roughly a century of development. Key early milestones—photoelectric effect, quantization, Schrödinger equation, and uncertainty—are tied back to modern quantum ideas.
- •‘100 years’ anchor: Schrödinger equation era (mid-1920s)
- •Golden period of foundational development (1920–1925)
- •Earlier roots: photoelectric effect and Einstein’s photon concept (1905)
- •Core concepts: probabilistic theory and uncertainty principle
- 16:17 – 20:22
Algorithms that changed everything: Deutsch, Shor, Grover—and why RSA matters
Prof. Mandayam explains how quantum computing became strategically important when Shor’s factoring algorithm threatened RSA-based public-key cryptography. Grover’s search algorithm is introduced as a broadly useful speedup that attracted industry interest.
- •Quantum computing idea ~40 years old; early spark: Deutsch’s algorithm
- •Shor’s algorithm: polynomial-time factoring on a quantum computer
- •Implication: breaks RSA assumptions used in everyday secure communication
- •Grover’s algorithm: quadratic speedup for search/optimization-style problems
- 20:22 – 26:00
From theory to machines: superconducting qubits, control challenges, and decoherence
The discussion shifts to hardware: how qubits are physically realized and why building quantum processors is hard. Decoherence is framed as the central fragility problem, motivating error correction and the need for engineered isolation plus controllability.
- •Early hardware progress: superconducting qubits (plus photonic demonstrations)
- •Need for precise control and measurement at microscopic scales
- •Decoherence: qubits drift/collapse toward classical behavior due to environment
- •Engineering trade-off: isolate qubits, but still interact to compute
- 26:00 – 31:50
Scaling reality check: 100-qubit demos vs the million-qubit era for fault tolerance
Prof. Mandayam contextualizes headline results like Google’s ~100-qubit chips as proofs of principle rather than full-scale capability. The conversation highlights how many qubits are estimated for meaningful cryptographic attacks and why error correction drives requirements upward.
- •2016+ enabled chip-based integration; recent ~100-qubit experiments are milestones
- •Demonstrations of Shor so far are tiny (e.g., factoring 15/21)
- •To break modern RSA: tens of thousands of ideal qubits; with QEC: ~million scale
- •Advantage is primarily in time/steps, but qubit count becomes critical with noise
- 31:50 – 37:45
Quantum error correction, no-cloning, and entanglement as the workaround
Classical redundancy (repetition codes) is contrasted with quantum constraints, especially the no-cloning theorem. Entanglement is introduced as the mechanism that allows redundancy without copying, enabling quantum error-correcting codes that protect superpositions.
- •Classical error correction: redundancy + majority vote handles bit flips
- •Quantum must protect an entire state space (superpositions), not just 0/1
- •No-cloning theorem: you can’t copy arbitrary unknown quantum states
- •Entanglement-based encoding (e.g., 3-qubit repetition code) distributes information across the whole system
- 37:45 – 40:02
Will quantum computing be personal or centralized? Facilities, access, and use-cases
The host asks whether quantum computers will become handheld like phones or remain specialized infrastructure. Prof. Mandayam predicts near-term centralized facilities where researchers submit problems (e.g., protein folding, optimization) rather than consumer devices.
- •Analogy to early classical computing: centralized access before personal devices
- •Likely near-term model: specialized quantum computing facilities
- •Near-term value: training, proof-of-principle tasks, early applications
- •Examples: optimization and scientific workloads (protein folding mentioned)
- 40:02 – 45:51
What to learn and where the field is headed: linear algebra, VQAs, architectures, and engineering
Prof. Mandayam outlines skills for entering the field—especially linear algebra—and distinguishes algorithmic approaches like variational quantum algorithms used for scientific problems. Multiple hardware architectures are compared, emphasizing that quantum progress is increasingly engineering-driven.
- •Core math for programming quantum computers: linear algebra (plus probability basics)
- •Variational quantum algorithms for chemistry/biology-style problems may require deeper QM knowledge
- •Architectures: photonic, superconducting, trapped ions, neutral atoms; no clear ‘winner’ yet
- •Tooling: cloud access and software stacks (e.g., IBM Qiskit) are emerging
- •Quantum engineering is a key workforce need: control/design of single quantum systems
- 45:51 – 55:03
Quantum research in India and the National Quantum Mission: hubs, QKD, and concrete goals
The conversation turns to India’s position in the global race and argues India can still catch up, especially in hardware. Prof. Mandayam explains National Quantum Mission hubs, the role of quantum communication and QKD, and measurable targets like intercity secure links and mid-scale processors.
- •India’s strengths: strong theory groups; growing experimental and hardware efforts
- •National Quantum Mission hubs: communication (IITM), computing (IISc), sensing (IITB), materials (IITD)
- •Quantum Key Distribution (QKD): security based on physics, not factoring hardness
- •Concrete mission goals: Chennai–Bangalore secure link (and later Chennai–Delhi), ~50-qubit-class hardware targets
- •Interdisciplinary ecosystem: CS, EE, physics, chemistry, biotech, operations research; industry interest (e.g., optimization/EV charging)
- 55:03 – 1:04:13
Prof. Mandayam’s path into quantum information: early influences, Caltech, and choosing curiosity over trends
Prof. Mandayam describes her education (Chennai → IIT Madras) and early exposure to quantum foundations through her father. She recounts formative experiences (Bell experiments, entanglement, quantum random walks) and joining John Preskill’s group at Caltech, emphasizing an interest-led career rather than trend-following.
- •Background: BSc in physics (Chennai), MSc at IIT Madras
- •Influence: father’s work in quantum foundations/measurement
- •Key spark: Bell/CHSH topics and early entanglement literature; quantum random walks
- •Graduate step: PhD with John Preskill at Caltech; early adopter of quantum computing as a field
- •Career philosophy: follow interest rather than perceived ‘safe’ paths (e.g., string theory trend)
- 1:04:13 – 1:11:06
Women in quantum & closing advice: barriers, choices, and why the next decade matters
The host asks about women’s participation in quantum/engineering physics; Prof. Mandayam notes progress but continued imbalance, and discusses social expectations and self-selection as key factors. The episode closes with encouragement for students to enter quantum now for durable skills and exciting growth.
- •Current gender ratios still modest; some improvement in engineering physics cohorts
- •Main drop-off drivers: expectations and life-planning pressures around higher studies
- •Peer effects and role-model visibility influence field choice
- •Work culture perspective: research roles can offer autonomy/flexibility when environments are respectful
- •Closing message: next decade is a strong time to learn quantum; skills will remain valuable
