dorsal/arxiv
View SchemaQuantum Booth's array multiplier
| Authors | J. J. Alvarez-Sanchez, J. V. Alvarez-Bravo, L. M. Nieto |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0611007 |
| URL | https://arxiv.org/abs/quant-ph/0611007 |
Abstract
A new quantum architecture for multiplying signed integers is presented based on Booth's algorithm, which is well known in classical computation. It is shown how a quantum binary chain might be encoded by its flank changes, giving the final product in 2's-complement representation.
{
"annotation_id": "ae640b90-a251-4605-b107-aaf1c83ad17b",
"date_created": "2026-03-02T18:02:30.291000Z",
"date_modified": "2026-03-02T18:02:30.291000Z",
"file_hash": "b4f3ce655a464b0b768ad22c34d0920d6854d4818648b8cac62caf62686c6574",
"private": false,
"record": {
"abstract": "A new quantum architecture for multiplying signed integers is presented based\non Booth\u0027s algorithm, which is well known in classical computation. It is shown\nhow a quantum binary chain might be encoded by its flank changes, giving the\nfinal product in 2\u0027s-complement representation.",
"arxiv_id": "quant-ph/0611007",
"authors": [
"J. J. Alvarez-Sanchez",
"J. V. Alvarez-Bravo",
"L. M. Nieto"
],
"categories": [
"quant-ph"
],
"title": "Quantum Booth\u0027s array multiplier",
"url": "https://arxiv.org/abs/quant-ph/0611007"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "a59af272-c083-480f-9244-a1ca77ad5395",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}