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:2405.10264 · Quantum Science and Technology

Architectures and random properties of symplectic quantum circuits

Diego García-Martín, Paolo Braccia, Marco Cerezo

Published Nov 18, 2025• 4 citations
arXivHTMLPDF

Abstract

Abstract Parametrized and random unitary (or orthogonal) n -qubit circuits play a central role in quantum information. As such, one could naturally assume that circuits implementing symplectic transformations would attract similar attention. However, this is not the case, as S P ( d / 2 ) —the group of d × d unitary symplectic matrices—has thus far been overlooked. In this work, we aim at starting to fill this gap. We begin by presenting a universal set of generators G for the symplectic algebra sp ( d / 2 ) , consisting of one- and two-qubit Pauli operators acting on neighboring sites in a one-dimensional lattice. Here, we uncover two critical differences between such set, and equivalent ones for unitary and orthogonal circuits. Namely, we find that the operators in G cannot generate arbitrary local symplectic unitaries and that they are not translationally invariant. We then review the Schur–Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements at the output of Haar random symplectic circuits can converge to Gaussian processes. As a by-product, such analysis provides us with concentration bounds for Pauli measurements in circuits that form t -designs over S P ( d / 2 ) . To finish, we present tensor-network tools to analyze shallow random symplectic circuits, and we use these to numerically show that computational-basis measurements anti-concentrate at logarithmic depth.

DOI
10.1088/2058-9565/ae20b5

Related papers

On the complexity of quantum states and circuits from the orthogonal and symplectic groups

Oxana Shaya, Zoë Holmes, Christoph Hirche +1 more

Abstract Understanding the complexity of quantum states and circuits is a central challenge in quantum information science, with broad implications in many-body physics, high-energy physics and quantum learning theory. A common way to model the behavior of typical states and circuits involves sampling unitary transformations from the Haar measure on the unitary group. In this work, we depart from this standard approach and instead study structured unitaries drawn from other compact connected groups, namely the symplectic and special orthogonal groups. By leveraging the concentration of measure phenomenon, we establish two main results. We show that random quantum states generated using symplectic or orthogonal unitaries typically exhibit an exponentially large strong state complexity, and are nearly orthogonal to one another. Similar behavior is observed for designs over these groups. Additionally, we demonstrate the average-case hardness of learning circuits composed of gates drawn from such classical groups of unitaries. Taken together, our results demonstrate that structured subgroups can exhibit a complexity comparable to that of the full unitary group.

arXiv:2509.07573•Journal of Physics A Mathematical and Theoretical•May 13, 2026•1 citation

Operator spreading in random unitary circuits with orthogonal/symplectic-invariant gate distributions

Zhiyang Tan, Piet W. Brouwer

We investigate operator spreading in random quantum circuits with gates drawn from orthogonal-invariant or symplectic-invariant ensembles, revealing several key distinctions from the well-studied unitary-invariant case. We find that the ensemble-averaged Pauli-string weights relax to a ternary-valued structure, instead of the binary structure of unitary-invariant circuits. For orthogonal- or symplectic-invariant circuits, the domain wall separating trivial and scrambled regions has a finite width even for Haar-random gates, whereas domain walls are sharp for Haar-distributed random unitary circuits. We further find a fundamental dichotomy between random circuits with two-qubit gates from the two disconnected components of the orthogonal group: While the butterfly velocity for the special orthogonal ensemble lies between zero and the Haar value, the negative-determinant sector exhibits a non-zero lower bound for any gate distribution. Moreover, for qudit size $q=2$, the butterfly velocity can exceed that of the Haar-random ensemble.

quant-pharXiv:2606.03956•Physical review. B./Physical review. B•Jun 3, 2026•0 citations

An algebraic characterisation of nnn-qubit pure-state invariants

Markus Frembs

