dorsal/arxiv
View SchemaQuantum Relational Databases
| Authors | Paul Cockshott |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9712025 |
| URL | https://arxiv.org/abs/quant-ph/9712025 |
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.
{
"annotation_id": "c49b706c-fd0c-449a-9c12-ef8d03743268",
"date_created": "2026-03-02T18:02:41.046000Z",
"date_modified": "2026-03-02T18:02:41.046000Z",
"file_hash": "f56e470d12b6ed593f2aeb98c1dbd0cf0c3e7f561b4f00071845aa7a68a98bbb",
"private": false,
"record": {
"abstract": "The approach given by Grover can be generalised to set an upper complexity\nlimit to the basic operations of relational algebra on a quantum computer.\nExcept in special cases where indices can be used on a classical machine, the\nquantum upper complexity limit is lower than the classical one.",
"arxiv_id": "quant-ph/9712025",
"authors": [
"Paul Cockshott"
],
"categories": [
"quant-ph"
],
"title": "Quantum Relational Databases",
"url": "https://arxiv.org/abs/quant-ph/9712025"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "aabcb026-23af-4502-890b-ece55d59feb3",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}