In this article, we propose a general principle of quantum interference for quantum system, and based on this we propose a new type of computing machine, the duality computer, that may outperform in principle both cla...In this article, we propose a general principle of quantum interference for quantum system, and based on this we propose a new type of computing machine, the duality computer, that may outperform in principle both classical computer and the quantum computer. According to the general principle of quantum interference, the very essence of quantum interference is the interference of the sub-waves of the quantum system itself A quantum system considered here can be any quantum system： a single microscopic particle, a composite quantum system such as an atom or a molecule, or a loose collection of a few quantum objects such as two independent photons. In the duality computer, the wave of the duality computer is split into several sub-waves and they pass through different routes, where different computing gate operations are performed. These sub-waves are then re-combined to interfere to give the computational results. The quantum computer, however, has only used the particle nature of quantum object. In a duality computer, it may be possible to find a marked item from an unsorted database using only a single query, and all NP-complete problems may have polynomial algorithms. Two proof-of-the-principle designs of the duality computer are presented： the giant molecule scheme and the nonlinear quantum optics scheme. We also propose thought experiment to check the related fundamental issues, the measurement efficiency of a partial wave function.展开更多
In this letter,we propose a duality computing mode,which resembles particle-wave duality property whena quantum system such as a quantum computer passes through a double-slit.In this mode,computing operations arenot n...In this letter,we propose a duality computing mode,which resembles particle-wave duality property whena quantum system such as a quantum computer passes through a double-slit.In this mode,computing operations arenot necessarily unitary.The duality mode provides a natural link between classical computing and quantum computing.In addition,the duality mode provides a new tool for quantum algorithm design.展开更多
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 simulat...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 ∑i=0^d-1piUi,and the pi ＇s are complex numbers with module less or equal to 1 and constrained by｜∑iPi｜≤1.展开更多
Firstly,the notion of the left-left Yetter-Drinfeld quasicomodule M=(M,·,ρ)over a Hopf coquasigroup H is given,which generalizes the left-left Yetter-Drinfeld module over Hopf algebras.Secondly,the braided monoi...Firstly,the notion of the left-left Yetter-Drinfeld quasicomodule M=(M,·,ρ)over a Hopf coquasigroup H is given,which generalizes the left-left Yetter-Drinfeld module over Hopf algebras.Secondly,the braided monoidal category HHYDQCM is introduced and the specific structure maps are given.Thirdly,Sweedler's dual of infinite-dimensional Hopf algebras in HHYDQCM is discussed.It proves that if(B,mB,μB,ΔB,εB)is a Hopf algebra in HHYDQCM with antipode SB,then(B^0,(mB0)^op,εB^*,(ΔB0)^op,μB^*)is a Hopf algebra in HHYDQCM with antipode SB^*,which generalizes the corresponding results over Hopf algebras.展开更多
The self-orthogonal condition is analyzed with respect to symplectic inner product for the binary code that generated by [B1 I B2 B3],where Bi are the binary n ×n matrices,I is an identity matrix.By the use of th...The self-orthogonal condition is analyzed with respect to symplectic inner product for the binary code that generated by [B1 I B2 B3],where Bi are the binary n ×n matrices,I is an identity matrix.By the use of the binary codes that generated by [B1 I B2 B2B1^T],asymptotic good[[2n ,n ]]additive quantum codes are obtained.展开更多
基金The project supported by the National Fundamental Research Program under Grant No. 001CB309308, National Natural Science Foundation of China under Grant Nos. 10325521 and 60433050, and the SRFDP Program of the Ministry of Education of China
文摘In this article, we propose a general principle of quantum interference for quantum system, and based on this we propose a new type of computing machine, the duality computer, that may outperform in principle both classical computer and the quantum computer. According to the general principle of quantum interference, the very essence of quantum interference is the interference of the sub-waves of the quantum system itself A quantum system considered here can be any quantum system： a single microscopic particle, a composite quantum system such as an atom or a molecule, or a loose collection of a few quantum objects such as two independent photons. In the duality computer, the wave of the duality computer is split into several sub-waves and they pass through different routes, where different computing gate operations are performed. These sub-waves are then re-combined to interfere to give the computational results. The quantum computer, however, has only used the particle nature of quantum object. In a duality computer, it may be possible to find a marked item from an unsorted database using only a single query, and all NP-complete problems may have polynomial algorithms. Two proof-of-the-principle designs of the duality computer are presented： the giant molecule scheme and the nonlinear quantum optics scheme. We also propose thought experiment to check the related fundamental issues, the measurement efficiency of a partial wave function.
基金the National Fundamental Research Program under Grant No.2006CB921106National Natural Science Foundation of China under Grant Nos.10325521 and 60433050
文摘In this letter,we propose a duality computing mode,which resembles particle-wave duality property whena quantum system such as a quantum computer passes through a double-slit.In this mode,computing operations arenot necessarily unitary.The duality mode provides a natural link between classical computing and quantum computing.In addition,the duality mode provides a new tool for quantum algorithm design.
基金supported by the National Fundamental Research Program Grant Nos.2006CB921106, 2009CB929042National Natural Science Foundation of China under Grant Nos. 10874098, 10775076, and 60433050
文摘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 ∑i=0^d-1piUi,and the pi ＇s are complex numbers with module less or equal to 1 and constrained by｜∑iPi｜≤1.
基金The National Natural Science Foundation of China(No.11371088,11571173,11871144)。
文摘Firstly,the notion of the left-left Yetter-Drinfeld quasicomodule M=(M,·,ρ)over a Hopf coquasigroup H is given,which generalizes the left-left Yetter-Drinfeld module over Hopf algebras.Secondly,the braided monoidal category HHYDQCM is introduced and the specific structure maps are given.Thirdly,Sweedler's dual of infinite-dimensional Hopf algebras in HHYDQCM is discussed.It proves that if(B,mB,μB,ΔB,εB)is a Hopf algebra in HHYDQCM with antipode SB,then(B^0,(mB0)^op,εB^*,(ΔB0)^op,μB^*)is a Hopf algebra in HHYDQCM with antipode SB^*,which generalizes the corresponding results over Hopf algebras.
文摘The self-orthogonal condition is analyzed with respect to symplectic inner product for the binary code that generated by [B1 I B2 B3],where Bi are the binary n ×n matrices,I is an identity matrix.By the use of the binary codes that generated by [B1 I B2 B2B1^T],asymptotic good[[2n ,n ]]additive quantum codes are obtained.
