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

Celý popis

Podrobná bibliografia

Vydané v:	Natural computing Ročník 22; číslo 4; s. 723 - 736
Hlavní autori:	Khadiev, Kamil, Khadieva, Aliya, Knop, Alexander
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Dordrecht Springer Netherlands 01.12.2023
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!