We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm
computes the expectation value of any observable for any circuit, with a small average error …

Quantifying and verifying the control level in preparing a quantum state are central
challenges in building quantum devices. The quantum state is characterized from …

We introduce a class of quantum non-Markovian processes—dubbed process trees—that
exhibit polynomially decaying temporal correlations and memory distributed across …

The complexity of quantum many-body systems is manifested in the vast diversity of their
correlations, making it challenging to distinguish the generic from the atypical features. This …

The study of generic properties of quantum states has led to an abundance of insightful
results. A meaningful set of states that can be efficiently prepared in experiments are ground …

We analyse the ergodic properties of quantum channels that are covariant with respect to
diagonal orthogonal transformations. We prove that the ergodic behaviour of a channel in …

ABSTRACT A discrete quantum process is represented by a sequence of quantum
operations, which are completely positive maps that are not necessarily trace preserving …

We introduce a class of quantum non-Markovian processes--dubbed process trees--that
exhibit polynomially decaying temporal correlations and memory distributed across time …

The development of classical ergodic theory has had a significant impact on the areas of
mathematics, physics, and, in general, applied sciences. The quantum ergodic theory of …

Any discrete quantum process is represented by a sequence of quantum channels. We
consider ergodic quantum processes obtained by a map that takes the points along the …