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

Computer Engineering and Applications Journal

Parameterized generalization of quantum universal gates

LI Xiao-peng

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

This paper gives the definition of parameterized generalization of quantum universal gates,and analyzes the parameterization of single qubit gates,double qubit gates and triple qubit gates.Also,it proves that the parameterized ones are equivalent with the generalized quantum universal gates showed by M.Nielsen,and the example illustrates the effects of parameterized gates in quantum computation.

Related papers

Parameterized General Single-bit Quantum Gate Model

Yinghui Gao, Atr Key

Quantum gate networks are the tools to realize the evolution of encoded quantum states,and they are mainly made up of single-bit quantum gates.This paper establishes the parameterized general one-bit quantum gate model based on the unitary quality of the quantum gate,and analyzes the relation between the model and the Bloch Sphere.Through the model parameters setting,the different quantum one-bit gate can be gotten.The proposition of the parameterized general one-bit quantum gate model is very useful to analyze the property of one-bit quantum gate synthetically,and is very helpful to design the practical one-bit quantum gate.

Signal Processing•Jan 1, 2009•0 citations

Universal Quantum Gates based on Quantum Dots

Yash Tiwari, Vishvendra Singh Poonia

In the last decade, a lot of effort have gone to find the most appropriate physical implementation of quantum computer. Quantum dot based system is one of the most promising system owing to its integrability with classical computation hardware and its versatility in realizing qubits and quantum gates. In this work, we propose a model for quantum dot based realization of qubits and quantum gates. The proposed system makes use of semiconductor hetrostructure based quantum dots and gate voltages to confine electrons and thus defining the qubits. Electron spin resonance is used to manipulate the spin state of the electrons. We implement single, double and triple qubit systems and two most widely used universal sets of quantum gates. We show full control of Bloch sphere in single qubit system, CNOT gate implementation in double qubit system and a novel way to implement Toffoli gate in triple qubit system.

•May 14, 2021•0 citations

Universality of universal single-qubit-gate decomposition with coherent errors

Wang, Ruixia, Zhao, Peng, Yu, Haifeng

To generate arbitrary one- and two-qubit gates, the universal decompositions are usually used in quantum computing, and the universality of these decompositions has been demonstrated. However, in realistic experiments, gate errors may affect the universality of the universal decompositions. Here, we focus on the single-qubit-gate decomposition scheme and study the coherent-error effects on universality. We prove that, in the parameter space which we studied, some kinds of coherent errors will not affect the original universality, but some others will destroy it. We provide the definition and analytical solutions for universality with coherent errors and propose methods to resume the accuracy of the operations with coherent errors based on our analysis. We also give the analytical results for three kinds of fidelities, which provide another metric for universality and comprehensively depict the resilience of the decomposition scheme with various kinds of coherent errors. Our work introduces a different way of thinking for quantum compilation than existing methods.

arXiv:2211.00365•Nov 1, 2022•2 citations

Gradient Analysis of Barren Plateau in Parameterized Quantum Circuits with multi-qubit gates

Yuhan Yao, Yoshihiko Hasegawa

The emergence of the Barren Plateau phenomenon poses a significant challenge to quantum machine learning. While most Barren Plateau analyses focus on single-qubit rotation gates, the gradient behavior of Parameterized Quantum Circuits built from multi-qubit gates remains largely unexplored. In this work, we present a general theoretical framework for analyzing the gradient properties of Parameterized Quantum Circuits with multi-qubit gates. Our method generalizes the direct computation framework, bypassing the Haar random assumption on parameters and enabling the calculation of the gradient expectation and variance. We apply this framework to single-layer and deep-layer circuits, deriving analytical results that quantify how gradient variance is co-determined by the size of the multi-qubit gate and the number of qubits, layers, and effective parameters. Numerical simulations validate our findings. Our study provides a refined framework for analyzing and optimizing Parameterized Quantum Circuits with complex multi-qubit gates.

quant-pharXiv:2602.05288•Feb 6, 2026•3 citations

Universality in quantum computation

Jennifer L. Dodd

