A Unified Framework for Optimizing Uniformly Controlled Structures in Quantum Circuits

• URL: http://arxiv.org/abs/2512.08675v2
• Date: Wed, 10 Dec 2025 05:21:23 GMT
• Title: A Unified Framework for Optimizing Uniformly Controlled Structures in Quantum Circuits
• Authors: Chengzhuo Xu, Xiao Chen, Xi Li, Zhihao Liu, Zhigang Li,
• Abstract summary: Unitaries of the form $_cketcbracotimes U_c$ are ubiquitous in quantum algorithms.<n>We study the general decomposition problem for UCG and UCG-like structure.
• Score: 16.36662739600811
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum unitaries of the form $Σ_{c}\ket{c}\bra{c}\otimes U_{c}$ are ubiquitous in quantum algorithms. This class encompasses not only standard uniformly controlled gates (UCGs) but also a wide range of circuits with uniformly controlled structures. However, their circuit-depth and gate-count complexities have not been systematically analyzed within a unified framework. In this work, we study the general decomposition problem for UCG and UCG-like structure. We then introduce the restricted Uniformly Controlled Gates (rUCGs) as a unified algebraic model, defined by a 2-divisible Abelian group that models the controlled gate set. This model captures uniformly controlled rotations, multi-qubit uniformly controlled gates, and diagonal unitaries. Furthermore, this model also naturally incorporates k-sparse version (k-rUCGs), where only a subset of control qubits participate in each multi-qubit gate. Building on this algebraic model, we develop a general framework. For an n-control rUCG, the framework reduce the gate complexity from ${O(n2^n)}$ to ${O(2^n})$ and the circuit depth from ${O(2^n\log n)}$ to ${O(2^n\log n/n)}$. The framework further provides systematic size and depth bounds for k-rUCGs by exploiting sparsity in the control space, with same optimization coefficient as rUCG, respectively. Empirical evaluations on representative QAOA circuits confirm reductions in depth and size, which highlight that the rUCG model and its associated decomposition framework unify circuits previously considered structurally distinct under a single, asymptotically optimal synthesis paradigm.

Related papers

• Eigenstate-assisted realization of general quantum controlled unitaries with a fixed cost [0.0]
  We present a general method to take any unitary $U$ into controlled-$U$ using a fixed circuit with 4 CNOT gates and 2 Toffoli gates per qubit.<n>For $n$-qubit unitaries and one control qubit, we require $2n+1$ qubits and a circuit that can generate an eigenstate of $U$.<n>The method also works for any black block implementation of $U$, achieving a constant-depth realization independent of its decomposition.
  arXiv  Detail & Related papers  (2026-02-22T16:06:01Z)
• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• Clifford+V synthesis for multi-qubit unitary gates [0.0]
  We develop a general framework for synthesizing target gates by using a finite set of basic gates.<n>We introduce a suboptimal but short run-time algorithm for synthesizing multi-qubit controlled gates.
  arXiv  Detail & Related papers  (2025-10-09T14:57:55Z)
• Logarithmic Depth Decomposition of Approximate Multi-Controlled Single-Qubit Gates Without Ancilla Qubits [0.9576327614980397]
  We present an improved decomposition of multi-controlled NOT gates with logarithmic depth using a single ancilla qubit.<n>We also introduce a relative-phase multi-controlled NOT gate that eliminates the need for ancillas.<n>Our method is particularly suitable for both NISQ and fault-tolerant quantum architectures.
  arXiv  Detail & Related papers  (2025-07-01T03:30:39Z)
• Gradient projection method for constrained quantum control [46.08419608239004]
  We adopt the Gradient Projection Method (GPM) to problems of quantum control.<n>The main advantage of the method is that it allows to exactly satisfy the bounds.<n>We apply the GPM to several examples including generation of one- and two-qubit gates and two-qubit Bell and Werner states.
  arXiv  Detail & Related papers  (2024-11-29T11:56:55Z)
• One Gate Scheme to Rule Them All: Introducing a Complex Yet Reduced Instruction Set for Quantum Computing [17.731117502015355]
  Scheme for qubits with $XX+YY$ coupling realizes any two-qubit gate up to single-qubit gates.<n>We observe marked improvements across various applications, including generic $n$-qubit gate synthesis, quantum volume, and qubit routing.
  arXiv  Detail & Related papers  (2023-12-09T19:30:31Z)
• Generation of C-NOT, SWAP, and C-Z Gates for Two Qubits Using Coherent and Incoherent Controls and Stochastic Optimization [56.47577824219207]
  We consider a general form of the dynamics of open quantum systems determined by the Gorini-Kossakowsky-Sudarchhan-Lindblad type master equation. We analyze the control problems of generating two-qubit C-NOT, SWAP, and C-Z gates using piecewise constant controls and optimization.
  arXiv  Detail & Related papers  (2023-12-09T17:55:47Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• Graph test of controllability in qubit arrays: A systematic way to determine the minimum number of external controls [62.997667081978825]
  We show how to leverage an alternative approach, based on a graph representation of the Hamiltonian, to determine controllability of arrays of coupled qubits. We find that the number of controls can be reduced from five to one for complex qubit-qubit couplings.
  arXiv  Detail & Related papers  (2022-12-09T12:59:44Z)
• The Sample Complexity of One-Hidden-Layer Neural Networks [57.6421258363243]
  We study a class of scalar-valued one-hidden-layer networks, and inputs bounded in Euclidean norm. We prove that controlling the spectral norm of the hidden layer weight matrix is insufficient to get uniform convergence guarantees. We analyze two important settings where a mere spectral norm control turns out to be sufficient.
  arXiv  Detail & Related papers  (2022-02-13T07:12:02Z)
• Synthesis of CNOT-Dihedral circuits with optimal number of two qubit gates [0.0]
  We present explicit canonical forms for all the elements in the two-qubit CNOT-Dihedral group, with minimal numbers of controlled-S (CS) and controlled-X ( CX) gates. We provide an algorithm to successively construct the n-qubit CNOT-Dihedral group, asserting an optimal number of controlled-X ( CX) gates.
  arXiv  Detail & Related papers  (2020-06-22T07:28:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.