CQuIC Seminars
Learning the quantum algorithm for state overlap
Presented by Lukasz Cincio, Los Alamos National Lab
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 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.
3:30 pm, Thursday, April 19, 2018
PAIS-2540, PAIS
Individuals with disabilities who need an auxiliary aid or service to attend or participate in P&A events should contact the Physics Department (phone: 505-277-2616, email: physics@unm.edu) well in advance to ensure your needs are accomodated. Event handouts can be provided in alternative accessible formats upon request. Please contact the Physics front office if you need written information in an alternative format.
A schedule of talks within the Department of Physics and Astronomy is available on the P&A web site at http://physics.unm.edu/pandaweb/events/index.php