We consider the effects of plane-wave states scattering off finite graphs as an approach to implementing single-qubit unitary operations within the continuous-time quantum walk framework of universal quantum computation. Four semi-infinite tails are attached at arbitrary points of a given graph, representing the input and output registers of a single qubit. For a range of momentum eigenstates, we enumerate all of the graphs with up to
n=9 vertices for which the scattering implements a single-qubit gate. As
n increases, the number of new unitary operations increases exponentially, and for
n>6 the majority correspond to rotations about axes distributed roughly uniformly across the Bloch sphere. Rotations by both rational and irrational multiples of $\ensuremath{\pi}$ are found.
The Bloch sphere is an elegant tool for representing single-qubit states. However, a widely accepted generalization for multi-qubit systems with entanglement remains absent. We propose a novel geometric model extending the Bloch sphere representation to arbitrary
N-qubit systems using
2N−1 spheres. We demonstrate that any pure 2-qubit state is uniquely described by three spheres: two for individual qubits and a third encapsulating bipartite entanglement. Generalizing this, we establish an
N-qubit parameterization through the hierarchical application of controlled rotation gates along the
Z and
Y axes. We formally prove a strict bijection between the standard state vector representation and our model's angular parameters. This framework provides an intuitive visualization of multiple entanglement, offering potential computational advantages for quantum simulators and new analytical perspectives on quantum gates.
A unitary operator U=\sum u_{j,k} |k> ; 0 <= j <= 2^n-1}. These relative phases are often required in applications. Constructing quantum circuits for diagonal computations using standard techniques requires either O(n^2 2^n) controlled-not gates and one-qubit Bloch sphere rotations or else O (n 2^n) such gates and a work qubit. This work provides a recursive, constructive procedure which inputs the matrix coefficients of U and outputs such a diagram containing 2^{n+1}-3 alternating controlled-not gates and one-qubit z-axis Bloch sphere rotations. Up to a factor of two, these circuits are the smallest possible. Moreover, should the computation U be a tensor of diagonal one-qubit computations of the form R_z(α)=e^{-i α/2}|0><0|+ e^{i α/2} |1><1|, then a cancellation of controlled-not gates reduces our circuit to that of an n-qubit tensor.