Since the difficulty in preparing the equal superposition state of amplitude is 1/√N, we construct a quantile transform of quantum Fourier transform （QFT） over ZN based on the elementary transforms, such as Hadamar...Since the difficulty in preparing the equal superposition state of amplitude is 1/√N, we construct a quantile transform of quantum Fourier transform （QFT） over ZN based on the elementary transforms, such as Hadamard transform and Pauli transform. The QFT over Z_N can then be realized by the quantile transform, and used to further design its quantum circuit and analyze the requirements for the quantum register and quantum gates. However, the transform needs considerable quantum computational resources and it is difficult to construct a high-dimensional quantum register. Hence, we investigate the design of t-bit quantile transform, and introduce the definition of t-bit semiclassical QFT over Z_N. According to probability amplitude, we prove that the transform can be used to realize QFT over ZN and further design its quantum circuit. For this transform, the requirements for the quantum register, the one-qubit gate, and two-qubit gate reduce obviously when compared with those for the QFT over Z_N.展开更多
The quantum Fourier transform and quantum phase estimation are the key components for many quantum algorithms, such as order-finding, factoring, and etc. In this article, the general procedure of quantum Fourier trans...The quantum Fourier transform and quantum phase estimation are the key components for many quantum algorithms, such as order-finding, factoring, and etc. In this article, the general procedure of quantum Fourier transform and phase estimation are investigated for high dimensional case run in a qudit quantum computer, and the quantum circuits are They can be seen as subroutines in a main program given.展开更多
A （n, n）-threshold scheme of multiparty quantum secret sharing of classical or quantum message is proposed based on the discrete quantum Fourier transform. In our proposed scheme, the secret message, which is encode...A （n, n）-threshold scheme of multiparty quantum secret sharing of classical or quantum message is proposed based on the discrete quantum Fourier transform. In our proposed scheme, the secret message, which is encoded by using the forward quantum Fourier transform and decoded by using the reverse, is split and shared in such a way that it can be reconstructed among them only if all the participants work in concert. Fhrthermore, we also discuss how this protocol must be carefully designed for correcting errors and checking eavesdropping or a dishonest participant. Security analysis shows that our scheme is secure. Also, this scheme has an advantage that it is completely compatible with quantum computation and easier to realize in the distributed quantum secure computation.展开更多
Quantum Fourier transform is realized by the Hadamard gate in a quantum computer, which can also be considered as a Hadamard transform. We introduce the Hadamard transformed photon-added coherent state （HTPACS）, whi...Quantum Fourier transform is realized by the Hadamard gate in a quantum computer, which can also be considered as a Hadamard transform. We introduce the Hadamard transformed photon-added coherent state （HTPACS）, which is obtained by letting the photon-added coherent state （PACS） across the quantum Hadamard gate, from this result. It is found that the HTPACS can be considered as a coordinate-momentum mutual exchanging followed by a squeezing transform of the PACS. In addition, the non-classical statistical properties of HTPACS, such as squeezing coefficient, Mandel parameter, etc., are also discussed.展开更多
A scheme for implementing discrete quantum Fourier transform is proposed via quantum dots embedded in a microcavity, and then some of its applications are investigated, i.e., Deutsch 3ozsa. algorithm and Shor＇s quant...A scheme for implementing discrete quantum Fourier transform is proposed via quantum dots embedded in a microcavity, and then some of its applications are investigated, i.e., Deutsch 3ozsa. algorithm and Shor＇s quantum factoring. In particular, the detailed process of implementing one^qubit Deutsch Jozsa algorithm and the factorization of N = 15 are given. The microcavity mode is only virtually excited in the whole interaction, so the effective decoherent has slight effect on the current scheme. These schemes would be an important step to fabricate a solid quantum computer.展开更多
We propose a theoretical scheme for realizing the general conditional phase shift gate of charge qubits situated in a high-Q superconducting transmission line resonator. The phase shifting angle can be tuned from 0 to...We propose a theoretical scheme for realizing the general conditional phase shift gate of charge qubits situated in a high-Q superconducting transmission line resonator. The phase shifting angle can be tuned from 0 to 27r by simply adjusting the qubit-resonator detuning and the interaction time. Based on this gate proposal, we give a detailed procedure to implement the three-qubit quantum Fourier transform with circuit quantum eleetrodynamics （QED）. A careful analysis of the decoherence sources shows that the algorithm can be achieved with a high fidelity using current circuit QED techniques.展开更多
The image security problem is an important area in information security, and image encryption plays a vital role in this day. To protect the image encryption from the attack of quantum algorithm appeared recently, an ...The image security problem is an important area in information security, and image encryption plays a vital role in this day. To protect the image encryption from the attack of quantum algorithm appeared recently, an image encryption method based on quantum Fourier transformation is proposed here. First, the image encryption and Fourier transformation are discussed here, then a encryption function is proposed. Second, a quantum Fourier transformation is introduced to quantum encryption, and the full step of quantum encryption is given as well. Third, the security of the proposed quantum encryption if analyzed, and some propositions are also presented. Lastly, some conclusions are indicated and some possible directions are also listed.展开更多
In this work,we describe a method of calculation of the 1-D circular quantum convolution of signals represented by 3-qubit superpositions in the computational basis states.The examples of the ideal low pass and high p...In this work,we describe a method of calculation of the 1-D circular quantum convolution of signals represented by 3-qubit superpositions in the computational basis states.The examples of the ideal low pass and high pass filters are described and quantum schemes for the 3-qubit circular convolution are presented.In the proposed method,the 3-qubit Fourier transformis used and one addition qubit,to prepare the quantumsuperposition for the inverse quantum Fourier transform.It is considered that the discrete Fourier transform of one of the signals is known and calculated in advance and only the quantum Fourier transform of another signal is calculated.The frequency characteristics of many linear time-invariant systems and filters are well known.Therefore,the described method of convolution can be used for these systems in quantum computation.展开更多
Because of the difficulty of building a high-dimensional quantum register,this paper presents an implementation of the high-dimensional quantum Fourier transform(QFT)based on a low-dimensional quantum register.First,w...Because of the difficulty of building a high-dimensional quantum register,this paper presents an implementation of the high-dimensional quantum Fourier transform(QFT)based on a low-dimensional quantum register.First,we define the t-bit semi- classical quantum Fourier transform.In terms of probability amplitude,we prove that the transform can realize quantum Fourier transformation,illustrate that the requirement for the two-qubit gate reduces obviously,and further design a quantum circuit of the transform.Combining the classical fixed-window method and the implementation of Shor's quantum factorization algorithm,we then redesign a circuit for Shor's algorithm,whose required computation resource is approximately equal to that of Parker's.The requirement for elementary quantum gates for Parker's algorithm is 3 O (logN),and the quantum register for our circuit re- quires t-1 more dimensions than Parker's.However,our circuit is t2 times as fast as Parker's,where t is the width of the window.展开更多
In our previous papers,the classical fractional Fourier transform theory was incorporated into the quantum theoretical system using the theoretical method of quantum optics,and the calculation produced quantum mechani...In our previous papers,the classical fractional Fourier transform theory was incorporated into the quantum theoretical system using the theoretical method of quantum optics,and the calculation produced quantum mechanical operators corresponding to the generation of fractional Fourier transform.The core function of the coordinate-momentum exchange operators in the addition law of fractional Fourier transform was analyzed too.In this paper,the bivariate operator Hermite polynomial theory and the technique of integration within an ordered product of operators(IWOP)are used to establish the entanglement fractional Fourier transform theory to the extent of quantum.A new function generating formula and an operator for generating quantum entangled fractional Fourier transform are obtained using the fractional Fourier transform relationship in a pair of conjugated entangled state representations.展开更多
We propose two schemes for the implementation of quantum discrete Fourier transform in the ion trap systern. In each scheme we design a tunable two-qubit phase gate as the main ingredient. The experimental implementat...We propose two schemes for the implementation of quantum discrete Fourier transform in the ion trap systern. In each scheme we design a tunable two-qubit phase gate as the main ingredient. The experimental implementation of the schemes would be an important step toward complex quantum computation in the ion trap system.展开更多
Using the Weyl quantization scheme and based on the Fourier slice transformation （FST） of the Wigner operator, we construct a new expansion formula of the density operator p, with the expansion coefficient being the...Using the Weyl quantization scheme and based on the Fourier slice transformation （FST） of the Wigner operator, we construct a new expansion formula of the density operator p, with the expansion coefficient being the FST of p＇s classical Weyl correspondence, and the latter the Fourier transformation of p＇s quantum tomogram. The coordinate momentum intermediate representation is used as the Radon transformation of the Wigner operator.展开更多
A quantum time-dependent spectrum analysis, or simply, quantum spectral analysis (QSA) is presented in this work, and it’s based on Schrödinger’s equation. In the classical world, it is named frequency in t...A quantum time-dependent spectrum analysis, or simply, quantum spectral analysis (QSA) is presented in this work, and it’s based on Schrödinger’s equation. In the classical world, it is named frequency in time (FIT), which is used here as a complement of the traditional frequency-dependent spectral analysis based on Fourier theory. Besides, FIT is a metric which assesses the impact of the flanks of a signal on its frequency spectrum, not taken into account by Fourier theory and lets alone in real time. Even more, and unlike all derived tools from Fourier Theory (i.e., continuous, discrete, fast, short-time, fractional and quantum Fourier Transform, as well as, Gabor) FIT has the following advantages, among others: 1) compact support with excellent energy output treatment, 2) low computational cost, O(N) for signals and O(N2) for images, 3) it does not have phase uncertainties (i.e., indeterminate phase for a magnitude = 0) as in the case of Discrete and Fast Fourier Transform (DFT, FFT, respectively). Finally, we can apply QSA to a quantum signal, that is, to a qubit stream in order to analyze it spectrally.展开更多
基金Project supported by the National Basic Research Program of China (Grant No.2013CB338002)
文摘Since the difficulty in preparing the equal superposition state of amplitude is 1/√N, we construct a quantile transform of quantum Fourier transform （QFT） over ZN based on the elementary transforms, such as Hadamard transform and Pauli transform. The QFT over Z_N can then be realized by the quantile transform, and used to further design its quantum circuit and analyze the requirements for the quantum register and quantum gates. However, the transform needs considerable quantum computational resources and it is difficult to construct a high-dimensional quantum register. Hence, we investigate the design of t-bit quantile transform, and introduce the definition of t-bit semiclassical QFT over Z_N. According to probability amplitude, we prove that the transform can be used to realize QFT over ZN and further design its quantum circuit. For this transform, the requirements for the quantum register, the one-qubit gate, and two-qubit gate reduce obviously when compared with those for the QFT over Z_N.
基金Supported by the National Natural Science Foundation of China Grant No.10874098the National Basic Research Program of China under Grant Nos.2009CB929402 and 2011CB9216002
文摘The quantum Fourier transform and quantum phase estimation are the key components for many quantum algorithms, such as order-finding, factoring, and etc. In this article, the general procedure of quantum Fourier transform and phase estimation are investigated for high dimensional case run in a qudit quantum computer, and the quantum circuits are They can be seen as subroutines in a main program given.
基金supported in part by National Natural Science Foundation of China under Grant Nos.60573127,60773012,and 60873082Natural Science Foundation of Hunan Province under Grant Nos.07JJ3128 and 2008RS4016+1 种基金Scientific Research Fund of Hunan Provincial Education Department under Grant No.08B011Postdoctoral Science Foundation of China under Grant Nos.20070420184 and 200801341
文摘A （n, n）-threshold scheme of multiparty quantum secret sharing of classical or quantum message is proposed based on the discrete quantum Fourier transform. In our proposed scheme, the secret message, which is encoded by using the forward quantum Fourier transform and decoded by using the reverse, is split and shared in such a way that it can be reconstructed among them only if all the participants work in concert. Fhrthermore, we also discuss how this protocol must be carefully designed for correcting errors and checking eavesdropping or a dishonest participant. Security analysis shows that our scheme is secure. Also, this scheme has an advantage that it is completely compatible with quantum computation and easier to realize in the distributed quantum secure computation.
基金Project supported by the Natural Science Foundation of the Anhui Provincial Higher Education Institutions of China (Grant Nos.KJ2011Z339 and KJ2011Z359)
文摘Quantum Fourier transform is realized by the Hadamard gate in a quantum computer, which can also be considered as a Hadamard transform. We introduce the Hadamard transformed photon-added coherent state （HTPACS）, which is obtained by letting the photon-added coherent state （PACS） across the quantum Hadamard gate, from this result. It is found that the HTPACS can be considered as a coordinate-momentum mutual exchanging followed by a squeezing transform of the PACS. In addition, the non-classical statistical properties of HTPACS, such as squeezing coefficient, Mandel parameter, etc., are also discussed.
基金Supported by National Natural Science Foundation of China (NSFC) under Grant Nos.60678022 and 10704001the Specialized Research Fund for the Doctoral Program of Higher Education under Grant No.20060357008+1 种基金Anhui Provincial Natural Science Foundation under Grant No.070412060the Program of the Education Department of Anhui Province under Grant Nos.KJ2008A28ZC,KJ2008B83ZC,KJ2008B265,and 2009A048Z
文摘A scheme for implementing discrete quantum Fourier transform is proposed via quantum dots embedded in a microcavity, and then some of its applications are investigated, i.e., Deutsch 3ozsa. algorithm and Shor＇s quantum factoring. In particular, the detailed process of implementing one^qubit Deutsch Jozsa algorithm and the factorization of N = 15 are given. The microcavity mode is only virtually excited in the whole interaction, so the effective decoherent has slight effect on the current scheme. These schemes would be an important step to fabricate a solid quantum computer.
基金Supported by the Foundation for the Author of National Excellent Doctoral Dissertation of China under Grant No. 200524the Program for New Century Excellent Talents of China under Grant No. 06-0920
文摘We propose a theoretical scheme for realizing the general conditional phase shift gate of charge qubits situated in a high-Q superconducting transmission line resonator. The phase shifting angle can be tuned from 0 to 27r by simply adjusting the qubit-resonator detuning and the interaction time. Based on this gate proposal, we give a detailed procedure to implement the three-qubit quantum Fourier transform with circuit quantum eleetrodynamics （QED）. A careful analysis of the decoherence sources shows that the algorithm can be achieved with a high fidelity using current circuit QED techniques.
文摘The image security problem is an important area in information security, and image encryption plays a vital role in this day. To protect the image encryption from the attack of quantum algorithm appeared recently, an image encryption method based on quantum Fourier transformation is proposed here. First, the image encryption and Fourier transformation are discussed here, then a encryption function is proposed. Second, a quantum Fourier transformation is introduced to quantum encryption, and the full step of quantum encryption is given as well. Third, the security of the proposed quantum encryption if analyzed, and some propositions are also presented. Lastly, some conclusions are indicated and some possible directions are also listed.
文摘In this work,we describe a method of calculation of the 1-D circular quantum convolution of signals represented by 3-qubit superpositions in the computational basis states.The examples of the ideal low pass and high pass filters are described and quantum schemes for the 3-qubit circular convolution are presented.In the proposed method,the 3-qubit Fourier transformis used and one addition qubit,to prepare the quantumsuperposition for the inverse quantum Fourier transform.It is considered that the discrete Fourier transform of one of the signals is known and calculated in advance and only the quantum Fourier transform of another signal is calculated.The frequency characteristics of many linear time-invariant systems and filters are well known.Therefore,the described method of convolution can be used for these systems in quantum computation.
文摘Because of the difficulty of building a high-dimensional quantum register,this paper presents an implementation of the high-dimensional quantum Fourier transform(QFT)based on a low-dimensional quantum register.First,we define the t-bit semi- classical quantum Fourier transform.In terms of probability amplitude,we prove that the transform can realize quantum Fourier transformation,illustrate that the requirement for the two-qubit gate reduces obviously,and further design a quantum circuit of the transform.Combining the classical fixed-window method and the implementation of Shor's quantum factorization algorithm,we then redesign a circuit for Shor's algorithm,whose required computation resource is approximately equal to that of Parker's.The requirement for elementary quantum gates for Parker's algorithm is 3 O (logN),and the quantum register for our circuit re- quires t-1 more dimensions than Parker's.However,our circuit is t2 times as fast as Parker's,where t is the width of the window.
基金Project supported by the National Natural Science Foundation of China(Grant No.11775208)the Foundation for Young Talents at the College of Anhui Province,China(Grant Nos.gxyq2021210 and gxyq2019077)the Natural Science Foundation of the Anhui Higher Education Institutions of China(Grant Nos.KJ2020A0638 and 2022AH051586)。
文摘In our previous papers,the classical fractional Fourier transform theory was incorporated into the quantum theoretical system using the theoretical method of quantum optics,and the calculation produced quantum mechanical operators corresponding to the generation of fractional Fourier transform.The core function of the coordinate-momentum exchange operators in the addition law of fractional Fourier transform was analyzed too.In this paper,the bivariate operator Hermite polynomial theory and the technique of integration within an ordered product of operators(IWOP)are used to establish the entanglement fractional Fourier transform theory to the extent of quantum.A new function generating formula and an operator for generating quantum entangled fractional Fourier transform are obtained using the fractional Fourier transform relationship in a pair of conjugated entangled state representations.
基金The project supported by National Natural Science Foundation of China under Grant No. 10225421 and Funds from Fuzhou University
文摘We propose two schemes for the implementation of quantum discrete Fourier transform in the ion trap systern. In each scheme we design a tunable two-qubit phase gate as the main ingredient. The experimental implementation of the schemes would be an important step toward complex quantum computation in the ion trap system.
基金Project supported by the Natural Science Foundation of Huangshi Institute of Technology,China (Grant No. 10yjz03R)the National Natural Science Foundation of China (Grant No. 10874174)
文摘Using the Weyl quantization scheme and based on the Fourier slice transformation （FST） of the Wigner operator, we construct a new expansion formula of the density operator p, with the expansion coefficient being the FST of p＇s classical Weyl correspondence, and the latter the Fourier transformation of p＇s quantum tomogram. The coordinate momentum intermediate representation is used as the Radon transformation of the Wigner operator.
文摘A quantum time-dependent spectrum analysis, or simply, quantum spectral analysis (QSA) is presented in this work, and it’s based on Schrödinger’s equation. In the classical world, it is named frequency in time (FIT), which is used here as a complement of the traditional frequency-dependent spectral analysis based on Fourier theory. Besides, FIT is a metric which assesses the impact of the flanks of a signal on its frequency spectrum, not taken into account by Fourier theory and lets alone in real time. Even more, and unlike all derived tools from Fourier Theory (i.e., continuous, discrete, fast, short-time, fractional and quantum Fourier Transform, as well as, Gabor) FIT has the following advantages, among others: 1) compact support with excellent energy output treatment, 2) low computational cost, O(N) for signals and O(N2) for images, 3) it does not have phase uncertainties (i.e., indeterminate phase for a magnitude = 0) as in the case of Discrete and Fast Fourier Transform (DFT, FFT, respectively). Finally, we can apply QSA to a quantum signal, that is, to a qubit stream in order to analyze it spectrally.
