Learning the quantum algorithm for state overlap


Cincio, L. (2018). Learning the quantum algorithm for state overlap. Perimeter Institute. https://pirsa.org/18080041


Cincio, Lukasz. Learning the quantum algorithm for state overlap. Perimeter Institute, Aug. 07, 2018, https://pirsa.org/18080041


          @misc{ pirsa_18080041,
            doi = {10.48660/18080041},
            url = {https://pirsa.org/18080041},
            author = {Cincio, Lukasz},
            keywords = {Other},
            language = {en},
            title = {Learning the quantum algorithm for state overlap},
            publisher = {Perimeter Institute},
            year = {2018},
            month = {aug},
            note = {PIRSA:18080041 see, \url{https://pirsa.org}}

Lukasz Cincio Los Alamos National Laboratory

Talk Type Scientific Series


Short-depth algorithms are crucial for reducing computational error on near-term quantum computers, for which decoherence and gate infidelity remain important issues. Here we present a machine-learning inspired approach for discovering such algorithms. We apply our method to a ubiquitous primitive: computing the overlap Tr(rho*sigma) between two quantum states rho and sigma. The standard algorithm for this task, known as the Swap Test, is used in many applications such as quantum support vector machines, and, when specialized to rho=sigma, quantifies the Renyi entanglement. Here, we find algorithms that have shorter depths than the Swap Test, including one that has constant depth (independent of problem size). Furthermore, we apply our approach to the hardware-specific connectivity and gate alphabets used by Rigetti's and IBM's quantum computers and demonstrate that the shorter algorithms that we derive significantly reduce the error - compared to the Swap Test - on these computers.