Episode
Why Quantum Computers Need New Compilation Algorithms
- Published
- Jun 17, 2026
- Duration seconds
- 479
- Processing state
not_requested
Actions
POST https://stenobird.com/v1/public/podcasts/the-quantum-computing-podcast-with-fexingo-qubits-quantum-hardware-and-future-computing-7871946/episodes/why-quantum-computers-need-new-compilation-algorithms/transcription-requests
Idempotently request low-priority transcript generation for this episode.GET https://stenobird.com/podcast/the-quantum-computing-podcast-with-fexingo-qubits-quantum-hardware-and-future-computing-7871946/why-quantum-computers-need-new-compilation-algorithms.md
Read the agent-friendly Markdown representation of this episode resource.
Summary
Episode 56 of The Quantum Computing Podcast dives into quantum compilation — the unsung layer between a programmer's code and a machine's microwave pulses. Lucas and Luna discuss why today's compilers lose 80% of qubit coherence time just scheduling operations, and how a team at the University of Chicago's new method called 'temporal slicing' cuts that overhead in half. They walk through a concrete example: a 50-qubit simulation of a lithium-sulfur battery molecule that would take a classical computer 12,000 years. With temporal slicing, the same simulation runs in 47 hours on a trapped-ion machine. The hosts also explore why hardware-native gate sets force compilers into suboptimal paths, and how the race between superconducting, trapped-ion, and photonic hardware means compilers must be hardware-agnostic. No hype, just the real bottleneck that'll determine whether quantum computing delivers on its timeline. #QuantumCompilation #QubitCoherence #TemporalSlicing #UniversityOfChicago #LithiumSulfurBattery #TrappedIon #SuperconductingQubits #PhotonicQuantum #GateSet #QuantumAlgorithms #Simulation #CompilerDesign #QuantumSoftware #Technology #FexingoBusiness #BusinessPodcast #QuantumComputing #HardwareAbstraction Keep every episode free: buymeacoffee.com/fexingo