Approximate inverse measurement channel for shallow shadows

Abstract

Classical shadows are a versatile tool to probe many-body quantum systems, consisting of a combination of randomised measurements and classical post-processing computations. In a recently introduced version of the protocol, the randomization step is performed via unitary circuits of variable depth $t$, defining the so-called shallow shadows. For sufficiently large $t$, this approach allows one to get around the use of non-local unitaries to probe global properties such as the fidelity with respect to a target state or the purity. Still, shallow shadows involve the inversion of a many-body map, the measurement channel, which requires non-trivial computations in the post-processing step, thus limiting its applicability when the number of qubits $N$ is large. In this work, we put forward a simple approximate post-processing scheme where the infinite-depth inverse channel is applied to the finite-depth classical shadows and study its performance for fidelity and purity estimation. The scheme allows for different circuit connectivity, as we illustrate for geometrically local circuits in one and two spatial dimensions and geometrically non-local circuits made of two-qubit gates. For the fidelity, we find that the resulting estimator coincides with a known linear cross-entropy, achieving an arbitrary small approximation error $\delta$ at depth $t=O(\log (N/\delta ))$ (independent of the circuit connectivity). For the purity, we show that the estimator becomes accurate at a depth $O(N)$. In addition, at those depths, the variances of both the fidelity and purity estimators display the same scaling with $N$ as in the case of global random unitaries. We establish these bounds by analytic arguments and extensive numerical computations in several cases of interest. Our work extends the applicability of shallow shadows to large system sizes and general circuit connectivity.

27 pages, 9 figures; v3: minor revision and references updated

References in corpus (70)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Persistent entanglement in arrays of interacting particles
• Improved Simulation of Stabilizer Circuits
• Superconducting Qubits: Current State of Play
• Error mitigation for short-depth quantum circuits
• Characterizing Quantum Supremacy in Near-Term Devices
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Strong quantum computational advantage using a superconducting quantum processor
• Symmetric Informationally Complete Quantum Measurements
• The ITensor Software Library for Tensor Network Calculations
• A Theory of Fault-Tolerant Quantum Computation
• Programmable Quantum Simulations of Spin Systems with Trapped Ions
• Semiconductor Spin Qubits
• Probing entanglement entropy via randomized measurements
• Random Quantum Circuits
• Direct Fidelity Estimation from Few Pauli Measurements
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• Tools for quantum simulation with ultracold atoms in optical lattices
• Stim: a fast stabilizer circuit simulator
• The randomized measurement toolbox
• Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators
• Quantum simulation and computing with Rydberg-interacting qubits
• Practical characterization of quantum devices without tomography
• Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
• Rényi Entropies from Random Quenches in Atomic Hubbard and Spin Models
• Error-mitigated digital quantum simulation
• Quantum Computer Systems for Scientific Discovery
• Measurement-induced entanglement and teleportation on a noisy quantum processor
• Onset of Random Matrix Behavior in Scrambling Systems
• Statistical correlations between locally randomized measurements: a toolbox for probing entanglement in many-body quantum states
• Preparing random states and benchmarking with many-body quantum chaos
• The power of random measurements: measuring Tr(ρ^n) on single copies of ρ
• The Tensor Networks Anthology: Simulation techniques for many-body quantum lattice systems
• Exponential Error Suppression for Near-Term Quantum Devices
• Theory of quantum system certification: a tutorial
• A general framework for randomized benchmarking
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates
• Reliable quantum certification for photonic quantum technologies
• A scalable superconducting quantum simulator with long-range connectivity based on a photonic bandgap metamaterial
• Classical Shadow Tomography with Locally Scrambled Quantum Dynamics
• Matrix Product Density Operators: Renormalization Fixed Points and Boundary Theories
• Quantum chaos in the Brownian SYK model with large finite $N$: OTOCs and tripartite information
• Theoretical and Experimental Perspectives of Quantum Verification
• Verification of Many-Qubit States
• Experimental single-setting quantum state tomography
• Entanglement dynamics in hybrid quantum circuits
• Characterizing multipartite entanglement with moments of random correlations
• Quasiprobability decompositions with reduced sampling overhead
• Shallow shadows: Expectation estimation using low-depth random Clifford circuits
• Scalable and Flexible Classical Shadow Tomography with Tensor Networks
• Benchmarking highly entangled states on a 60-atom analog quantum simulator
• Quantum error mitigation via matrix product operators
• Fidelity witnesses for fermionic quantum simulations
• Multipartite Entanglement Analysis From Random Correlations
• Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage
• Operator relaxation and the optimal depth of classical shadows
• Classical shadows with Pauli-invariant unitary ensembles
• Cross-Platform Comparison of Arbitrary Quantum Computations
• Analysing quantum systems with randomised measurements
• Robust estimation of the Quantum Fisher Information on a quantum processor
• Closed-form analytic expressions for shadow estimation with brickwork circuits
• Demonstration of Robust and Efficient Quantum Property Learning with Shallow Shadows
• Entanglement Growth and Minimal Membranes in $(d+1)$ Random Unitary Circuits
• Hilbert space delocalization under random unitary circuits
• Enhanced observable estimation through classical optimization of informationally over-complete measurement data -- beyond classical shadows
• Classical shadows based on locally-entangled measurements
• Many-body entropies and entanglement from polynomially-many local measurements
• Tensor network noise characterization for near-term quantum computers
• Robust ultra-shallow shadows

Cited by in corpus (3)

• Low variance estimations of many observables with tensor networks and informationally-complete measurements
• Anticoncentration in Clifford Circuits and Beyond: From Random Tensor Networks to Pseudo-Magic States
• Learning mixed quantum states in large-scale experiments