Probing the limits of classical computing with arbitrarily connected quantum circuits

          @misc{ scivideos_PIRSA:24040094,
            doi = {10.48660/24040094},
            url = {https://pirsa.org/24040094},
            author = {Foss-Feig, Michael},
            keywords = {Quantum Information},
            language = {en},
            title = {Probing the limits of classical computing with arbitrarily connected quantum circuits},
            publisher = {Perimeter Institute for Theoretical Physics},
            year = {2024},
            month = {may},
            note = {PIRSA:24040094 see, \url{https://scivideos.org/index.php/pirsa/24040094}}
          }
          

Abstract

Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distribution of two-dimensional quantum circuits. Many attempts to close this gap have utilized classical simulations based on tensor network techniques, and their limitations shed light on the improvements to quantum hardware required to inhibit classical simulability. In particular, state of the art quantum computers having in excess of ~50 qubits are primarily vulnerable to classical simulation due to restrictions on their gate fidelity and their connectivity, the latter determining how many gates are required (and therefore how much infidelity is suffered) in generating highly-entangled states. Here, we describe numerical evidence for the difficulty of random circuit sampling in highly connected geometries.