Circuit Optimization for Universality Transformation

• URL: http://arxiv.org/abs/2603.13169v1
• Date: Fri, 13 Mar 2026 17:03:44 GMT
• Title: Circuit Optimization for Universality Transformation
• Abstract summary: It is known that a computationally universal gate set $H,CCZ$ can be transformed to a strictly universal one $(S), H$ using one maximally imaginary state $|+irangle$ and non-imaginary ancillary qubits.<n>We succeed this transformation with a shorter circuit that eliminates non-imaginary ancillary qubits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: It is known that a computationally universal gate set $\{H,CCZ\}$ can be transformed to a strictly universal one $\{Λ(S), H\}$ using one maximally imaginary state $|+i\rangle$ and non-imaginary ancillary qubits. We succeed this transformation with a shorter circuit that eliminates non-imaginary ancillary qubits. We further extend this to the continuous gate-set setting, showing that any multi-qubit unitary can be exactly generated by real single-qubit unitary gates, $CCZ$ gates and $|+i\rangle$.

Related papers

• Preparing approximate $N$-fold cat states with the phase space instruction set [12.338455427628562]
  We show that a universal gate set is surprisingly inefficient at preparing a simple family of states.<n>We also imply that converting bosonic circuits between different universal gate sets can be extremely inefficient.
  arXiv  Detail & Related papers  (2026-08-07T18:38:41Z)
• Asymptotic yet practical optimization of quantum circuits implementing GF($2^m$) multiplication and division operations [1.1694898979785655]
  We present optimized quantum circuits for multiplication and division operations.<n>Our ancilla-free GF multiplication circuit has the gate count complexity of $O(mlog3)$.<n>We demonstrate practical advantages for cryptographically relevant values of $m$, including reductions in both CNOT and Toffoli gate counts.
  arXiv  Detail & Related papers  (2025-11-25T18:43:08Z)
• Bounds on Eventually Universal Quantum Gate Sets [0.0]
  For qubits, our result implies that if an $n$-qubit gate set is eventually universal, then it will exhibit universality when acting on a $16n$ qubit system.<n>Our proof relies on the invariants of finite linear groups as well as a classification result for all finite groups that are unitary $2$-designs.
  arXiv  Detail & Related papers  (2025-10-11T00:05:41Z)
• Circuit Complexity Bounds for RoPE-based Transformer Architecture [25.2590541420499]
  Empirical evidence suggests that $mathsfRoPE$-based Transformer architectures demonstrate greater generalization capabilities than conventional Transformer models.<n>We show that unless $mathsfTC0 = mathsfNC1$, a $mathsfRoPE$-based Transformer with $mathrmpoly(n)$-precision, $O(1)$ layers, hidden dimension $d leq O(n)$ cannot solve the Arithmetic formula evaluation problem.
  arXiv  Detail & Related papers  (2024-11-12T07:24:41Z)
• Efficient unitary designs and pseudorandom unitaries from permutations [35.66857288673615]
  We show that products exponentiated sums of $S(N)$ permutations with random phases match the first $2Omega(n)$ moments of the Haar measure. The heart of our proof is a conceptual connection between the large dimension (large-$N$) expansion in random matrix theory and the method.
  arXiv  Detail & Related papers  (2024-04-25T17:08:34Z)
• Chain of Thought Empowers Transformers to Solve Inherently Serial Problems [57.58801785642868]
  Chain of thought (CoT) is a highly effective method to improve the accuracy of large language models (LLMs) on arithmetics and symbolic reasoning tasks. This work provides a theoretical understanding of the power of CoT for decoder-only transformers through the lens of expressiveness.
  arXiv  Detail & Related papers  (2024-02-20T10:11:03Z)
• All You Need is pi: Quantum Computing with Hermitian Gates [0.0]
  We show that any single-qubit operator may be implemented as two Hermitian gates, and thus a purely Hermitian universal set is possible.<n>This implementation can be used to prepare high fidelity single-qubit states in the presence of amplitude errors.<n>We show that a gate set comprised of $pi$ rotations about two fixed axes, along with the CNOT gate, is universal for quantum computation.
  arXiv  Detail & Related papers  (2024-02-19T18:36:09Z)
• Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates [40.56175933029223]
  We propose two types of constant-depth constructions for implementing Uniformly Controlled Gates. We obtain constant-depth circuits for the quantum counterparts of read-only and read-write memory devices.
  arXiv  Detail & Related papers  (2023-08-16T17:54:56Z)
• Cat-qubit-inspired gate on cos($2\theta$) qubits [77.34726150561087]
  We introduce a single-qubit $Z$ gate inspired by the noise-bias preserving gate of the Kerr-cat qubit. This scheme relies on a $pi$ rotation in phase space via a beamsplitter-like transformation between a qubit and ancilla qubit.
  arXiv  Detail & Related papers  (2023-04-04T23:06:22Z)
• Asymptotically optimal synthesis of reversible circuits [0.0]
  We propose an algorithm to implement an arbitrary $n$wire circuit with no more than $ (2n n/log n)$ elementary gates.
  arXiv  Detail & Related papers  (2023-02-13T03:08:55Z)
• Optimal universal quantum circuits for unitary complex conjugation [1.6492989697868894]
  This work presents optimal quantum circuits for transforming a number $k$ of calls of $U_d$ into its complex conjugate $barU_d$. Our circuits admit a parallel implementation and are proven to be optimal for any $k$ and $d$ with an average fidelity of $leftlangleFrightrangle =frack+1d(d-k)$.
  arXiv  Detail & Related papers  (2022-05-31T20:43:29Z)
• Asymptotically Optimal Circuit Depth for Quantum State Preparation and General Unitary Synthesis [24.555887999356646]
  The problem is of fundamental importance in quantum algorithm design, Hamiltonian simulation and quantum machine learning, yet its circuit depth and size complexity remain open when ancillary qubits are available. In this paper, we study efficient constructions of quantum circuits with $m$ ancillary qubits that can prepare $psi_vrangle$ in depth. Our circuits are deterministic, prepare the state and carry out the unitary precisely, utilize the ancillary qubits tightly and the depths are optimal in a wide range of parameter regime.
  arXiv  Detail & Related papers  (2021-08-13T09:47:11Z)

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.