burn_quantum 0.2.0

Differentiable qubit and qudit simulation with Burn's native tensor and module APIs
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12

//! Grover search for classical Boolean CNF satisfiability.
//!
//! Clauses compile into reversible compute/phase/uncompute circuits, without
//! enumerating solutions or constructing a truth-table oracle. This is a dense
//! simulation, not a polynomial-time SAT algorithm or a solver for QMA quantum SAT.
mod cnf;
mod oracle;
mod search;

pub use cnf::Cnf;
pub use oracle::GroverSat;
pub use search::{SatOutcome, SearchConfig, SearchReport};