mirror of
https://github.com/kristoferssolo/grovers-visualizer.git
synced 2025-10-21 20:10:35 +00:00
34 lines
1.0 KiB
Python
34 lines
1.0 KiB
Python
from collections.abc import Iterator
|
|
from itertools import product
|
|
from math import copysign, floor, pi, sqrt
|
|
|
|
from .state import QubitState
|
|
|
|
|
|
def all_states(n_qubits: int) -> Iterator[QubitState]:
|
|
"""Generate all possible QubitStates for n_qubits."""
|
|
for bits in product("01", repeat=n_qubits):
|
|
yield QubitState("".join(bits))
|
|
|
|
|
|
def optimal_grover_iterations(n_qubits: int) -> int:
|
|
"""Return the optimal number of Grover iterations for n qubits."""
|
|
return floor(pi / 4 * sqrt(2**n_qubits))
|
|
|
|
|
|
def is_optimal_iteration(iteration: int, optimal_iteration: int) -> bool:
|
|
return iteration == optimal_iteration
|
|
|
|
|
|
def get_bar_color(state: str, target_state: QubitState | None, iteration: int, optimal_iteration: int | None) -> str:
|
|
"""Return the color for a bar based on state and iteration."""
|
|
if state != target_state:
|
|
return "skyblue"
|
|
if optimal_iteration and is_optimal_iteration(iteration, optimal_iteration):
|
|
return "green"
|
|
return "orange"
|
|
|
|
|
|
def sign(x: float) -> int:
|
|
return int(copysign(1, x))
|