Search arXiv⌕ Search

arXiv subjects

Harishankar Mishra

Publications and source records attributed to Harishankar Mishra.

3 recordsLinked to original sources

Deterministic Quantum Search for NP Problems Through Verifier-Based Oracle Construction

Problems in the class NP are important in computational science, where a given candidate solution can be verified in polynomial time, while finding a solution may require evaluating the entire search space in the worst case. Classical exhaustive approaches generally solve such problems by evaluating the verifier function over all possible inputs, resulting in a worst-case query complexity of O(N), where N = d^n represents the size of the search space, d is the number of possible values for each variable, and n is the number of variables. Quantum search algorithms can solve unstructured search problems more efficiently by reducing the query complexity to O(sqrt (N)), providing a quadratic speedup over classical exhaustive search. However, conventional quantum search formulations typically assume access to an oracle that identifies valid solutions, while standard implementations generally yield probabilistic success. In this work, we propose a generalised quantum oracle construction method for NP problems, together with a deterministic quantum search framework that identifies satisfying assignments using their corresponding classical verifier functions. The proposed framework retains the quadratic query speedup of quantum search over classical exhaustive search. We further establish that constructed oracle can be implemented using a number of gates polynomial in the size (L) of the binary encoding of verification function, consistent with the polynomial-time evaluation of the corresponding classical verifier, while the total qubit requirement remains O(poly(L)). The construction is demonstrated on multiple N-SAT instances, with circuit-level simulations confirming deterministic identification of satisfying assignments. These results establish the applicability of deterministic quantum search to NP problems while retaining the quadratic query advantage over classical exhaustive search.

quant-ph↗

Deterministic Quantum Search for Arbitrary Initial Success Probabilities

Unstructured search remains one of the significant challenges in computer science, as classical search algorithms become increasingly impractical for large-scale systems due to their linear time complexity. Quantum algorithms, notably Grover's algorithm, leverage quantum parallelism to achieve quadratic speedup over classical approaches. Its generalization, the amplitude amplification algorithm, extends this advantage to a broader class of search problems. However, both algorithms are inherently probabilistic and fail to guarantee success with certainty, also under the standard implementation of these algorithms, they offer no quantum advantage when the initial success probability exceeds 0.5. This work presents a deterministic quantum search algorithm that operates effectively for arbitrary initial success probabilities, providing guaranteed success in searching target states. The proposed approach introduces at most one additional iteration beyond the optimal count required by probabilistic quantum search algorithms. The algorithm preserves the quadratic speedup characteristic of quantum search methods. Additionally, an approach is proposed for the exact search of multiple target states within a bounded number of steps. A complete circuit-level implementation of the proposed algorithm is also presented.

quant-ph↗

Single-Round Deterministic Quantum Anonymous Veto Using Bell States

Quantum Anonymous Veto (QAV) protocols enable secure and anonymous decision-making by allowing participants to detect the presence of a veto without revealing individual choices. While existing QAV schemes offer strong theoretical guarantees, they face significant limitations in practical implementation due to resource requirements, scalability issues, and the need for multipartite entanglement. In this work, we propose a novel deterministic QAV protocol that leverages only bipartite entanglement in the form of Bell states and achieves conclusive veto detection in a single round. Our approach eliminates the need for multi-qubit entangled states and iterative rounds, thereby significantly reducing experimental overhead and enhancing scalability. The protocol preserves critical properties such as voter anonymity, correctness, and verifiability, making it well-suited for implementation on near-term quantum devices. Furthermore, we outline a practical photonic realization based on polarization-path encoding and discrete-time quantum walks, demonstrating its feasibility within current quantum optical platforms. This work contributes a resource-efficient and experimentally viable alternative to existing QAV schemes, advancing the prospects of secure quantum decision-making in distributed systems.

quant-ph↗