Can shallow quantum circuits scramble local noise into global white noise?

DOI10.1088/1751-8121/AD0AC7arXiv2302.00881OpenAlexW4388483788MaRDI QIDQ6148971FDOQ6148971

Publication date: 12 January 2024

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Abstract: Shallow quantum circuits are believed to be the most promising candidates for achieving early practical quantum advantage - this has motivated the development of a broad range of error mitigation techniques whose performance generally improves when the quantum state is well approximated by a global depolarising (white) noise model. While it has been crucial for demonstrating quantum supremacy that random circuits scramble local noise into global white noise - a property that has been proved rigorously - we investigate to what degree practical shallow quantum circuits scramble local noise into global white noise. We define two key metrics as (a) density matrix eigenvalue uniformity and (b) commutator norm. While the former determines the distance from white noise, the latter determines the performance of purification based error mitigation. We derive analytical approximate bounds on their scaling and find in most cases they nicely match numerical results. On the other hand, we simulate a broad class of practical quantum circuits and find that white noise is in certain cases a bad approximation posing significant limitations on the performance of some of the simpler error mitigation schemes. On a positive note, we find in all cases that the commutator norm is sufficiently small guaranteeing a very good performance of purification-based error mitigation. Lastly, we identify techniques that may decrease both metrics, such as increasing the dimensionality of the dynamical Lie algebra by gate insertions or randomised compiling.

Full work available at URL: https://arxiv.org/abs/2302.00881

zbMATH Keywords

quantum computing noisy quantum circuits quantum 81P73 mitigation

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Classification theory, stability, and related concepts in model theory (03C45) Commutation relations and statistics as related to quantum mechanics (general) (81S05) Stochastic analysis (60Hxx) Quantum state spaces, operational and probabilistic concepts (81P16) Networks and circuits as models of computation; circuit complexity (68Q06) Sequences, series, summability (40-XX) Regularization by noise (60H50) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)

Cites Work

Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices

This page was built for publication: Can shallow quantum circuits scramble local noise into global white noise?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6148971)