Quantum and classical nondeterministic OBDDs

   A model of nondeterministic ordered binary decision diagrams (NOBDDs) was analyzed. A method for proving a lower bound on the complexity of quantum NOBDDs was developed. Two functions were introduced: one function has linear complexity in the quantum NOBDD but constant complexity in the classical...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki Jg. 166; H. 4; S. 470 - 484
1. Verfasser: Gainutdinova, A. F.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Kazan Federal University 22.12.2024
Schlagworte:
branching program
complexity
hierarchy of complexity classes
nondeterminism
obdd
ordered binary decision diagram
quantum algorithm
ISSN:2541-7746, 2500-2198
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:   A model of nondeterministic ordered binary decision diagrams (NOBDDs) was analyzed. A method for proving a lower bound on the complexity of quantum NOBDDs was developed. Two functions were introduced: one function has linear complexity in the quantum NOBDD but constant complexity in the classical NOBDD, while the other function demonstrates the same complexity in both quantum and classical NOBDD models. The relationships among the complexity classes specific to the OBDD model were described.
ISSN:2541-7746
2500-2198
DOI:10.26907/2541-7746.2024.4.470-484