We study the set of $n$-qubit pure quantum states. Specifically, we consider their incarnation as density matrices in Bloch representation. Building on prior work, we define a family of quadratic functions in Pauli expectation values, and fully characterise all instances that result in state-independent purity constraints. The resulting family of pure-state invariants is surprisingly rich in structure, with strong ties to the geometry of symplectic polar spaces. After charting the general landscape, we define a sub-family of pure-state invariants that satisfies the dynamical constraint of being stable under state update. We prove that it corresponds with (different embeddings of) symplectic Lie algebras $\mathfrak{sp}(2^{n-1})\subset\mathfrak{su}(2^n)$, which admit a generating set of Pauli operators. We carefully distinguish the symplectic case from its orthogonal counterpart, using the Arf invariant of quadratic refinements of the symplectic form on the projective Pauli group, which we further identify with quaternionic structures on $\mathbb{C}^{2^n}$ that are both generated by and restricted to Pauli operators. As a consequence of this analysis, we reveal previously largely overlooked structure in the $n$-qubit Pauli group. We highlight this in a number of examples. We characterise all state-independent uncertainty relations in variance for Pauli observables, as well as all Pauli channels for which the output fidelity and output purity are state-independent. We further show that the orbits of the projective stabiliser groups of pure-state invariants, which for $n\geq2$ are proper subgroups of the Clifford group, form complex projective state $2$-designs, while their unitary lifts form symplectic $2$-designs.

quant-pharXiv:2610.36076•Oct 28, 2026•0 citations

Exact spectral gaps of random one-dimensional quantum circuits

Andrew E. Deneris, Pablo Bermejo, Paolo Braccia +2 more

The spectral gap of local random quantum circuits is a fundamental property that determines how close the moments of the circuit's unitaries match those of a Haar random distribution. When studying spectral gaps, it is common to bound these quantities using tools from statistical mechanics or via quantum information-based inequalities. By focusing on the second moment of one-dimensional unitary circuits where nearest-neighboring gates act on sets of qudits (with open and closed boundary conditions), we show that one can exactly compute the associated spectral gaps. Indeed, having access to their functional form allows us to prove several important results, such as the fact that the spectral gap for closed boundary condition is exactly the square of the gap for open boundaries, as well as improve on previously known bounds for approximate design convergence. Finally, we verify our theoretical results by numerically computing the spectral gap for systems of up to 70 qubits, as well as comparing them to gaps of random orthogonal and symplectic circuits.

arXiv:2408.11201•Physical Review A•Nov 25, 2025•4 citations

From Pauli Strings to Quantum Dynamics: A Unified Characterization

Roberto Gargiulo, Paul Herringer, Robert Zeier

Understanding the dynamical properties of quantum systems is an essential task in quantum computing, quantum control, and many-body physics. Tools such as representation theory and Lie theory provide crucial information on reachability and computational power. However, this information can be difficult to access exactly or compute efficiently for arbitrary generating sets. Here we focus on the setting of Pauli strings, which satisfy numerous exceptional properties that simplify the problem. We find deep connections between Pauli Lie algebras and certain subgroups of the Clifford group generated by transvections, through the symplectic properties of the Pauli strings. This allows us to give an invariant-based perspective on these objects and their reachability, in the language of Pauli orbits, symmetries, and invariant subspaces. The invariant-based approach provides efficient algorithms for identifying Lie algebras and orbits, as well as a simple framework for analyzing structured Pauli generating sets. We also show in an elementary way that Clifford subgroups generated by transvections provide 3-designs for the corresponding Pauli Lie groups. We illustrate the framework through structured examples from variational quantum algorithms, restricted quantum computation, many-body systems, and random circuits.

quant-pharXiv:2606.09773•Jun 9, 2026•0 citations

Random Processes over the Unitary Group

Emilio Onorati

According to one of the fundamental axioms of quantum mechanics, unitary operators rule the evolution of any quantum system; it is thus of prominent importance to investigate the corresponding group and discover its properties. Random processes over the unitary group have indeed a wide range of applications in the context of quantum information; in particular, they are involved in the construction of peculiar distributions called unitary designs which mimic the uniform Haar measure by matching its moments and are thus deeply connected to the description of phenomena such as quantum tomography, equilibration, thermalization, encryption and scrambling. Previous approaches have shown that unitary designs are efficiently approximated by random quantum circuits with local unitary operators. Moreover, these circuits are used to characterize the precision of experimental implementations of unitary gates via randomized benchmarking protocols and to rapidly decouple a system from the environment. The main novel contribution of this work is to extend these mixing properties to a continuous-time framework, namely, Brownian motion over the unitary group induced by stochastic local Hamiltonians. In order to achieve these new results, on the one hand we move to a representation theoretic formulation and make use of its tools to establish the gap of local generators linked to the moments of the distribution induced by the diffusion process; from this we then derive an expression for the length of time it takes to ensure convergence toward the moments of the Haar measure. On the other hand we project the stochastic evolution onto a random walk on Pauli matrices and tie this description to the analogous one for random quantum circuits to achieve decoupling in a run time scaling almost linearly with respect to the system size. In addition to providing a unifying framework for random processes over the unitary group, we hence aim at presenting new mathematical results and techniques for quantum information. We furthermore discuss applications to black holes dynamics in the perspective of the information paradox. As an additional novel result not related to Brownian motion, we propose a randomized benchmarking protocol exploiting the symmetry of the gate whose accuracy has to be estimated, in order to overcome current shortcomings afflicting the known schemes. We again rely on representation theory to reduce the computational effort and the amount of employed quantum resources.

