Abstracts

Constructing gate cycles with predictable stochastic error rates in the quantum approximate optimization algorithm

Presenting Author: Bram Evert, Rigetti Computing
Contributing Author(s): Mark Hodson, Dennis Feng, Stephen Jeffrey, Ian Hincks, Zhihui Wang, James Sud, Shon Grabbe, Nicolas Didier, Eleanor Rieffel, Davide Venturelli, Joel Wallman, Matt Reagor

Theoretical frameworks for studying quantum algorithms typically assume a well-behaved error model, where average gate fidelities, estimated for instance via randomized benchmarking, are representative and errors are uncorrelated. Experimental quantum hardware routinely breaks these assumptions due to coherent errors and crosstalk. Here, we show how the use of random compilation and cycle calibration strategies can recover a well-behaved error model. These strategies are demonstrated in a large-scale QAOA ansatz.

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

 

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

SQuInT Co-Organizer
Hartmut Haeffner, Associate Professor, UC Berkeley
hhaeffner@berkeley.edu

SQuInT Administrator
Dwight Zier
d29zier@unm.edu
505 277-1850

SQuInT Program Committee
Alberto Alonso, Postdoc, UC Berkeley
Philip Blocher, Postdoc, UNM
Neha Yadav, Postdoc, UC Berkeley
Cunlu Zhou, Postdoc, UNM

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

Tweet About SQuInT 2022!