A quantum computer is similar to an ordinary computer, except that instead of bits it uses two-level quantum systems (qubits), and the usual logical operations on bits are replaced with noiseless quantum dynamics in the form of unitary gates or Hamiltonian interactions. Many sets of resources that are universal for quantum computation (that is, capable of implementing any quantum computation) have been found, but general conditions for universality are still only partially understood. Improving our understanding of these conditions contributes to two broad goals. On the one hand, understanding what class of physical systems is suitable for quantum computation allows us choose the systems that are most easily controlled or built in the laboratory. On the other hand, identifying the unifying characteristics of such a class provides insight into the fundamental physics responsible for the much greater computational power of quantum computers.        The original results presented in this thesis are a contribution to our understanding of the physical requirements for universal quantum computation. These results lead to the identification of a new, large class of universal dynamics. More specifically, the main problem that is addressed is the following: consider a physical system that is made up of a finite number of qubits that are subject to a natural, fixed interaction described by a two-body Hamiltonian. Suppose we have the ability to control the system only by applying fast one-qubit operations. Under what conditions is this system capable of universal quantum computation? The first original result of the thesis is to prove that universal quantum computation is possible under these conditions given the single extra constraint that the Hamiltonian must entangle, or connect, all of the qubits. In other words, since a two-body Hamiltonian is expressible as a sum of coupling terms each of which acts nontrivially on a pair of qubits, consider the graph whose vertices correspond to qubits and whose edges connect qubits that are coupled by a term in the Hamiltonian. Then this Hamiltonian, together with fast one-qubit unitaries, is universal for quantum computation precisely when the corresponding graph is connected.       This result suggests many potential generalizations, three of which are explored in this thesis. The first generalization is to show that the same result holds for a two-body Hamiltonian that acts on D-dimensional quantum systems (qudits), given fast one-qudit unitaries. A second extension is to the case of a many-body Hamiltonian, that is, a Hamiltonian that has coupling terms that act on more than two qubits. Again, we find that under mild restrictions, such Hamiltonians are universal provided they are connected and that arbitrary one-qubit unitaries are available. We also discover and explore some surprising structure in many-body Hamiltonians that is associated with the parity of the couplings. A third related problem that is addressed is the question of what two-qubit unitaries are universal for quantum computation. This problem was originally solved by J.-L. and R. Brylinski [BB02], who gave a technical proof of the universality of any two-qudit gate that is not the swap gate or a product of one-qudit unitaries, given one-qudit unitaries as a free resource. We develop an elementary and constructive proof for the case of qubits, and prove that our construction is very close to optimal in the number of uses of the two-qubit gate.       Given a qualitative understanding of what dynamical resources are universal for quantum computation, it is natural to consider developing a quantitative measure of the usefulness of quantum dynamics for quantum information processing. This is done in the final chapter of the thesis, in which the beginnings of a quantitative theory of quantum dynamics are developed.

•Jan 1, 2004•7 citations

Universality in quantum computation

David Elieser Deutsch, Adriano Barenco, Artur Ekert

Abstract We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as logic gates.

