Unitary $2$-designs from random $X$- and $Z$-diagonal unitaries

Abstract

Unitary $2$-designs are random unitaries simulating up to the second order statistical moments of the uniformly distributed random unitaries, often referred to as Haar random unitaries. They are used in a wide variety of theoretical and practical quantum information protocols, and also have been used to model the dynamics in complex quantum many-body systems. Here, we show that unitary $2$-designs can be approximately implemented by alternately repeating random unitaries diagonal in the Pauli-$Z$ basis and that in the Pauli-$X$ basis. We also provide a converse about the number of repetitions needed to achieve unitary $2$-designs. These results imply that the process after $\ell$ repetitions achieves a $\Theta (d^{-\ell })$-approximate unitary $2$-design. Based on the construction, we further provide quantum circuits that efficiently implement approximate unitary $2$-designs. Although a more efficient implementation of unitary $2$-designs is known, our quantum circuit has its own merit that it is divided into a constant number of commuting parts, which enables us to apply all commuting gates simultaneously and leads to a possible reduction of an actual execution time. We finally interpret the result in terms of the dynamics generated by time-dependent Hamiltonians and provide for the first time a random disordered time-dependent Hamiltonian that generates a unitary $2$-design after switching interactions only a few times.

16 pages, 1 figure, v2: some minor changes and added references, v3: 21 pages, 1 figure, both results and presentations were much improved. v4: 20 pages, 1 figure, published version

References in corpus (20)

• Black holes as mirrors: quantum information in random subsystems
• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• Foundation of Statistical Mechanics under experimentally realistic conditions
• Two-dimensional conformal field theory and the butterfly effect
• Evenly distributed unitaries: on the structure of unitary designs
• Aspects of generic entanglement
• The mother of all protocols: Restructuring quantum information's family tree
• Process verification of two-qubit quantum gates by randomized benchmarking
• Relating quantum privacy and quantum coherence: an operational approach
• Randomized benchmarking of single and multi-qubit control in liquid-state NMR quantum information processing
• Efficient unitary designs with nearly time-independent Hamiltonian dynamics
• Comment on the paper "Random Quantum Circuits are Approximate 2-designs"
• Parameters of Pseudo-Random Quantum Circuits
• Efficient algorithm for multi-qudit twirling for ensemble quantum computation
• Efficient Quantum Tensor Product Expanders and k-designs
• Quantum pseudo-randomness from cluster-state quantum computation
• Near-linear constructions of exact unitary 2-designs
• Decoupling with random diagonal unitaries
• Pseudo-randomness and Learning in Quantum Computation

Cited by in corpus (24)

• Differentiable Quantum Architecture Search
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates
• Pseudorandom States, Non-Cloning Theorems and Quantum Money
• Feature Selection on Quantum Computers
• Quantum Cryptography in Algorithmica
• Sample complexity of device-independently certified "quantum supremacy"
• Quantum circuits for exact unitary $t$-designs and applications to higher-order randomized benchmarking
• Symmetry enhanced variational quantum spin eigensolver
• Quantum computational supremacy in the sampling of bosonic random walkers on a one-dimensional lattice
• Markovianization with approximate unitary designs
• Benchmarking universal quantum gates via channel spectrum
• Randomized adaptive quantum state preparation
• Decoupling with random diagonal unitaries
• Automatic Depth-Optimized Quantum Circuit Synthesis for Diagonal Unitary Matrices with Asymptotically Optimal Gate Count
• A graphical calculus for integration over random diagonal unitary matrices
• Purity of thermal mixed quantum states
• Energy-filtered random-phase states as microcanonical thermal pure quantum states
• Kerdock Codes Determine Unitary 2-Designs
• Thermal Pure States for Systems with Antiunitary Symmetries and Their Tensor Network Representations
• Dual unitaries as maximizers of the distance to local product gates
• Emergence of a fluctuation relation for heat in nonequilibrium Landauer processes
• Simulating Floquet scrambling circuits on trapped-ion quantum computers
• Machine learning, quantum chaos, and pseudorandom evolution
• Towards Classical Software Verification using Quantum Computers