On Computational Power of Quantum Branching Programs
量子物理
2007-05-23 v1
摘要
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.
引用
@article{arxiv.quant-ph/0302022,
title = {On Computational Power of Quantum Branching Programs},
author = {Farid Ablayev and Aida Gainutdinova and Marek Karpinski},
journal= {arXiv preprint arXiv:quant-ph/0302022},
year = {2007}
}