Generating a state $t$-design by diagonal quantum circuits

Abstract

We investigate protocols for generating a state $t$-design by using a fixed separable initial state and a diagonal-unitary $t$-design in the computational basis, which is a $t$-design of an ensemble of diagonal unitary matrices with random phases as their eigenvalues. We first show that a diagonal-unitary $t$-design generates a $O(1/2^N)$-approximate state $t$-design, where $N$ is the number of qubits. We then discuss a way of improving the degree of approximation by exploiting non-diagonal gates after applying a diagonal-unitary $t$-design. We also show that it is necessary and sufficient to use $O({\log }_{2}t)$-qubit gates with random phases to generate a diagonal-unitary $t$-design by diagonal quantum circuits, and that each multi-qubit diagonal gate can be replaced by a sequence of multi-qubit controlled-phase-type gates with discrete-valued random phases. Finally, we analyze the number of gates for implementing a diagonal-unitary $t$-design by {\it non-diagonal} two- and one-qubit gates. Our results provide a concrete application of diagonal quantum circuits in quantum informational tasks.

ver. 1: 15 pages, 1 figures. ver.2: 16 pages, 2 figures, major changes, we corrected a mistake, which slightly changes a main conclusion, added a new result, and improved a presentation. ver.3: 11 pages, 2 figures, published version

References in corpus (6)

• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
• Emergence of typical entanglement in two-party random processes
• Complexity of thermal states in quantum spin chains
• Comment on the paper "Random Quantum Circuits are Approximate 2-designs"
• Efficient algorithm for multi-qudit twirling for ensemble quantum computation

Cited by in corpus (24)

• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Computational advantage of quantum random sampling
• Pseudorandom States, Non-Cloning Theorems and Quantum Money
• Efficient unitary designs with nearly time-independent Hamiltonian dynamics
• Anticoncentration theorems for schemes showing a quantum speedup
• Quantum Commuting Circuits and Complexity of Ising Partition Functions
• Sample complexity of device-independently certified "quantum supremacy"
• Unitary $2$-designs from random $X$- and $Z$-diagonal unitaries
• Characterizing complexity of many-body quantum dynamics by higher-order eigenstate thermalization
• Diagonal quantum circuits: their computational power and applications
• Random Matrix Theory of the Isospectral twirling
• Diagonal unitary entangling gates and contradiagonal quantum states
• Entanglement of random hypergraph states
• Optimal quantum circuit cuts with application to clustered Hamiltonian simulation
• Automatic and effective discovery of quantum kernels
• Decoupling with random diagonal unitaries
• Automatic Depth-Optimized Quantum Circuit Synthesis for Diagonal Unitary Matrices with Asymptotically Optimal Gate Count
• Energy-filtered random-phase states as microcanonical thermal pure quantum states
• Characterization, synthesis, and optimization of quantum circuits over multiple-control $\text{Z}$-rotation gates: A systematic study
• Quantum tomography with random diagonal unitary maps and statistical bounds on information generation using random matrix theory
• Thermal states of random quantum many-body systems
• Generic Entanglement Entropy for Quantum States with Symmetry
• Simple Diagonal State Designs with Reconfigurable Real-Time Circuits