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

Full description

Saved in:

Bibliographic Details
Published in:	Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki Vol. 166; no. 4; pp. 470 - 484
Main Author:	Gainutdinova, A. F.
Format:	Journal Article
Language:	English
Published:	Kazan Federal University 22.12.2024
Subjects:	branching program complexity hierarchy of complexity classes nondeterminism obdd ordered binary decision diagram quantum algorithm
ISSN:	2541-7746, 2500-2198
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!