排序方式: 共有5条查询结果,搜索用时 0 毫秒
1
1.
Design of quantum VQ iteration and quantum VQ encoding algorithm taking O(√N) steps for data compression 下载免费PDF全文
Vector quantization (VQ) is an important data compression
method. The key of the encoding of VQ is to find the closest vector among
N vectors for a feature vector. Many classical linear search algorithms
take $O(N)$ steps of distance computing between two vectors. The quantum VQ iteration and corresponding quantum VQ encoding algorithm that takes
$O(\sqrt N )$ steps are presented in this paper. The unitary operation of
distance computing can be performed on a number of vectors simultaneously
because the quantum state exists in a superposition of states. The quantum VQ iteration comprises three oracles, by contrast many quantum algorithms have only one oracle, such as Shor's factorization algorithm and Grover's algorithm. Entanglement state is generated and used, by contrast the state in Grover's algorithm is not an entanglement state. The quantum VQ iteration is a rotation over subspace, by contrast the Grover iteration is a rotation over global space. The quantum VQ iteration extends the Grover iteration to the more complex search that requires more oracles. The method of the quantum VQ iteration is universal. 相似文献
2.
A quantum search algorithm of two entangled registers to realize quantum discrete Fouriertransform
of signal processing 下载免费PDF全文
The discrete Fourier transform (DFT) is the base of modern signal processing. 1-dimensional fast Fourier transform (1D FFT) and 2D FFT have time complexity O(N log N) and O(N^2 log N) respectively. Since 1965, there has been no more essential breakthrough for the design of fast DFT algorithm. DFT has two properties. One property is that DFT is energy conservation transform. The other property is that many DFT coefficients are close to zero. The basic idea of this paper is that the generalized Grover's iteration can perform the computation of DFT which acts on the entangled states to search the big DFT coefficients until these big coefficients contain nearly all energy. One-dimensional quantum DFT (1D QDFT) and two-dimensional quantum DFT (2D QDFT) are presented in this paper. The quantum algorithm for convolution estimation is also presented in this paper. Compared with FFT, 1D and 2D QDFT have time complexity O(v/N) and O(N) respectively. QDFT and quantum convolution demonstrate that quantum computation to process classical signal is possible. 相似文献
3.
Many classical encoding algorithms of vector quantization (VQ) of image compression
that can obtain global optimal solution have computational complexity O(N). A pure
quantum VQ encoding algorithm with probability of success near 100% has been
proposed, that performs operations 45\sqrt{N} times approximately. In this paper,
a hybrid quantum VQ encoding algorithm between the classical method and the
quantum algorithm is presented. The number of its operations is less than \sqrt{N}
for most images, and it is more efficient than the pure quantum algorithm. 相似文献
4.
We investigate the dynamics of genuine three-qubit entanglement in the Ising model of three spins. A scheme is presented for generating the genuine three-qubit entanglement by the nearest-neighbour couplings. The effect of magnetic fields on the dynamics of genuine three-qubit entanglement is also discussed. 相似文献
5.
利用大失谐腔场中的两个原子实现量子相位门 总被引:1,自引:1,他引:0
本文讨论同时囚禁于单模、大失谐腔场中两个不同原子构成的系统,结论指出:只要仔细选择两不同原子的跃迁频率差、原子与腔场相互作用时间,可实现一个快速的量子相位门。这一方案不需要辅助的原子能级。 相似文献
1