The demand to solve increasingly complex problems is accelerating beyond the capabilities of traditional computing approaches. Quantum computing promises to revolutionize a host of industries by enabling rapid solutions to complex problems that are currently intractable for more traditional – or classical – computers. 

As a primary funder of quantum research since 2009, IARPA-sponsored efforts have resulted in multiple world-record demonstrations of quantum computing capabilities, including achieving a “Quantum Advantage” – when a quantum computer can solve a problem more efficiently than a classical one. IARPA-funded quantum efforts have also led to over a thousand publications, dozens of patents, and the 2012 Nobel Prize in Physics.

If you haven't already, head over to our website, at https://www.iarpa.gov/podcast, where you will find resources and citations for this, and all of our episodes, including examples of quantum computing systems.

In part two of this two-part episode, we discuss with Michael why quantum is such an IARPA hard problem, unpack IARPA’s history of quantum breakthroughs over the last decade, explore what applications might come from quantum computing in the future, and much more – including how Michael’s first foray into engineering and maybe even the world of quantum might of have had its roots in the mechanics of bowling alley pin setters.