dorsal/arxiv
View SchemaQuantum Computation Beyond the "Standard Circuit Model"
| Authors | K. Ch. Chatzisavvas, C. Daskaloyannis, C. P. Panos |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0507163 |
| URL | https://arxiv.org/abs/quant-ph/0507163 |
| Journal | Quantum Information Processing: From Theory to Experiment, NATO Science Series: Computer and Systems Sciences, Vol. 199, IOS Press, p. 330-336 (2006) |
Abstract
Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g. concerning the number of computational steps) and it neglects physical systems which cannot follow the "standard circuit model" analysis. We propose a computational scheme which overcomes the notion of the transposition from classical circuits providing a computation scheme with the least possible number of Hamiltonians in order to minimize the physical resources needed to perform quantum computation and to succeed a minimization of the computational procedure (minimizing the number of computational steps needed to perform an arbitrary unitary transformation). It is a general scheme of construction, independent of the specific system used for the implementation of the quantum computer. The open problem of controllability in Lie groups is directly related and rises to prominence in an effort to perform universal quantum computation.
{
"annotation_id": "a95dbc83-94ad-4315-b7c9-ba400a545857",
"date_created": "2026-03-02T18:02:20.526000Z",
"date_modified": "2026-03-02T18:02:20.526000Z",
"file_hash": "cdf17c6fc0cdabfcaa273a4b13e18802da0665b4c1d935c3de0c7f4f4eec23fe",
"private": false,
"record": {
"abstract": "Construction of explicit quantum circuits follows the notion of the \"standard\ncircuit model\" introduced in the solid and profound analysis of elementary\ngates providing quantum computation. Nevertheless the model is not always\noptimal (e.g. concerning the number of computational steps) and it neglects\nphysical systems which cannot follow the \"standard circuit model\" analysis. We\npropose a computational scheme which overcomes the notion of the transposition\nfrom classical circuits providing a computation scheme with the least possible\nnumber of Hamiltonians in order to minimize the physical resources needed to\nperform quantum computation and to succeed a minimization of the computational\nprocedure (minimizing the number of computational steps needed to perform an\narbitrary unitary transformation). It is a general scheme of construction,\nindependent of the specific system used for the implementation of the quantum\ncomputer. The open problem of controllability in Lie groups is directly related\nand rises to prominence in an effort to perform universal quantum computation.",
"arxiv_id": "quant-ph/0507163",
"authors": [
"K. Ch. Chatzisavvas",
"C. Daskaloyannis",
"C. P. Panos"
],
"categories": [
"quant-ph"
],
"journal_ref": "Quantum Information Processing: From Theory to Experiment, NATO\n Science Series: Computer and Systems Sciences, Vol. 199, IOS Press, p.\n 330-336 (2006)",
"title": "Quantum Computation Beyond the \"Standard Circuit Model\"",
"url": "https://arxiv.org/abs/quant-ph/0507163"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "6eab3764-6723-4c87-b364-d093e5d1271e",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}