Bruno Bertini
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Recognitions
Bruno Bertini has a total of 53 co-authors. Here are the top co-authors by number of shared publications:
- Katja Klobas
University of Birmingham
14 shared publications Pasquale Calabrese
SISSA
13 shared publications- Pavel Kos
Max Planck Institute of Quantum Optics
13 shared publications - Lorenzo Piroli
Dipartimento di Fisica e Astronomia, Università di Bologna and INFN, Sezione di Bologna, via Irnerio 46, I-40126 Bologna, Italy
12 shared publications - Tomaž Prosen
University of Ljubljana
7 shared publications Tomaž Prosen
Department of Physics, Faculty of Mathematics and Physics, University of Ljubljana, Jadranska 19, SI-1000 Ljubljana, Slovenia
6 shared publications
Latest Publications
- Open Access
- 22 October 2026
- Published by Sissa Medialab Srl in Journal of Quantum Science
- Vol. 1 (1)
Athermality of generalized Gibbs ensembles
- 22 October 2026
- Published by Sissa Medialab Srl in Journal of Quantum Science
- Vol. 1 (1)
Open AccessAthermality of generalized Gibbs ensembles
- Open Access
- 1 October 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (4)
Asymptotically Solvable Quantum Circuits
The discovery of chaotic quantum circuits with (partially) solvable dynamics has played a key role in our understanding of non-equilibrium quantum matter and, at the same time, has helped the development of concrete platforms for quantum computation. It was shown that solvability does not prevent the generation of chaotic dynamics, however, it imposes nontrivial constraints on the generated correlations. A natural question is then whether it is possible to gain insight into the generic case despite the latter being very hard to access. To address this question here we introduce a family of “asymptotically solvable” quantum circuits where the solvability constraints only affect correlations on length scales beyond a tunable threshold. This means that their dynamics are only solvable for long enough times: for times shorter than the threshold they are generic. We show this by computing both their dynamical correlations on the equilibrium (infinite temperature) state and their thermalization dynamics following quantum quenches from compatible (asymptotically solvable) non-equilibrium initial states. The class of systems we introduce is generically ergodic but contains a non-interacting point, which we use to provide exact analytical results, complementing those of numerical experiments, on the non-solvable early time regime.
- 1 October 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (4)
Open AccessAsymptotically Solvable Quantum Circuits
The discovery of chaotic quantum circuits with (partially) solvable dynamics has played a key role in our understanding of non-equilibrium quantum matter and, at the same time, has helped the development of concrete platforms for quantum computation. It was shown that solvability does not prevent the generation of chaotic dynamics, however, it imposes nontrivial constraints on the generated correlations. A natural question is then whether it is possible to gain insight into the generic case despite the latter being very hard to access. To address this question here we introduce a family of “asymptotically solvable” quantum circuits where the solvability constraints only affect correlations on length scales beyond a tunable threshold. This means that their dynamics are only solvable for long enough times: for times shorter than the threshold they are generic. We show this by computing both their dynamical correlations on the equilibrium (infinite temperature) state and their thermalization dynamics following quantum quenches from compatible (asymptotically solvable) non-equilibrium initial states. The class of systems we introduce is generically ergodic but contains a non-interacting point, which we use to provide exact analytical results, complementing those of numerical experiments, on the non-solvable early time regime.
- Open Access
- 18 June 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 113 (6)
Vanishing correlations in stochastic and bistochastic controlled circuits
We study the dynamics of circuits composed of stochastic and bistochastic controlled gates. This type of dynamics arises from quantum circuits with random controlled gates, as well as in stochastic circuits and deterministic classical cellular automata. We prove that stochastic and bistochastic controlled gates lead to two-point spatiotemporal correlation functions that vanish everywhere except when the two operators act on the same site. More generally, for multipoint correlations the two rightmost operators must act on the same site. We argue that autocorrelation, while hard to compute, typically decays exponentially toward a value that is exponentially small in the system size. Our results reveal a broad class of quantum systems that exhibit surprisingly simple correlation structures despite their complex microscopic dynamics.
- 18 June 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 113 (6)
Open AccessVanishing correlations in stochastic and bistochastic controlled circuits
We study the dynamics of circuits composed of stochastic and bistochastic controlled gates. This type of dynamics arises from quantum circuits with random controlled gates, as well as in stochastic circuits and deterministic classical cellular automata. We prove that stochastic and bistochastic controlled gates lead to two-point spatiotemporal correlation functions that vanish everywhere except when the two operators act on the same site. More generally, for multipoint correlations the two rightmost operators must act on the same site. We argue that autocorrelation, while hard to compute, typically decays exponentially toward a value that is exponentially small in the system size. Our results reveal a broad class of quantum systems that exhibit surprisingly simple correlation structures despite their complex microscopic dynamics.
- Open Access
- 8 June 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (3)
Quantum state designs from minimally random quantum circuits
Random many-body states and matrices are both a useful tool to model certain physical systems and an important asset for quantum computation. Realizing them, however, generally requires an exponential (in system size) amount of resources. Recent research has presented a way out by showing that one can generate random states and matrices, or more precisely a controlled approximation of them, by applying a quantum circuit built in terms of few-body unitary gates. Most of this research has been focussed on the case of quantum circuits composed by fully random unitary gates. Here we consider what happens for circuits that, instead, involve a minimal degree of randomness. Specifically, we concentrate on two different settings: (a) brickwork quantum circuits with a single one-qudit random matrix at a boundary; (b) brickwork quantum circuits with fixed interactions but random one-qudit gates everywhere. We show that, for any given initial state, (a) and (b) produce a distribution of states approaching the Haar distribution in the limit of large circuit depth. More precisely, we show that the moments of the distribution produced by our circuits can approximate the ones of the Haar distribution in a depth proportional to the system size. Interestingly we find that in both Cases (a) and (b) the relaxation to the Haar distribution occurs in two steps—this is in contrast with what happens in fully random circuits. Moreover, we show that choosing appropriately the fixed interactions, for example taking the local gate to be a dual-unitary gate with high enough entangling power, minimally random circuits produce a Haar random distribution more rapidly than fully random circuits. In particular, dual-unitary circuits with maximal entangling power—i.e. perfect tensors—appear to provide the optimal quantum state design preparation for any design number. Our results also suggest that the minimally random settings (a) and (b) give an optimal framework to prepare unitary designs, i.e., random unitary matrices.
- 8 June 2026
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 7 (3)
Open AccessQuantum state designs from minimally random quantum circuits
Random many-body states and matrices are both a useful tool to model certain physical systems and an important asset for quantum computation. Realizing them, however, generally requires an exponential (in system size) amount of resources. Recent research has presented a way out by showing that one can generate random states and matrices, or more precisely a controlled approximation of them, by applying a quantum circuit built in terms of few-body unitary gates. Most of this research has been focussed on the case of quantum circuits composed by fully random unitary gates. Here we consider what happens for circuits that, instead, involve a minimal degree of randomness. Specifically, we concentrate on two different settings: (a) brickwork quantum circuits with a single one-qudit random matrix at a boundary; (b) brickwork quantum circuits with fixed interactions but random one-qudit gates everywhere. We show that, for any given initial state, (a) and (b) produce a distribution of states approaching the Haar distribution in the limit of large circuit depth. More precisely, we show that the moments of the distribution produced by our circuits can approximate the ones of the Haar distribution in a depth proportional to the system size. Interestingly we find that in both Cases (a) and (b) the relaxation to the Haar distribution occurs in two steps—this is in contrast with what happens in fully random circuits. Moreover, we show that choosing appropriately the fixed interactions, for example taking the local gate to be a dual-unitary gate with high enough entangling power, minimally random circuits produce a Haar random distribution more rapidly than fully random circuits. In particular, dual-unitary circuits with maximal entangling power—i.e. perfect tensors—appear to provide the optimal quantum state design preparation for any design number. Our results also suggest that the minimally random settings (a) and (b) give an optimal framework to prepare unitary designs, i.e., random unitary matrices.
- Open Access
- 19 May 2026
- Published by Stichting SciPost in SciPost Physics Lecture Notes
Non-equilibrium quantum many-body physics with quantum circuits
These are the notes for the 4.5-hour course with the same title that I delivered in August 2025 at the Les Houches summer school “Exact Solvability and Quantum Information’’. In these notes I pedagogically introduce the setting of brickwork quantum circuits and show that it provides a useful framework to study non-equilibrium quantum many-body dynamics in the presence of local interactions. I first show that brickwork quantum circuits evolve quantum correlations in a way that is fundamentally similar to local Hamiltonians, and then present examples of brickwork quantum circuits where, surprisingly, one can compute exactly several relevant dynamical and spectral properties in the presence of non-trivial interactions.
- 19 May 2026
- Published by Stichting SciPost in SciPost Physics Lecture Notes
Open AccessNon-equilibrium quantum many-body physics with quantum circuits
These are the notes for the 4.5-hour course with the same title that I delivered in August 2025 at the Les Houches summer school “Exact Solvability and Quantum Information’’. In these notes I pedagogically introduce the setting of brickwork quantum circuits and show that it provides a useful framework to study non-equilibrium quantum many-body dynamics in the presence of local interactions. I first show that brickwork quantum circuits evolve quantum correlations in a way that is fundamentally similar to local Hamiltonians, and then present examples of brickwork quantum circuits where, surprisingly, one can compute exactly several relevant dynamical and spectral properties in the presence of non-trivial interactions.
- 27 April 2026
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 59 (17) , 170201
Quantum-circuit models for many-body physics out of equilibrium
- 27 April 2026
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 59 (17) , 170201
Quantum-circuit models for many-body physics out of equilibrium
- Top Cited Papers
- 15 April 2026
- Published by American Physical Society (APS) in Reviews of Modern Physics
- Vol. 98 (2)
Exactly solvable quantum many-body dynamics from space-time duality
- 15 April 2026
- Published by American Physical Society (APS) in Reviews of Modern Physics
- Vol. 98 (2)
Top Cited PapersExactly solvable quantum many-body dynamics from space-time duality
- Top Cited PapersOpen Access
- 13 March 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (1)
Entanglement dynamics and Page curves in random permutation circuits
The characterization of ensembles of many-qubit random states and their realization via quantum circuits are crucial tasks in quantum-information theory. In this work, we study the ensembles generated by quantum circuits that randomly permute the computational basis, thus acting classically on the corresponding states. We focus on the averaged entanglement and present two main results. First, we derive generically tight upper bounds on the entanglement that can be generated by applying permutation circuits to arbitrary initial states. We show that the late-time “entanglement Page curves” are bounded in terms of the initial state participation entropies and their overlap with the “maximally antilocalized” state. Generally speaking, this result states that the quantum correlations generated by classical circuits are bounded in terms of some quantum property of the initial state (namely, the degree to which it can be written as a superposition of classical states). Second, comparing the averaged Rényi-2 entropies generated by ( 1 ) an infinitely deep random circuit of two-qubit gates and ( 2 ) global random permutations, we show that the two quantities are different for finite N but the corresponding Page curves coincide in the thermodynamic limit. We also discuss how these conclusions are modified by additional random phases or considering circuits of k -local gates with k ≥ 3 . Our results are exact and highlight the implications of classical features on entanglement generation in many-body systems.
- 13 March 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (1)
Top Cited PapersOpen AccessEntanglement dynamics and Page curves in random permutation circuits
The characterization of ensembles of many-qubit random states and their realization via quantum circuits are crucial tasks in quantum-information theory. In this work, we study the ensembles generated by quantum circuits that randomly permute the computational basis, thus acting classically on the corresponding states. We focus on the averaged entanglement and present two main results. First, we derive generically tight upper bounds on the entanglement that can be generated by applying permutation circuits to arbitrary initial states. We show that the late-time “entanglement Page curves” are bounded in terms of the initial state participation entropies and their overlap with the “maximally antilocalized” state. Generally speaking, this result states that the quantum correlations generated by classical circuits are bounded in terms of some quantum property of the initial state (namely, the degree to which it can be written as a superposition of classical states). Second, comparing the averaged Rényi-2 entropies generated by ( 1 ) an infinitely deep random circuit of two-qubit gates and ( 2 ) global random permutations, we show that the two quantities are different for finite N but the corresponding Page curves coincide in the thermodynamic limit. We also discuss how these conclusions are modified by additional random phases or considering circuits of k -local gates with k ≥ 3 . Our results are exact and highlight the implications of classical features on entanglement generation in many-body systems.
- Open Access
- 11 March 2026
- Published by American Physical Society (APS) in Physical Review B
- Vol. 113 (10)
Random permutation circuits beyond qubits are quantum chaotic
Random permutation circuits were recently introduced as minimal models for local many-body dynamics that can be interpreted both as classical and quantum. Standard dynamical complexity indicators such as damage spreading and out-of-time-order correlators (OTOCs), show that these systems exhibit sensitivity to initial conditions in the classical setting and operator scrambling in the quantum setting. Here, we address their quantum chaoticity—a stricter property—by studying the time evolution of local operator entanglement (LOE). We show that the behavior of LOE in random permutation circuits depends on the dimension of the local configuration space q . When q = 2 , i.e., the circuits act on qubits, random permutations are Clifford and the LOE of any local operator is bounded by a constant, indicating that they are not truly chaotic. On the other hand, when the dimension of the local configuration space exceeds two, the LOE grows linearly in time. We prove this in the limit of large q and present numerical evidence that a three-dimensional local configuration space is sufficient for a linear growth of LOE. Our findings highlight that quantum chaos can be produced by essentially classical dynamics. Moreover, we show that LOE can be defined also in the classical realm and put it forward as a universal indicator chaos, both quantum and classical.
- 11 March 2026
- Published by American Physical Society (APS) in Physical Review B
- Vol. 113 (10)
Open AccessRandom permutation circuits beyond qubits are quantum chaotic
Random permutation circuits were recently introduced as minimal models for local many-body dynamics that can be interpreted both as classical and quantum. Standard dynamical complexity indicators such as damage spreading and out-of-time-order correlators (OTOCs), show that these systems exhibit sensitivity to initial conditions in the classical setting and operator scrambling in the quantum setting. Here, we address their quantum chaoticity—a stricter property—by studying the time evolution of local operator entanglement (LOE). We show that the behavior of LOE in random permutation circuits depends on the dimension of the local configuration space q . When q = 2 , i.e., the circuits act on qubits, random permutations are Clifford and the LOE of any local operator is bounded by a constant, indicating that they are not truly chaotic. On the other hand, when the dimension of the local configuration space exceeds two, the LOE grows linearly in time. We prove this in the limit of large q and present numerical evidence that a three-dimensional local configuration space is sufficient for a linear growth of LOE. Our findings highlight that quantum chaos can be produced by essentially classical dynamics. Moreover, we show that LOE can be defined also in the classical realm and put it forward as a universal indicator chaos, both quantum and classical.