On Computational Power of Quantum Branching Programs

Simple item page
dc.creatorAblayev, Farid
dc.creatorGainutdinova, Aida
dc.creatorKarpinski, Marek
dc.date2003-02-03
dc.date.accessioned2026-07-07T06:06:03Z
dc.date.available2026-07-07T06:06:03Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/quant-ph/0302022
dc.identifierhttp://arxiv.org/abs/quant-ph/0302022
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90844
dc.subjectQuantum Physics
dc.titleOn Computational Power of Quantum Branching Programs
dc.typetext

Files

Collections

arXiv