Parameters of Pseudo-Random Quantum Circuits

Abstract

Pseudorandom circuits generate quantum states and unitary operators which are approximately distributed according to the unitarily invariant Haar measure. We explore how several design parameters affect the efficiency of pseudo-random circuits, with the goal of identifying relevant trade-offs and optimizing convergence. The parameters we explore include the choice of single- and two-qubit gates, the topology of the underlying physical qubit architecture, the probabilistic application of two-qubit gates, as well as circuit size, initialization, and the effect of control constraints. Building on the equivalence between pseudo-random circuits and approximate $t$-designs, a Markov matrix approach is employed to analyze asymptotic convergence properties of pseudo-random second-order moments to a 2-design. Quantitative results on the convergence rate as a function of the circuit size are presented for qubit topologies with a sufficient degree of symmetry. Our results may be theoretically and practically useful to optimize the efficiency of random state and operator generation.

17 pages, 14 figures, 2 Appendices

References in corpus (42)

• Persistent entanglement in arrays of interacting particles
• Measurement-based quantum computation with cluster states
• Average Entropy of a Subsystem
• Multi-party entanglement in graph states
• Resource-efficient linear optical quantum computation
• The capacity of the noisy quantum channel
• Optical quantum computation using cluster states
• Global entanglement in multiparticle systems
• Evenly distributed unitaries: on the structure of unitary designs
• Quantum Data Hiding
• Randomizing quantum states: Constructions and applications
• A subsystem-independent generalization of entanglement
• Symmetrised Characterisation of Noisy Quantum Processes
• Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
• Superdense coding of quantum states
• Efficient quantum computation with probabilistic quantum gates
• Generalizations of entanglement based on coherent states and convex sets
• Remote preparation of quantum states
• Composed ensembles of random unitary matrices
• Efficient Generation of Generic Entanglement
• Entangling power of the quantum baker's map
• Nature and Measure of Entanglement in Quantum Phase Transitions
• Convergence Conditions for Random Quantum Circuits
• Exact convergence times for generation of random bipartite entanglement
• Emergence of typical entanglement in two-party random processes
• Efficient error characterization in Quantum Information Processing
• Potential and limits to cluster state quantum computing using probabilistic gates
• Probability density function characterization of multipartite entanglement
• Distribution of bipartite entanglement for random pure states
• Entanglement Generation of Nearly-Random Operators
• Generalized entanglement as a framework for complex quantum systems: Purity vs delocalization measures
• Generalization of entanglement to convex operational theories: Entanglement relative to a subspace of observables
• Optimal two-qubit gate for generation of random bipartite entanglement
• Efficient Construction of Photonic Quantum Computational Clusters
• Efficient construction of 2-D cluster states with probabilistic quantum gates
• Distribution of G-concurrence of random pure states
• Efficient algorithm for multi-qudit twirling for ensemble quantum computation
• Quantum pseudo-randomness from cluster-state quantum computation
• Matrix Element Distribution as a Signature of Entanglement Generation
• Formation of Multipartite Entanglement Using Random Quantum Gates
• Quantum Cellular Automata Pseudo-Random Maps
• Pseudo-random operators of the circular ensembles

Cited by in corpus (20)

• Characterizing Quantum Supremacy in Near-Term Devices
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Convergence rates for arbitrary statistical moments of random quantum circuits
• Efficient unitary designs with nearly time-independent Hamiltonian dynamics
• Toward Quantum Computing Phase Diagrams of Gauge Theories with Thermal Pure Quantum States
• Mixing properties of stochastic quantum Hamiltonians
• Simulating hydrodynamics on noisy intermediate-scale quantum devices with random circuits
• Quantum circuits for exact unitary $t$-designs and applications to higher-order randomized benchmarking
• Unitary $2$-designs from random $X$- and $Z$-diagonal unitaries
• Quantum Pseudorandomness and Classical Complexity
• Quantum Teleportation-Inspired Algorithm for Sampling Large Random Quantum Circuits
• Evaluation of Parameterized Quantum Circuits with Cross-Resonance Pulse-Driven Entanglers
• Decoupling with random diagonal unitaries
• One-Shot Randomized and Nonrandomized Partial Decoupling
• Impact of the form of weighted networks on the quantum extreme reservoir computation
• Quantum simulation using noisy unitary circuits and measurements
• Quantum circuit for three-qubit random states
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement
• Pseudo-Random Circuits from Clifford Plus T-Gates
• Crosstalk-Based Parameterized Quantum Circuit Approximation