Quantum Relational Databases
Quantum Physics
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.quant-ph/9712025,
title = {Quantum Relational Databases},
author = {Paul Cockshott},
journal= {arXiv preprint arXiv:quant-ph/9712025},
year = {2007}
}
Comments
7 pages 3 figures