•Jan 1, 2019•0 citations
Abstract Parametrized and random unitary (or orthogonal) n -qubit circuits play a central role in quantum information. As such, one could naturally assume that circuits implementing symplectic transformations would attract similar attention. However, this is not the case, as S P ( d / 2 ) —the group of d × d unitary symplectic matrices—has thus far been overlooked. In this work, we aim at starting to fill this gap. We begin by presenting a universal set of generators G for the symplectic algebra sp ( d / 2 ) , consisting of one- and two-qubit Pauli operators acting on neighboring sites in a one-dimensional lattice. Here, we uncover two critical differences between such set, and equivalent ones for unitary and orthogonal circuits. Namely, we find that the operators in G cannot generate arbitrary local symplectic unitaries and that they are not translationally invariant. We then review the Schur–Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements at the output of Haar random symplectic circuits can converge to Gaussian processes. As a by-product, such analysis provides us with concentration bounds for Pauli measurements in circuits that form t -designs over S P ( d / 2 ) . To finish, we present tensor-network tools to analyze shallow random symplectic circuits, and we use these to numerically show that computational-basis measurements anti-concentrate at logarithmic depth.
Abstract Understanding the complexity of quantum states and circuits is a central challenge in quantum information science, with broad implications in many-body physics, high-energy physics and quantum learning theory. A common way to model the behavior of typical states and circuits involves sampling unitary transformations from the Haar measure on the unitary group. In this work, we depart from this standard approach and instead study structured unitaries drawn from other compact connected groups, namely the symplectic and special orthogonal groups. By leveraging the concentration of measure phenomenon, we establish two main results. We show that random quantum states generated using symplectic or orthogonal unitaries typically exhibit an exponentially large strong state complexity, and are nearly orthogonal to one another. Similar behavior is observed for designs over these groups. Additionally, we demonstrate the average-case hardness of learning circuits composed of gates drawn from such classical groups of unitaries. Taken together, our results demonstrate that structured subgroups can exhibit a complexity comparable to that of the full unitary group.
We investigate operator spreading in random quantum circuits with gates drawn from orthogonal-invariant or symplectic-invariant ensembles, revealing several key distinctions from the well-studied unitary-invariant case. We find that the ensemble-averaged Pauli-string weights relax to a ternary-valued structure, instead of the binary structure of unitary-invariant circuits. For orthogonal- or symplectic-invariant circuits, the domain wall separating trivial and scrambled regions has a finite width even for Haar-random gates, whereas domain walls are sharp for Haar-distributed random unitary circuits. We further find a fundamental dichotomy between random circuits with two-qubit gates from the two disconnected components of the orthogonal group: While the butterfly velocity for the special orthogonal ensemble lies between zero and the Haar value, the negative-determinant sector exhibits a non-zero lower bound for any gate distribution. Moreover, for qudit size q=2q=2q=2, the butterfly velocity can exceed that of the Haar-random ensemble.
We study the set of nnn-qubit pure quantum states. Specifically, we consider their incarnation as density matrices in Bloch representation. Building on prior work, we define a family of quadratic functions in Pauli expectation values, and fully characterise all instances that result in state-independent purity constraints. The resulting family of pure-state invariants is surprisingly rich in structure, with strong ties to the geometry of symplectic polar spaces. After charting the general landscape, we define a sub-family of pure-state invariants that satisfies the dynamical constraint of being stable under state update. We prove that it corresponds with (different embeddings of) symplectic Lie algebras sp(2n−1)⊂su(2n)\mathfrak{sp}(2^{n-1})\subset\mathfrak{su}(2^n)sp(2n−1)⊂su(2n), which admit a generating set of Pauli operators. We carefully distinguish the symplectic case from its orthogonal counterpart, using the Arf invariant of quadratic refinements of the symplectic form on the projective Pauli group, which we further identify with quaternionic structures on C2n\mathbb{C}^{2^n}C2n that are both generated by and restricted to Pauli operators. As a consequence of this analysis, we reveal previously largely overlooked structure in the nnn-qubit Pauli group. We highlight this in a number of examples. We characterise all state-independent uncertainty relations in variance for Pauli observables, as well as all Pauli channels for which the output fidelity and output purity are state-independent. We further show that the orbits of the projective stabiliser groups of pure-state invariants, which for n≥2n\geq2n≥2 are proper subgroups of the Clifford group, form complex projective state 222-designs, while their unitary lifts form symplectic 222-designs.
The spectral gap of local random quantum circuits is a fundamental property that determines how close the moments of the circuit's unitaries match those of a Haar random distribution. When studying spectral gaps, it is common to bound these quantities using tools from statistical mechanics or via quantum information-based inequalities. By focusing on the second moment of one-dimensional unitary circuits where nearest-neighboring gates act on sets of qudits (with open and closed boundary conditions), we show that one can exactly compute the associated spectral gaps. Indeed, having access to their functional form allows us to prove several important results, such as the fact that the spectral gap for closed boundary condition is exactly the square of the gap for open boundaries, as well as improve on previously known bounds for approximate design convergence. Finally, we verify our theoretical results by numerically computing the spectral gap for systems of up to 70 qubits, as well as comparing them to gaps of random orthogonal and symplectic circuits.
Understanding the dynamical properties of quantum systems is an essential task in quantum computing, quantum control, and many-body physics. Tools such as representation theory and Lie theory provide crucial information on reachability and computational power. However, this information can be difficult to access exactly or compute efficiently for arbitrary generating sets. Here we focus on the setting of Pauli strings, which satisfy numerous exceptional properties that simplify the problem. We find deep connections between Pauli Lie algebras and certain subgroups of the Clifford group generated by transvections, through the symplectic properties of the Pauli strings. This allows us to give an invariant-based perspective on these objects and their reachability, in the language of Pauli orbits, symmetries, and invariant subspaces. The invariant-based approach provides efficient algorithms for identifying Lie algebras and orbits, as well as a simple framework for analyzing structured Pauli generating sets. We also show in an elementary way that Clifford subgroups generated by transvections provide 3-designs for the corresponding Pauli Lie groups. We illustrate the framework through structured examples from variational quantum algorithms, restricted quantum computation, many-body systems, and random circuits.
According to one of the fundamental axioms of quantum mechanics, unitary operators rule the evolution of any quantum system; it is thus of prominent importance to investigate the corresponding group and discover its properties. Random processes over the unitary group have indeed a wide range of applications in the context of quantum information; in particular, they are involved in the construction of peculiar distributions called unitary designs which mimic the uniform Haar measure by matching its moments and are thus deeply connected to the description of phenomena such as quantum tomography, equilibration, thermalization, encryption and scrambling. Previous approaches have shown that unitary designs are efficiently approximated by random quantum circuits with local unitary operators. Moreover, these circuits are used to characterize the precision of experimental implementations of unitary gates via randomized benchmarking protocols and to rapidly decouple a system from the environment. The main novel contribution of this work is to extend these mixing properties to a continuous-time framework, namely, Brownian motion over the unitary group induced by stochastic local Hamiltonians. In order to achieve these new results, on the one hand we move to a representation theoretic formulation and make use of its tools to establish the gap of local generators linked to the moments of the distribution induced by the diffusion process; from this we then derive an expression for the length of time it takes to ensure convergence toward the moments of the Haar measure. On the other hand we project the stochastic evolution onto a random walk on Pauli matrices and tie this description to the analogous one for random quantum circuits to achieve decoupling in a run time scaling almost linearly with respect to the system size. In addition to providing a unifying framework for random processes over the unitary group, we hence aim at presenting new mathematical results and techniques for quantum information. We furthermore discuss applications to black holes dynamics in the perspective of the information paradox. As an additional novel result not related to Brownian motion, we propose a randomized benchmarking protocol exploiting the symmetry of the gate whose accuracy has to be estimated, in order to overcome current shortcomings afflicting the known schemes. We again rely on representation theory to reduce the computational effort and the amount of employed quantum resources.