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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Garey and D. Johnson, Computers and Intractability — a Guide to the Theory of NP-Completeness, Freeman, 1979.
T. Toffoli, Computation and construction universality of reversible cellular automata, Journal of Computer and System Sciences 15, (1977), 213.
M. Ohya, Mathematical Foundation of Quantum Computer, Maruzen Publ. Company, 1998.
M. Ohya and N. Masuda, NP problem in Quantum Algorithm, quant-ph/9809075.
M. Ohya, I.V. Volovich, Quantum computing, NP-complete problems and chaotic dynamics, Preprint Vito Volterra N426, 2000, Università degli Studi di Roma “Tor Vergata”.
M. Ohya, N. Watanabe, On Mathematical treatment of Fredkin-Toffoli-Milburn gate, Physica D, 120 (1998), 206–213
I.V. Volovich, Quantum Computers and Neural Networks, Invited talk at the International Conference on Quantum Information, Meijo University, 4-8 Nov. 1997.
I.V. Volovich, Mathematical models of quantum computers and quantum decoherence problem, in the volume dedicated to V.A. Sadovnichij, Moscow State University, 1999, to be published.
I.V. Volovich, Quantum Kolmogorov Machine, Invited talk at the International Conference on Quantum Information, Meijo University, 4-8 Nov. 1997.
I.V. Volovich, Atomic Quantum Computer, quant-ph/9911062; Preprint Vito Volterra N403, 1999, Università degli Studi di Roma “Tor Vergata”.
I.V. Volovich, Models of quantum computers and decoherence problem, Preprint Vito Volterra N358, 1999, Università degli Studi di Roma “Tor Vergata”.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag London
About this paper
Cite this paper
Accardi, L., Sabbadini, R. (2001). On the Ohya-Masuda Quantum SAT Algorithm. In: Antoniou, I., Calude, C.S., Dinneen, M.J. (eds) Unconventional Models of Computation, UMC’2K. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0313-4_1
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0313-4_1
Publisher Name: Springer, London
Print ISBN: 978-1-85233-415-4
Online ISBN: 978-1-4471-0313-4
eBook Packages: Springer Book Archive