Abstracts

Variational quantum state diagonalization

Presenting Author: Patrick Coles, Los Alamos National Laboratory
Contributing Author(s): Ryan LaRose, Arkin Tikku, Etude O'Neel-Judy, Lukasz Cincio

Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gate sequence (with exponential speedup over classical cost evaluation), and a classical computer uses this information to adjust the parameters of the gate sequence. Here we present such an algorithm for quantum state diagonalization. State diagonalization has applications in condensed matter physics (e.g., entanglement spectroscopy) as well as in machine learning (e.g., principal component analysis). For a quantum state $\rho$ and gate sequence $U$, our cost function quantifies how far $U \rho U^{\dagger}$ is from being diagonal. We introduce novel short-depth quantum circuits to quantify our cost. Minimizing this cost returns a gate sequence that approximately diagonalizes $\rho$. One can then read out approximations of the largest eigenvalues, and the associated eigenvectors, of $\rho$. As a proof-of-principle, we implement our algorithm on Rigetti's quantum computer to diagonalize one-qubit states and on a simulator to find the entanglement spectrum of the Heisenberg model ground state.

Read this article online: https://arxiv.org/abs/1810.10506

(Session 5 : Sunday from 5:00pm - 7:00pm)

 

SQuInT Chief Organizer
Akimasa Miyake, Associate Professor
amiyake@unm.edu

SQuInT Local Organizers
Rafael Alexander, Postdoctoral Fellow
Chris Jackson, Postdoctoral Fellow

SQuInT Administrator
Gloria Cordova
gjcordo1@unm.edu
505 277-1850

SQuInT Assistant
Wendy Jay

SQuInT Founder
Ivan Deutsch, Regents' Professor, CQuIC Director
ideutsch@unm.edu

Tweet About SQuInT 2019!