oxicuda_quantum/algorithm/
mod.rs

1//! Canonical quantum algorithms built on the state-vector simulator.
2//!
3//! This module collects textbook oracle-based and communication algorithms that
4//! showcase quantum advantage on top of the primitives in [`crate::statevec`]
5//! and [`crate::gates`]:
6//!
7//! * [`mod@grover`] — Grover's unstructured search (quadratic query speed-up).
8//! * [`mod@deutsch_jozsa`] — single-query constant-vs-balanced decision.
9//! * [`mod@bernstein_vazirani`] — single-query hidden-string recovery.
10//! * [`mod@teleportation`] — single-qubit state transfer via a Bell pair + 2 cbits.
11//! * [`mod@superdense`] — two classical bits sent through one qubit + a Bell pair.
12//! * [`mod@simon`] — exponential-speed-up hidden-period recovery (Shor precursor).
13//! * [`mod@shor`] — order-finding subroutine + classical factoring reduction.
14//! * [`mod@error_correction`] — GHZ/W state prep + 3-qubit bit/phase-flip codes.
15
16pub mod bernstein_vazirani;
17pub mod deutsch_jozsa;
18pub mod error_correction;
19pub mod grover;
20pub mod shor;
21pub mod simon;
22pub mod superdense;
23pub mod swap_test;
24pub mod teleportation;
25
26pub use bernstein_vazirani::{BernsteinVaziraniResult, bernstein_vazirani};
27pub use deutsch_jozsa::{DeutschJozsaResult, FunctionKind, deutsch_jozsa};
28pub use error_correction::{
29    bit_flip_correct, bit_flip_encode, phase_flip_correct, phase_flip_encode, prepare_ghz,
30    prepare_w,
31};
32pub use grover::{GroverResult, grover_search, marked_probability, optimal_iterations};
33pub use shor::{
34    OrderFindingResult, ShorResult, classical_order, continued_fraction_convergents,
35    factor_from_order, gcd, mod_exp, order_finding, shor_factor,
36};
37pub use simon::{SimonResult, recover_period_from_constraints, simon};
38pub use superdense::{SuperdenseResult, superdense_decode};
39pub use swap_test::{hadamard_test, swap_test};
40pub use teleportation::{TeleportResult, teleport};
oxicuda_quantum/algorithm/mod.rs

oxicuda_quantum/algorithm/
mod.rs
