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

Full description

Bibliographic Details

Published in:	Natural computing Vol. 22; no. 4; pp. 723 - 736
Main Authors:	Khadiev, Kamil, Khadieva, Aliya, Knop, Alexander
Format:	Journal Article
Language:	English
Published:	Dordrecht Springer Netherlands 01.12.2023
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!