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 (19)

• Multi-party entanglement in graph states
• Resource-efficient linear optical quantum computation
• Evenly distributed unitaries: on the structure of unitary designs
• Randomizing quantum states: Constructions and applications
• Symmetrised Characterisation of Noisy Quantum Processes
• Superdense coding of quantum states
• Remote preparation of quantum states
• Entangling power of the quantum baker's map
• Exact convergence times for generation of random bipartite entanglement
• Emergence of typical entanglement in two-party random processes
• Potential and limits to cluster state quantum computing using probabilistic gates
• Probability density function characterization of multipartite entanglement
• Generalized entanglement as a framework for complex quantum systems: Purity vs delocalization measures
• Optimal two-qubit gate for generation of random bipartite entanglement
• 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
• Formation of Multipartite Entanglement Using Random Quantum Gates