arXiv:2606.25789

A Short Note on the Generators of Controlled Quantum Gates

Richard M. Milbradt, Christian B. Mendl

quant-phSubmitted Jun 24, 2026• Announced Jun 25, 2026• 0 citations

Abstract

We present the analytical generators for arbitrary multi-qubit controlled gates. Closed forms for the generating Hamiltonians are given for gates with both multiple control and target qubits, as well as for arbitrary control conditions. This allows us to go beyond gate-based simulations of quantum circuits and incorporate decoherence and other noise in simulations of quantum computers. We exemplify this by simulating the impact of a harmonic oscillator interacting with two qubits during the application of a controlled NOT gate.

Comments: 5 Pages, 3 Figures

Related papers

Experimental implementation of quantum gates through actuator qubits

Jingfu Zhang, Daniel Klaus Burgarth, Raymond Laflamme +1 more

Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations. In combination with a drift Hamiltonian containing interactions between the qubits, this allows the implementation of arbitrary gate operations. Here, we demonstrate an alternative scheme that does not require local control for all qubits: we implement one- and two-qubit gate operations on a set of target qubits indirectly, through a combination of gates on directly controlled actuator qubits with a drift Hamiltonian that couples actuator and target qubits. Experiments are performed on nuclear spins, using radio-frequency pulses as gate operations and magnetic-dipole couplings for the drift Hamiltonian.

arXiv:1405.7169Physical Review AJan 22, 20158 citations

Generators and Roots of Quantum Logic Gates

R. Muradian, Diego Frias

This is an exposition of some basic mathematical aspects of quantum logic gates. At first we established some general formulas for the case of arbitrary quantum gate A with unique restriction A^2=I. The explicit form of the generators and roots of matrix A have been found . Then we apply general results to the particular cases of one-qubit and multi-qubit quantum gates. Some interesting properties of square roots of basic Pauli and Hadamard gates are demonstrated.

arXiv:quant-ph/0511250Nov 28, 20050 citations

Variational Quantum Circuits for Multi-Qubit Gate Automata

Majumder, Arunava, Lewis, Dylan, Jayashankar, Akshaya +2 more

Implementing quantum operations in the form of natural Hamiltonian dynamics is desirable, since they almost require no external control or feedback. In this work, we propose a NISQ-friendly quantum-classical hybrid approach to designing a time-independent Hamiltonian that generates a given multi-qubit unitary. In particular, we execute a Variational Quantum Algorithm, whose ansatz is carefully chosen to be a sequence of appropriately parametrized unitaries describing at most two-qubit nearest neighbour interactions, dictating the target unitary. Subsequently, we apply our approach to simulate multi-qubit target gates, with and without stochastic noise. We demonstrate that our strategy allows us to implement a Toffoli gate with sufficiently high fidelity, as compared to the other similar techniques. Our approach is an example of the usage of quantum computing for the design of quantum computers.

arXiv:2209.00139Aug 31, 20220 citations

Exact Two-Qubit Universal Quantum Circuit

Jun Zhang, Jiří Vala, Shankar Sastry +1 more

We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly simulates arbitrary two-qubit operations in SU(4). Each block in this circuit is given in a closed form solution. We also provide a uniform upper bound of the applications of the given entangling gates, and find that exactly half of all the controlled-unitary gates satisfy the same upper bound as the CNOT gate. These results allow for the efficient implementation of operations in SU(4) required for both quantum computation and quantum simulation.

arXiv:quant-ph/0212109Physical Review LettersJul 11, 200368 citations

On the generation of discrete unitary gates from continuous time forced Schrodinger equations

Claudio Altafini

In all the various proposals for quantum computers, a common feature is that the quantum circuits are expected to be made of cascades of unitary transformations acting on the quantum states. A framework is proposed to express these elementary quantum gates directly in terms of the control inputs entering into the continuous time forced Schrodinger equation.

IEEE Conference on Decision and Control (CDC)Aug 27, 20031 citation

Geometric methods in quantum computation

Jun Zhang, Shankar Sastry

Recent advances in the physical sciences and engineering have created great hopes for new computational paradigms and substrates. One such new approach is the quantum computer, which holds the promise of enhanced computational power. Analogous to the way a classical computer is built from electrical circuits containing wires and logic gates, a quantum computer is built from quantum circuits containing quantum wires and elementary quantum gates to transport and manipulate quantum information. Therefore, design of quantum gates and quantum circuits is a prerequisite for any real application of quantum computation. In this dissertation we apply geometric control methods from differential geometry and Lie group representation theory to analyze the properties of quantum gates and to design optimal quantum circuits. Using the Cartan decomposition and the Weyl group, we show that the geometric structure of nonlocal two-qubit gates is a 3-Torus. After further reducing the symmetry, the geometric representation of nonlocal gates is seen to be conveniently visualized as a tetrahedron. Each point in this tetrahedron except on the base corresponds to a different equivalent class of nonlocal gates. This geometric representation is one of the cornerstones for the discussion on quantum computation in this dissertation. We investigate the properties of those two-qubit operations that can generate maximal entanglement. It is an astonishing finding that if we randomly choose a two-qubit operation, the probability that we obtain a perfect entangler is exactly one half. We prove that given a two-body interaction Hamiltonian, it is always possible to explicitly construct a quantum circuit for exact simulation of any arbitrary nonlocal two-qubit gate by turning on the two-body interaction for at most three times, together with at most four local gates. We also provide an analytic approach to construct a universal quantum circuit from any entangling gate supplemented with local gates. Closed form solutions have been derived for each step in this explicit construction procedure. Moreover, the minimum upper bound is found to construct a universal quantum circuit from any Controlled-Unitary gate. A near optimal explicit construction of universal quantum circuits from a given Controlled-Unitary is provided. For the Controlled-NOT and Double-CNOT gate, we then develop simple analytic ways to construct universal quantum circuits with exactly three applications, which is the least possible for these gates. We further discover a new quantum gate (named B gate) that achieves the desired universality with minimal number of gates. Optimal implementation of single-qubit quantum gates is also investigated. Finally, as a real physical application, a constructive way to implement any arbitrary two-qubit operation on a spin electronics system is discussed.

Jan 1, 20031 citation