Quantum Relational Databases

Simple item page
dc.creatorCockshott, Paul
dc.date1997-12-11
dc.date.accessioned2026-07-07T06:14:38Z
dc.date.available2026-07-07T06:14:38Z
dc.descriptionThe 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.
dc.description7 pages 3 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/9712025
dc.identifierhttp://arxiv.org/abs/quant-ph/9712025
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93538
dc.subjectQuantum Physics
dc.titleQuantum Relational Databases
dc.typetext

Files

Collections

arXiv