dorsal/arxiv
View SchemaOn Computational Power of Quantum Branching Programs
| Authors | Farid Ablayev, Aida Gainutdinova, Marek Karpinski |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0302022 |
| URL | https://arxiv.org/abs/quant-ph/0302022 |
Abstract
In this paper we study a model of a Quantum Branching Program (QBP) and investigate its computational power. We prove a general lower bound on the width of read-once QBPs, which we show to be almost tight on certain symmetric function.
{
"annotation_id": "1dc457d1-88b3-40fe-b0b6-8b99517d6720",
"date_created": "2026-03-02T18:01:56.378000Z",
"date_modified": "2026-03-02T18:01:56.378000Z",
"file_hash": "dcb9985a2679b0dc95fa5c06827fb248003562b5cf9fe5823d618064b86d3598",
"private": false,
"record": {
"abstract": "In this paper we study a model of a Quantum Branching Program (QBP) and\ninvestigate its computational power. We prove a general lower bound on the\nwidth of read-once QBPs, which we show to be almost tight on certain symmetric\nfunction.",
"arxiv_id": "quant-ph/0302022",
"authors": [
"Farid Ablayev",
"Aida Gainutdinova",
"Marek Karpinski"
],
"categories": [
"quant-ph"
],
"title": "On Computational Power of Quantum Branching Programs",
"url": "https://arxiv.org/abs/quant-ph/0302022"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "c4044216-bd91-45d6-a171-b386b152ccae",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}