Optimal Scalarization Functions for Neutrosophic Quantum Search
Saeid Jafari
Quantum search algorithms provide a quadratic speedup for a broad class of unstructured search problems. In practical settings, however, the classification of a candidate as “good” or “bad” may itself contain uncertainty, indeterminacy, or contradictory information. Neutrosophic sets provide a natural mathematical language for representing such information through independent truth, indeterminacy, and falsity degrees. In this paper we introduce a scalarization framework for neutrosophic quantum search. The central idea is to transform a neutrosophic evaluation N = (T, I, F) into a real-valued utility while preserving the distinction between truth, indeterminacy, and falsity. We introduce a parameterized family of weighted scalarization functions and establish conditions under which these functions are normalized, monotone, continuous, and order-preserving. We then define an optimization criterion for choosing scalarization parameters according to the requirements of a quantum search problem. A neutrosophic quantum oracle is modeled by assigning a neutrosophic evaluation to each computational basis state. The resulting scalarized oracle determines the effective marked-state amplitude. We derive an explicit relationship between scalarized utility and the number of amplitude-amplification iterations. Several scalarization functions, including linear, nonlinear, entropy-sensitive, and indeterminacy-penalized forms, are compared. A theoretical criterion based on discrimination, robustness, and indeterminacy sensitivity is proposed. The resulting framework provides a mathematically explicit bridge between neutrosophic decision theory and quantum amplitude amplification.
•Sep 29, 2026•0 citations