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

arXiv:2610.28057

Optimal Quantum-Circuit Synthesis and Implementation of General Unitaries with Parallelized Bitstring-Conditioned Rotations

Heikki Suominen, Suman Kundu, Heidi Kivijärvi, Sasu Tuohino, Mikko Tuokkola, Eemeli Forsbom, Madhavi Chand, Vasilii Vadimov, R. Vijay, Mikko Möttönen

quant-phSubmitted Oct 20, 2026• Announced Oct 21, 2026• 0 citations
arXivHTMLPDF

Abstract

We theoretically introduce a quantum-circuit synthesis protocol to realize any $n$-qubit transformation $U\in U(2^n)$, up to a diagonal. The resulting circuit is directly native to and optimal in gate count and depth for systems where bitstring-conditioned rotations with tunable angle and axis, $C^{(n-1)}R(θ,φ)$, form the set of native operations. Subsequently, we suggest how this protocol can be implemented in a few-mode superconducting circuit, and experimentally demonstrate the method for the smallest nontrivial case, i.e., for two qubits. We report an average gate fidelity of 97.6 % for Haar-random two-qubit unitaries up to phase shifts in the computational basis. Importantly, these results suggest that multimode devices, such as those in the multimon or multiunimon families may become competitive with qubit-array networks for general-unitary implementations for qubit counts as low as three.

AI Summary

The paper studies synthesis of dense $n$-qubit unitaries for hardware with native bitstring-conditioned rotations $C^{(n-1)}R(\theta,\phi)$, assuming rotations on disjoint computational-basis transitions can be driven simultaneously with independently tunable amplitudes and phases. A modification of cosine-sine decomposition implements any $U\in U(2^n)$ up to a final diagonal using $2^n-1$ layers, each containing $2^{n-1}$ parallel rotations. Diagonal phases are propagated through the decomposition, converting uniformly controlled rotations into rotations about independently chosen axes in the $xy$ plane. A hypercube matching argument bounds parallelism, and parameter counting establishes gate-count and depth optimality within this native-operation model. A variant uses only $\pi/2$ rotations, requiring $2^{n+1}-2$ layers; another procedure wraps rotation angles into $(-\pi,\pi]$. The experimental demonstration uses a two-qubit subspace of a superconducting trimon. Haar-random $4\times4$ transformations compile into three layers of 64-ns multiplexed pulses. Randomized benchmarking, with residual diagonals absorbed into subsequent transformations, gives a best-decile fidelity of $97.6\pm0.2\%$. Control includes calibration and dynamic compensation of drive-induced frequency shifts. The final diagonal is dispensable before computational-basis measurement, but must otherwise be retained or absorbed into later operations. Short coherence times and overlapping transitions prevented a three-qubit demonstration. Larger-system fidelity comparisons are estimates rather than measurements. Frequency-shift calibration scales exponentially: approximately four hours for the demonstrated two-qubit system and an estimated 36 hours for three qubits. The depth advantage assumes independently addressable, simultaneously driven transitions.

No sign of AI-generated textIncrementalStrong assumptionsOverclaims

Error found: The abstract omits that the reported 97.6% average gate fidelity is a best-decile result selected from a time series of randomized-benchmarking fidelity estimates, rather than an unselected estimate of typical performance.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
15 pages, 7 figures, 1 table

Related papers

Depth-optimized quantum circuit synthesis for diagonal unitary operators with asymptotically optimal gate count

Shihao Zhang, Kai Huang, Lvzhou Li

