arXiv subjects

Ignacio Loaiza

Publications and source records attributed to Ignacio Loaiza.

17 recordsLinked to original sources

arXiv2026

Theory and practice of Trotter product formulas for quantum chemistry

Trotter product formulas are a fundamental class of methods for Hamiltonian simulation, particularly attractive due to their low qubit requirements. However, they are often overlooked for use with fault-tolerant quantum algorithms, because of their perceived higher gate counts and the difficulty of estimating Trotter error. Here, we introduce Symmetry-Protected Randomized near-Integrable Trotter (SPRINT) formulas, a framework for building optimized product formulas for electronic structure Hamiltonians widely used in quantum chemistry. SPRINT integrates a generalization of classical near-integrability, randomization, symmetry protection, use of QROM, and other techniques into a thoroughly optimized methodology for Hamiltonian simulation. When applied to concrete simulation tasks, we find SPRINT leads to substantial reduction in gate count compared to previous approaches. Alongside SPRINT, we introduce and analyze a Generalized Rank Decomposition (GRADE) of electronic Hamiltonians that generalizes previous factorization methods. We apply these techniques to the task of simulating the X-ray absorption spectrum of Li$_4$Mn$_2$O, a candidate battery cathode material, leveraging recent advances in tight Trotter error estimation to carefully identify the best version of SPRINT for this problem. Using a Trotter error estimation tool developed in the PennyLane software platform, we show that SPRINT reduces the Toffoli gate cost by a factor of $4.5$ relative to the previous state of the art for this problem, with a gate cost only $\times 2.5$ higher than qubitization, while requiring a dramatic $\times 5.5$ fewer logical qubits. These results establish well-designed Trotter product formulas as an attractive Hamiltonian simulation method for industrially relevant problems in chemistry and materials science.

quant-ph↗

arXiv2026

Quantum algorithm for simulating resonant inelastic X-ray scattering in battery materials

Resonant inelastic X-ray scattering (RIXS) is the workhorse experimental technique for probing the structural degradation of higher-capacity cathode materials. However, the interpretation of experimental spectra is challenging due to the lack of accurate simulations. In this work, we propose a quantum algorithm for simulating the RIXS spectrum of molecular clusters hypothesized to form in Li-excess cathodes. The algorithm uses quantum phase estimation to sample the spectrum from a state encoding the scattering transition amplitudes of the cluster valence excitations. We prepare this state in the quantum computer using a block-encoding of the dipole operator and quantum signal processing to implement the Green's function propagator over intermediate core-excited states. To showcase the algorithm, we use a model cluster proposed in recent experimental works consisting of an oxygen dimer bonded to a manganese atom. Using the PennyLane software platform, we report resource estimation for simulating RIXS spectra for chemically motivated active spaces of increasing sizes. For a classically challenging active space with 20 orbitals, the algorithm requires $2.0 \times 10^{10}$ Toffoli gates and $414$ logical qubits.

quant-ph↗

arXiv2026

Efficient Simulation of Pre-Born-Oppenheimer Dynamics on a Quantum Computer

In this work, we present a quantum algorithm for direct first-principles simulation of electron-nuclear dynamics on a first-quantized real-space grid. Our algorithm achieves best-in-class efficiency for block-encoding the pre-Born-Oppenheimer molecular Hamiltonian by harnessing the linear scaling of swap networks for implementing the quadratic number of particle interactions, while using a novel alternating sign implementation of the Coulomb interaction that exploits highly optimized arithmetic routines. We benchmark our approach for a series of scientifically and industrially relevant chemical reactions. We demonstrate over an order-of-magnitude reduction in costs compared to previous state-of-the-art for the $\rm NH_3+BF_3$ reaction, achieving a Toffoli cost of $8.7\times10^{9}$ per femtosecond using $1362$ logical qubits (system + ancillas). Our results significantly lower the resources required for fault-tolerant simulations of photochemical reactions, while providing a suite of algorithmic primitives that are expected to serve as foundational building blocks for a broader class of quantum algorithms.

