Struct Grover 

pub struct Grover { /* private fields */ }

Grover’s search algorithm for unstructured search.

Provides quadratic speedup: O(√N) vs O(N) classical.

Example

use logosq_algorithms::{Grover, Oracle};

let oracle = Oracle::from_marked_states(&[5], 3);
let grover = Grover::new(oracle).unwrap();
let result = grover.run(1000).unwrap();

Implementations

impl Grover

pub fn new(oracle: Oracle) -> Result<Self, AlgorithmError>

Create a new Grover search instance.

pub fn with_iterations(self, iterations: usize) -> Self

Set a specific number of iterations (overrides optimal calculation).

pub fn optimal_iterations(&self) -> usize

Calculate the optimal number of iterations.

Optimal iterations ≈ π/4 × √(N/M)

pub fn build_circuit(&self) -> Result<Circuit, AlgorithmError>

Build the Grover circuit.

pub fn run(&self, shots: u32) -> Result<GroverResult, AlgorithmError>

Run Grover’s algorithm.