Ising Hamiltonians are basic models of disordered magnets and a standard language for quantum and classical optimization. We study an energy-selective quantum search primitive in which the physical evolution \(\exp(-\mathrm{i} T H)\) is used directly as a Hamiltonian phase oracle. Unlike a Boolean oracle, this oracle marks configurations continuously by their phases and selects a finite resonance band rather than a preassigned marked set. We show that alternating it with the Grover diffusion operator nevertheless produces a Grover-type amplification peak. An exact spectral recurrence and a generating-function representation determine the peak position, width, and height. For an annealed Gaussian density of states, target energies in a high-density tail require \(Θ(\sqrt{2^n/M})\) oracle calls when the resonance contains \(M\) configurations. For random Ising spectra, overlap-induced correlations shift and distort the peak; spectral symmetrization and iterative calibration remove this detuning for prescribed-energy targeting.
Ising Hamiltonians are basic models of disordered magnets and a standard language for quantum and classical optimization. We study an energy-selective quantum search primitive in which the physical evolution (\exp(-\mathrm{i} T H)) is used directly as a Hamiltonian phase oracle. Unlike a Boolean oracle, this oracle marks configurations continuously by their phases and selects a finite resonance band rather than a preassigned marked set. We show that alternating it with the Grover diffusion operator nevertheless produces a Grover-type amplification peak. An exact spectral recurrence and a generating-function representation determine the peak position, width, and height. For an annealed Gaussian density of states, target energies in a high-density tail require (Θ(\sqrt{2^n/M})) oracle calls when the resonance contains (M) configurations. For random Ising spectra, overlap-induced correlations shift and distort the peak; spectral symmetrization and iterative calibration remove this detuning for prescribed-energy targeting.
This archive contains the numerical data and scripts used to generate the figures for the paper “Energy-selective quantum search with Ising Hamiltonian phase oracles”. The main numerical dataset is used for the scaling analysis of the correlation-induced resonance displacement φ₀ in the zero-field random Ising ensemble. The simulations use dimensionless units with σ_J = 1 and the Hamiltonian H(s) = 2 sum_{i<j} J_ij s_i s_j, where the couplings are independent Gaussian random variables, J_ij ~ N(0, 1), and h_i = 0. For each random Ising instance, the archive stores the truncated characteristic-function coefficients g_m = 2^{-n} Tr exp(-i m T H), m = 0, ..., 15. These coefficients are used to extract the local displacement φ₀ from the zero of the imaginary part of the response function C(φ) = 2 sum_{m=0}^{15} g_m (-1)^m exp(i m φ) - 1. The quantity plotted in the paper is the disorder-averaged second moment <φ₀²> and the scaled combination n⁶<φ₀²>. The Monte Carlo average is over independent disorder realizations only. For each realization, the trace over spin configurations is evaluated deterministically. The data cover even system sizes n = 18, 20, 22, ..., 36. For the largest systems, the computation splits the spins into two equal halves, performs GPU block contractions, and uses the zero-field spin-flip symmetry H(s)=H(-s) to reduce the sum by a factor of two. Archive contents - scripts/01_generate_phi0_coefficients.py Generates the characteristic-function coefficient files g_m for the random Ising ensemble. - scripts/02_analyze_phi0_scaling.py Computes φ₀, bootstrap confidence intervals, the finite-n covariance-sum comparison, and the scaling plots. - scripts/03_make_gaussian_amplification.py Generates the Gaussian amplification figure used as Fig. 1 in the paper. - data/phi0_coefficients/ Directory for the NumPy .npz files containing the characteristic-function coefficients. The production files have names of the form Nq_<n>_K_<K>.npz. The .npz files are saved without pickle objects. They can be read with standard NumPy using np.load. Typical usage To regenerate the Gaussian amplification figure: python scripts/03_make_gaussian_amplification.py --output-dir output/fig1_gaussian To analyze the φ₀ scaling data: python scripts/02_analyze_phi0_scaling.py \ --data-dir data/phi0_coefficients \ --output-dir output/phi0_scaling To run a short test calculation of the characteristic-function coefficients: python scripts/01_generate_phi0_coefficients.py \ --smoke-test \ --output-dir output/smoke_test_coefficients To regenerate the full production dataset on a CUDA-capable GPU: python scripts/01_generate_phi0_coefficients.py \ --production \ --output-dir data/phi0_coefficients The production calculations were performed using CuPy on an NVIDIA GPU. The analysis and plotting scripts use NumPy, pandas, and Matplotlib.
Grover’s algorithm provides a quadratic speedup for unstructured search and represents one of the most fundamental primitives of quantum computation. However, its practical performance can be sensitive to the precise choice of the iteration count, which depends on the number of marked elements. This sensitivity becomes more pronounced when the density of solutions increases, where even small inaccuracies in estimating the number of marked states may lead to overshooting of the target subspace and a corresponding drop in success probability. In this work we introduce a density-aware parametrization of Grover search in which the phase rotations of the Grover operator are computed explicitly as a function of the solution density. The resulting construction can be interpreted as a density-dependent instantiation of Høyer’s arbitrary-phase amplitude amplification framework. The resulting operator performs a controlled rotation in the two–dimensional search subspace and naturally interpolates between sparse and dense regimes of the search space. We provide a theoretical analysis of the resulting dynamics and show that the proposed parametrization stabilizes the amplification process across a wide range of solution densities. Numerical simulations demonstrate that the method maintains near–optimal success probability for densities where the standard Grover algorithm becomes unstable, while also exhibiting improved robustness with respect to errors in estimating the number of marked states. These results suggest that density-aware phase parametrizations offer a simple yet effective strategy for extending the practical applicability of Grover-style quantum search procedures.
Abstract Noise-assisted quantum dynamics can produce useful transport and detection effects, but conclusions drawn from individual stochastic trajectories may not persist under ensemble averaging. We assess a closed-system model in which selected computational-basis states are assigned unit energy in a diagonal Hamiltonian and coupled by a transverse term whose scalar amplitude is independently sampled from a zero-mean Gaussian distribution at each timestep. Four configurations containing 2, 3, and 10 qubits were simulated using sparse exponential propagation. For each original parameter setting, 100 seeded trajectories were compared with zero-perturbation and constant-coupling controls. At the originally proposed weak perturbation strengths, none of the four configurations showed a statistically resolved increase in final marked-state population: all 95% confidence intervals included the uniform baseline. Perturbation-strength sweeps revealed configuration-dependent responses at larger amplitudes, including increased population for one three-qubit configuration, but no universal marked-state amplification or established stochastic-resonance regime. The marked set must also be supplied when constructing the Hamiltonian, so eliminating an explicit phase-oracle circuit does not eliminate its information-encoding role. These results recast the model as an exploratory study of stochastically modulated energy-marked dynamics rather than an oracle-free search algorithm. The work demonstrates the importance of seeded ensembles, controls, and operational detection criteria when evaluating noise-assisted quantum-computing proposals.
Grover's algorithm achieves a quadratic speedup for unstructured search given a global oracle for the target set. In many applications, however, the target set is specified as the intersection of multiple constraint sets. Constructing a global oracle for the intersection can be costly, whereas the individual constraint oracles are often much simpler to implement.
We study a randomized Grover search algorithm that directly uses these constraint oracles. At each iteration, one of the corresponding Grover operators is selected at random. For the two-operator case with uniform sampling, we prove that the success probability approaches one after Θ(4πrN) iterations, where r is the size of the intersection. Thus, the algorithm achieves the same asymptotic query complexity as standard Grover search but without requiring a global oracle. We then generalize the analysis to arbitrary sampling distributions and an arbitrary number of Grover operators through an auxiliary operator that approximates the expected Grover evolution, while retaining the same asymptotic complexity. We further show that highly biased sampling distributions can still achieve near-unit success probability, enabling cheaper Grover operators to be used more frequently. Finally, we prove asymptotic optimality and support the theoretical results with numerical simulations.
Abstract This guide is based on the IBM Quantum course Phase Estimation and Factoring and focuses on Grover’s algorithm, a quantum algorithm for unstructured search problems that provides a quadratic speedup over classical approaches. In an unstructured search problem, we are given a function (often represented as an oracle) that marks one or more “correct” solutions among NNN possible candidates. A classical algorithm requires on the order of O(N)O(N)O(N) evaluations in the worst case. In contrast, Grover’s algorithm finds a solution using only O(N)O(\sqrt{N})O(N) oracle queries. This quadratic improvement implies: The quantum algorithm requires roughly the square root of the number of operations needed classically. Any classical algorithm for unstructured search must have cost at least quadratic relative to Grover’s quantum procedure. Core Idea of the Algorithm Grover’s algorithm relies on: Preparation of a uniform superposition (typically using Hadamard gates). An oracle that marks valid solutions via phase inversion. The Grover diffusion operator, which amplifies the probability amplitude of the marked states through interference. By repeatedly applying the Grover operator, the amplitude of the desired solution grows while others diminish, allowing measurement to reveal the correct answer with high probability. Practical Considerations Despite its theoretical elegance and wide applicability, the quadratic speedup of Grover’s algorithm is unlikely to yield near-term practical advantage. Modern classical hardware operates at extremely high clock rates and is vastly more mature than current quantum devices. For problem sizes accessible to today’s quantum computers, classical systems remain dominant. However, history shows that even sub-quadratic classical improvements — such as: Fast Fourier Transform (FFT) Efficient sorting algorithms like quicksort and mergesort have had transformative practical impact. The crucial distinction is that Grover’s algorithm depends on fundamentally different hardware — quantum processors — which are still in early development. Long-Term Perspective As quantum hardware advances in qubit count, coherence time, and error correction, Grover’s quadratic advantage may become practically significant for: Cryptographic key search Optimization heuristics Combinatorial search problems Amplitude amplification subroutines in broader quantum algorithms Through hands-on experimentation on IBM Q, this lesson demonstrates how theoretical amplitude amplification translates into executable quantum circuits, reinforcing the relationship between interference, probability amplitudes, and computational complexity.
Grover's search algorithm was originally proposed for circuit-based quantum computers. A crucial part of it is to query an oracle -- a black-box unitary operation. Generation of this oracle is formally beyond the original algorithm design. Here, we propose a realization of Grover's oracle for a large class of searching problems using a quantum annealing step. The time of this step grows only logarithmically with the size of the database. This suggests an efficient path to application of Grover's algorithm to practically important problems, such as finding the ground state of a Hamiltonian with a spectral gap over its ground state.