quant-ph↗

arXiv2025

Quantum Algorithms for Photoreactivity in Cancer-Targeted Photosensitizers

Photodynamic therapy (PDT) is a targeted cancer treatment that uses light-activated photosensitizers to generate reactive oxygen species that selectively destroy tumor cells, generally causing less collateral damage than conventional treatments. However, its clinical success hinges on the availability of photosensitizers with strong optical sensitivity and high efficiency in generating reactive oxygen species. While classical computational methods have provided useful insights into photosensitizer design, they struggle to scale and often lack the accuracy needed for these simulations. In this work, we show how fault-tolerant quantum algorithms can be used to identify promising photosensitizer candidates for PDT. To predict photosensitizer performance, we assess two computational properties. First, we quantify light sensitivity by calculating the cumulative absorption in the therapeutic window with a threshold projection algorithm. Second, we determine the efficiency of reactive oxygen generation by estimating intersystem crossing (ISC) rates using the evolution-proxy approach, complemented by a vibronic dynamic treatment where appropriate. We apply these algorithms to a clinically relevant and actively pursued class of photosensitizers, BODIPY derivatives, including heavy-atom and transition-metal-substituted systems that are challenging for classical methods. Our resource estimates, obtained with PennyLane, suggest that systems with active spaces ranging from 11 to 45 spatial orbitals can be simulated using $180$-$350$ logical qubits and Toffoli gate depths between $10^7$ and $10^9$, placing our algorithms within reach of realistic fault-tolerant quantum devices. This paves the way to an efficient quantum-based workflow for designing photosensitizers that can accelerate the discovery of new PDT agents.

quant-ph↗

arXiv2025

Planted Solutions in Quantum Chemistry: Generating Non-Trivial Hamiltonians with Known Ground States

Generating large, non-trivial quantum chemistry test problems with known ground-state solutions remains a core challenge for benchmarking electronic structure methods. Inspired by planted-solution techniques from combinatorial optimization, we introduce four classes of Hamiltonians with embedded, retrievable ground states. These Hamiltonians mimic realistic electronic structure problems, support adjustable complexity, and are derived from reference systems. Crucially, their ground-state energies can be computed exactly, provided the construction parameters are known. To obscure this structure and control perceived complexity, we introduce techniques such as killer operators, balance operators, and random orbital rotations. We showcase this framework using examples based on homogeneous catalysts of industrial relevance and validate tunable difficulty through density matrix renormalization group (DMRG) convergence behavior. Beyond enabling scalable, ground-truth benchmark generation, our approach offers a controlled setting to explore the limitations of electronic structure methods and investigate how Hamiltonian structure influences ground state solution difficulty.

quant-ph↗

arXiv2025

Trotter simulation of vibrational Hamiltonians on a quantum computer

Simulating vibrational dynamics is essential for understanding molecular structure, unlocking useful applications such as vibrational spectroscopy for high-fidelity chemical detection. Quantum algorithms for vibrational dynamics are emerging as a promising alternative to resource-demanding classical approaches, but this domain is largely underdeveloped compared to quantum simulations of electronic structure. In this work, we describe in detail three distinct forms of the vibrational Hamiltonian: canonical bosonic quantization, real space representation, and the Christiansen second-quantized form. Leveraging Lie algebraic properties of each, we develop efficient fragmentation schemes to enable the use of Trotter product formulas for simulating time evolution. We introduce circuits required to implement time evolution in each form, and highlight factors that contribute to the simulation cost, including the choice of vibrational coordinates. Using a perturbative approach for the Trotter error, we obtain tight estimates of T gate cost for the simulation of time evolution in each form, enabling their quantitative comparison. Combining tight Trotter error estimates and efficient fragmentation schemes, we find that for the medium-sized CH$_4$ molecule with 9 vibrational modes, time evolution for approximately 1.8 ps may be simulated using as little as 36 qubits and approximately $3 \times 10^{8}$ T gates -- an order-of-magnitude speedup over prior-art algorithms. Finally, we present calculations of vibrational spectra using each form to demonstrate the fidelity of our algorithms. This work presents a unified and highly optimized framework that makes simulating vibrational dynamics an attractive use case for quantum computers.

