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

Communications in Theoretical Physics

Allowable Generalized Quantum Gates

Long Gui-Lu, Liu Yang, Chuan Wang

Published Jan 1, 2009• 73 citations
Publisher

Abstract

In this paper, we give the most general duality gates, or generalized quantum gates in duality quantum computers. Here we show by explicit construction that a n-bit duality quantum computer with d slits can be simulated perfectly with an ordinary quantum computer with n qubits and one auxiliary qudit. Using this model, we give the most general form of duality gates which is of the form Σ d- 1 i = 0 p i U i , and the p i 's are complex numbers with module less or equal to 1 and constrained by |Σ i p i |≤1.

DOI
10.1088/0253-6102/51/1/13

Related papers

Generalised Quantum Gates for Qudits and their Application in Quantum Fourier Transform

Francesco Pudda, Mario Chizzini, Crippa, Luca

Quantum computing with qudits, quantum systems with $d > 2$ levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several algorithms and, possibly, providing a foundation for optimised error correction. In this work, we propose a novel formulation of qudit gates that is universally applicable for any number of levels $d$, without restrictions on the dimensionality. By extending the mathematical framework of quantum gates to arbitrary dimensions, we derive explicit gate operations that form a universal set for quantum computation on qudits of any size. We demonstrate the validity of our approach through the implementation of the Quantum Fourier Transform (QFT) for arbitrary $d$, verifying both the correctness and utility of our generalized gates. This novel methodology broadens the design space for quantum algorithms and fault-tolerant architectures, paving the way for advancements in qudit-based quantum computing.

arXiv:2410.05122•Oct 7, 2024•17 citations

A Systematic Algorithm for Quantum Boolean Circuits Construction

I.-M. Tsai, Sy‐Yen Kuo

To build a general-purpose quantum computer, it is crucial for the quantum devices to implement classical boolean logic. A straightforward realization of quantum boolean logic is to use auxiliary qubits as intermediate storage. This inefficient implementation causes a large number of auxiliary qubits to be used. In this paper, we have derived a systematic way of realizing any general m-to-n bit combinational boolean logic using elementary quantum gates. Our approach transforms the m-to-n bit classical mapping into a t-bit unitary quantum operation with minimum number of auxiliary qubits, then a variation of Toffoli gate is used as the basic building block to construct the unitary operation. Finally, each of these building blocks can be decomposed into one-bit rotation and two-bit control-U gates. The efficiency of the network is taken into consideration by formulating it as a constrained set partitioning problem.

arXiv:quant-ph/0104037•Apr 9, 2001•4 citations

THE GENERAL QUANTUM INTERFERENCE PRINCIPLE AND THE DUALITY QUANTUM COMPUTER

Yang Liu

Here we review the general quantum interference principle and the duality quantum computer which was proposed recently.The general quantum interference principle is the concretization of Dirac's statement about single photon interference and the generalization into multi-photon quantum systems.It applies not only to compact quantum system such as an atom,but also to loose quantum system such as a few independent photons.Using the general quantum interference principle,many debated issues can be explained,for instance the interference in a quantum system of two independent photons.From the view point of general quantum interference principle,two photon or multi-photon interferences,are just the interference of the two photon system with the two photon system itself,the interference of multi-photon system with itself.The general quantum interference principle can be expressed in terms of a general Feynman path-integral of a multi-constituents system and be calculated quantitatively.Based on this principle,we proposed a new type of computer,the duality computer or duality quantum computer.In principle,the duality computer is superior to classical computer and the quantum computer in the sense that it can do more than them.In a duality computer,the wave function of the computer is split into many parts,and each part is processed independently through a series of quantum gates,and then the different parts are recombined to get the final results.In addition to quantum parallelism,there is also duality parallelism in which different gate operations can be performed on different parts of the wave function simultaneously in a duality computer.The mathematical theory of duality computer has been established,and this has paved the way for further research.Studies have shown that a n bits duality computer with d-slits can be simulated by a quantum computer with n+log2d qubits.This relationship makes duality computing in an ordinary quantum computer possible,and also spares the seemingly insurmountable obstacle of building a moving quantum computer which a duality computer at all is.The duality computing in an ordinary quantum computer is called duality computing mode of a quantum computer.This relationship also helps us in understanding the general quantum interference principle.Because the underlying physics of an ordinary quantum computer is just quantum mechanics,the general quantum interference principle is also compatible with the usual quantum mechanics.However this principle exhibits itself only in a multipartite quantum system,thus it is difficult to understand it in simple single particle quantum systems.Duality computer is a new type of computer,and there are many unresolved issues and opportunity as well.In a duality computer,the gate operations need not be unitary and could be any operation that we may think of.The type of gates allowed in duality computing is called duality gate or generalized quantum gate.Generalized quantum gates have attracted the attention of mathematicians and some mathematical results have been obtained on the properties of the generalized quantum gates.Besides the mathematical properties of duality computing,duality computing may offer a bridge between quantum computing and classical computing so that classical algorithms may be transformed into quantum algorithms.Because the nonunitarity of generalized quantum gates,it may play important role in the study of open quantum systems.

