arXiv ID: 2211.09835v1
Title: Closed-form analytic expressions for shadow estimation with brickwork circuits
Language: English
Authors: Arienzo, Mirko 
Heinrich, Markus 
Roth, Ingo 
Kliesch, Martin 
Keywords: Quantum Physics; Quantum Physics
Issue Date: Nov-2022
Source: arXiv:2211.09835v1 (2022-11)
Abstract (english): 
Properties of quantum systems can be estimated using classical shadows, which implement measurements based on random ensembles of unitaries. Originally derived for global Clifford unitaries and products of single-qubit Clifford gates, practical implementations are limited to the latter scheme for moderate numbers of qubits. Beyond local gates, the accurate implementation of very short random circuits with two-local gates is still experimentally feasible and, therefore, interesting for implementing measurements in near-term applications. In this work, we derive closed-form analytical expressions for shadow estimation using brickwork circuits with two layers of parallel two-local Haar-random (or Clifford) unitaries. Besides the construction of the classical shadow, our results give rise to sample-complexity guarantees for estimating Pauli observables. We then compare the performance of shadow estimation with brickwork circuits to the established approach using local Clifford unitaries and find improved sample complexity in the estimation of observables supported on sufficiently many qubits.
URI: http://hdl.handle.net/11420/14132
Institute: Quantum Inspired and Quantum Optimization E-25 
Document Type: Preprint
Project: Verifizierung und Charakterisierung von Quantentechnologie 
Skalierbarer Quantencomputer mit Hochfrequenz‐gesteuerten gespeicherten Ionen 
Effiziente Materialsimulation auf NISQ-Quantencomputern - Effizientes Auslesen von hybriden Quantencomputern 
Appears in Collections:Publications without fulltext

Show full item record

Page view(s)

15
checked on Dec 9, 2022

Google ScholarTM

Check

Add Files to Item

Note about this record

Export

Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.