quant-ph↗

arXiv2025

Nonlinear Spectroscopy via Generalized Quantum Phase Estimation

Response theory has a successful history of connecting experimental observations with theoretical predictions. Of particular interest is the optical response of matter, from which spectroscopy experiments can be modelled. However, the calculation of response properties for quantum systems is often prohibitively expensive, especially for nonlinear spectroscopy, as it requires access to either the time evolution of the system or to excited states. In this work, we introduce a generalized quantum phase estimation framework designed for multi-variate phase estimation. This allows the treatment of general correlation functions enabling the recovery of response properties of arbitrary orders. The generalized quantum phase estimation circuit has an intuitive construction that is linked with a physical process of interest, and can directly sample frequencies from the distribution that would be obtained experimentally. In addition, we provide a single-ancilla modification of the new framework for early fault-tolerant quantum computers. Overall, our framework enables the efficient simulation of spectroscopy experiments beyond the linear regime, such as Raman spectroscopy, having that the circuit cost grows linearly with respect to the order of the target nonlinear response. This opens up an exciting new field of applications for quantum computers with potential technological impact.

quant-ph↗

arXiv2025

Simulating near-infrared spectroscopy on a quantum computer for enhanced chemical detection

Near-infrared (NIR) spectroscopy is a non-invasive, low-cost, reagent-less, and rapid technique to measure chemical concentrations in a wide variety of sample types. However, extracting concentration information from the NIR spectrum requires training a statistical model on a large collection of measurements, which can be impractical, expensive, or dangerous. In this work, we propose a method for simulating NIR spectra on a quantum computer, as part of a larger workflow to improve NIR-based chemical detection. The quantum algorithm is highly optimized, exhibiting a cost reduction of many orders of magnitude relative to prior approaches. The main optimizations include the localization of vibrational modes, an efficient real-space-based representation of the Hamiltonian with a quantum arithmetic-based implementation of the time-evolution, optimal Trotter step size determination, and specific targeting of the NIR region. Overall, our algorithm achieves a O(M^2) scaling, compared with the O(M^12) coming from equivalent high-accuracy classical methods. As a concrete application, we show that simulating the spectrum of azidoacetylene (HC2N3), a highly explosive molecule with strong anharmonicities consisting of M = 12 vibrational modes, requires circuits with a maximum 8.47 x 10^8 T gates and 173 logical qubits. By enhancing the training datasets of detection models, the full potential of vibrational spectroscopy for chemical detection could be unlocked across a range of applications, including pharmaceuticals, agriculture, environmental monitoring, and medical sensing.

quant-ph↗

arXiv2024

Majorana Tensor Decomposition: A unifying framework for decompositions of fermionic Hamiltonians to Linear Combination of Unitaries

Linear combination of unitaries (LCU) decompositions have appeared as one of the main tools for encoding operators on quantum computers, allowing efficient implementations of arbitrary operators. In particular, LCU approaches present a way of encoding information from the electronic structure Hamiltonian into a quantum circuit. Over the past years, many different decomposition techniques have appeared for the electronic structure Hamiltonian. Here we present the Majorana Tensor Decomposition (MTD), a framework that unifies existing LCUs and offers novel decomposition methods by using popular low-rank tensor factorizations.

quant-ph↗

arXiv2024

Feasibility of accelerating homogeneous catalyst discovery with fault-tolerant quantum computers

