Search arXiv⌕ Search

arXiv · 2611.09830

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

Abstract

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Soumyajyoti Chatterjee, Harishankar Mishra, Asvija Balasubramanyam, S D Sudarsan, Gudapati Naresh Raghava. 2026-11-06. Deterministic Quantum Search for NP Problems Through Verifier-Based Oracle Construction. https://arxiv.org/abs/2611.09830

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Certified Lipschitz Bounds for Hybrid Quantum-Classical Decision Models

We study certified upper bounds on Lipschitz constants for hybrid quantum-classical decision models, which combine classical neural-network layers with parameterized quantum circuits. We pair an SDP-based certificate for classical layers with an exact spectral characterization for probability-output quantum models. For hybrid architectures, these componentwise estimates are connected through the encoding maps to obtain a certified composition bound for the complete model. The resulting bounds support sensitivity analyses relevant to robustness, stability, generalization, and fairness.

quant-ph↗

Quantum-to-classical transition and the emergence of trajectory level Darwinism with measurements distributed in time: a path integral approach

We present a formulation for the emergence of classical dynamics in a quantum world using a path integral approach that incorporates continuous measurements. It complements decoherence and coarse-grained measurement frameworks. The formulation provides the joint statistics of a sequence of measurements, with each Feynman path picking up a random phase proportional to the measurement strength, and we give conditions under which trajectories near classical paths dominate the probability amplitude. Information proliferates across the environment, a key feature of quantum Darwinism, via plane-wave probe scattering. In the continuous limit, momentum kicks from the probes add a further phase to each trajectory--the origin of the back-action force. We provide conditions under which measurements yield enough ``which-path'' information while keeping the wave packet localized. This describes the quantum-to-classical transition at the level of individual measurement records, complementing the ensemble description by density matrices. The same scattering that decoheres a trajectory also heats it, tying decoherence and measurement back-action together. This bounds how redundantly a classical trajectory can be recorded before back-action randomizes it into Brownian motion. The bound is not restrictive for macroscopic systems. For a trapped particle, it is set by the resolution in units of the zero-point motion and collapses to a single record where the semiclassical description of the orbit fails; for a free coordinate it marks the loss of deterministic objectivity even while the classical action remains large. In both cases, it delimits the regime in which objective classical trajectories exist. The crossover is driven by photon recoil, already resolved in levitated optomechanics; the bound recasts it as the point where a redundantly recorded trajectory, still objective, stops being deterministic.

quant-ph↗

Simulating Gaussian boson sampling on graphs in polynomial time

We show that a distribution related to Gaussian Boson Sampling (GBS) on graphs can be sampled classically in polynomial time. Graphical applications of GBS typically sample from this distribution, and thus quantum algorithms do not provide exponential speedup for these applications. We also show that another distribution related to Boson sampling can be sampled classically in polynomial time.

quant-ph↗