Architectures and random properties of symplectic quantum circuits

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 $\mathbb{SP}(d/2)$ -- the group of $d\times 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 $\mathcal{G}$ for the symplectic algebra $\mathfrak{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 $\mathcal{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 $\mathbb{SP}(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.

13+8 pages, 8 figures, updated to published version

References in corpus (61)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Elementary gates for quantum computation
• Barren plateaus in quantum neural network training landscapes
• Improved Simulation of Stabilizer Circuits
• Black holes as mirrors: quantum information in random subsystems
• Characterizing Quantum Supremacy in Near-Term Devices
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Fast Scramblers
• The foundations of statistical mechanics from entanglement: Individual states vs. averages
• Operator Spreading in Random Unitary Circuits
• Chaos in quantum channels
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Quantum Entanglement Growth Under Random Unitary Dynamics
• Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
• Operator hydrodynamics, OTOCs, and entanglement growth in systems without conservation laws
• Quantum advantage in learning from experiments
• Random Quantum Circuits
• Holographic duality from random tensor networks
• Towards the fast scrambling conjecture
• Evenly distributed unitaries: on the structure of unitary designs
• Local random quantum circuits are approximate polynomial-designs
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Barren Plateaus in Variational Quantum Computing
• Matchgates and classical simulation of quantum circuits
• Exploiting symmetry in variational quantum machine learning
• Theory of overparametrization in quantum neural networks
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates
• Efficient Generation of Generic Entanglement
• Hadamard-free circuits expose the structure of the Clifford group
• Theory for Equivariant Quantum Neural Networks
• Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networks
• Random quantum circuits are approximate unitary $t$-designs in depth $O\left(n{t}^{5+o(1)}\right)$
• Symmetry Principles in Quantum Systems Theory
• Matchgate Shadows for Fermionic Quantum Simulation
• Does provable absence of barren plateaus imply classical simulability?
• Restrictions on realizable unitary operations imposed by symmetry and locality
• The Adjoint Is All You Need: Characterizing Barren Plateaus in Quantum Ansätze
• Anticoncentration theorems for schemes showing a quantum speedup
• Efficient unitary designs with a system-size independent number of non-Clifford gates
• Speeding up Learning Quantum States through Group Equivariant Convolutional Quantum Ansätze
• Criteria for reachability of quantum states
• Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
• Symmetry criteria for quantum simulability of effective interactions
• The Power of Noisy Fermionic Quantum Computation
• Quantum Deep Hedging
• Efficient classical algorithms for simulating symmetric quantum systems
• Universal extensions of restricted classes of quantum operations
• Classification of dynamical Lie algebras for translation-invariant 2-local spin systems in one dimension
• Identification of dynamical Lie algebras for finite-level quantum control systems
• Tight and Efficient Gradient Bounds for Parameterized Quantum Circuits
• Computing exact moments of local random quantum circuits via tensor networks
• Quantum neural networks form Gaussian processes
• On the universality of $S_n$-equivariant $k$-body gates
• Trainability and Expressivity of Hamming-Weight Preserving Quantum Circuits for Machine Learning
• Rotationally-Invariant Circuits: Universality with the exchange interaction and two ancilla qubits
• Characterization of variational quantum algorithms using free fermions
• Approximate orthogonality of permutation operators, with application to quantum information
• Gate-based quantum simulation of Gaussian bosonic circuits on exponentially many modes

Cited by in corpus (2)

• Exact spectral gaps of random one-dimensional quantum circuits
• Moments of Quantum Channel Ensembles