Struct qvm::QVM

pub struct QVM { /* fields omitted */ }

Implementations

impl QVM

pub fn new(n: usize) -> QVM

pub fn get_bits(&self) -> usize

pub fn is_superposition(&self, n: usize) -> bool

impl QVM

pub fn set_superposition(&mut self, address: usize, value: u8) -> Option<bool>

pub fn measure(&mut self, address: usize) -> Option<u8>

impl QVM

To calculate all qubit, we need (2^n)x(2^n) size huge matrix and computation time is O(4^n) mathmetically. However, we need only use fucntion that performs linear transformation for better performance. Computation time of this implement is O(2^n).

pub fn pass_gate(&mut self, gate: Gate, addresses: Vec<usize>) -> Option<bool>

impl QVM

pub fn print_register(&self)