We consider one dimensional quantum circuits of the brickwork type, where the fundamental quantum gate is dual unitary. Such models are solvable: the dynamical correlation functions of the infinite temperature ensemble can be computed exactly. We review various existing constructions for dual unitary gates and we supplement them with new ideas in a number of cases. We discuss connections with various topics in physics and mathematics, including quantum information theory, tensor networks for the AdS/CFT correspondence (holographic error correcting codes), classical combinatorial designs (orthogonal Latin squares), planar algebras, and Yang-Baxter maps. Afterwards we consider the ergodicity properties of a special class of dual unitary models, where the local gate is a permutation matrix. We find an unexpected phenomenon: non-ergodic behaviour can manifest itself in multi-site correlations, even in those cases when the one-site correlation functions are fully chaotic (completely thermalizing). We also discuss the circuits built out of perfect tensors. They appear locally as the most chaotic and most scrambling circuits, nevertheless they can show global signs of non-ergodicity: if the perfect tensor is constructed from a linear map over finite fields, then the resulting circuit can show exact quantum revivals at unexpectedly short times. A brief mathematical treatment of the recurrence time in such models is presented in the Appendix by Roland Bacher and Denis Serre.
Dual-unitary quantum circuits can be used to construct 1+1 dimensional lattice models for which dynamical correlations of local observables can be explicitly calculated. We show how to analytically construct classes of dual-unitary circuits with any desired level of (non-)ergodicity for any dimension of the local Hilbert space, and present analytical results for thermalization to an infinite-temperature Gibbs state (ergodic) and a generalized Gibbs ensemble (non-ergodic). It is shown how a tunable ergodicity-inducing perturbation can be added to a non-ergodic circuit without breaking dual-unit…
The hallmark of superfluidity is the appearance of metastable flow-states that carry a persistent circulating current. Considering Bose-Hubbard superfluid rings, we clarify the role of "quantum chaos" in this context. We show that the standard Landau and Bogoliubov superfluidity criteria fail for such low-dimensional circuits. We also discuss the feasibility for a coherent operation of a SQUID-like setup. Finally, we address the manifestation of the strong many-body dynamical localization effect.
Dual-unitary circuits have emerged as a minimal model for chaotic quantum many-body dynamics in which the dynamics of correlations and entanglement remains tractable. Simultaneously, there has been intense interest in the effect of measurements on the dynamics of quantum information in many-body systems. In this work we introduce a class of models combining dual-unitary circuits with particular projective measurements that allow the exact computation of dynamical correlations of local observables, entanglement growth, and steady-state entanglement. We identify a symmetry preventing a measureme…
We study the unitary dynamics of the bosonic quantum East model, a kinetically constrained lattice model which generalises the quantum East model to arbitrary occupation per site. We consider the semiclassical limit of large (but finite) site occupancy, so that the dynamics are approximated by an evolution equation of the Gross-Pitaevskii kind. This allows us to numerically study in detail system sizes of hundreds of sites. Like in the spin-$1/2$ case, we find two dynamical phases, an active one of fast thermalisation, and an inactive one of slow relaxation and absence of ergodicity on numeric…
We extend the concept of dual unitary quantum gates to quantum lattice models in $2 + 1$ dimensions, by introducing and studying ternary unitary four-particle gates, which are unitary in time and both spatial dimensions. When used as building blocks of lattice models with periodic boundary conditions in time and space (corresponding to infinite temperature states), dynamical correlation functions exhibit a light-ray structure. We also generalize solvable MPS to two spatial dimensions with cylindrical boundary conditions, by showing that the analogous solvable PEPS can be identified with matrix…
We study the growth of genuine multipartite entanglement in random quantum circuit models, which include random unitary circuit models and the random Clifford circuit. We find that for the random Clifford circuit, the growth of multipartite entanglement remains slower in comparison to the random unitary case. However, the final saturation value of multipartite entanglement is almost the same in both cases. The behavior is then compared to the genuine multipartite entanglement obtained in random matrix product states with a moderately high bond dimension. We then relate the behavior of multipar…
We discuss the variational optimization of a unitary tensor-network circuit with different network structures. The ansatz is performed based on a generalization of well-developed multi-scale entanglement renormalization algorithm and also the conjugate-gradient method with an effective line search. We present the benchmarking calculations for different network structures by studying the Heisenberg model in a strongly disordered magnetic field and a tensor-network $QR$-decomposition.
Center for Theoretical Physics — a Leinweber Institute, Massachusetts Institute of Technology(麻省理工学院莱因韦伯理论物理中心);California Institute of Technology(加州理工学院);Department of Physics, The University of Texas at Austin(德克萨斯大学奥斯汀分校物理系);National University of Singapore(新加坡国立大学);Centre for Quantum Technologies, National University of Singapore(新加坡国立大学量子技术中心)
Randomized benchmarking is a useful scheme for evaluation the average fidelity of a noisy quantum circuit. However, it is insensitive to the unitary error. Here, we propose a method of randomized benchmarking in which a unitary t-design is applied and by which the unitary error estimation can be converted to analysis of pseudo-randomness on a set of unitary operators. We give a bound on the number of randomized benchmarking sequences, when performing a unitary t-design on n-qubit d-dimensional system. By applying local random unitary operators, a decomposition of a unitary t-design, the bound …
Random quantum circuits are proficient information scramblers and efficient generators of randomness, rapidly approximating moments of the unitary group. We study the convergence of local random quantum circuits to unitary $k$-designs. Employing a statistical mechanical mapping, we give an exact expression of the distance to forming an approximate design as a lattice partition function. In the statistical mechanics model, the approach to randomness has a simple interpretation in terms of domain walls extending through the circuit. We analytically compute the second moment, showing that random …
This paper is concerned with the ergodic subspaces of the state spaces of isolated quantum systems. We prove a new ergodic theorem for closed quantum systems which shows that the equilibrium state of the system takes the form of a grand canonical density matrix involving a complete commuting set of observables including the Hamiltonian. The result obtained, which is derived for a generic finite-dimensional quantum system, shows that the equilibrium state arising from unitary evolution is always expressible in the canonical form, without the consideration of a system-bath decomposition.
The entanglement in operator space is a well established measure for the complexity of the quantum many-body dynamics. In particular, that of local operators has recently been proposed as dynamical chaos indicator, i.e. as a quantity able to discriminate between quantum systems with integrable and chaotic dynamics. For chaotic systems the local-operator entanglement is expected to grow linearly in time, while it is expected to grow at most logarithmically in the integrable case. Here we study local-operator entanglement in dual-unitary quantum circuits, a class of "statistically solvable" quan…
This paper addresses the problem of designing universal quantum circuits to transform $k$ uses of a $d$-dimensional unitary input-operation into a unitary output-operation in a probabilistic heralded manner. Three classes of protocols are considered, parallel circuits, where the input-operations can be simultaneously, adaptive circuits, where sequential uses of the input-operations are allowed, and general protocols, where the use of the input-operations may be performed without a definite causal order. For these three classes, we develop a systematic semidefinite programming approach that fin…
Models for non-unitary quantum dynamics, such as quantum circuits that include projective measurements, have been shown to exhibit rich quantum critical behavior. There are many complementary perspectives on this behavior. For example, there is a known correspondence between d-dimensional local non-unitary quantum circuits and tensor networks on a D=(d+1)-dimensional lattice. Here, we show that in the case of systems of non-interacting fermions, there is furthermore a full correspondence between non-unitary circuits in d spatial dimensions and unitary non-interacting fermion problems with stat…
One-way measurement based quantum computations (1WQC) may describe unitary transformations, via a composition of CPTP maps which are not all unitary themselves. This motivates the following decision problems: Is it possible to determine whether a ``quantum-to-quantum'' 1WQC procedure (having non-trivial input and output subsystems) performs a unitary transformation? Is it possible to describe precisely how such computations transform quantum states, by translation to a quantum circuit of comparable complexity? In this article, we present an efficient algorithm for transforming certain families…
We consider the long-time limit of out-of-time-order correlators (OTOCs) in two classes of quantum lattice models with time evolution governed by local unitary quantum circuits and maximal butterfly velocity $v_{B} = 1$. Using a transfer matrix approach, we present analytic results for the long-time value of the OTOC on and inside the light cone. First, we consider `dual-unitary' circuits with various levels of ergodicity, including the integrable and non-integrable kicked Ising model, where we show exponential decay away from the light cone and relate both the decay rate and the long-time val…
We develop a unitary dependence theory to characterize the behaviors of quantum circuits and states in terms of how quantum gates manipulate qubits and determine their measurement probabilities. A qubit has dependence on a 1-qubit unitary gate if its measurement probabilities depend on the parameters of the gate. A 1-qubit unitary creates such a dependence onto the target qubit, and a CNOT gate copies all the dependences from the control qubit to the target qubit. The complete dependence picture of the output state details the connections qubits may have when being manipulated or measured. Com…
We study the computational power of unitary Clifford circuits with solely magic state inputs (CM circuits), supplemented by classical efficient computation. We show that CM circuits are hard to classically simulate up to multiplicative error (assuming PH non-collapse), and also up to additive error under plausible average-case hardness conjectures. Unlike other such known classes, a broad variety of possible conjectures apply. Along the way we give an extension of the Gottesman-Knill theorem that applies to universal computation, showing that for Clifford circuits with joint stabiliser and non…
We study a model of free fermions on a chain with dynamics generated by random unitary gates acting on nearest neighbor bonds and present an exact calculation of time-ordered and out-of-time-ordered correlators. We consider three distinct cases: the random circuit with spatio-temporal disorder (i) with and (ii) without particle number conservation and (iii) the particle non-conserving case with purely temporal disorder. In all three cases, temporal disorder causes diffusive operator spreading and $\sim\sqrt{t}$ entanglement growth. This is in sharp contrast to Anderson localization for the cas…
The representation of discrete, compact wavelet transformations (WTs) as circuits of local unitary gates is discussed. We employ a similar formalism as used in the multi-scale representation of quantum many-body wavefunctions using unitary circuits, further cementing the relation established in [Phys. Rev. Lett. 116, 140403 (2016)] between classical and quantum multi-scale methods. An algorithm for constructing the circuit representation of known orthogonal, dyadic, discrete WTs is presented, and the explicit representation for Daubechies wavelets, coiflets, and symlets is provided. Furthermor…
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 …
We study efficient generations of random diagonal-unitary matrices, an ensemble of unitary matrices diagonal in a given basis with randomly distributed phases for their eigenvalues. Despite the simple algebraic structure, they cannot be achieved by quantum circuits composed of a few-qubit diagonal gates. We introduce diagonal-unitary $t$-designs and present two quantum circuits that implement diagonal-unitary $2$-designs with the computational basis in $N$-qubit systems. One is composed of single-qubit diagonal gates and controlled-phase gates with randomized phases, which achieves an exact di…
Quantum circuits that are classically simulatable tell us when quantum computation becomes less powerful than or equivalent to classical computation. Such classically simulatable circuits are of importance because they illustrate what makes universal quantum computation different from classical computers. In this work, we propose a novel family of classically simulatable circuits by making use of dual-unitary quantum circuits (DUQCs), which have been recently investigated as exactly solvable models of non-equilibrium physics, and we characterize their computational power. Specifically, we inve…
Circulant matrices are an important family of operators, which have a wide range of applications in science and engineering related fields. They are in general non-sparse and non-unitary. In this paper, we present efficient quantum circuits to implement circulant operators using fewer resources and with lower complexity than existing methods. Moreover, our quantum circuits can be readily extended to the implementation of Toeplitz, Hankel, and block circulant matrices. Efficient quantum algorithms to implement the inverses and products of circulant operators are also provided.
Recent works have investigated the emergence of a new kind of random matrix behaviour in unitary dynamics following a quantum quench. Starting from a time-evolved state, an ensemble of pure states supported on a small subsystem can be generated by performing projective measurements on the remainder of the system, leading to a projected ensemble. In chaotic quantum systems it was conjectured that such projected ensembles become indistinguishable from the uniform Haar-random ensemble and lead to a quantum state design. Exact results were recently presented by Ho and Choi [Phys. Rev. Lett. 128, 0…
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…
Exact Hilbert-space ergodicity from continuous monitoring
Institute for Advanced Study, Tsinghua University(清华大学高等研究院);Department of Physics & State Key Laboratory of Surface Physics, Fudan University(复旦大学物理系与表面物理国家重点实验室)
Quantum complexity and localization in random and time-periodic unitary circuits
Perimeter Institute for Theoretical Physics(Perimeter理论物理研究所);University of Waterloo(滑铁卢大学);Indian Institute of Sciences(印度科学学院);University of Bristol(布里斯托大学);Jagiellonian University(亚捷隆大学);Indian Institute of Science(印度科学学院)
Within the general context of the architecture in quantum computer design, this paper aims is to provide a general strategy to obtain a block-matrix representation of quantum gates applied to qubits placed in arbitrary positions over an arbitrary dimensional input state. The model is also extended to the framework of quantum computation with qudits. An application in the context of the quantum computational logic is provided.