Quantum Relational Databases
classification
🪐 quant-ph
keywords
quantumclassicalcomplexitylimitrelationalupperalgebraapproach
read the original abstract
The approach given by Grover can be generalised to set an upper complexity limit to the basic operations of relational algebra on a quantum computer. Except in special cases where indices can be used on a classical machine, the quantum upper complexity limit is lower than the classical one.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.