Quantum counting algorithm is a quantum algorithm for efficiently counting the number of solutions for a given search problem.
The algorithm is based on the quantum phase estimation algorithm and on Grover's search algorithm.
Counting problems are common in diverse fields such as statistical estimation, statistical physics, networking, etc.
As for quantum computing, the ability to perform quantum counting efficiently is needed in order to use Grover's search algorithm (because running Grover's search algorithm requires knowing how many solutions exist). Moreover, this algorithm solves the quantum existence problem (namely, deciding whether any solution exists) as a special case.
The algorithm was devised by Gilles Brassard, Peter Høyer and Alain Tapp in 1998.
Consider a finite set of size and a set of "solutions" (that is a subset of ). Define:
In other words, is the indicator function of .
Calculate the number of solutions .
Without any prior knowledge on the set of solutions (or the structure of the function ), a classical deterministic solution cannot perform better than , because all the elements of must be inspected (consider a case where the last element to be inspected is a solution).
The input consists of two registers (namely, two parts): the upper qubits comprise the first register, and the lower qubits are the second register.
The initial state of the system is . After applying multiple bit Hadamard gate operation on each of the registers separately, the state of the first register is
and the state of the second register is
an equal superposition state in the computational basis.
Because the size of the space is and the number of solutions is , we can define the normalized states:
Note that
which is the state of the second register after the Hadamard transform.
Geometric visualization of Grover's algorithm shows that in the two-dimensional space spanned by and , the Grover operator is a counterclockwise rotation; hence, it can be expressed as
in the orthonormal basis .
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
In quantum computing, the quantum Fourier transform (QFT) is a linear transformation on quantum bits, and is the quantum analogue of the discrete Fourier transform. The quantum Fourier transform is a part of many quantum algorithms, notably Shor's algorithm for factoring and computing the discrete logarithm, the quantum phase estimation algorithm for estimating the eigenvalues of a unitary operator, and algorithms for the hidden subgroup problem. The quantum Fourier transform was discovered by Don Coppersmith.
Explores the Grover algorithm, a quantum search algorithm with quadratic speedup, covering quantum circuits, final states, and geometric interpretations.
Quantum computing has received wide-spread attention lately due the possibility of a near-term breakthrough of quantum supremacy. This course acts as an introduction to the area of quantum computing.
After introducing the foundations of classical and quantum information theory, and quantum measurement, the course will address the theory and practice of digital quantum computing, covering fundament
The course teaches non von-Neumann architectures. The first part of the course deals with quantum computing, sensing, and communications. The second focuses on field-coupled and conduction-based nanoc
Quantum computing has made significant progress in recent years, with Google and IBM releasing quantum computers with 72 and 50 qubits, respectively. Google has also achieved quantum supremacy with its 54-qubit device, and IBM has announced the release of ...
Universal quantum algorithms that prepare arbitrary n-qubit quantum states require O(2n) gate complexity. The complexity can be reduced by considering specific families of quantum states depending on the task at hand. In particular, multipartite quantum st ...
Quantum many-body control is a central milestone en route to harnessing quantum technologies. However, the exponential growth of the Hilbert space dimension with the number of qubits makes it challenging to classically simulate quantum many-body systems an ...