The generation of k -designs (pseudorandom distributions that emulate the Haar measure up to k moments) with local quantum circuit ensembles is a problem of fundamental importance in quantum information and physics. Despite the extensive understanding of this problem for ordinary random circuits, the crucial situations in which symmetries or conservation laws are in play are known to pose fundamental challenges and remain little understood. Here, we construct explicit local unitary ensembles that can achieve high-order unitary k -designs under transversal continuous symmetry, in the particularly important SU ( d ) case. Specifically, we define the convolutional quantum alternating (CQA) group generated by 4-local SU ( d ) -symmetric Hamiltonians as well as associated 4-local SU ( d ) -symmetric random unitary circuit ensembles and prove that they form and converge to SU ( d ) -symmetric k -designs, respectively, for all k < n ( n − 3 ) / 2 , with n being the number of qudits. A key technique that we employ to obtain the results is the Okounkov-Vershik approach to S n representation theory. To study the convergence time of the CQA ensemble, we develop a numerical method using the Young orthogonal form and the S n branching rule. We provide strong evidence for a subconstant spectral gap and certain convergence time scales of various important circuit architectures, which contrast with the symmetry-free case. We also provide comprehensive explanations of the difficulties and limitations in rigorously analyzing the convergence time using methods that have been effective for cases without symmetries, including Knabe’s local gap threshold and Nachtergaele’s martingale methods. This suggests that a novel approach is likely necessary for understanding the convergence time of SU ( d ) -symmetric local random circuits. Published by the American Physical Society 2024
The generation of k -designs (pseudorandom distributions that emulate the Haar measure up to k moments) with local quantum circuit ensembles is a problem of fundamental importance in quantum information and physics. Despite the extensive understanding of this problem for ordinary random circuits, the crucial situations in which symmetries or conservation laws are in play are known to pose fundamental challenges and remain little understood. Here, we construct explicit local unitary ensembles that can achieve high-order unitary k -designs under transversal continuous symmetry, in the particularly important SU ( d ) case. Specifically, we define the convolutional quantum alternating (CQA) group generated by 4-local SU ( d ) -symmetric Hamiltonians as well as associated 4-local SU ( d ) -symmetric random unitary circuit ensembles and prove that they form and converge to SU ( d ) -symmetric k -designs, respectively, for all k < n ( n − 3 ) / 2 , with n being the number of qudits. A key technique that we employ to obtain the results is the Okounkov-Vershik approach to S n representation theory. To study the convergence time of the CQA ensemble, we develop a numerical method using the Young orthogonal form and the S n branching rule. We provide strong evidence for a subconstant spectral gap and certain convergence time scales of various important circuit architectures, which contrast with the symmetry-free case. We also provide comprehensive explanations of the difficulties and limitations in rigorously analyzing the convergence time using methods that have been effective for cases without symmetries, including Knabe’s local gap threshold and Nachtergaele’s martingale methods. This suggests that a novel approach is likely necessary for understanding the convergence time of SU ( d ) -symmetric local random circuits. Published by the American Physical Society 2024
The efficiency of locally generating unitary designs, which capture statistical notions of quantum pseudorandomness, lies at the heart of wide-ranging areas in physics and quantum information technologies. While there are extensive potent methods and results for this problem, the evidently important setting where continuous symmetries or conservation laws (most notably U(1) and SU(d)) are involved is known to present fundamental difficulties. In particular, even the basic question of whether any local symmetric circuit can generate 2-designs efficiently (in time that grows at most polynomially in the system size) remains open with no circuit constructions provably known to do so, despite intensive efforts. In this work, we resolve this long-standing open problem for both U(1) and SU(d) symmetries by explicitly constructing local symmetric quantum circuits which we prove to converge to symmetric unitary 2-designs in polynomial time using a combination of representation theory, graph theory, and Markov chain methods. As a direct application, our constructions can be used to efficiently generate near-optimal covariant quantum error-correcting codes, confirming a conjecture in [PRX Quantum 3, 020314 (2022)].
Local symmetric quantum circuits provide a simple framework to study the dynamics and phases of complex quantum systems with conserved charges. However, some of their basic properties have not yet been understood. Recently, it has been shown that such quantum circuits only generate a restricted subset of symmetric unitary transformations [I. Marvian, Nature Physics, 2022]. In this paper, we consider circuits with 2-local SU(d)-invariant unitaries acting on qudits, i.e., d-dimensional quantum systems. Our results reveal a significant distinction between the cases of d = 2 and d>2. For qubits with SU(2) symmetry, arbitrary global rotationally-invariant unitaries can be generated with 2-local ones, up to relative phases between the subspaces corresponding to inequivalent irreducible representations (irreps) of the symmetry, i.e., sectors with different angular momenta. On the other hand, for d>2, in addition to similar constraints on the relative phases between the irreps, locality also restricts the generated unitaries inside these conserved subspaces. These constraints impose conservation laws that hold for dynamics under 2-local SU(d)-invariant unitaries, but are violated under general SU(d)-invariant unitaries. Based on this result, we show that the distribution of unitaries generated by random 2-local SU(d)-invariant unitaries does not converge to the Haar measure over the group of all SU(d)-invariant unitaries, and in fact, for d>2, is not even a 2-design for the Haar distribution.
Local symmetric quantum circuits are those that contain only local unitaries that respect a certain symmetry. These circuits provide a simple framework to study the dynamics and phases of complex quantum systems with conserved charges; however, some of their basic properties have not yet been understood. Recently, it has been shown that such quantum circuits only generate a restricted subset of symmetric unitary transformations. In this paper, we consider circuits with 2-local SU(d)-invariant unitaries acting on qudits, i.e., d-dimensional quantum systems. Our results reveal a significant distinction between the cases of d=2 and d>=3. For qubits with SU(2) symmetry, arbitrary global rotationally-invariant unitaries can be generated with 2-local ones, up to relative phases between the subspaces corresponding to inequivalent irreducible representations (irreps) of the symmetry, i.e., sectors with different angular momenta. On the other hand, for d>=3, in addition to similar constraints on relative phases between the irreps, locality also restricts the generated unitaries inside these conserved subspaces. In particular, for certain irreps of SU(d), the dynamics under 2-local SU(d)-invariant unitaries can be mapped to the dynamics of a non-interacting (free) fermionic system, whereas for general 3-local ones, the corresponding fermionic model is interacting. Using this correspondence, we obtain new conservation laws for dynamics under 2-local SU(d)-invariant unitaries. Furthermore, we identify a Z2 symmetry related to the parity of permutations which imposes additional conservation laws for systems with n =3. Our results imply that the distribution of unitaries generated by random 2-local SU(d)-invariant unitaries does not converge to the Haar measure over the group of all SU(d)-invariant unitaries, and in fact, for d>=3, is not even a 2-design for the Haar distribution.
Local random circuits scramble efficiently and, accordingly, have a range of applications in quantum information and quantum dynamics. With a global U(1) charge, however, the scrambling ability is reduced; for example, such random circuits do not generate the entire group of number-conserving unitaries. We establish two results using the statistical mechanics of k -fold replicated circuits. First, we show that finite moments cannot distinguish the ensemble that local random circuits generate from the Haar ensemble on the entire group of number-conserving unitaries. Specifically, the circuits form a k c -design with k c = O ( L d ) for a system in d spatial dimensions with linear dimension L . Second, for k < k c , we derive bounds on the depth τ required for the circuit to converge to an approximate k -design. The depth is lower bounded by diffusion k L 2 ln ( L ) ≲ τ . In contrast, without number conservation τ ∼ poly ( k ) L . The convergence of the circuit ensemble is controlled by the low-energy properties of a frustration-free quantum statistical model which spontaneously breaks k U(1) symmetries. We conjecture that the associated Goldstone modes set the spectral gap for arbitrary spatial and qudit dimensions, leading to an upper bound τ ≲ k L d + 2 .
Random quantum circuits are a central concept in quantum information theory with applications ranging from demonstrations of quantum computational advantage to descriptions of scrambling in strongly interacting systems and black holes. The utility of random quantum circuits in these settings stems from their ability to rapidly generate quantum pseudorandomness. In a seminal paper by Brand\~ao, Harrow, and Horodecki [Commun. Math. Phys. 346, 397 (2016)] it was proven that the tth moment operator of local random quantum circuits on n qudits with local dimension q has a spectral gap of at least $\mathrm{\ensuremath{\Omega}}({n}^{\ensuremath{-}1}{t}^{\ensuremath{-}5\ensuremath{-}3.1/ln(q)})$, which implies that they are efficient constructions of approximate unitary designs. As a first result, we use Knabe bounds for the spectral gaps of frustration-free Hamiltonians to show that one-dimensional random quantum circuits have a spectral gap scaling as $\mathrm{\ensuremath{\Omega}}({n}^{\ensuremath{-}1})$, provided that t is small compared to the local dimension: ${t}^{2}\ensuremath{\le}O(q)$. This implies a (nearly) linear scaling of the circuit depth in the design order t. Our second result is an unconditional spectral gap bounded below by $\mathrm{\ensuremath{\Omega}}[{n}^{\ensuremath{-}1}{ln}^{\ensuremath{-}1}(n){t}^{\ensuremath{-}\ensuremath{\alpha}(q)}]$ for random quantum circuits with all-to-all interactions. This improves both the n and t scaling in design depth for the nonlocal model. We show this by proving a recursion relation for the spectral gaps involving an auxiliary random walk. Lastly, we solve the smallest nontrivial case exactly and combine with numerics and Knabe bounds to improve the constants involved in the spectral gap for small values of t.
The applications of random quantum circuits range from quantum computing and quantum many-body systems to the physics of black holes. Many of these applications are related to the generation of quantum pseudorandomness: Random quantum circuits are known to approximate unitary t -designs. Unitary t -designs are probability distributions that mimic Haar randomness up to t th moments. In a seminal paper, Brandão, Harrow and Horodecki prove that random quantum circuits on qubits in a brickwork architecture of depth O(nt10.5) are approximate unitary t -designs. In this work, we revisit this argument, which lower bounds the spectral gap of moment operators for local random quantum circuits by Ω(n−1t−9.5) . We improve this lower bound to Ω(n−1t−4−o(1)) , where the o(1) term goes to 0 as t→∞ . A direct consequence of this scaling is that random quantum circuits generate approximate unitary t -designs in depth O(nt5+o(1)) . Our techniques involve Gao's quantum union bound and the unreasonable effectiveness of the Clifford group. As an auxiliary result, we prove fast convergence to the Haar measure for random Clifford unitaries interleaved with Haar random single qubit unitaries.