Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Simple Diagonal Designs with Reconfigurable Real-Time Circuits

Yizhi Shen

Published Dec 23, 2024• 0 citations
OpenAlex

Abstract

Unitary designs are widely used in quantum computation, but in many practical settings it suffices to construct a diagonal state design generated with unitary gates diagonal in the computational basis. In this work, we introduce a simple and efficient diagonal state design based on real-time evolutions. Our construction is inspired by the classical Girard-Hutchinson trace estimator in that it involves the stochastic preparation of random-phase states. Although the exact Girard-Hutchinson states are not tractably implementable on a quantum computer, we can construct states that match the statistical moments of the Girard-Hutchinson states with real-time evolution. Importantly, our random states are all generated using the same Hamiltonians for real-time evolution, with the randomness arising solely from stochastic variations in the durations of the evolutions. In this sense, the circuit is fully reconfigurable and thus suited for near-term realizations on both digital and analog platforms.

Related papers

Diagonal state designs with reconfigurable real-time circuits

Yizhi Shen, Katherine Klymko, Eran Rabani +4 more

Unitary designs are widely used in quantum computation, but in many practical settings it suffices to construct a diagonal state design generated with unitary gates diagonal in the computational basis. In this work, we introduce a simple and efficient diagonal state 3-design based on real-time evolutions under 2-local Hamiltonians. Our construction is inspired by the classical Girard-Hutchinson trace estimator in that it involves the stochastic preparation of many random-phase states. Though the exact Girard-Hutchinson states are not tractably implementable on a quantum computer, we can construct states that match the statistical moments of the Girard-Hutchinson states with real-time evolution. Importantly, our random states are all generated using the same Hamiltonians for real-time evolution, with the randomness arising solely from stochastic variations in the durations of the evolutions. In this sense, the circuit is fully reconfigurable and thus suited for near-term realizations on both digital and analog platforms. Moreover, we show how to extend our construction to achieve diagonal state designs of arbitrarily high order.

arXiv:2401.04176•Physical Review Research•Sep 29, 2025•9 citations

DIAGONAL-UNITARY 2-DESIGN AND THEIR IMPLEMENTATIONS BY QUANTUM CIRCUITS

YOSHIFUMI NAKATA, Mio Murao

We study efficient generations of random diagonal-unitary matrices, an ensemble of unitary matrices diagonal in a given basis with randomly distributed phases for their eigenvalues. Despite the simple algebraic structure, they cannot be achieved by quantum circuits composed of a few-qubit diagonal gates. We introduce diagonal-unitaryt-designs and present two quantum circuits that implement diagonal-unitary 2-design with the computational basis in N-qubit systems. One is composed of single-qubit diagonal gates and controlled-phase gates with randomized phases, which achieves an exact diagonal-unitary 2-design after applying the gates on all pairs of qubits. The number of required gates is N(N - 1)/2. If the controlled-Z gates are used instead of the controlled-phase gates, the circuit cannot achieve an exact 2-design, but achieves an ϵ-approximate 2-design by applying gates on randomly selected pairs of qubits. Due to the random choice of pairs, the circuit obtains extra randomness and the required number of gates is at most O(N2(N + log 1/∊)). We also provide an application of the circuits, a protocol of generating an exact 2-design of random states by combining the circuits with a simple classical procedure requiring O(N) random classical bits.

arXiv:1206.4451•International Journal of Quantum Information•Oct 1, 2013•23 citations

Generating a statet-design by diagonal quantum circuits

Yoshifumi Nakata, Masato Koashi, Mio Murao

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.

arXiv:1311.1128•New Journal of Physics•May 22, 2014•43 citations

Random Quantum Circuits Beyond Moment Matching

Shih-Han Hung

Random quantum circuits aim to efficiently reproduce the statistical properties of ideal random quantum evolution. One approach is to construct approximate unitary designs, which match the moments of Haar-random unitaries up to a prescribed order with controlled error. We establish quantitative guarantees for how accurately these designs reproduce the distribution of each output probability. We show that, for every strong $\varepsilon$-approximate unitary $k$-design on $n$ qubits, the distribution of each output probability is within $O(k^{-1/2}(1+k/2^n)^{-1/2}+\varepsilon)$ in Kolmogorov distance of the Porter-Thomas distribution, a beta distribution with parameters $1$ and $2^n-1$. This bound is optimal up to constant factors, implying that a substantially better uniform bound requires additional structure. We then show that a mild form of local invariance suffices. We prove that any such design that is invariant under unitary translations acting on a single qubit approximates Porter-Thomas to total variation distance $O(k^{-1/2}+\varepsilon)$. Every strong $\varepsilon$-approximate unitary $k$-design invariant on $\log k+O(1)$ qubits achieves error $2^{-Ω(k)}+O(\varepsilon)$ in Kolmogorov distance and $2^{-Ω(k)}+O(\varepsilon\log(2/\varepsilon))$ in total variation distance. These results identify the distributional accuracy guaranteed by moment matching and the structure that improves it. As an application, we show that the Shannon entropy of the output distribution of a strong $\varepsilon$-approximate $k$-design is concentrated around its Haar value $n-Θ(1)$: its mean differs from the Haar mean by $O(k^{-1/4}+\varepsilon^{1/2})$ and its standard deviation is $O(2^{-n/2}+k^{-1/8}+\varepsilon^{1/4})$. Consequently, a trusted device sampling such circuits generates $n-O(1)$ bits of entropy per sample, which makes them useful for random number generation.

