May 25, 2018 · 1h 18m · y-combinator
Simon Benjamin on Architectures for Quantum Computing · Y Combinator
gold bands on the timeline = statements, start to end. Hover to read, click to jump. CC turns on captions
In this Y Combinator interview, Oxford quantum theorist Simon Benjamin explores the physics, hardware architectures, scaling challenges, and commercial prospects of quantum computing. He details how breakthroughs in error correction, ion-trap hardware, and modular optical networking are transforming theoretical physics into a practical engineering reality.
How this conversation actually went
Every chapter scored 0–10 on four independent dynamics. Hover any point for the reasoning behind the score. How this is scored →
speaking balance: gold is the partners, purple is the guest (3 minute bins)
Simon dismisses the commercial hype surrounding 50-qubit supremacy as an empty 'underpants gnomes' profit plan that ignores the lack of useful algorithms at that scale.
Hardest push from the partners ▶ 21:01 Questioning network link error exposureThe host directly challenges Simon's pitch for networked quantum architectures by questioning if arbitrary remote connectivity exposes the system to higher error rates.
Biggest teaching moment ▶ 11:14 Ancilla qubit measurement mechanicsSimon educates the host on how error-detecting ancilla qubits decouple error syndrome extraction from reading the protected logical quantum state.
The partners hold their own ▶ 50:48 Countering code breaking with quantum cryptographyThe host displays domain knowledge by countering Simon's code-breaking discussion, pointing out that quantum communication principles simultaneously provide provably secure defense.
the scores for every segment, with the reasoning behind each
| Chapter | Topic | The partners as informed peer | Guest teaching | Guest disagreement | The partners pushing back | Why |
|---|---|---|---|---|---|---|
| Recent Momentum and Commercial Interest in Quantum Computing | 2 | 5 | 1 | 1 | The host asks open-ended questions about the sudden momentum and laboratory breakthroughs behind quantum computing. Simon explains the core fragility of qubits and Oxford's 99.9% two-qubit gate fidelity record. | |
| Quantum Error Correction and Ancilla Qubit Detection | 4 | 7 | 0 | 2 | Simon details quantum error correction, explaining how ancilla qubits check for flips without directly measuring and collapsing the logical qubit. The host asks perceptive questions about measurement verification ('who guards the guards'). | |
| Fault-Tolerance Thresholds and Closing the Theory-Experiment Gap | 3 | 6 | 0 | 1 | Simon describes the fault-tolerance threshold historically moving from 99.9999% to roughly 99%, closing the gap with lab achievements. The host contributes clarifying points about algorithmic errors and qubit count scaling. | |
| Topological Surface Codes and Hardware Neutrality | 3 | 6 | 1 | 2 | Simon explains topological 2D surface codes and why nearest-neighbor connectivity avoids costly swaps. The host asks whether long-range network links introduce more errors into the system. | |
| Oxford Ion Trap Systems and Schrödinger's Cat Analogy | 2 | 6 | 0 | 0 | The host asks about Oxford's specific hardware approach, prompting Simon to unpack trapped-ion systems via a detailed Schrödinger's cat thought experiment regarding macroscopic superposition. | |
| Trapping Ions in Vacuum and Measuring Decoherence Times | 3 | 6 | 0 | 1 | Simon explains how calcium ions stripped of electrons are trapped in ultra-high vacuum above gold microchips, demonstrating 50-second decoherence times at room temperature. The host seeks quick clarification on temperature conditions. | |
| Long-Running Computations and the Scaling Challenge | 3 | 5 | 1 | 1 | The host asks how long calculations run and whether qubits are swapped out. Simon clarifies that fast gate errors dominate over natural decoherence and frames scaling as the true remaining bottleneck. | |
| Quantum Supremacy and Classical Simulation Limits | 4 | 6 | 1 | 1 | Simon breaks down the 50-qubit threshold of quantum supremacy, noting the exponential RAM requirements needed for classical supercomputers to simulate full state vectors. The host actively follows along, comparing supremacy to AGI narratives. | |
| The Utility Gap: Cryptography versus Molecular Discovery | 4 | 6 | 0 | 2 | Simon contrasts millions of qubits needed for Shor's algorithm with near-term NISQ molecular simulation. The host raises an insightful counterpoint regarding quantum cryptography defending against quantum decryption. | |
| Modular Quantum Architectures and Entanglement Distillation | 3 | 7 | 0 | 1 | Simon outlines his modular architecture proposal: linking small 5-qubit ion traps via photonic interconnects and using entanglement distillation to purify noisy optical channels into high-fidelity Bell pairs. | |
| Optical Link Speed, Server Farm Scale, and Commercial Development | 3 | 5 | 0 | 1 | The host presses on whether modular networking suffers latency compared to monolithic 50-qubit chips. Simon explains photon loss, optical cavities, and how quantum server farms could scale without re-engineering chip physics. | |
| Quantum Hype Cycles, AI Winters, and Career Entry Points | 3 | 5 | 1 | 1 | Simon warns against premature commercial hype and potential quantum winters, drawing parallels to AI history. The host agrees based on his machine learning contacts before asking how non-physicists can enter the field. |