dorsal/arxiv
View SchemaUniversal construction of unitary transformation of quantum computation with one- and two-body interactions
| Authors | Xijia Miao |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0003068 |
| URL | https://arxiv.org/abs/quant-ph/0003068 |
Abstract
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary representation in usual computational basis. This decomposition may be simplified greatly with the help of the properties of the finite-dimensional multiple-quantum operator algebra spaces of a quantum system and the specific properties of a given quantum algorithm. As elementary building blocks of quantum computation, the two-qubit diagonal gates and one-qubit gates may be constructed physically with one- and two-body interactions in a two-state quantum system and hence could be conveniently realized experimentally. The present work will be helpful for implementing generally any N-qubit quantum computation in those feasible two-state quantum systems and determining conveniently the time evolution of these systems in course of quantum computation.
{
"annotation_id": "bc9f80a6-9e2e-440b-87de-f90ff9f87fbc",
"date_created": "2026-03-02T18:01:39.215000Z",
"date_modified": "2026-03-02T18:01:39.215000Z",
"file_hash": "ac45580e2e4f5fa9b7635bb27d340d0fa81b5bd6b802ee5ce5ef7ccbc50ae9c5",
"private": false,
"record": {
"abstract": "Any unitary transformation of quantum computational networks is explicitly\ndecomposed, in an exact and unified form, into a sequence of a limited number\nof one-qubit quantum gates and the two-qubit diagonal gates that have diagonal\nunitary representation in usual computational basis. This decomposition may be\nsimplified greatly with the help of the properties of the finite-dimensional\nmultiple-quantum operator algebra spaces of a quantum system and the specific\nproperties of a given quantum algorithm. As elementary building blocks of\nquantum computation, the two-qubit diagonal gates and one-qubit gates may be\nconstructed physically with one- and two-body interactions in a two-state\nquantum system and hence could be conveniently realized experimentally. The\npresent work will be helpful for implementing generally any N-qubit quantum\ncomputation in those feasible two-state quantum systems and determining\nconveniently the time evolution of these systems in course of quantum\ncomputation.",
"arxiv_id": "quant-ph/0003068",
"authors": [
"Xijia Miao"
],
"categories": [
"quant-ph"
],
"title": "Universal construction of unitary transformation of quantum computation with one- and two-body interactions",
"url": "https://arxiv.org/abs/quant-ph/0003068"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "69e0551f-6e59-4cc7-9025-825b495824fd",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}