An attempt to ascertain reasons of the quantum logic efficiency was made. To do this, we reduce the complete set of elementary quantum logic operations to the classical one via taking the semi-classical limit (dequantization). We estimate the amount of information loss for any element of the set and obtain general expression for the loss estimation of any quantum algorithm under dequantization. We demonstrate the technique on quantum discrete fast Fourier transform and Grover search algorithms.
An attempt to ascertain reasons of the quantum logic efficiency was made. To do this, we reduce the complete set of elementary quantum logic operations to the classical one via taking the semi-classical limit (dequantization). We estimate the amount of information loss for any element of the set and obtain general expression for the loss estimation of any quantum algorithm under dequantization. We demonstrate the technique on quantum discrete fast Fourier transform and Grover search algorithms.
In this chapter, the authors describe how to implement classical computations, such as addition and multiplication, using quantum gates. However, there are very good reasons to consider efficient quantum implementations of classical logic. First, these operations are embedded as kernels in important quantum algorithms, such as Shor's algorithm for factoring large integers, and Grover's search algorithm. Second, classical computations can be performed on quantum information, and the authors show how logical operations operate on general quantum states. With a basic understanding of reversible logic, they discuss how to do arithmetic and logic operations on qubits. The authors focus on implementing common arithmetic operations on unsigned binary integers, using a binary adder as an example. They consider operations that affect the phase of the quantum state. Phase adds a quantum twist to the topic of computational logic.
A classical limit of Grover's algorithm is discussed by assuming a very rapid decoherence (or dephasing) between consecutive Grover's unitary operations, which leads pure quantum states to completely decohered mixed states. One can identify a specific element among N unsorted elements by a probability of the order of unity after k∼N/4 steps of classical amplification defined by the decohered mixed states, in contrast to Grover's k∼πN/4 steps in quantum mechanical amplification. This difference is caused by the loss of quantum coherence with or without the loss of entanglement depending on each case.
A new approach to the classical limit of Grover’s algorithm is discussed by assuming a very rapid dephasing of a system between consecutive Grover’s unitary operations, which drives pure quantum states to decohered mixed states. One can identify a specific element among [Formula: see text] unsorted elements by a probability of the order of unity after [Formula: see text] steps of classical amplification, which is realized by a combination of Grover’s unitary operation and rapid dephasing, in contrast to [Formula: see text] steps in quantum mechanical amplification. The initial two-state system with enormously unbalanced existence probabilities, which is realized by a chosen specific state and a superposition of all the rest of the states among [Formula: see text] unsorted states, is crucial in the present analysis of classical amplification. This analysis illustrates Grover’s algorithm in extremely noisy circumstances. A similar increase from [Formula: see text] to [Formula: see text] steps due to the loss of quantum coherence takes place in the analog model of Farhi and Gutmann where the entanglement does not play an obvious role. This supports a view that entanglement is crucial in quantum computation to describe quantum states by a set of qubits, but the actual speedup of the quantum computation is based on quantum coherence.
Abstract As computers get faster and faster, the size of the circuitry imprinted onto silicon chips decreases. The size of the circuitry becomes so small that its behavior is governed by the laws of quantum mechanics. Such a computer, whose computations would be fully quantum mechanical, is called a quantum computer. Any computational task such as addition, multiplication, displaying graphics, or updating databases is performed by a computer according to an algorithm — an abstract set of instructions. Quantum computers would accomplish tasks by performing quantum algorithms. A quantum algorithm is a sequence of unitary evolutions carried out on a quantum string made up of qubits, which can exist as a superposition of classical strings. This chapter discusses the computational complexity of a quantum algorithm, Deutsch's algorithm and its efficiency as quantified by the Holevo bound, Oracles, Grover's search algorithm, quantum factorisation, quantum Fourier transform, and phase estimation.
The discrete Fourier transform (DFT) is the base of modern signal processing. 1-dimensional fast Fourier transform (ID 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 (ID 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, ID and 2D QDFT have time complexity O(√ N ) and O ( N ) respectively. QDFT and quantum convolution demonstrate that quantum computation to process classical signal is possible.
Quantum computation has shown much promise at providing, at least in some cases, a significant advantage over classical computation. However, the nature of quantum computation is still far from being well understood. In order to develop quantum algorithms effectively, it is important to understand the true nature of the differences between classical and quantum computation. We investigate these differences more closely by looking at de-quantising quantum algorithms into classical counterparts which retain the benefit provided by, and thought to be intrinsic to, the quantum algorithms. We extend a previous de-quantisation of Deutsch’s problem to show that in some situations the quantum algorithm solving the Deutsch-Jozsa problem can be de-quantised into an equivalent classical one. We quantify the entanglement in this problem and show that the inability to easily extend the de-quantisation to the general case is a result of the entanglement destroying the concise classical state description needed to de-quantise such a black-box algorithm. We further show that the quantum Fourier transform, an important process in many quantum algorithms, in its standard form is de-quantisable. This highlights key misconceptions about both the quantum Fourier transform and quantum computation itself. In such cases it is the linearity of quantum mechanics which allows constructing quantum algorithms which offer advantage over classical algorithms. The careful investigation of de-quantisation in relation to these problems allows a deeper insight into the nature of quantum computation.