Diagonal unitary operators are well known to be key building blocks of many quantum algorithms and quantum computing procedures, and thus resource-efficient quantum circuit implementations are in demand. Here we propose a constructive algorithm that can generate a quantum circuit over the primitive gate set {cnot, ${R}_{Z}$} for realizing any given diagonal unitary operator piece by piece. The theoretical analysis reveals that, for the general case, our generated circuit not only ensures the asymptotically optimal gate count, but also nearly halves the circuit depth compared with the previous Welch's method [New J. Phys. 16, 033040 (2014)]. Specifically, this substantial depth optimization originates from the use of a uniform circuit rewriting rule developed here. The performance of our circuit synthesis algorithm is further validated by numerical evaluations on two examples. First, we achieve a nearly 50% depth reduction over Welch's method for synthesizing random diagonal unitary operators with up to 16 qubits. Second, we achieve an average of 22.05% depth reduction for resynthesizing the diagonal part of the specific quantum approximate optimization algorithm (QAOA) circuits with up to 14 qubits.

arXiv:2212.01002•Physical Review A•Apr 1, 2024•21 citations

Characterization, synthesis, and optimization of quantum circuits over multiple-control Z -rotation gates: A systematic study

Shihao Zhang, Junda Wu, Lvzhou Li

We conduct a systematic study of quantum circuits composed of multiple-control $Z$-rotation (mczr) gates as primitives, since they are widely used components in quantum algorithms and also have attracted much experimental interest in recent years. We establish a circuit-polynomial correspondence to characterize the functionality of quantum circuits over the mczr gate set with continuous parameters. An analytic method for exactly synthesizing such quantum circuit to implement any given diagonal unitary matrix with an optimal gate count is proposed, which also enables the circuit depth optimal for specific cases with pairs of complementary gates. Furthermore, we present a gate-exchange strategy together with a flexible iterative algorithm for effectively optimizing the depth of any mczr circuit, which can also be applied to quantum circuits over any other commuting gate set. Besides the theoretical investigation, the practical performance of our circuit synthesis and optimization techniques is further evaluated numerically on two typical examples in quantum computing, including diagonal Hermitian operators and quantum approximate optimization algorithm circuits with tens of qubits, which can demonstrate a reduction in circuit depth by 33.40% and 15.55% on average over relevant prior works, respectively. Therefore, our methods and results provide a pathway for implementing quantum circuits and algorithms on recently developed devices.

arXiv:2304.08758•Physical Review A•Aug 7, 2023•8 citations

On the Synthesis of Quantum Circuits for Diagonal Operators in Quantum Computation

Jonathan Welch

Diagonal unitary operators are commonly found in many quantum algorithms. They find application as analytical potential operators for quantum simulation, as well as for complex oracles used in quantum searches. However, in order to implement a quantum algorithm on a given quantum device, each operator must be decomposed into a sequence of fault-tolerant, device-level instructions. In general, to implement an $n$-qubit diagonal unitary {\\em exactly} on a quantum computer generally requires $2^{n+1}-3$ one- and two-qubit gates. However, for most practical implementations of diagonal unitaries, some degree of approximation will be necessary if the circuit is to be efficient. In this thesis we develop two complementary methods for the approximate synthesis of quantum circuits for diagonal unitaries. We show how to apply these techniques to real-space quantum simulation and show how efficient high fidelity quantum simulations can be implemented with low-depth quantum circuits.

•Sep 29, 2015•2 citations

Automated quantum circuit optimization with randomized replacements

Marcin Szyniszewski, Aleks Kissinger, Noah Linden +1 more

Quantum circuit optimization - the process of transforming a quantum circuit into an equivalent one with reduced time and space requirements - is crucial for maximizing the utility of current and near-future quantum devices. While most automated optimization techniques focus on transforming circuits into equivalent ones that implement the same unitary, we show that substantial new opportunities for resource reduction can be achieved by (1) allowing approximate local transformations and (2) employing mixed quantum channels to approximate pure circuits. Our novel automated protocol for approximate circuit rewriting is a refined evolution of automated optimization techniques based on the ZX-calculus, where we add a greedy strategy that selectively replaces ZX-diagrams with small phase angles with stochastic mixtures of the identity and carefully chosen over-rotations, which are designed to reduce the overall gate count in expectation while staying within a strict error budget. This approach yields modest two-qubit gate count reduction in random quantum circuits, and achieves a substantial reduction in structured circuits such as the quantum Fourier transform. Fundamentally, our protocol converts experimental noise due to gate applications into deliberately engineered random noise, outperforming many other approximation methods on average. These results highlight the potential of mixed-channel approximations to enhance future quantum circuit performance, suggesting new directions for resource-aware automated quantum compilation beyond pure unitary channels.

