q5m.js - Quantum Computing Library - v0.1.1
    Preparing search index...

    Function groverSearch

    • Implements Grover's quantum search algorithm using Amplitude Amplification.

      Grover's algorithm provides quadratic speedup for searching unsorted databases. This implementation uses the general Amplitude Amplification framework, which ensures theoretical correctness and optimal performance.

      Algorithm Overview:

      1. Initialization: Create uniform superposition over all states
      2. Amplitude Amplification: Apply oracle + diffusion iterations
      3. Measurement: Obtain marked states with high probability

      Theoretical Speedup:

      • Classical search: O(N) expected time
      • Grover's algorithm: O(√N) expected time
      • Success probability: ~1 with optimal iterations

      Parameters

      • numQubits: number

        Number of qubits (search space size = 2^numQubits)

      • oracle: AmplitudeOracle

        Function that identifies marked items

      • options: GroverOptions = {}

        Configuration options for the algorithm

      Returns Circuit

      Circuit implementing Grover's algorithm

      If numQubits < 1 or no marked items exist

    Settings

    Member Visibility