2010 12th International Conference on Transparent Optical Networks 2010
DOI: 10.1109/icton.2010.5549171
|View full text |Cite
|
Sign up to set email alerts
|

Optimized methods for inserting and deleting records and data retrieving in quantum database

Abstract: In this paper, we show how a quantum CNOT-based relational database is built, then we show how to query its quantum tables using the most used SQL-like queries, e.g. INSERT, UPDATE, DELETE and SELECT. We specify each time the evolution of the probability amplitude corresponding to the records before and after the query has been executed and we propose corresponding circuits implementation.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 4 publications
0
4
0
Order By: Relevance
“…Grover's algorithm searches through the database using parallelism, it acts on the register in a superposition of states of each element at one time. Grover's algorithm applies to the Hadamard gate (Hadamard transformation) which performs rotation of every qubit and is setting up an equal superposition of each of the database elements (Younes 2007;Gueddana et al 2010;Hamouda et al 2016). On the whole Grover's algorithm has four stages: initialization (Hadamard transformation creates an equal superposition of all states), quantum oracle (oracle O marks the solutions by ipping the sign of that state's amplitude), ampli cation (increasing the amplitude of the marked state), and measurement (Bender et al 1999).…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…Grover's algorithm searches through the database using parallelism, it acts on the register in a superposition of states of each element at one time. Grover's algorithm applies to the Hadamard gate (Hadamard transformation) which performs rotation of every qubit and is setting up an equal superposition of each of the database elements (Younes 2007;Gueddana et al 2010;Hamouda et al 2016). On the whole Grover's algorithm has four stages: initialization (Hadamard transformation creates an equal superposition of all states), quantum oracle (oracle O marks the solutions by ipping the sign of that state's amplitude), ampli cation (increasing the amplitude of the marked state), and measurement (Bender et al 1999).…”
Section: Resultsmentioning
confidence: 99%
“…UPDATE statement (updating a set of records) can be done using CNOT gate by permutation with unitary operator U or replacing the qubit states (Younes 2007;Hamouda et al 2016). INSERT statement (inserting one or more records into the database) can be implemented using a controlled Hadamard gate (Younes 2007;Gueddana et al 2010;Hamouda et al 2016). DELETE statement (deleting records from the database) can be made by Grover operator G (Gueddana et al 2010;Hamouda et al 2016).…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations