|
| related topics |
| {algorithm, log, probability} |
| {let, theorem, proof} |
| {time, systems, information} |
| {level, atom, field} |
| {energy, state, states} |
| {classical, space, random} |
| {cos, sin, state} |
|
On Computational Power of Quantum Branching Programs
Farid Ablayev, Aida Gainutdinova, Marek Karpinski
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.
- oai_identifier:
- oai:arXiv.org:quant-ph/0302022
- categories:
- quant-ph
- arxiv_id:
- quant-ph/0302022
- report_no:
- MSRI 2002-028
- created:
- 2003-02-03
Full article ▸
|
|
| related documents |
| 9905026v1 |
| 0207131v1 |
| 0011052v2 |
| 9706003v4 |
| 0505007v3 |
| 0511272v1 |
| 0201152v1 |
| 0109038v1 |
| 9903071v1 |
| 0306042v1 |
| 0206089v2 |
| 0010034v1 |
| 0106152v1 |
| 0504067v3 |
| 0609220v1 |
| 0010021v1 |
| 0610235v2 |
| 0304131v1 |
| 0403140v2 |
| 0305031v1 |
| 0607148v3 |
| 0410042v1 |
| 0609166v1 |
| 0401053v1 |
| 0303074v1 |
|