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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki Ročník 166; číslo 4; s. 470 - 484
Hlavní autor: Gainutdinova, A. F.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Kazan Federal University 22.12.2024
Témata:
branching program
complexity
hierarchy of complexity classes
nondeterminism
obdd
ordered binary decision diagram
quantum algorithm
ISSN:2541-7746, 2500-2198
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:   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