Analysis of groups generated by quantum gates
David C. Gajewski · OhioLink ETD Center (Ohio Library and Information Network) · 2009
Different forms of computational systems, such as binary computers and Turing Machines, are known to be able to efficiently simulate each other.This is the basis We will see how SO 2n (Z[1/2]).H = (h ⊗ I) σ |σ ∈ P 2n , and that this suggests an algorithm which decomposes a quantum operator into a sequence of basic operators which are purely quantum or purely classical.This metric, and another based on buildings, will be explored.