quant-pharXiv:2610.02135•Oct 2, 2026•0 citations

Efficient Quantum Circuits for Non-Unitary and Unitary Diagonal Operators with Space-Time-Accuracy Trade-Offs

Julien Zylberman, Ugo Nzongani, Andrea Simonetto +1 more

Unitary and non-unitary diagonal operators are fundamental building blocks in quantum algorithms with applications in the resolution of partial differential equations, Hamiltonian simulations, the loading of classical data on quantum computers (quantum state preparation), and many others. In this paper, we introduce a general approach to implement unitary and non-unitary diagonal operators with efficient-adjustable-depth quantum circuits. The depth, i.e., the number of layers of quantum gates of the quantum circuit, is reducible with respect either to the width, i.e., the number of ancilla qubits, or to the accuracy between the implemented operator and the target one. While exact methods have an optimal exponential scaling either in terms of size, i.e., the total number of primitive quantum gates, or width, approximate methods prove to be efficient for the class of diagonal operators depending on smooth, at least differentiable, functions. Our approach is general enough to allow any method for diagonal operators to become adjustable-depth or approximate, decreasing the depth of the circuit by increasing its width or its approximation level. This feature offers flexibility and can match with the hardware limitations in coherence time or cumulative gate error. We illustrate these methods by performing quantum state preparation and non-unitary-real-space simulation of the diffusion equation. This simulation paves the way to efficient implementations of stochastic models useful in physics, chemistry, biology, image processing, and finance.

arXiv:2404.02819•ACM Transactions on Quantum Computing•Feb 19, 2025•18 citations

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

Yoshifumi Nakata, Christoph Hirche, Ciara Morgan +1 more

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 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 ℓ repetitions achieves a Θ(d−ℓ)-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.