arXiv:quant-ph/9505018•Proceedings of the Royal Society of London Series A Mathematical and Physical Sciences•Jun 8, 1995•367 citations
This paper gives the definition of parameterized generalization of quantum universal gates,and analyzes the parameterization of single qubit gates,double qubit gates and triple qubit gates.Also,it proves that the parameterized ones are equivalent with the generalized quantum universal gates showed by M.Nielsen,and the example illustrates the effects of parameterized gates in quantum computation.
Quantum gate networks are the tools to realize the evolution of encoded quantum states,and they are mainly made up of single-bit quantum gates.This paper establishes the parameterized general one-bit quantum gate model based on the unitary quality of the quantum gate,and analyzes the relation between the model and the Bloch Sphere.Through the model parameters setting,the different quantum one-bit gate can be gotten.The proposition of the parameterized general one-bit quantum gate model is very useful to analyze the property of one-bit quantum gate synthetically,and is very helpful to design the practical one-bit quantum gate.
In the last decade, a lot of effort have gone to find the most appropriate physical implementation of quantum computer. Quantum dot based system is one of the most promising system owing to its integrability with classical computation hardware and its versatility in realizing qubits and quantum gates. In this work, we propose a model for quantum dot based realization of qubits and quantum gates. The proposed system makes use of semiconductor hetrostructure based quantum dots and gate voltages to confine electrons and thus defining the qubits. Electron spin resonance is used to manipulate the spin state of the electrons. We implement single, double and triple qubit systems and two most widely used universal sets of quantum gates. We show full control of Bloch sphere in single qubit system, CNOT gate implementation in double qubit system and a novel way to implement Toffoli gate in triple qubit system.
To generate arbitrary one- and two-qubit gates, the universal decompositions are usually used in quantum computing, and the universality of these decompositions has been demonstrated. However, in realistic experiments, gate errors may affect the universality of the universal decompositions. Here, we focus on the single-qubit-gate decomposition scheme and study the coherent-error effects on universality. We prove that, in the parameter space which we studied, some kinds of coherent errors will not affect the original universality, but some others will destroy it. We provide the definition and analytical solutions for universality with coherent errors and propose methods to resume the accuracy of the operations with coherent errors based on our analysis. We also give the analytical results for three kinds of fidelities, which provide another metric for universality and comprehensively depict the resilience of the decomposition scheme with various kinds of coherent errors. Our work introduces a different way of thinking for quantum compilation than existing methods.
The emergence of the Barren Plateau phenomenon poses a significant challenge to quantum machine learning. While most Barren Plateau analyses focus on single-qubit rotation gates, the gradient behavior of Parameterized Quantum Circuits built from multi-qubit gates remains largely unexplored. In this work, we present a general theoretical framework for analyzing the gradient properties of Parameterized Quantum Circuits with multi-qubit gates. Our method generalizes the direct computation framework, bypassing the Haar random assumption on parameters and enabling the calculation of the gradient expectation and variance. We apply this framework to single-layer and deep-layer circuits, deriving analytical results that quantify how gradient variance is co-determined by the size of the multi-qubit gate and the number of qubits, layers, and effective parameters. Numerical simulations validate our findings. Our study provides a refined framework for analyzing and optimizing Parameterized Quantum Circuits with complex multi-qubit gates.
A quantum computer is similar to an ordinary computer, except that instead of bits it uses two-level quantum systems (qubits), and the usual logical operations on bits are replaced with noiseless quantum dynamics in the form of unitary gates or Hamiltonian interactions. Many sets of resources that are universal for quantum computation (that is, capable of implementing any quantum computation) have been found, but general conditions for universality are still only partially understood. Improving our understanding of these conditions contributes to two broad goals. On the one hand, understanding what class of physical systems is suitable for quantum computation allows us choose the systems that are most easily controlled or built in the laboratory. On the other hand, identifying the unifying characteristics of such a class provides insight into the fundamental physics responsible for the much greater computational power of quantum computers.        The original results presented in this thesis are a contribution to our understanding of the physical requirements for universal quantum computation. These results lead to the identification of a new, large class of universal dynamics. More specifically, the main problem that is addressed is the following: consider a physical system that is made up of a finite number of qubits that are subject to a natural, fixed interaction described by a two-body Hamiltonian. Suppose we have the ability to control the system only by applying fast one-qubit operations. Under what conditions is this system capable of universal quantum computation? The first original result of the thesis is to prove that universal quantum computation is possible under these conditions given the single extra constraint that the Hamiltonian must entangle, or connect, all of the qubits. In other words, since a two-body Hamiltonian is expressible as a sum of coupling terms each of which acts nontrivially on a pair of qubits, consider the graph whose vertices correspond to qubits and whose edges connect qubits that are coupled by a term in the Hamiltonian. Then this Hamiltonian, together with fast one-qubit unitaries, is universal for quantum computation precisely when the corresponding graph is connected.       This result suggests many potential generalizations, three of which are explored in this thesis. The first generalization is to show that the same result holds for a two-body Hamiltonian that acts on D-dimensional quantum systems (qudits), given fast one-qudit unitaries. A second extension is to the case of a many-body Hamiltonian, that is, a Hamiltonian that has coupling terms that act on more than two qubits. Again, we find that under mild restrictions, such Hamiltonians are universal provided they are connected and that arbitrary one-qubit unitaries are available. We also discover and explore some surprising structure in many-body Hamiltonians that is associated with the parity of the couplings. A third related problem that is addressed is the question of what two-qubit unitaries are universal for quantum computation. This problem was originally solved by J.-L. and R. Brylinski [BB02], who gave a technical proof of the universality of any two-qudit gate that is not the swap gate or a product of one-qudit unitaries, given one-qudit unitaries as a free resource. We develop an elementary and constructive proof for the case of qubits, and prove that our construction is very close to optimal in the number of uses of the two-qubit gate.       Given a qualitative understanding of what dynamical resources are universal for quantum computation, it is natural to consider developing a quantitative measure of the usefulness of quantum dynamics for quantum information processing. This is done in the final chapter of the thesis, in which the beginnings of a quantitative theory of quantum dynamics are developed.