Abstracts

Fidelity Lower Bounds for Graph States from a Small, Constant Number of Measurement Settings

Presenting Author: Tyler Thurtell, University of New Mexico CQuIC
Contributing Author(s): Akimasa Miyake

Benchmarking the performance of noisy intermediate scale quantum (NISQ) devices is a major near-term challenge for quantum information science. A particularly important class of states across many areas of quantum information are the stabilizer or graph states. To aid in the evaluation of the quality of preparation of these states, we introduce operators whose expectation values in a prepared state lower bound the fidelity between that state and a target graph state. The operators we introduce are constructed from linear combinations of efficiently measurable stabilizers. On small graphs, we choose the coefficients to maximize the noise tolerance for a chosen noise model. We then extend the small graph operators to larger graphs so that performance is system size independent under weak, local noise. The result is a new family of operators whose expectation values give fidelity lower bounds for graph states which are tighter while requiring only a constant number of measurement settings.

(Session 5 : Thursday from 12:00pm-2:00 pm)

 

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

SQuInT Co-Organizer
Brian Smith, Associate Professor
bjsmith@uoregon.edu

SQuInT Local Organizers
Philip Blocher, Postdoc
Pablo Poggi, Research Assistant Professor
Tzula Propp, Postdoc
Jun Takahashi, Postdoc
Cunlu Zhou, Postdoc

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

Tweet About SQuInT 2021!