We investigate two fundamental data encoding strategies for gate-based quantum computers: amplitude encoding and angle encoding. In amplitude encoding, a normalized -dimensional classical vector is mapped into the probability amplitudes of a -qubit quantum state, whereas angle encoding uses one or more single-qubit rotation gates per feature to encode data as angles.[1, 2] We construct a toy binary classification dataset with four real-valued features and compare these encoding schemes using a variational quantum classifier (VQC) approach. Our results indicate that angle encoding often yields slightly higher classification accuracy (e.g. 82% vs. 75% in one experiment) at the cost of requiring more qubits, while amplitude encoding compresses features into fewer qubits (2 vs. 4) but demands deeper state-preparation circuits. These findings align with previous studies that report higher accuracy for rotation encodings (e.g. vs. in MNIST experiments [3]) and note that the encoding choice acts as a hyperparameter affecting VQC performance. [4]
We examine the time dependent amplitude $ ϕ_{j}\left( t\right)$ at each vertex
j of a continuous-time quantum walk on the cycle
Cn. In many cases the Lissajous curve of the real vs. imaginary parts of each $ ϕ_{j}\left( t\right)$ reveals interesting shapes of the space of time-accessible amplitudes. We find two invariants of continuous-time quantum walks. First, considering the rate at which each amplitude evolves in time we find the quantity
T=j=0∑n−1∣dtdϕj(t)∣2 is time invariant. The value of
T for any initial state can be minimized with respect to a global phase factor
eiθt to some value
Tmin. An operator for
Tmin is defined. For any simply connected graph
g the highest possible value of
Tmin with respect to the initial state is found to be
Tminmax=(2λmax)2 where
λmax is the maximum eigenvalue in the Laplace spectrum of
g. A second invariant is found in the time-dependent probability distribution
Pj(t)=∣ϕj(t)∣2 of any initial state satisfying
Tminmax, with these conditions
j=0∑n−1(Pjmax−Pjmin)2=n4 for all simply connected graphs of
n vertices.
We have observed that Hadamard matrices whether real or complex lead to a dense output of identical probabilities for any given single input state. Complex Hadamard matrices have unusual orders and introduce phase which prove useful when controlled phase transformation gates are used. By taking a superposed combinations of input states, we discovered that the Hadamards generate non-uniform probabilities which is practically significant towards amplitude amplification without the need for manual parameterization like Grover's operator~\cite{grover1996}. A variety of graph theoretic properties are applied to TSS graphs and their trends were explored. Additionally, graphs turn out to be nearly isomorphic for the same set of input states which has potential applications for developing Quantum Algorithms.
Keywords: Quantum Algorithms, Hadamard Matrices, Unitary Matrix Approach, Topological Structure of Superpositions (TSS), Graph Theory