arXiv:1502.07514•Journal of Mathematical Physics•May 1, 2017•54 citations
Unitary designs are widely used in quantum computation, but in many practical settings it suffices to construct a diagonal state design generated with unitary gates diagonal in the computational basis. In this work, we introduce a simple and efficient diagonal state design based on real-time evolutions. Our construction is inspired by the classical Girard-Hutchinson trace estimator in that it involves the stochastic preparation of random-phase states. Although the exact Girard-Hutchinson states are not tractably implementable on a quantum computer, we can construct states that match the statistical moments of the Girard-Hutchinson states with real-time evolution. Importantly, our random states are all generated using the same Hamiltonians for real-time evolution, with the randomness arising solely from stochastic variations in the durations of the evolutions. In this sense, the circuit is fully reconfigurable and thus suited for near-term realizations on both digital and analog platforms.
Unitary designs are widely used in quantum computation, but in many practical settings it suffices to construct a diagonal state design generated with unitary gates diagonal in the computational basis. In this work, we introduce a simple and efficient diagonal state 3-design based on real-time evolutions under 2-local Hamiltonians. Our construction is inspired by the classical Girard-Hutchinson trace estimator in that it involves the stochastic preparation of many random-phase states. Though the exact Girard-Hutchinson states are not tractably implementable on a quantum computer, we can construct states that match the statistical moments of the Girard-Hutchinson states with real-time evolution. Importantly, our random states are all generated using the same Hamiltonians for real-time evolution, with the randomness arising solely from stochastic variations in the durations of the evolutions. In this sense, the circuit is fully reconfigurable and thus suited for near-term realizations on both digital and analog platforms. Moreover, we show how to extend our construction to achieve diagonal state designs of arbitrarily high order.
We study efficient generations of random diagonal-unitary matrices, an ensemble of unitary matrices diagonal in a given basis with randomly distributed phases for their eigenvalues. Despite the simple algebraic structure, they cannot be achieved by quantum circuits composed of a few-qubit diagonal gates. We introduce diagonal-unitaryt-designs and present two quantum circuits that implement diagonal-unitary 2-design with the computational basis in N-qubit systems. One is composed of single-qubit diagonal gates and controlled-phase gates with randomized phases, which achieves an exact diagonal-unitary 2-design after applying the gates on all pairs of qubits. The number of required gates is N(N - 1)/2. If the controlled-Z gates are used instead of the controlled-phase gates, the circuit cannot achieve an exact 2-design, but achieves an ϵ-approximate 2-design by applying gates on randomly selected pairs of qubits. Due to the random choice of pairs, the circuit obtains extra randomness and the required number of gates is at most O(N2(N + log 1/∊)). We also provide an application of the circuits, a protocol of generating an exact 2-design of random states by combining the circuits with a simple classical procedure requiring O(N) random classical bits.
We investigate protocols for generating a state ttt-design by using a fixed separable initial state and a diagonal-unitary ttt-design in the computational basis, which is a ttt-design of an ensemble of diagonal unitary matrices with random phases as their eigenvalues. We first show that a diagonal-unitary ttt-design generates a O(1/2N)O(1/2^N)O(1/2N)-approximate state ttt-design, where NNN 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 ttt-design. We also show that it is necessary and sufficient to use O(log⁡2t)O(\log_2 t)O(log2​t)-qubit gates with random phases to generate a diagonal-unitary ttt-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 ttt-design by {\it non-diagonal} two- and one-qubit gates. Our results provide a concrete application of diagonal quantum circuits in quantum informational tasks.
Random quantum circuits aim to efficiently reproduce the statistical properties of ideal random quantum evolution. One approach is to construct approximate unitary designs, which match the moments of Haar-random unitaries up to a prescribed order with controlled error. We establish quantitative guarantees for how accurately these designs reproduce the distribution of each output probability. We show that, for every strong ε\varepsilonε-approximate unitary kkk-design on nnn qubits, the distribution of each output probability is within O(k−1/2(1+k/2n)−1/2+ε)O(k^{-1/2}(1+k/2^n)^{-1/2}+\varepsilon)O(k−1/2(1+k/2n)−1/2+ε) in Kolmogorov distance of the Porter-Thomas distribution, a beta distribution with parameters 111 and 2n−12^n-12n−1. This bound is optimal up to constant factors, implying that a substantially better uniform bound requires additional structure. We then show that a mild form of local invariance suffices. We prove that any such design that is invariant under unitary translations acting on a single qubit approximates Porter-Thomas to total variation distance O(k−1/2+ε)O(k^{-1/2}+\varepsilon)O(k−1/2+ε). Every strong ε\varepsilonε-approximate unitary kkk-design invariant on log⁡k+O(1)\log k+O(1)logk+O(1) qubits achieves error 2−Ω(k)+O(ε)2^{-Ω(k)}+O(\varepsilon)2−Ω(k)+O(ε) in Kolmogorov distance and 2−Ω(k)+O(εlog⁡(2/ε))2^{-Ω(k)}+O(\varepsilon\log(2/\varepsilon))2−Ω(k)+O(εlog(2/ε)) in total variation distance. These results identify the distributional accuracy guaranteed by moment matching and the structure that improves it. As an application, we show that the Shannon entropy of the output distribution of a strong ε\varepsilonε-approximate kkk-design is concentrated around its Haar value n−Θ(1)n-Θ(1)n−Θ(1): its mean differs from the Haar mean by O(k−1/4+ε1/2)O(k^{-1/4}+\varepsilon^{1/2})O(k−1/4+ε1/2) and its standard deviation is O(2−n/2+k−1/8+ε1/4)O(2^{-n/2}+k^{-1/8}+\varepsilon^{1/4})O(2−n/2+k−1/8+ε1/4). Consequently, a trusted device sampling such circuits generates n−O(1)n-O(1)n−O(1) bits of entropy per sample, which makes them useful for random number generation.
Unitary and non-unitary diagonal operators are fundamental building blocks in quantum algorithms with applications in the resolution of partial differential equations, Hamiltonian simulations, the loading of classical data on quantum computers (quantum state preparation), and many others. In this paper, we introduce a general approach to implement unitary and non-unitary diagonal operators with efficient-adjustable-depth quantum circuits. The depth, i.e., the number of layers of quantum gates of the quantum circuit, is reducible with respect either to the width, i.e., the number of ancilla qubits, or to the accuracy between the implemented operator and the target one. While exact methods have an optimal exponential scaling either in terms of size, i.e., the total number of primitive quantum gates, or width, approximate methods prove to be efficient for the class of diagonal operators depending on smooth, at least differentiable, functions. Our approach is general enough to allow any method for diagonal operators to become adjustable-depth or approximate, decreasing the depth of the circuit by increasing its width or its approximation level. This feature offers flexibility and can match with the hardware limitations in coherence time or cumulative gate error. We illustrate these methods by performing quantum state preparation and non-unitary-real-space simulation of the diffusion equation. This simulation paves the way to efficient implementations of stochastic models useful in physics, chemistry, biology, image processing, and finance.
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 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 ℓ repetitions achieves a Θ(d−ℓ)-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.