dorsal/arxiv
View SchemaSimulation of Quantum Computation: A deterministic event-based approach
| Authors | K. Michielsen, K. De Raedt, H. De Raedt |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0501140 |
| URL | https://arxiv.org/abs/quant-ph/0501140 |
Abstract
We demonstrate that locally connected networks of machines that have primitive learning capabilities can be used to perform a deterministic, event-based simulation of quantum computation. We present simulation results for basic quantum operations such as the Hadamard and the controlled-NOT gate, and for seven-qubit quantum networks that implement Shor's numbering factoring algorithm.
{
"annotation_id": "8e8aafe8-66f0-418c-b46a-01f2ae93b789",
"date_created": "2026-03-02T18:02:13.032000Z",
"date_modified": "2026-03-02T18:02:13.032000Z",
"file_hash": "57bd2fe4b61ed365f721ac5a0ffab5b480083627cc9a30b03564cd69c4d9b3c7",
"private": false,
"record": {
"abstract": "We demonstrate that locally connected networks of machines that have\nprimitive learning capabilities can be used to perform a deterministic,\nevent-based simulation of quantum computation. We present simulation results\nfor basic quantum operations such as the Hadamard and the controlled-NOT gate,\nand for seven-qubit quantum networks that implement Shor\u0027s numbering factoring\nalgorithm.",
"arxiv_id": "quant-ph/0501140",
"authors": [
"K. Michielsen",
"K. De Raedt",
"H. De Raedt"
],
"categories": [
"quant-ph"
],
"title": "Simulation of Quantum Computation: A deterministic event-based approach",
"url": "https://arxiv.org/abs/quant-ph/0501140"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "f7b84ac1-14e8-4b63-bbd1-eaa096debd1a",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}