arXiv subjects

Praveen Jayakumar

Publications and source records attributed to Praveen Jayakumar.

5 recordsLinked to original sources

arXiv2025

On the Feasibility of Exact Unitary Transformations for Many-body Hamiltonians

Exact unitary transformations play a central role in the analysis and simulation of many-body quantum systems, yet the conditions under which they can be carried out exactly and efficiently remain incompletely understood. We show that exact transformations arise whenever the adjoint action of a unitary's generator defines a linear map within a finite-dimensional operator space. In this regime, there exists a finite-degree polynomial that annihilates the adjoint map, rendering the Baker-Campbell-Hausdorff (BCH) expansion finite. We identify the role of Lie algebras and their modules in producing finite BCH expansions in all known cases. This perspective brings together previously disparate examples of exact transformations under a single unifying principle and clarifies how algebraic relations between generators and transformed operators determine the polynomial degree of the transformation. We illustrate this framework for previously known cases of efficient unitary transformations including unitary coupled-cluster and Pauli product generators. Using this framework, we propose a new class of fermionic generators that can be used for efficient transformations. The result establishes sufficient algebraic conditions for when exact unitary transformations are possible and provides new strategies for reducing their computational cost in quantum simulation and constructing feasible unitary transformations.

quant-ph↗

arXiv2025

Quantum Seniority-based Subspace Expansion: Linear Combinations of Short-Circuit Unitary Transformations for the Electronic Structure Problem

Quantum SENiority-based Subspace Expansion (Q-SENSE) is a hybrid quantum-classical algorithm that interpolates between the Variational Quantum Eigensolver (VQE) and Configuration Interaction (CI) methods. It constructs Hamiltonian matrix elements on a quantum device and solves the resulting eigenvalue problem classically. Unlike other expansion-based methods -- such as Quantum Subspace Expansion (QSE), Quantum Krylov Algorithms, and the Non-Orthogonal Quantum Eigensolver -- Q-SENSE introduces seniority operators as artificial symmetries to construct orthogonal basis states. This seniority-symmetry-based approach reduces one of the primary limitations of VQE on near-term quantum hardware -- circuit depth -- at the cost of measuring additional matrix elements. The artificial symmetries also reduce the number of Hamiltonian terms that must be measured, as only a small fraction of the terms couple basis states in different seniority subspaces. With all these merits, Q-SENSE offers a scalable and resource-efficient route to quantum advantage on near-term quantum devices and in the early fault-tolerant regime.

quant-ph↗

arXiv2025

Quantum Measurement for Quantum Chemistry on a Quantum Computer

Quantum chemistry is among the most promising applications of quantum computing, offering the potential to solve complex electronic structure problems more efficiently than classical approaches. A critical component of any quantum algorithm is the measurement step, where the desired properties are extracted from a quantum computer. This review focuses on recent advancements in quantum measurement techniques tailored for quantum chemistry, particularly within the second quantized framework suitable for current and near-term quantum hardware. We provide a comprehensive overview of measurement strategies developed primarily for the Variational Quantum Eigensolver (VQE) and its derivatives. These strategies address the inherent challenges posed by complexity of the electronic Hamiltonian operator. Additionally, we examine methods for estimating excited states and one- and two-electron properties, extending the applicability of quantum algorithms to broader chemical phenomena. Key aspects of the review include approaches for constructing measurement operators with reduced classical preprocessing and quantum implementation costs, techniques to minimize the number of measurements required for a given accuracy, and error mitigation strategies that leverage symmetries and other properties of the measurement operators. Furthermore, we explore measurement schemes rooted in Quantum Phase Estimation (QPE), which are expected to become viable with the advent of fault-tolerant quantum computing. This review emphasizes foundational concepts and methodologies rather than numerical benchmarks, serving as a resource for researchers aiming to enhance the efficiency and accuracy of quantum measurements in quantum chemistry.

quant-ph↗

arXiv2024

Efficient recursive encoders for quantum Reed-Muller codes towards Fault tolerance

Transversal gates are logical gate operations on encoded quantum information that are efficient in gate count and depth, and are designed to minimize error propagation. Efficient encoding circuits for quantum codes that admit transversal gates are thus crucial to reduce noise and realize useful quantum computers. The class of punctured Quantum Reed-Muller codes admit transversal gates. We construct resource efficient recursive encoders for the class of quantum codes constructed from Reed-Muller and punctured Reed-Muller codes. These encoders on $n$ qubits have circuit depth of $O(\log n)$ and lower gate counts compared to previous works. The number of CNOT gates in the encoder across bi-partitions of the qubits is found to be equal to the entanglement entropy across these partitions, demonstrating that the encoder is optimal in terms of CNOT gates across these partitions. Finally, connecting these ideas, we explicitly show that entanglement can be extracted from QRM codewords.

quant-ph↗

arXiv2024

Entanglement-assisted Quantum Reed-Muller Tensor Product Codes

We present the construction of standard entanglement-assisted (EA) qubit Reed-Muller (RM) codes and their tensor product variants from classical RM codes. We show that the EA RM codes obtained using the CSS construction have zero coding rate and negative catalytic rate. We further show that EA codes constructed from these same classical RM codes using the tensor product code (TPC) construction have positive coding rate and provide a subclass of EA RM TPCs that have positive catalytic rate, thus establishing the coding analog of superadditivity for this family of codes, useful towards quantum communications. We also generalize this analysis to obtain conditions for EA TPCs from classical codes to have positive catalytic rate when their corresponding EA CSS codes have zero rate.

quant-ph↗