dorsal/arxiv
View SchemaA polynomial-time solution to the parity problem on an NMR quantum computer
| Authors | Xijia Miao |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0108116 |
| URL | https://arxiv.org/abs/quant-ph/0108116 |
Abstract
An efficient quantum algorithm is proposed to solve in polynomial time the parity problem, one of the hardest problems both in conventional quantum computation and in classical computation, on NMR quantum computers. It is based on the quantum parallelism principle in a quantum ensemble, the selective decoherence manipulation, and the NMR phase-sensitive measurement. The quantum circuit for the quantum algorithm is designed explicitly.
{
"annotation_id": "e4da9173-e38c-462c-8e49-444103166ee0",
"date_created": "2026-03-02T18:01:45.894000Z",
"date_modified": "2026-03-02T18:01:45.894000Z",
"file_hash": "51b5cafb245a38830c5f0bb1f0d8b47de6b5e99b0b90528a1da653c3abcccc7f",
"private": false,
"record": {
"abstract": "An efficient quantum algorithm is proposed to solve in polynomial time the\nparity problem, one of the hardest problems both in conventional quantum\ncomputation and in classical computation, on NMR quantum computers. It is based\non the quantum parallelism principle in a quantum ensemble, the selective\ndecoherence manipulation, and the NMR phase-sensitive measurement. The quantum\ncircuit for the quantum algorithm is designed explicitly.",
"arxiv_id": "quant-ph/0108116",
"authors": [
"Xijia Miao"
],
"categories": [
"quant-ph"
],
"title": "A polynomial-time solution to the parity problem on an NMR quantum computer",
"url": "https://arxiv.org/abs/quant-ph/0108116"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "ae3287a8-1521-453d-800c-bc66c37c2294",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}