The industrial manufacturing of chemicals consumes a significant amount of energy and raw materials. In principle, the development of new catalysts could greatly improve the efficiency of chemical production. However, the discovery of viable catalysts can be exceedingly challenging because it is difficult to know the efficacy of a candidate without experimentally synthesizing and characterizing it. This study explores the feasibility of using fault-tolerant quantum computers to accelerate the discovery of homogeneous catalysts for nitrogen fixation, an industrially important chemical process. It introduces a set of ground-state energy estimation problems representative of calculations needed for the discovery of homogeneous catalysts and analyzes them on three dimensions: economic utility, classical hardness, and quantum resource requirements. For the highest utility problem considered, two steps of a catalytic cycle for the generation of cyanate anion from dinitrogen, the economic utility of running these computations is estimated to be $200,000, and the required runtime for double-factorized phase estimation on a fault-tolerant superconducting device is estimated under conservative assumptions to be 139,000 QPU-hours. The computational cost of an equivalent DMRG calculation is estimated to be about 400,000 CPU-hours. These results suggest that, with continued development, it will be feasible for fault-tolerant quantum computers to accelerate the discovery of homogeneous catalysts.

quant-ph↗

arXiv2024

Simulating X-ray absorption spectroscopy of battery materials on a quantum computer

X-ray absorption spectroscopy is a crucial experimental technique for elucidating the mechanisms of structural degradation in battery materials. However, extracting information from the measured spectrum is challenging without high-quality simulations. In this work, we propose simulating near-edge X-ray absorption spectra as a promising application for quantum computing. It is attractive due to the ultralocal nature of X-ray absorption that significantly reduces the sizes of problems to be simulated, and because of the classical hardness of simulating spectra. We describe three quantum algorithms to compute the X-ray absorption spectrum and provide their asymptotic cost. One of these is a Monte-Carlo based time-domain algorithm, which is cost-friendly to early fault-tolerant quantum computers. We then apply the framework to an industrially relevant example, a CAS(22e,18o) active space for an O-Mn cluster in a Li-excess battery cathode, showing that practically useful simulations could be obtained with much fewer qubits and gates than ground-state energy estimation of the same material.

quant-ph↗

arXiv2023

Probing Quantum Efficiency: Exploring System Hardness in Electronic Ground State Energy Estimation

We consider the question of how correlated the system hardness is between classical algorithms of electronic structure theory in ground state estimation and quantum algorithms. To define the system hardness for classical algorithms we employ empirical criterion based on the deviation of electronic energies produced by coupled cluster and configuration interaction methods from the exact ones along multiple bonds dissociation in a set of molecular systems. For quantum algorithms, we have selected the Variational Quantum Eigensolver (VQE) and Quantum Phase Estimation (QPE) methods. As characteristics of the system hardness for quantum methods, we analyzed circuit depths for the state preparation, the number of quantum measurements needed for the energy expectation value, and various cost characteristics for the Hamiltonian encodings via Trotter approximation and linear combination of unitaries (LCU). Our results show that the quantum resource requirements are mostly unaffected by classical hardness, with the only exception being the state preparation part, which contributes to both VQE and QPE algorithm costs. However, there are clear indications that constructing the initial state with a significant overlap with the true ground state (>10%) is easier than obtaining the state with an energy expectation value within chemical precision. These results support optimism regarding the identification of a molecular system where a quantum algorithm excels over its classical counterpart, as quantum methods can maintain efficiency in classically challenging systems.

quant-ph↗

arXiv2023

Block-Invariant Symmetry Shift: Preprocessing technique for second-quantized Hamiltonians to improve their decompositions to Linear Combination of Unitaries

