Paper Info
Title
On the Ohya-Masuda Quantum SAT Algorithm
Abstract
Using a new explicit form of some of the gates involved, we propose a variant of the Ohya-Masuda quantum SAT algorithm which allows to reduce the dimensions of the dust-q-bit spaces and to perform a constructive analysis of its complexity. We use this algorithm to introduce a kind of absolute measure of truth for different sets of clauses, measured in terms of the cardinality of the set of truth functions which gives a value 1 to the given set of clauses.
Year
DOI
Venue
2000
10.1007/978-1-4471-0313-4_1
UMC
Keywords
Field
DocType
ohya-masuda quantum sat algorithm
Quantum,Binary strings,Computer science,Algorithm,Quantum computer,Cardinality,Truth function,Constructive analysis,Toffoli gate
Conference
ISBN
Citations 
PageRank 
1-85233-415-0
2
1.02
References 
Authors
2
2
Name
Order
Citations
PageRank
Luigi Accardi1116.36
Ruben Sabbadini221.02