quant-pharXiv:2601.15934•Jan 23, 2026•0 citations

Parallelizing quantum circuit synthesis

Olivia Di Matteo, Michele Mosca

Quantum circuit synthesis is the process in which an arbitrary unitary operation is decomposed into a sequence of gates from a universal set, typically one which a quantum computer can implement both efficiently and fault-tolerantly. As physical implementations of quantum computers improve, the need is growing for tools that can effectively synthesize components of the circuits and algorithms they will run. Existing algorithms for exact, multi-qubit circuit synthesis scale exponentially in the number of qubits and circuit depth, leaving synthesis intractable for circuits on more than a handful of qubits. Even modest improvements in circuit synthesis procedures may lead to significant advances, pushing forward the boundaries of not only the size of solvable circuit synthesis problems, but also in what can be realized physically as a result of having more efficient circuits. We present a method for quantum circuit synthesis using deterministic walks. Also termed pseudorandom walks, these are walks in which once a starting point is chosen, its path is completely determined. We apply our method to construct a parallel framework for circuit synthesis, and implement one such version performing optimal T -count synthesis over the Clifford+ T gate set. We use our software to present examples where parallelization offers a significant speedup on the runtime, as well as directly confirm that the 4-qubit 1-bit full adder has optimal T -count 7 and T -depth 3.

arXiv:1606.07413•Quantum Science and Technology•Mar 1, 2016•42 citations

Optimized Synthesis of Circuits for Diagonal Unitary Matrices with Reflection Symmetry

Xinchi Huang, Taichi Kosugi, Hirofumi Nishi +1 more

During the noisy intermediate-scale quantum (NISQ) era, it is important to optimize the quantum circuits in circuit depth and gate count, especially entanglement gates, including the CNOT gate. Among all the unitary operators, diagonal unitary matrices form a special class that plays a crucial role in many quantum algorithms/subroutines. Based on a natural gate set {CNOT, Rz}, quantum circuits for general diagonal unitary matrices were discussed in several previous works, and an optimal synthesis algorithm was proposed in terms of circuit depth. In this paper, we are interested in the implementation of diagonal unitary matrices with reflection symmetry, which has promising applications, including the realization of real-time evolution for first quantized Hamiltonians by quantum circuits. Owing to such a symmetric property, we show that the quantum circuit in the existing work can be further simplified and propose a constructive algorithm that optimizes the entanglement gate count. Compared to the previous synthesis methods for general diagonal unitary matrices, the quantum circuit by our proposed algorithm achieves nearly half the reduction in both the gate count and circuit depth.

