Exponential separation between quantum and classical ordered binary decision diagrams, reordering method and hierarchies

In this paper, we study quantum Ordered Binary Decision Diagrams( OBDD ) model; it is a restricted version of read-once quantum branching programs, with respect to “width” complexity. It is known that the maximal gap between deterministic and quantum complexities is exponential. But there are few ex...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Natural computing Jg. 22; H. 4; S. 723 - 736
Hauptverfasser:	Khadiev, Kamil, Khadieva, Aliya, Knop, Alexander
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Dordrecht Springer Netherlands 01.12.2023
Schlagworte:	Artificial Intelligence Complex Systems Computer Science Evolutionary Biology Processor Architectures Theory of Computation Branching programs Hierarchy Quantum computing Quantum vs classical OBDD Probabilistic OBDD Quantum OBDD Quantum models Computational complexity
ISSN:	1567-7818, 1572-9796
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!