2024/01/24 by Bibhas Adhikari, Adhikari, Bibhas, Aryan Jha +1
Computer Science · #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata #Symbolic Computation (cs.SC)
paper · pdf · doi:10.48550/arxiv.2401.13156
openalex publication_date 2024/01/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we develop a classical algorithm of complexity O(K 2n) to simulate parametrized quantum circuits (PQCs) of n qubits, where K is the total number of one-qubit and two-qubit control gates. The algorithm is developed by finding 2-sparse unitary matrices of order 2n explicitly corresponding to any single-qubit and two-qubit control gates in an n-qubit system. Finally, we determine analytical expression of Hamiltonians for any such gate and consequently a local Hamiltonian decomposition of any PQC is obtained. All results are validated with numerical simulations.