arXiv:2310.06676•Journal of the Physical Society of Japan•Apr 11, 2024•4 citations
We theoretically introduce a quantum-circuit synthesis protocol to realize any nnn-qubit transformation U∈U(2n)U\in U(2^n)U∈U(2n), up to a diagonal. The resulting circuit is directly native to and optimal in gate count and depth for systems where bitstring-conditioned rotations with tunable angle and axis, C(n−1)R(θ,φ)C^{(n-1)}R(θ,φ)C(n−1)R(θ,φ), form the set of native operations. Subsequently, we suggest how this protocol can be implemented in a few-mode superconducting circuit, and experimentally demonstrate the method for the smallest nontrivial case, i.e., for two qubits. We report an average gate fidelity of 97.6 % for Haar-random two-qubit unitaries up to phase shifts in the computational basis. Importantly, these results suggest that multimode devices, such as those in the multimon or multiunimon families may become competitive with qubit-array networks for general-unitary implementations for qubit counts as low as three.
The paper studies synthesis of dense nnn-qubit unitaries for hardware with native bitstring-conditioned rotations C(n−1)R(θ,ϕ)C^{(n-1)}R(\theta,\phi)C(n−1)R(θ,ϕ), assuming rotations on disjoint computational-basis transitions can be driven simultaneously with independently tunable amplitudes and phases.
A modification of cosine-sine decomposition implements any U∈U(2n)U\in U(2^n)U∈U(2n) up to a final diagonal using 2n−12^n-12n−1 layers, each containing 2n−12^{n-1}2n−1 parallel rotations. Diagonal phases are propagated through the decomposition, converting uniformly controlled rotations into rotations about independently chosen axes in the xyxyxy plane. A hypercube matching argument bounds parallelism, and parameter counting establishes gate-count and depth optimality within this native-operation model. A variant uses only π/2\pi/2π/2 rotations, requiring 2n+1−22^{n+1}-22n+1−2 layers; another procedure wraps rotation angles into (−π,π](-\pi,\pi](−π,π].
The experimental demonstration uses a two-qubit subspace of a superconducting trimon. Haar-random 4×44\times44×4 transformations compile into three layers of 64-ns multiplexed pulses. Randomized benchmarking, with residual diagonals absorbed into subsequent transformations, gives a best-decile fidelity of 97.6±0.2%97.6\pm0.2\%97.6±0.2%. Control includes calibration and dynamic compensation of drive-induced frequency shifts.
The final diagonal is dispensable before computational-basis measurement, but must otherwise be retained or absorbed into later operations. Short coherence times and overlapping transitions prevented a three-qubit demonstration. Larger-system fidelity comparisons are estimates rather than measurements. Frequency-shift calibration scales exponentially: approximately four hours for the demonstrated two-qubit system and an estimated 36 hours for three qubits. The depth advantage assumes independently addressable, simultaneously driven transitions.
Diagonal unitary operators are well known to be key building blocks of many quantum algorithms and quantum computing procedures, and thus resource-efficient quantum circuit implementations are in demand. Here we propose a constructive algorithm that can generate a quantum circuit over the primitive gate set {cnot, RZ{R}_{Z}RZ​} for realizing any given diagonal unitary operator piece by piece. The theoretical analysis reveals that, for the general case, our generated circuit not only ensures the asymptotically optimal gate count, but also nearly halves the circuit depth compared with the previous Welch's method [New J. Phys. 16, 033040 (2014)]. Specifically, this substantial depth optimization originates from the use of a uniform circuit rewriting rule developed here. The performance of our circuit synthesis algorithm is further validated by numerical evaluations on two examples. First, we achieve a nearly 50% depth reduction over Welch's method for synthesizing random diagonal unitary operators with up to 16 qubits. Second, we achieve an average of 22.05% depth reduction for resynthesizing the diagonal part of the specific quantum approximate optimization algorithm (QAOA) circuits with up to 14 qubits.
We conduct a systematic study of quantum circuits composed of multiple-control ZZZ-rotation (mczr) gates as primitives, since they are widely used components in quantum algorithms and also have attracted much experimental interest in recent years. We establish a circuit-polynomial correspondence to characterize the functionality of quantum circuits over the mczr gate set with continuous parameters. An analytic method for exactly synthesizing such quantum circuit to implement any given diagonal unitary matrix with an optimal gate count is proposed, which also enables the circuit depth optimal for specific cases with pairs of complementary gates. Furthermore, we present a gate-exchange strategy together with a flexible iterative algorithm for effectively optimizing the depth of any mczr circuit, which can also be applied to quantum circuits over any other commuting gate set. Besides the theoretical investigation, the practical performance of our circuit synthesis and optimization techniques is further evaluated numerically on two typical examples in quantum computing, including diagonal Hermitian operators and quantum approximate optimization algorithm circuits with tens of qubits, which can demonstrate a reduction in circuit depth by 33.40% and 15.55% on average over relevant prior works, respectively. Therefore, our methods and results provide a pathway for implementing quantum circuits and algorithms on recently developed devices.
Diagonal unitary operators are commonly found in many quantum algorithms. They find application as analytical potential operators for quantum simulation, as well as for complex oracles used in quantum searches. However, in order to implement a quantum algorithm on a given quantum device, each operator must be decomposed into a sequence of fault-tolerant, device-level instructions. In general, to implement an nnn-qubit diagonal unitary {\\em exactly} on a quantum computer generally requires 2n+1−32^{n+1}-32n+1−3 one- and two-qubit gates. However, for most practical implementations of diagonal unitaries, some degree of approximation will be necessary if the circuit is to be efficient. In this thesis we develop two complementary methods for the approximate synthesis of quantum circuits for diagonal unitaries. We show how to apply these techniques to real-space quantum simulation and show how efficient high fidelity quantum simulations can be implemented with low-depth quantum circuits.
Quantum circuit optimization - the process of transforming a quantum circuit into an equivalent one with reduced time and space requirements - is crucial for maximizing the utility of current and near-future quantum devices. While most automated optimization techniques focus on transforming circuits into equivalent ones that implement the same unitary, we show that substantial new opportunities for resource reduction can be achieved by (1) allowing approximate local transformations and (2) employing mixed quantum channels to approximate pure circuits. Our novel automated protocol for approximate circuit rewriting is a refined evolution of automated optimization techniques based on the ZX-calculus, where we add a greedy strategy that selectively replaces ZX-diagrams with small phase angles with stochastic mixtures of the identity and carefully chosen over-rotations, which are designed to reduce the overall gate count in expectation while staying within a strict error budget. This approach yields modest two-qubit gate count reduction in random quantum circuits, and achieves a substantial reduction in structured circuits such as the quantum Fourier transform. Fundamentally, our protocol converts experimental noise due to gate applications into deliberately engineered random noise, outperforming many other approximation methods on average. These results highlight the potential of mixed-channel approximations to enhance future quantum circuit performance, suggesting new directions for resource-aware automated quantum compilation beyond pure unitary channels.
Quantum circuit synthesis is the process in which an arbitrary unitary operation is decomposed into a sequence of gates from a universal set, typically one which a quantum computer can implement both efficiently and fault-tolerantly. As physical implementations of quantum computers improve, the need is growing for tools that can effectively synthesize components of the circuits and algorithms they will run. Existing algorithms for exact, multi-qubit circuit synthesis scale exponentially in the number of qubits and circuit depth, leaving synthesis intractable for circuits on more than a handful of qubits. Even modest improvements in circuit synthesis procedures may lead to significant advances, pushing forward the boundaries of not only the size of solvable circuit synthesis problems, but also in what can be realized physically as a result of having more efficient circuits. We present a method for quantum circuit synthesis using deterministic walks. Also termed pseudorandom walks, these are walks in which once a starting point is chosen, its path is completely determined. We apply our method to construct a parallel framework for circuit synthesis, and implement one such version performing optimal T -count synthesis over the Clifford+ T gate set. We use our software to present examples where parallelization offers a significant speedup on the runtime, as well as directly confirm that the 4-qubit 1-bit full adder has optimal T -count 7 and T -depth 3.
During the noisy intermediate-scale quantum (NISQ) era, it is important to optimize the quantum circuits in circuit depth and gate count, especially entanglement gates, including the CNOT gate. Among all the unitary operators, diagonal unitary matrices form a special class that plays a crucial role in many quantum algorithms/subroutines. Based on a natural gate set {CNOT, Rz}, quantum circuits for general diagonal unitary matrices were discussed in several previous works, and an optimal synthesis algorithm was proposed in terms of circuit depth. In this paper, we are interested in the implementation of diagonal unitary matrices with reflection symmetry, which has promising applications, including the realization of real-time evolution for first quantized Hamiltonians by quantum circuits. Owing to such a symmetric property, we show that the quantum circuit in the existing work can be further simplified and propose a constructive algorithm that optimizes the entanglement gate count. Compared to the previous synthesis methods for general diagonal unitary matrices, the quantum circuit by our proposed algorithm achieves nearly half the reduction in both the gate count and circuit depth.