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:2403.01706 · Quantum Machine Intelligence

Computing exact moments of local random quantum circuits via tensor networks

Paolo Braccia, Pablo Bermejo, Łukasz Cincio, Marco Cerezo

Published Sep 2, 2024• 20 citations
arXivHTMLPDF
DOI
10.1007/s42484-024-00187-8

Related papers

Anticoncentration in Clifford Circuits and Beyond: From Random Tensor Networks to Pseudomagic States

Beatrice Magni, Alexios Christopoulos, Andrea De Luca +1 more

Anticoncentration describes how an ensemble of quantum states spreads over the allowed Hilbert space, leading to statistically uniform output probability distributions. In this work, we investigate the anticoncentration of random Clifford circuits toward the overlap distribution of random stabilizer states. Using exact analytical techniques and extensive numerical simulations based on Clifford replica tensor networks, we demonstrate that random Clifford circuits fully anticoncentrate in logarithmic circuit depth; namely, higher-order moments of the overlap distribution converge to those of random stabilizer states. Moreover, we investigate the effect of introducing a controlled number of non-Clifford (magic) resources into Clifford circuits. We show that inserting a polylogarithmic in qudit number of T states is sufficient to drive the overlap distribution toward the Porter-Thomas statistics, effectively recovering full quantum randomness. In short, this fact presents doped tensor networks and shallow Clifford circuits as pseudomagic quantum states. Our results clarify the interplay between Clifford dynamics, magic-state injection, and quantum complexity, with implications for quantum circuit sampling, many-body quantum physics, and the benchmarking of quantum computational advantage.

arXiv:2502.20455•Physical Review X•Aug 15, 2025•24 citations

Computations in quantum tensor networks

Thomas Huckle, Konrad Waldherr, Thomas Schulte‐Herbrüggen

arXiv:1212.5005•Linear Algebra and its Applications•Jan 27, 2012•57 citations

Scrambling in random unitary circuits: Exact results

Bruno Bertini, Lorenzo Piroli

We study the scrambling of quantum information in local random unitary circuits by focusing on the tripartite information proposed by Hosur et al. We provide exact results for the averaged R\'enyi-2 tripartite information in two cases: (i) the local gates are Haar random and (ii) the local gates are dual-unitary and randomly sampled from a single-site Haar-invariant measure. We show that the latter case defines a one-parameter family of circuits, and prove that for a ``maximally chaotic'' subset of this family quantum information is scrambled faster than in the Haar-random case. Our approach is based on a standard mapping onto an averaged folded tensor network, that can be studied by means of appropriate recurrence relations. By means of the same method, we also revisit the computation of out-of-time-ordered correlation functions, rederiving known formulas for Haar-random unitary circuits, and presenting an exact result for maximally chaotic random dual-unitary gates.

arXiv:2004.13697•Physical review. B./Physical review. B•Aug 10, 2020•113 citations

Large-Scale Simulation of Quantum Circuits via Tensor Network Contraction

Cupjin Huang, Fang Zhang, Michael Newman +10 more

Bulletin of the American Physical Society•Mar 16, 2021•0 citations

Tensor networks for quantum computing

A. V. Berezutskii, Minzhao Liu, Atithi Acharya +25 more

arXiv:2503.08626•Nature Reviews Physics•Jul 30, 2025•21 citations

Estimating the randomness of quantum circuit ensembles up to 50 qubits

Minzhao Liu, Junyu Liu, Yuri Alexeev +1 more

Abstract Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any random unitaries has consequences on their complexity, expressibility, and trainability. To study this property of random circuits, we develop numerical protocols for estimating the frame potential, the distance between a given ensemble and the exact randomness. Our tensor-network-based algorithm has polynomial complexity for shallow circuits and is high-performing using CPU and GPU parallelism. We study 1. local and parallel random circuits to verify the linear growth in complexity as stated by the Brown–Susskind conjecture, and; 2. hardware-efficient ansätze to shed light on its expressibility and the barren plateau problem in the context of variational algorithms. Our work shows that large-scale tensor network simulations could provide important hints toward open problems in quantum information science.

arXiv:2205.09900•npj Quantum Information•Nov 24, 2022•11 citations
Anticoncentration describes how an ensemble of quantum states spreads over the allowed Hilbert space, leading to statistically uniform output probability distributions. In this work, we investigate the anticoncentration of random Clifford circuits toward the overlap distribution of random stabilizer states. Using exact analytical techniques and extensive numerical simulations based on Clifford replica tensor networks, we demonstrate that random Clifford circuits fully anticoncentrate in logarithmic circuit depth; namely, higher-order moments of the overlap distribution converge to those of random stabilizer states. Moreover, we investigate the effect of introducing a controlled number of non-Clifford (magic) resources into Clifford circuits. We show that inserting a polylogarithmic in qudit number of T states is sufficient to drive the overlap distribution toward the Porter-Thomas statistics, effectively recovering full quantum randomness. In short, this fact presents doped tensor networks and shallow Clifford circuits as pseudomagic quantum states. Our results clarify the interplay between Clifford dynamics, magic-state injection, and quantum complexity, with implications for quantum circuit sampling, many-body quantum physics, and the benchmarking of quantum computational advantage.
We study the scrambling of quantum information in local random unitary circuits by focusing on the tripartite information proposed by Hosur et al. We provide exact results for the averaged R\'enyi-2 tripartite information in two cases: (i) the local gates are Haar random and (ii) the local gates are dual-unitary and randomly sampled from a single-site Haar-invariant measure. We show that the latter case defines a one-parameter family of circuits, and prove that for a ``maximally chaotic'' subset of this family quantum information is scrambled faster than in the Haar-random case. Our approach is based on a standard mapping onto an averaged folded tensor network, that can be studied by means of appropriate recurrence relations. By means of the same method, we also revisit the computation of out-of-time-ordered correlation functions, rederiving known formulas for Haar-random unitary circuits, and presenting an exact result for maximally chaotic random dual-unitary gates.
Abstract Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any random unitaries has consequences on their complexity, expressibility, and trainability. To study this property of random circuits, we develop numerical protocols for estimating the frame potential, the distance between a given ensemble and the exact randomness. Our tensor-network-based algorithm has polynomial complexity for shallow circuits and is high-performing using CPU and GPU parallelism. We study 1. local and parallel random circuits to verify the linear growth in complexity as stated by the Brown–Susskind conjecture, and; 2. hardware-efficient ansätze to shed light on its expressibility and the barren plateau problem in the context of variational algorithms. Our work shows that large-scale tensor network simulations could provide important hints toward open problems in quantum information science.