Progress in physics•Jan 1, 2008•0 citations

ANALYTIC ONE-BIT AND CNOT GATE CONSTRUCTIONS OF GENERAL n-QUBIT CONTROLLED GATES

Yang Liu, GUI LU LONG, Yang Sun

General n-qubit controlled unitary gates are frequently used in quantum information processing tasks. Barenco, Bennett, Cleve, Di Vincenzo, Margolus and Shor [Phys. Rev. A52 (1995) 3457] have given the general construction methods, and explicit results for up-to-four-qubits controlled unitary gates. We extended their calculation and gave two analytic expressions for the construction of general n-qubit controlled unitary gates in terms of one-qubit and two-qubit CNOT gates. There are two expressions – one is exponential in the qubit number which is efficient for up to ten qubits, and the other is polynomial in the qubit number, which is efficient for more than ten qubits.

International Journal of Quantum Information•Jun 1, 2008•72 citations

The wave-particle duality of the qudit quantum space and the quantum wave gates

Zixuan Hu, Sabre Kais

We propose three core ideas: 1. the wave-particle duality of the qudit quantum space; 2. the classification of all elementary quantum gates by ordered pairs of qudit functionals; 3. a new type of quantum gates called the "quantum wave gates". We first study the quantum functionals whose relation to the quantum states is analogous to that between the momentum and position wavefunctions in fundamental quantum physics: a Fourier transform and an entropic uncertainty principle can be defined between the dual representations. The quantum functionals are not just mathematical constructs but have clear physical meanings and quantum circuit realizations. Connecting the partition interpretation of the qudit functionals to the effects of quantum gates we classify all elementary quantum gates by ordered pairs of qudit functionals. By generalizing the qudit functionals to quantum functionals, the new type of "quantum wave gates" are discovered as quantum versions of the conventional quantum gates.

arXiv:2207.05213•Jul 11, 2022•4 citations

Duality quantum computing

Steven Anatolievich Duplij, Raimund Vogl

We reformulate the duality computer concept from thorough mathematical viewpoint, using the bra/ket formalism. We interpret the main objects divider and combiner, as some analogs of polyadic coproduct and polyadic product. The construction of a duality computer is presented in our new interpretation based on analogy with a convolution product in polyadic Hopf algebra theory. The higher generalization of duality computer based on polyadic powers is proposed. The corresponding simulation procedure of duality computer on the ordinary quantum computer is given using the introduced polyadic generalization.

