Datasets:
wesley7137
/
quantum

Dataset card Data Studio Files
xet
 Community
text
stringlengths
0
8.13M
not matched with the input. If this condition is happen, the program will do the iterations
again until the number is matched with the input. But even the program do the iterations
more than one round, the total iterations is never exceed the value of the input. We can
see this from the table in the column "Total Iterations". But this Grover’s quantum search
19
simulation has a limitation, the maximum qubits that the program can use is only 32 qubits
(QCL limitation). For the possible real implementation, grover algorithm can be used for
searching a record in database and improving the traditional genetic search.
V. CONCLUSION REMARKS
A. Conclusion
Using QCL, a Grover’s quantum search simulation has been made. It is performed with-
out using a quantum computer, but using a classic computer. To search an element, the
program needs to use qubit instead of bit. The number of qubits needed is depend on the
value of the number that we want to find. The bigger the value of the number, the bigger
qubits needed. It goes the same with the number of iterations needed. The minimum value
for the number is 1, and the maximum value is depend on the qubits needed. At this far,
the program has been tested to search number till 9999. This Grover’s quantum search is
just a simulation to simulate the algorithm, not a real quantum searching program that can
be implemented on the real database.
B. Future Work
ThisGrover’squantumsearchisjustasimulationofquantumsearchinaclassiccomputer.
That are some possible works for the future related to grover algorithm. Some of them is
implementing grover algorithm in a real database using quantum computer, but in this case,
the database must be converted in to quantum states which is probably the most difficult
thing to do. Another possible work is improving the traditional genetic search by combine
it with grover algorithm.
[1] L. K. Grover, Proceeding of the 28th Annual ACM Symposium on Theory of Computing
(1996), arXiv:quant-ph/9605043v3.
[2] F. P. Zen, A. N. Atmaja, and S. Sigit, Indonesian Journal of Physics (2003).
[3] B. Oemer, S. Doz, and D. K. Svozil, Simulation of quantum computers (1996).
20
[4] B. Oemer, Structured quantum programming (2003), http://tph.tuwien.ac.at/ oemer/.
[5] R. P. Feynmann, International Journal of Theoretical Physics 21, 467 (1982).
[6] P. Benioff, Physical Review Letters 48, 1581 (1982).
[7] D. Deutsch, Proceedings of the Royal Society of London Series A A400, 97 (1985).
[8] D. Deutsch, Proceedings of the Royal Society of London A425, 73 (1989).
[9] Paramita, R. E. Prihandini, and M. K. Sulaeman (2006), http://www.informatika.org/.
[10] M.Whitehead(2005),https://www.cs.indiana.edu/mewhiteh/files/quantum_genetic_search.pdf.
[11] A. Younes (2008), arXiv:quant-ph/0811.4481v1.
21
APPENDIX
Listing Program
procedure query(qureg x,quvoid f,int bil) {
int i;
for i=0 to #x-1 { // x -> NOT (x XOR bil)
if not bit(bil,i)
{Not(x[i]);}
}
CNot(f,x); // flip f jika x=1111..
for i=0 to #x-1 { // x <- NOT (x XOR bil)
if not bit(bil,i)
{!Not(x[i]);}
}
}
procedure diffusi(qureg q) {
H(q); // Transformasi Hadamard (superposisi)
Not(q); // Inversi q
CPhase(pi,q); // Rotate jika q=1111..
!Not(q); // undo inversi
!H(q); // undo Transformasi Hadamard
}
procedure algoritma(int bil) {
int jmlqubit = floor(log(bil,2))+1; // banyaknya qubit
int iterasi = ceil(pi/8*sqrt(2^jmlqubit)); // banyaknya iterasi
int hasilmeasurement;
int i;
qureg q[jmlqubit];
22
qureg f[1];
print "Jumlah qubit yang digunakan:",jmlqubit;
print "Jumlah iterasi yang dibutuhkan:",iterasi;
print "Proses pencarian dimulai...";
{
reset; // bersihkan register
H(q); // persiapan superposisi
for i= 1 to iterasi { // looping utama
print "Iterasi",i;
query(q,f,bil); // hitung C(q)
CPhase(pi,f); // negasi |n>
!query(q,f,bil); // undo C(q)
diffusi(q);
}
//oracle
measure q,hasilmeasurement; // measurement
if hasilmeasurement==bil {
print "Hasil measurement:",hasilmeasurement;
print "Telah sama dengan bilangan yang dicari...";
}
else {
print "Hasil measurement:",hasilmeasurement;
print "Belum sama dengan bilangan yang dicari...";
}
} until hasilmeasurement==bil;
reset; // bersihkan register
}
procedure mulai(){
int bil;
print;
print "-----------------------------------------";
23