Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1506.03323 · Quantum Information Processing

Propagation of correlations in local random quantum circuits

Siddhartha Santra, Radhakrishnan Balu

Published Aug 27, 2016• 2 citations
arXivHTMLPDF
DOI
10.1007/s11128-016-1412-y

Related papers

Universal Spreading of Conditional Mutual Information in Noisy Random Circuits

Su-un Lee, Changhun Oh, Yat Wong +2 more

We study the evolution of conditional mutual information (CMI) in generic open quantum systems, focusing on one-dimensional random circuits with interspersed local noise. Unlike in noiseless circuits, where CMI spreads linearly while being bounded by the light cone, we find that noisy random circuits with an error rate p exhibit superlinear propagation of CMI, which diverges far beyond the light cone at a critical circuit depth t_{c}∝p^{-1}. We demonstrate that the underlying mechanism for such rapid spreading is the combined effect of local noise and a scrambling unitary, which selectively removes short-range correlations while preserving long-range correlations. To analytically capture the dynamics of CMI in noisy random circuits, we introduce a coarse-graining method, and we validate our theoretical results through numerical simulations. Furthermore, we identify a universal scaling law governing the spreading of CMI.

arXiv:2402.18548•Physical Review Letters•Nov 15, 2024•11 citations

Non-local propagation of correlations in long-range interacting quantum systems

A.C. Lee, Philip Richerme, Zhihao Gong +6 more

Bulletin of the American Physical Society•Jun 4, 2014•9 citations

Two-step phantom relaxation of out-of-time-ordered correlations in random circuits

Jaš Bensa, Marko Žnidarič

We study out-of-time-ordered correlation (OTOC) functions in various random quantum circuits and show that the average dynamics is governed by a Markovian propagator. This is then used to study relaxation of OTOC to its long-time average value in circuits with random single-qubit unitaries, finding that relaxation in general proceeds in two steps: In the first phase that lasts upto an extensively long time the relaxation rate is given by a phantom eigenvalue of a nonsymmetric propagator, whereas in the second phase the rate is determined by the true 2nd largest propagator eigenvalue. We also obtain exact OTOC dynamics on the lightcone and an expression for the average OTOC in finite random circuits with random two-qubit gates.

arXiv:2112.07281•Physical Review Research•Mar 25, 2022•29 citations

Random Quantum Circuits as Seeds for Continuous Generative Models

Olli Hirviniemi, Afrad Basheer, Thomas Cope

We introduce a random circuit family and show they are robust against current classical simulation techniques, specifically tensor network contraction and Pauli propagation. We also show that local variables do not concentrate, ensuring enough variance to be able to produce a diverse set of data points. We therefore argue that using these circuits as a "random seed" for a larger classical generative model is a way to make large-scale quantum-classical hybrid models amenable towards NISQ devices.

quant-pharXiv:2602.10049•Feb 11, 2026•2 citations

Notes on Interrogating Random Quantum Circuits

Luís T. A. N. Brandão, René Peralta

•Jan 1, 2020•4 citations

Local random quantum circuits: Ensemble completely positive maps and swap algebras

Paolo Zanardi

We define different classes of local random quantum circuits (L-RQC) and show that (a) statistical properties of L-RQC are encoded into an associated family of completely positive maps and (b) average purity dynamics can be described by the action of these maps on operator algebras of permutations (swap algebras). An exactly solvable one-dimensional case is analyzed to illustrate the power of the swap algebra formalism. More in general, we prove short time area-law bounds on average purity for uncorrelated L-RQC and infinite time results for both the uncorrelated and correlated cases.

arXiv:1303.2832•Journal of Mathematical Physics•Aug 1, 2014•10 citations
We study the evolution of conditional mutual information (CMI) in generic open quantum systems, focusing on one-dimensional random circuits with interspersed local noise. Unlike in noiseless circuits, where CMI spreads linearly while being bounded by the light cone, we find that noisy random circuits with an error rate p exhibit superlinear propagation of CMI, which diverges far beyond the light cone at a critical circuit depth t_{c}∝p^{-1}. We demonstrate that the underlying mechanism for such rapid spreading is the combined effect of local noise and a scrambling unitary, which selectively removes short-range correlations while preserving long-range correlations. To analytically capture the dynamics of CMI in noisy random circuits, we introduce a coarse-graining method, and we validate our theoretical results through numerical simulations. Furthermore, we identify a universal scaling law governing the spreading of CMI.
We study out-of-time-ordered correlation (OTOC) functions in various random quantum circuits and show that the average dynamics is governed by a Markovian propagator. This is then used to study relaxation of OTOC to its long-time average value in circuits with random single-qubit unitaries, finding that relaxation in general proceeds in two steps: In the first phase that lasts upto an extensively long time the relaxation rate is given by a phantom eigenvalue of a nonsymmetric propagator, whereas in the second phase the rate is determined by the true 2nd largest propagator eigenvalue. We also obtain exact OTOC dynamics on the lightcone and an expression for the average OTOC in finite random circuits with random two-qubit gates.
We introduce a random circuit family and show they are robust against current classical simulation techniques, specifically tensor network contraction and Pauli propagation. We also show that local variables do not concentrate, ensuring enough variance to be able to produce a diverse set of data points. We therefore argue that using these circuits as a "random seed" for a larger classical generative model is a way to make large-scale quantum-classical hybrid models amenable towards NISQ devices.
We define different classes of local random quantum circuits (L-RQC) and show that (a) statistical properties of L-RQC are encoded into an associated family of completely positive maps and (b) average purity dynamics can be described by the action of these maps on operator algebras of permutations (swap algebras). An exactly solvable one-dimensional case is analyzed to illustrate the power of the swap algebra formalism. More in general, we prove short time area-law bounds on average purity for uncorrelated L-RQC and infinite time results for both the uncorrelated and correlated cases.