Computational cost of energy estimation for molecular electronic Hamiltonians via Quantum Phase Estimation (QPE) grows with the difference between the largest and smallest eigenvalues of the Hamiltonian. In this work we propose a preprocessing procedure that reduces the norm of the Hamiltonian without changing its eigenspectrum for the target states of a particular symmetry. The new procedure, Block-Invariant Symmetry Shift (BLISS), builds an operator T such that the cost of implementing H-T is reduced compared to that of H, yet H-T acts on the subspaces of interest the same way as H does. BLISS performance is demonstrated for Linear Combination of Unitaries (LCU)-based QPE approaches on a set of small molecules. Using the number of electrons as the symmetry specifying the target set of states, BLISS provided a factor of 2 reduction of 1-norm for several LCU decompositions compared to their unshifted versions.

quant-ph↗

arXiv2023

Reducing molecular electronic Hamiltonian simulation cost for Linear Combination of Unitaries approaches

We consider different Linear Combination of Unitaries (LCU) decompositions for molecular electronic structure Hamiltonians. Using these LCU decompositions for Hamiltonian simulation on a quantum computer, the main figure of merit is the 1-norm of their coefficients, which is associated with the quantum circuit complexity. It is derived that the lowest possible LCU 1-norm for a given Hamiltonian is half of its spectral range. This lowest norm decomposition is practically unattainable for general Hamiltonians; therefore, multiple practical techniques to generate LCU decompositions are proposed and assessed. A technique using symmetries to reduce the 1-norm further is also introduced. In addition to considering LCU in the Schrödinger picture, we extend it to the interaction picture, which substantially further reduces the 1-norm.

quant-ph↗

arXiv2022

Fluid fermionic fragments for optimizing quantum measurements of electronic Hamiltonians in the variational quantum eigensolver

Measuring the expectation value of the molecular electronic Hamiltonian is one of the challenging parts of the variational quantum eigensolver. A widely used strategy is to express the Hamiltonian as a sum of measurable fragments using fermionic operator algebra. Such fragments have an advantage of conserving molecular symmetries that can be used for error mitigation. The number of measurements required to obtain the Hamiltonian expectation value is proportional to a sum of fragment variances. Here, we introduce a new method for lowering the fragments' variances by exploiting flexibility in the fragments' form. Due to idempotency of the occupation number operators, some parts of two-electron fragments can be turned into one-electron fragments, which then can be partially collected in a purely one-electron fragment. This repartitioning does not affect the expectation value of the Hamiltonian but has non-vanishing contributions to the variance of each fragment. The proposed method finds the optimal repartitioning by employing variances estimated using a classically efficient proxy for the quantum wavefunction. Numerical tests on several molecules show that repartitioning of one-electron terms lowers the number of measurements by more than an order of magnitude.

quant-ph↗

arXiv2021

Computational approaches to efficient generation of the stationary state for incoherent light excitation

Light harvesting processes are often computationally studied from a time-dependent viewpoint, in line with ultrafast coherent spectroscopy experiments. Yet, natural processes take place in the presence of incoherent light, which induces a stationary state. Such stationary states can be described using the eigenbasis of the molecular Hamiltonian, but for realistic systems a full diagonalization is prohibitively expensive. We propose three efficient computational approaches to obtaining the stationary state that circumvent system Hamiltonian diagonalization. The connection between the incoherent perturbations, decoherence, and Kraus operators is established.

physics.chem-ph↗

arXiv2018

On the Breakdown of the Ehrenfest Method for Molecular Dynamics on Surfaces

Due to a continuum of electronic states present in periodic systems, the description of molecular dynamics on surfaces poses a serious computational challenge. One of the most used families of approaches in these settings are friction theories, which are based on the Ehrenfest (EH) approach. Yet, a mean-field treatment of electronic degrees of freedom in the EH method makes this approach inaccurate in some cases. Our aim is to clarify when EH breaks down for molecular dynamics on surfaces. Answering this question provides limits of applicability for more approximate friction theories derived from EH. We assess the EH method on one-dimensional, numerically exactly solvable models with a large but finite number of electronic states. Using the Landau-Zener formula and the Massey parameter, an expression that determines when EH breaks down is deduced.

physics.chem-ph↗