dorsal/arxiv
View SchemaQuantum Computing on Lattices using Global Two-Qubit Gate
| Authors | G. Ivanyos, S. Massar, A. B. Nagy |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0502142 |
| URL | https://arxiv.org/abs/quant-ph/0502142 |
| DOI | 10.1103/PhysRevA.72.022339 |
| Journal | Phys. Rev. A 72, 022339 (2005) |
Abstract
We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed, and if the initial state of the lattice can be suitably chosen, then a quantum computer can be efficiently simulated
{
"annotation_id": "89bc3810-7d12-45b8-bc2d-9f00a67c3b6a",
"date_created": "2026-03-02T18:02:12.848000Z",
"date_modified": "2026-03-02T18:02:12.848000Z",
"file_hash": "b0e38deb9c9db146ef43cc87ab4d94573650934c5002dd335a9a31f66ffb390c",
"private": false,
"record": {
"abstract": "We study the computation power of lattices composed of two dimensional\nsystems (qubits) on which translationally invariant global two-qubit gates can\nbe performed. We show that if a specific set of 6 global two qubit gates can be\nperformed, and if the initial state of the lattice can be suitably chosen, then\na quantum computer can be efficiently simulated",
"arxiv_id": "quant-ph/0502142",
"authors": [
"G. Ivanyos",
"S. Massar",
"A. B. Nagy"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.72.022339",
"journal_ref": "Phys. Rev. A 72, 022339 (2005)",
"title": "Quantum Computing on Lattices using Global Two-Qubit Gate",
"url": "https://arxiv.org/abs/quant-ph/0502142"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "d9f574b0-f150-4ad1-8dc4-7e7d5ff4502c",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}