dorsal/arxiv
View SchemaA Constant Complexity Algorithm for Solving the Boolean Satisfiability Problem on Quantum Computers
| Authors | Ahmed Younes, Julian Miller |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0309077 |
| URL | https://arxiv.org/abs/quant-ph/0309077 |
Abstract
This paper has been withdrawn by the author(s). Please refer to quant-ph/0311171.
{
"annotation_id": "0600b3d9-9b04-413d-8746-1f5acee749a4",
"date_created": "2026-03-02T18:02:03.126000Z",
"date_modified": "2026-03-02T18:02:03.126000Z",
"file_hash": "9f1e0cac7940e275bd25d390e62ea2e4b6843f4a49601f5eeb5f67e34ef76392",
"private": false,
"record": {
"abstract": "This paper has been withdrawn by the author(s). Please refer to\nquant-ph/0311171.",
"arxiv_id": "quant-ph/0309077",
"authors": [
"Ahmed Younes",
"Julian Miller"
],
"categories": [
"quant-ph"
],
"title": "A Constant Complexity Algorithm for Solving the Boolean Satisfiability Problem on Quantum Computers",
"url": "https://arxiv.org/abs/quant-ph/0309077"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "1f55f440-dd0c-4889-ab67-41db15f93fd8",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}