Institute of Physics eBooks•Nov 1, 2023•0 citations
In this paper, we give the most general duality gates, or generalized quantum gates in duality quantum computers. Here we show by explicit construction that a n-bit duality quantum computer with d slits can be simulated perfectly with an ordinary quantum computer with n qubits and one auxiliary qudit. Using this model, we give the most general form of duality gates which is of the form Σ d- 1 i = 0 p i U i , and the p i 's are complex numbers with module less or equal to 1 and constrained by |Σ i p i |≤1.
Quantum computing with qudits, quantum systems with d>2d > 2d>2 levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several algorithms and, possibly, providing a foundation for optimised error correction. In this work, we propose a novel formulation of qudit gates that is universally applicable for any number of levels ddd, without restrictions on the dimensionality. By extending the mathematical framework of quantum gates to arbitrary dimensions, we derive explicit gate operations that form a universal set for quantum computation on qudits of any size. We demonstrate the validity of our approach through the implementation of the Quantum Fourier Transform (QFT) for arbitrary ddd, verifying both the correctness and utility of our generalized gates. This novel methodology broadens the design space for quantum algorithms and fault-tolerant architectures, paving the way for advancements in qudit-based quantum computing.
To build a general-purpose quantum computer, it is crucial for the quantum devices to implement classical boolean logic. A straightforward realization of quantum boolean logic is to use auxiliary qubits as intermediate storage. This inefficient implementation causes a large number of auxiliary qubits to be used. In this paper, we have derived a systematic way of realizing any general m-to-n bit combinational boolean logic using elementary quantum gates. Our approach transforms the m-to-n bit classical mapping into a t-bit unitary quantum operation with minimum number of auxiliary qubits, then a variation of Toffoli gate is used as the basic building block to construct the unitary operation. Finally, each of these building blocks can be decomposed into one-bit rotation and two-bit control-U gates. The efficiency of the network is taken into consideration by formulating it as a constrained set partitioning problem.
Here we review the general quantum interference principle and the duality quantum computer which was proposed recently.The general quantum interference principle is the concretization of Dirac's statement about single photon interference and the generalization into multi-photon quantum systems.It applies not only to compact quantum system such as an atom,but also to loose quantum system such as a few independent photons.Using the general quantum interference principle,many debated issues can be explained,for instance the interference in a quantum system of two independent photons.From the view point of general quantum interference principle,two photon or multi-photon interferences,are just the interference of the two photon system with the two photon system itself,the interference of multi-photon system with itself.The general quantum interference principle can be expressed in terms of a general Feynman path-integral of a multi-constituents system and be calculated quantitatively.Based on this principle,we proposed a new type of computer,the duality computer or duality quantum computer.In principle,the duality computer is superior to classical computer and the quantum computer in the sense that it can do more than them.In a duality computer,the wave function of the computer is split into many parts,and each part is processed independently through a series of quantum gates,and then the different parts are recombined to get the final results.In addition to quantum parallelism,there is also duality parallelism in which different gate operations can be performed on different parts of the wave function simultaneously in a duality computer.The mathematical theory of duality computer has been established,and this has paved the way for further research.Studies have shown that a n bits duality computer with d-slits can be simulated by a quantum computer with n+log2d qubits.This relationship makes duality computing in an ordinary quantum computer possible,and also spares the seemingly insurmountable obstacle of building a moving quantum computer which a duality computer at all is.The duality computing in an ordinary quantum computer is called duality computing mode of a quantum computer.This relationship also helps us in understanding the general quantum interference principle.Because the underlying physics of an ordinary quantum computer is just quantum mechanics,the general quantum interference principle is also compatible with the usual quantum mechanics.However this principle exhibits itself only in a multipartite quantum system,thus it is difficult to understand it in simple single particle quantum systems.Duality computer is a new type of computer,and there are many unresolved issues and opportunity as well.In a duality computer,the gate operations need not be unitary and could be any operation that we may think of.The type of gates allowed in duality computing is called duality gate or generalized quantum gate.Generalized quantum gates have attracted the attention of mathematicians and some mathematical results have been obtained on the properties of the generalized quantum gates.Besides the mathematical properties of duality computing,duality computing may offer a bridge between quantum computing and classical computing so that classical algorithms may be transformed into quantum algorithms.Because the nonunitarity of generalized quantum gates,it may play important role in the study of open quantum systems.
General n-qubit controlled unitary gates are frequently used in quantum information processing tasks. Barenco, Bennett, Cleve, Di Vincenzo, Margolus and Shor [Phys. Rev. A52 (1995) 3457] have given the general construction methods, and explicit results for up-to-four-qubits controlled unitary gates. We extended their calculation and gave two analytic expressions for the construction of general n-qubit controlled unitary gates in terms of one-qubit and two-qubit CNOT gates. There are two expressions – one is exponential in the qubit number which is efficient for up to ten qubits, and the other is polynomial in the qubit number, which is efficient for more than ten qubits.
We propose three core ideas: 1. the wave-particle duality of the qudit quantum space; 2. the classification of all elementary quantum gates by ordered pairs of qudit functionals; 3. a new type of quantum gates called the "quantum wave gates". We first study the quantum functionals whose relation to the quantum states is analogous to that between the momentum and position wavefunctions in fundamental quantum physics: a Fourier transform and an entropic uncertainty principle can be defined between the dual representations. The quantum functionals are not just mathematical constructs but have clear physical meanings and quantum circuit realizations. Connecting the partition interpretation of the qudit functionals to the effects of quantum gates we classify all elementary quantum gates by ordered pairs of qudit functionals. By generalizing the qudit functionals to quantum functionals, the new type of "quantum wave gates" are discovered as quantum versions of the conventional quantum gates.
We reformulate the duality computer concept from thorough mathematical viewpoint, using the bra/ket formalism. We interpret the main objects divider and combiner, as some analogs of polyadic coproduct and polyadic product. The construction of a duality computer is presented in our new interpretation based on analogy with a convolution product in polyadic Hopf algebra theory. The higher generalization of duality computer based on polyadic powers is proposed. The corresponding simulation procedure of duality computer on the ordinary quantum computer is given using the introduced polyadic generalization.