Quantum Ordered Binary Decision Diagrams with Repeated Tests

Simple item page
dc.creatorHomeister, Matthias
dc.creatorWaack, Stephan
dc.date2005-07-27
dc.date.accessioned2026-07-07T06:13:16Z
dc.date.available2026-07-07T06:13:16Z
dc.descriptionQuantum branching programs (quantum binary decision diagrams, respectively) are a convenient tool for examining quantum computations using only a logarithmic amount of space. Recently several types of restricted quantum branching programs have been considered, e. g. read--once quantum branching programs. This paper considers quantum ordered binary decision diagrams (QOBDDs) and answers the question: How does the computational power of QOBDDs increase, if we allow repeated tests. Additionally it is described how to synthesize QOBDDs according to Boolean operations.
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0507258
dc.identifierhttp://arxiv.org/abs/quant-ph/0507258
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93047
dc.subjectQuantum Physics
dc.titleQuantum Ordered Binary Decision Diagrams with Repeated Tests
dc.typetext

Files

Collections

arXiv