Searcharxiv⌕ Search

arXiv subjects

Kamalika Datta

Publications and source records attributed to Kamalika Datta.

4 recordsLinked to original sources

A Unified Benchmarking Study of Variational Quantum Eigensolver Ansatz for Electronic Structure Problems

Electronic structure calculations become computationally expensive on classical computers as electron correlation increases. Quantum computing offers a promising alternative through hybrid quantum-classical Variational Quantum Eigensolver (VQE) on Noisy-Intermediate Scale Quantum (NISQ) devices. The choice of ansatz plays a pivotal role in the performance and scalability of the VQE, yet selecting an optimal ansatz remains challenging. Existing approaches including chemically inspired ansatz, adaptive schemes and Hardware Efficient Ansätze (HEA) lack a unified comparison. This gap makes the scalability and trade-offs of each method unclear for varying molecular sizes. This work presents a systematic benchmarking study comparing Unitary Couples Cluster Singles and Doubles Ansatz (UCCSD), fermionic ADAPT-VQE, BasicPCA HEA, and Excitation Preserving HEA across molecules of varying size like $H_2$, $LiH$, $N_2$. We evaluate trade-offs among circuit depth, parameter count, ground-state energy error, and NISQ feasibility. ADAPT-VQE achieves accuracy comparable to UCCSD with lower resource overhead, but becomes impractical for modest system sizes ($\sim$10 electrons) due to increasing circuit complexity. In contrast, HEA reduces hardware costs but requires more parameters and sacrifices accuracy, with performance strongly dependent on molecular size. The Excitation Preserving ansatz remains below chemical accuracy for $H_2$ and $LiH$, and fails for $N_2$, underscoring the need to balance expressibility and trainability. Overall, these results highlight key trade-offs between accuracy and resource efficiency across VQE ansätze, emphasizing the need to improve ADAPT-VQE scalability and HEA accuracy while addressing optimization challenges for near-term quantum hardware.

quant-ph↗

TRACE: Traversal and Reasoning Algebraic Computing Engine for Formal Hardware Verification

Modern hardware verification of complex circuits relies heavily on the efficiency of formal methods. For complex arithmetic circuits in particular Symbolic Computer Algebra (SCA) engines which represent pseudo-boolean functions using polynomials are crucial. As circuit complexity grows in the age of AI, verification of arithmetic primitives, including Multiplication, Addition, Multiply-Accumulate (MAC), becomes a computational bottleneck. To address this, we introduce TRACE (Traversal and Reasoning Algebraic Computing Engine), a highly efficient framework designed to investigate the intersection of traversal strategies and proof efficiency. Unlike existing SCA tools which are mainly limited to multipliers, TRACE offers a flexible framework for researchers to analyze memory usage and verification time across a wide range of arithmetic circuits (adder, multiplier and MAC). To overcome the state-explosion problem inherent in polynomial expansion, the engine incorporates advanced reduction techniques, including optimized traversal strategies, conflict removal, and polarity-based optimization for compact symbolic representations. Our experimental results show that for optimized MAC, for the first time, TRACE was able to verify previously unverifiable circuits

cs.AR↗

qSAT: Design of an Efficient Quantum Satisfiability Solver for Hardware Equivalence Checking

The use of Boolean Satisfiability (SAT) solver for hardware verification incurs exponential run-time in several instances. In this work we have proposed an efficient quantum SAT (qSAT) solver for equivalence checking of Boolean circuits employing Grover's algorithm. The Exclusive-Sum-of-Product based generation of the Conjunctive Normal Form equivalent clauses demand less qubits and minimizes the gates and depth of quantum circuit interpretation. The consideration of reference circuits for verification affecting Grover's iterations and quantum resources are also presented as a case study. Experimental results are presented assessing the benefits of the proposed verification approach using open-source Qiskit platform and IBM quantum computer.

quant-ph↗

Exact Synthesis of Reversible Logic Circuits using Model Checking

Synthesis of reversible logic circuits has gained great atten- tion during the last decade. Various synthesis techniques have been pro- posed, some generate optimal solutions (in gate count) and are termed as exact, while others are scalable in the sense that they can handle larger functions but generate sub-optimal solutions. Although scalable synthe- sis is very much essential for circuit design, exact synthesis is also of great importance as it helps in building design library for the synthesis of larger functions. In this paper, we propose an exact synthesis technique for re- versible circuits using model checking. We frame the synthesis problem as a model checking instance and propose an iterative bounded model checking calls for an optimal synthesis. Experiments on reversible logic benchmarks shows successful synthesis of optimal circuits. We also illus- trate optimal synthesis of random functions with as many as 10 variables and up to 10 gates.

cs.ET↗