Searcharxiv⌕ Search

arXiv subjects

Sina Asadiyan Zargar

Publications and source records attributed to Sina Asadiyan Zargar.

2 recordsLinked to original sources

Parallel Data Processing in Quantum Machine Learning

We propose a Quantum Machine Learning (QML) framework that applies the core design principle of quantum algorithms-superposition, oracle, and interference-to accelerate training. Building on the structural analogy between feature extraction in foundational quantum algorithms and parameter optimization in QML, we reformulate the training process to leverage quantum parallelism: all training samples are encoded into a quantum superposition, processed through a parameterized quantum circuit, and classified via an interferometer module that implements quantum interference across the dataset. This architectural reformulation reduces the theoretical complexity of loss function evaluation from $O(N^{2})$ in conventional QML training to $O(N)$, where $N$ is the dataset size. Numerical simulations on multiple binary and multi-class classification datasets (with up to $N=128$ samples) demonstrate that our method achieves classification accuracies comparable to conventional circuits while reducing the number of quantum circuit executions per cost function evaluation from $N$ to 1. This represents a near $N$-fold reduction in quantum overhead per training iteration, reducing the required circuit executions without loss of accuracy. These results highlight the potential of quantum algorithmic design principles as a scalable pathway to efficient QML implementations.

quant-ph↗

Learning Hamiltonians for $O(1)$ Oracle-Query Quantum State Preparation

We propose a Hamiltonian-based quantum state preparation method implemented via a shallow parametrized quantum circuit. The approach learns the parameters of a diagonal Hamiltonian through a classical training phase, while the quantum circuit itself performs only fixed-depth Hamiltonian evolution and mixing operations. With oracle access to the learned Hamiltonian parameters, $N$ classical data values can be encoded into $n=\log_2{N}$ qubits using $O(1)$ quantum queries, shifting the overall computational cost to an $O(N\log{N})$ classical preprocessing stage. For structured datasets generated by an underlying function, oracle access can be avoided by expressing the Hamiltonian in the Walsh basis and retaining only a polynomial number of significant terms. In this regime, quantum state preparation is achieved in $\text{poly}(n)$ time using $\text{poly}(n)$ parameters, reaching infidelities on the order of $10^{-5}$. By restricting the Hamiltonian to one-local and two-local terms, the method naturally yields hardware-efficient circuits suitable for near-term quantum devices.

quant-ph↗