Quantum algorithms are sought after for their potential to outpace classical computing, but since the development of the first quantum algorithms almost 25 years ago, a new breed of classical algorithms has appeared that closely mimics quantum computers. These algorithms, based on tensor networks, provide scaling and capabilities similar to real quantum computers. Originally conceived for simulating small quantum systems or shallow circuits, in tensor networks can sometimes perform so well that they can even allow us to bring certain quantum algorithms back to the classical world, outperforming previously known classical algorithms on today's computers.
After introducing tensor networks from a quantum computing perspective, I will discuss some recent efforts to simulate various quantum algorithms and reflect on the what the results tell us about the boundary between classical and quantum computing.
Zoom link: https://bnl.zoomgov.com/j/1605020278?pwd=cHJ1bDRuK1FDNnZLSnpxVkZhcDQ3QT09