arXiv subjects

Arun Govindankutty

Publications and source records attributed to Arun Govindankutty.

4 recordsLinked to original sources

arXiv2026

The Quantum Learning Pyramid (QLP): A Novel, Holistic, Industry-Ready Curriculum and Pedagogical Methodology for Quantum Computing Education

Quantum computing education is becoming urgent as industry demand and national initiatives grow rapidly. This paper introduces the Quantum Learning Pyramid (QLP), a unified pedagogical framework for undergraduate and graduate education in quantum information and computing. The QLP follows a four-tier structure that integrates phenomenological understanding, computational thinking, hardware-aware development, and societal context. The curriculum is designed using spiral progression, competency-based pathways, and authentic assessment. Instruction is grounded in active and project-based learning, aligned with ACM/IEEE curriculum guidelines. Core topics include quantum mechanics fundamentals, qubit operations, and key algorithms, while advanced modules address error correction, cryptography, and quantum hardware. Hands-on learning is supported through simulation platforms, cloud-accessible quantum processors, and hybrid laboratory environments. Interdisciplinary case studies and real-system experimentation are embedded throughout. The proposed framework bridges theory and practice and provides a scalable roadmap for developing a quantum-ready workforce and scientifically informed citizens.

physics.ed-ph↗

arXiv2026

Bit-Vector Abstractions to Formally Verify Quantum Error Detection & Entanglement

As the number of qubits increases, quantum circuits become more complex and their state space grows rapidly. This makes functional verification challenging for conventional techniques. Ensuring correctness is especially critical for quantum error correction and entanglement generation. This paper presents a novel application of bit-vector based abstraction methodology for formal verification of quantum circuits where superposition and functional behaviour can be decoupled. The approach is applied to error detection circuits for 2-qubit, 3-qubit, and Shor 9-qubit quantum codes, as well as Bell-state and GHZ-state generation circuits. The error detection circuits and the Bell-state generation circuit are verified in less than a second and 25MB memory. GHZ circuits with up to 8,192 qubits are verified in under three minutes using a maximum of 23.2 GB of memory. The results demonstrate the versatility, scalability, and effectiveness of the proposed approach.

quant-ph↗

arXiv2026

Formally Verifying Quantum Phase Estimation Circuits with 1,000+ Qubits

We present a scalable formal verification methodology for Quantum Phase Estimation (QPE) circuits. Our approach uses a symbolic qubit abstraction based on quantifier-free bit-vector logic, capturing key quantum phenomena, including superposition, rotation, and measurement. The proposed methodology maps quantum circuit functional behaviour from Hilbert space to a bit-vector domain. We develop formal properties aligned with this abstraction to ensure functional correctness of QPE circuits. The method scales efficiently, verifying QPE circuits with up to 6 precision qubits and 1,024 phase qubits using under 7.5~GB of memory.

quant-ph↗

arXiv2023

Rotational Abstractions for Verification of Quantum Fourier Transform Circuits

With the race to build large-scale quantum computers and efforts to exploit quantum algorithms for efficient problem solving in science and engineering disciplines, the requirement to have efficient and scalable verification methods are of vital importance. We propose a novel formal verification method that is targeted at Quantum Fourier Transform (QFT) circuits. QFT is a fundamental quantum algorithm that forms the basis of many quantum computing applications. The verification method employs abstractions of quantum gates used in QFT that leads to a reduction of the verification problem from Hilbert space to the quantifier free logic of bit-vectors. Very efficient decision procedures are available to reason about bit-vectors. Therefore, our method is able to scale up to the verification of QFT circuits with 10,000 qubits and 50 million quantum gates, providing a meteoric advance in the size of QFT circuits thus far verified using formal verification methods.

quant-ph↗