Random Matrix Spectral Form Factor of Dual-Unitary Quantum Circuits
Bruno Bertini, Pavel Kos, Tomaz Prosen
备注：
30 pages; v2 rigorous results for spatially inhomogeneous interactions added; v3 extended version, it contains some unproven conjectures not published in CMP
We investigate a class of brickwork-like quantum circuits on chains of $d-$level systems (qudits) that share the so-called `dual unitarity' property. Namely, these systems generate unitary dynamics not only when propagating in the time direction, but also when propagating in the space direction. We consider space-time homogeneous (Floquet) circuits and perturb them with a quenched single-site disorder, i.e. by applying independent single site random unitaries drawn from arbitrary non-singular distribution over ${\rm SU}(d)$, e.g. one concentrated around the identity, after each layer of the circuit. We identify the spectral form factor at time $t$ in the limit of long chains as the dimension of the commutant of a finite set of operators on a qudit ring of $t$ sites. For general dual unitary circuits of qubits $(d=2)$ and a family of their extensions to higher $d>2$, we provide explicit construction of the commutant and prove that spectral form factor exactly matches the prediction of circular unitary ensemble for all $t$, if only the local 2-qubit gates are different from a SWAP (non-interacting gate). We discuss and partly prove possible extensions of our results to a weaker (more singular) forms of disorder averaging, as well as to quantum circuits with time-reversal symmetry, and to computing higher moments of the spectral form factor.
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ényi-$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 …
Interacting many-body systems with explicitly accessible spatio-temporal correlation functions are extremely rare, especially in the absence of integrability. Recently, we identified a remarkable class of such systems and termed them dual-unitary quantum circuits. These are brick-wall type local quantum circuits whose dynamics are unitary in both time and space. For these systems the spatio-temporal correlation functions are non-trivial only at the edge of the causal light cone and can be computed in terms of one-dimensional transfer matrices. Dual-unitarity, however, requires fine-tuning and …
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(n t^{10.5})$ are approximate unitary $t$-designs. In this work, we revisit th…
Quantifying quantum states' complexity is a key problem in various subfields of science, from quantum computing to black-hole physics. We prove a prominent conjecture by Brown and Susskind about how random quantum circuits' complexity increases. Consider constructing a unitary from Haar-random two-qubit quantum gates. Implementing the unitary exactly requires a circuit of some minimal number of gates - the unitary's exact circuit complexity. We prove that this complexity grows linearly with the number of random gates, with unit probability, until saturating after exponentially many random gate…
While quantum circuits built from two-particle dual-unitary (maximally entangled) operators serve as minimal models of typically nonintegrable many-body systems, the construction and characterization of dual-unitary operators themselves are only partially understood. A nonlinear map on the space of unitary operators was proposed in PRL.~125, 070501 (2020) that results in operators being arbitrarily close to dual unitaries. Here we study the map analytically for the two-qubit case describing the basins of attraction, fixed points, and rates of approach to dual unitaries. A subset of dual-unitar…
We consider a unitary circuit where the underlying gates are chosen to be R-matrices satisfying the Yang-Baxter equation and correlation functions can be expressed through a transfer matrix formalism. These transfer matrices are no longer Hermitian and differ from the ones guaranteeing local conservation laws, but remain mutually commuting at different values of the spectral parameter defining the circuit. Exact eigenstates can still be constructed as a Bethe ansatz, but while these transfer matrices are diagonalizable in the inhomogeneous case, the homogeneous limit corresponds to an exceptio…
One-parameter interpolations between any two unitary matrices (e.g., quantum gates) $U_1$ and $U_2$ along efficient paths contained in the unitary group are constructed. Motivated by applications, we propose the continuous unitary path $U(θ)$ obtained from the QR-factorization \[ U(θ)R(θ)=(1-θ)A+θB, \] where $U_1 R_1=A$ and $U_2 R_2=B$ are the QR-factorizations of $A$ and $B$, and $U(θ)$ is a unitary for all $θ$ with $U(0)=U_1$ and $U(1)=U_2$. The QR-algorithm is modified to, instead of $U(θ)$, output a matrix whose columns are proportional to the corresponding columns of $U(θ)$ and whose entr…
Given an arbitrary $2^w \times 2^w$ unitary matrix $U$, a powerful matrix decomposition can be applied, leading to four different syntheses of a $w$-qubit quantum circuit performing the unitary transformation. The demonstration is based on a recent theorem by Führ and Rzeszotnik, generalizing the scaling of single-bit unitary gates ($w=1$) to gates with arbitrary value of~$w$. The synthesized circuit consists of controlled 1-qubit gates, such as NEGATOR gates and PHASOR gates. Interestingly, the approach reduces to a known synthesis method for classical logic circuits consisting of controlled …
Random unitary matrices find a number of applications in quantum information science, and are central to the recently defined boson sampling algorithm for photons in linear optics. We describe an operationally simple method to directly implement Haar random unitary matrices in optical circuits, with no requirement for prior or explicit matrix calculations. Our physically-motivated and compact representation directly maps independent probability density functions for parameters in Haar random unitary matrices, to optical circuit components. We go on to extend the results to the case of random u…
Depth dependence of entanglement and circuit complexity in random linear optical networks
University of Maryland（马里兰大学）；Joint Quantum Institute, Department of Physics, University of Maryland（马里兰大学物理系联合量子研究所）；Joint Center for Quantum Information and Computer Science, NIST/University of Maryland（美国国家标准与技术研究院/马里兰大学联合量子信息与计算科学中心）
