Dispatches from Google's hunt for super-quadratic quantum advantage in new applications

The ultimate dream of quantum computing, and the plan of record for many industrial efforts, is to build a fault-tolerant quantum computer. While many problems are amenable to a quadratic quantum speedup, the high overheads of quantum error-correction necessitate higher order polynomial speedups for practical quantum advantage with reasonable resources. This talk will cover recent work at Google which has sought to expand the portfolio of use cases benefitting from a super-quadratic speedup. The talk may cover research into fundamentally new quantum algorithms, as well as research seeking new applications for established paradigms.