arXiv subjects

Robert A. Lang

Publications and source records attributed to Robert A. Lang.

16 recordsLinked to original sources

arXiv2026

Practical Estimation of Trotter Error for Hamiltonian Simulation

Trotter product formulas are a leading approach for Hamiltonian simulation on quantum computers, yet their practical performance has remained difficult to assess due to the challenge of accurately estimating the Trotter error. In this work, we develop new theoretical results, algorithms, and software tools that advance the state-of-the-art in Trotter error estimation by orders of magnitude in both scale and accuracy. On the theoretical side, we prove that in the asymptotic limit the error of a product formula depends on the diagonal elements of the Baker-Campbell-Hausdorff (BCH) error operator in the eigenbasis of the Hamiltonian, rather than its full spectral norm -- yielding an improved scaling for Hamiltonian simulation using product formulas. On the algorithmic side, we introduce a compact representation of the BCH expansion that reduces the number of commutators from $\mathcal{O}(n^3)$ to $\mathcal{O}(n)$ for second-order, and from $\mathcal{O}(n^5)$ to $\mathcal{O}(n^2)$ for fourth-order formulas on $n$ fragments, complemented by an importance sampling scheme to further reduce the computational cost. We provide implementations of these techniques in software and demonstrate their power on two applications: (i) X-ray absorption spectroscopy of an electronic Hamiltonian (Li$_4$Mn$_2$O) at up to 56 qubits using tensor networks; and (ii) vibronic dynamics of naphthalene at over 100 qubits using ML-MCTDH, where we find that naive analytical bounds overestimate the required number of Trotter steps by nearly five orders of magnitude. Our framework enables, for the first time, the accurate estimation of Trotter error at practically relevant system sizes, providing a foundation for fair algorithmic comparisons and rational design of product formulas.

quant-ph↗

arXiv2026

Quantum algorithm for simulating non-adiabatic dynamics at metallic surfaces

Non-adiabatic dynamics at molecule-metal interfaces govern diverse and technologically important phenomena, from heterogeneous catalysis to dye-sensitized solar energy conversion and charge transport across molecular junctions. Realistic modeling of such dynamics necessitates taking into account various charge and energy transfer channels involving the coupling of nuclear motion with a very large number of electronic states, leading to prohibitive cost using classical computational methods. In this work we introduce a generalization of the Anderson-Newns Hamiltonian and develop a highly optimized quantum algorithm for simulating the non-adiabatic dynamics of realistic molecule-metal interfaces. Using the PennyLane software platform, we perform resource estimations of our algorithm, showing its remarkably low implementation cost for model systems representative of various scientifically and industrially relevant molecule-metal systems. Specifically, we find that time evolution for models including $100$ metal orbitals, $8$ molecular orbitals, and $20$ nuclear degrees of freedom, requires only $271$ qubits and $7.9 \times 10^7$ Toffoli gates for $1000$ Trotter steps, suggesting non-adiabatic molecule-metal dynamics as a fruitful application of first-generation fault-tolerant quantum computers.

quant-ph↗

arXiv2026

Multistate iterative qubit coupled cluster (MS-iQCC): a quantum-inspired, state-averaged approach to ground- and excited-state energies

We introduce the multistate iterative qubit coupled cluster (MS-iQCC) method, a quantum-inspired algorithm that runs efficiently on classical hardware and is designed to predict both ground and excited electronic states of molecules. Accurate excited-state energetics are essential for interpreting spectroscopy and chemical reactivity, but standard electronic structure methods are either too computationally expensive for larger systems or lose reliability in the presence of strong electron correlation. MS-iQCC addresses this challenge by simultaneously optimizing multiple electronic states in a single, state-averaged procedure that treats ground and excited states on equal footing. This removes the energetic bias that is introduced when excited states are computed one at a time and constrained to remain orthogonal to previously optimized states. The approach supports multireference electronic structure by allowing multideterminantal initial guesses and by adaptively building a compact exponential ansatz from a pool of qubit excitation generators. We apply MS-iQCC to H$_4$, H$_2$O, N$_2$, and C$_2$, including strongly correlated geometries, and observe robust convergence of all targeted state energies to chemically meaningful accuracy across their potential energy surfaces.

physics.chem-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

Quantum Algorithm for Vibronic Dynamics: Case Study on Singlet Fission Solar Cell Design

Vibronic interactions between nuclear motion and electronic states are critical for the accurate modeling of photochemistry. However, accurate simulations of fully quantum non-adiabatic dynamics are often prohibitively expensive for classical methods beyond small systems. In this work, we present a quantum algorithm based on product formulas for simulating time evolution under a general vibronic Hamiltonian in real space, capable of handling an arbitrary number of electronic states and vibrational modes. We develop the first trotterization scheme for vibronic Hamiltonians beyond two electronic states and introduce an array of optimization techniques for the exponentiation of each fragment in the product formula, resulting in a remarkably low cost of implementation. To demonstrate practical relevance, we outline a proof-of-principle integration of our algorithm into a materials discovery pipeline for designing more efficient singlet fission-based organic solar cells. We estimate that $100$ fs of propagation using a second-order Trotter product formula for a $6$-state, $21$-mode model of exciton transport at an anthracene dimer requires $154$ qubits and $2.76 \times 10^6$ Toffoli gates. While a $4$-state, $246$-mode model describing charge transfer at an anthracene-fullerene interface requires $1053$ qubits and $2.66 \times 10^7$ Toffoli gates.

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↗

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

Growth reduction of similarity transformed electronic Hamiltonians in qubit space

Accurately solving the electronic structure problem through the variational quantum eigensolver (VQE) is hindered by the available quantum resources of current and near-term devices. One approach to relieving the circuit depth requirements for VQE is to "pre-process" the electronic Hamiltonian by a similarity transformation incorporating some degree of electronic correlation, with the remaining correlation left to be addressed by the circuit ansatz. This often comes at the price of a substantial increase in the number of terms to measure in the similarity transformed Hamiltonian. In this work, we propose an efficient approach to sampling elements from the complete Pauli group for $N$ qubits which minimize the onset of new terms in the transformed Hamiltonian, while facilitating substantial energy lowering. We benchmark the growth-mitigating generator selection technique for ground state energy estimations applied to models of the H$_4$, N$_2$ and H$_2$O molecular systems. It is found that utilizing a selection procedure which obtains the growth-minimizing generator from the set of operators with maximal energy gradient is the most competitive approach to reducing the onset of Hamiltonian terms while achieving systematic energy lowering of the reference state.

quant-ph↗

arXiv2023

Differentiable quantum computational chemistry with PennyLane

This work describes the theoretical foundation for all quantum chemistry functionality in PennyLane, a quantum computing software library specializing in quantum differentiable programming. We provide an overview of fundamental concepts in quantum chemistry, including the basic principles of the Hartree-Fock method. A flagship feature in PennyLane is the differentiable Hartree-Fock solver, allowing users to compute exact gradients of molecular Hamiltonians with respect to nuclear coordinates and basis set parameters. PennyLane provides specialized operations for quantum chemistry, including excitation gates as Givens rotations and templates for quantum chemistry circuits. Moreover, built-in simulators exploit sparse matrix techniques for representing molecular Hamiltonians that lead to fast simulation for quantum chemistry applications. In combination with PennyLane's existing methods for constructing, optimizing, and executing circuits, these methods allow users to implement a wide range of quantum algorithms for quantum chemistry. We discuss how PennyLane can be used to implement variational algorithms for calculating ground-state energies, excited-state energies, and energy derivatives, all of which can be differentiated with respect to both circuit and Hamiltonian parameters. We provide an example workflow describing how to jointly optimize circuit parameters, nuclear coordinates, and basis set parameters for quantum chemistry algorithms. We discuss a functionality for reducing the number of qubits by using symmetries and explain how PennyLane can be used to estimate quantum resources needed to implement several quantum algorithms. By combining insights from quantum computing, computational chemistry, and machine learning, PennyLane is the first library for differentiable quantum computational chemistry.

quant-ph↗

arXiv2022

PennyLane: Automatic differentiation of hybrid quantum-classical computations

PennyLane is a Python 3 software framework for differentiable programming of quantum computers. The library provides a unified architecture for near-term quantum computing devices, supporting both qubit and continuous-variable paradigms. PennyLane's core feature is the ability to compute gradients of variational quantum circuits in a way that is compatible with classical techniques such as backpropagation. PennyLane thus extends the automatic differentiation algorithms common in optimization and machine learning to include quantum and hybrid computations. A plugin system makes the framework compatible with any gate-based quantum simulator or hardware. We provide plugins for hardware providers including the Xanadu Cloud, Amazon Braket, and IBM Quantum, allowing PennyLane optimizations to be run on publicly accessible quantum devices. On the classical front, PennyLane interfaces with accelerated machine learning libraries such as TensorFlow, PyTorch, JAX, and Autograd. PennyLane can be used for the optimization of variational quantum eigensolvers, quantum approximate optimization, quantum machine learning models, and many other applications.

quant-ph↗

arXiv2021

Analytic gradients in variational quantum algorithms: Algebraic extensions of the parameter-shift rule to general unitary transformations

Optimization of unitary transformations in Variational Quantum Algorithms benefits highly from efficient evaluation of cost function gradients with respect to amplitudes of unitary generators. We propose several extensions of the parametric-shift-rule to formulating these gradients as linear combinations of expectation values for generators with general eigen-spectrum (i.e. with more than two eigenvalues). Our approaches are exact and do not use any auxiliary qubits, instead they rely on a generator eigen-spectrum analysis. Two main directions in the parametric-shift-rule extensions are 1) polynomial expansion of the exponential unitary operator based on a limited number of different eigenvalues in the generator and 2) decomposition of the generator as a linear combination of low-eigenvalue operators (e.g. operators with only 2 or 3 eigenvalues). These techniques have a range of scalings for the number of needed expectation values with the number of generator eigenvalues from quadratic (for polynomial expansion) to linear and even $\log_2$ (for generator decompositions). This allowed us to propose efficient differentiation schemes superior to previous approaches for commonly used 2-qubit transformations (e.g. match-gates, transmon and fSim gates) and $\hat S^2$-conserving fermionic operators for the variational quantum eigensolver.

quant-ph↗

arXiv2020

Unitary transformation of the electronic Hamiltonian with an exact quadratic truncation of the Baker-Campbell-Hausdorff expansion

Application of current and near-term quantum hardware to the electronic structure problem is highly limited by qubit counts, coherence times, and gate fidelities. To address these restrictions within the variational quantum eigensolver (VQE) framework, many recent contributions have suggested dressing the electronic Hamiltonian to include a part of electron correlation, leaving the rest to be accounted by VQE state preparation. We present a new dressing scheme that combines preservation of the Hamiltonian hermiticity and an exact quadratic truncation of the Baker-Campbell-Hausdorff expansion. The new transformation is constructed as the exponent of an involutory linear combination (ILC) of anti-commuting Pauli products. It incorporates important strong correlation effects in the dressed Hamiltonian and can be viewed as a classical preprocessing step alleviating the resource requirements of the subsequent VQE application. The assessment of the new computational scheme for electronic structure of the LiH, H$_2$O, and N$_2$ molecules shows significant increase in efficiency compared to conventional qubit coupled cluster dressings.

quant-ph↗

arXiv2020

On the order problem in construction of unitary operators for the Variational Quantum Eigensolver

One of the main challenges in the Variational Quantum Eigensolver (VQE) framework is construction of the unitary transformation. The dimensionality of the space for unitary rotations of $N$ qubits is $4^N-1$, which makes the choice of a polynomial subset of generators exponentially difficult process. Moreover, due to non-commutativity of generators, the order in which they are used strongly affects results. Choosing the optimal order in a particular subset of generators requires testing the factorial number of combinations. We propose an approach based on the Lie algebra - Lie group connection and corresponding closure relations that systematically eliminates the order problem.

quant-ph↗

arXiv2019

Iterative Qubit Coupled Cluster approach with efficient screening of generators

An iterative version of the qubit coupled cluster (QCC) method [I.G. Ryabinkin et al., J. Chem. Theory Comput. 14, 6317 (2019)] is proposed. The new method seeks to find ground electronic energies of molecules on noisy intermediate-scale quantum (NISQ) devices. Each iteration involves a canonical transformation of the Hamiltonian and employs constant-size quantum circuits at the expense of increasing the Hamiltonian size. We numerically studied the convergence of the method on ground-state calculations for LiH, H$_2$O, and N$_2$ molecules and found that the exact ground-state energies can be systematically approached only if the generators of the QCC ansatz are sampled from a specific set of operators. We report an algorithm for constructing this set that scales linearly with the size of a Hamiltonian.

quant-ph↗

arXiv2019

Unitary partitioning approach to the measurement problem in the Variational Quantum Eigensolver method

To obtain estimates of electronic energies, the Variational Quantum Eigensolver (VQE) technique performs separate measurements for multiple parts of the system Hamiltonian. Current quantum hardware is restricted to projective single-qubit measurements, and thus, only parts of the Hamiltonian which form mutually qubit-wise commuting groups can be measured simultaneously. The number of such groups in the electronic structure Hamiltonians grows as $N^4$, where $N$ is the number of qubits, and thus puts serious restrictions on the size of the systems that can be studied. Using a partitioning of the system Hamiltonian as a linear combination of unitary operators we found a circuit formulation of the VQE algorithm that allows one to measure a group of fully anti-commuting terms of the Hamiltonian in a single series of single-qubit measurements. Numerical comparison of the unitary partitioning to previously used grouping of Hamiltonian terms based on their qubit-wise commutativity shows an $N$-fold reduction in the number of measurable groups.

quant-ph↗

arXiv2019

Exact and approximate symmetry projectors for the electronic structure problem on a quantum computer

Solving the electronic structure problem on a universal-gate quantum computer within the variational quantum eigensolver (VQE) methodology requires constraining the search procedure to a subspace defined by relevant physical symmetries. Ignoring symmetries results in convergence to the lowest eigenstate of the Fock space for the second quantized electronic Hamiltonian. Moreover, this eigenstate can be symmetry broken due to limitations of the wavefunction ansatz. To address this VQE problem, we introduce and assess methods of exact and approximate projection operators to irreducible eigen-subspaces of available physical symmetries. Feasibility of symmetry projection operators in the VQE framework is discussed, and their efficiency is compared with symmetry constraint optimization procedures. Generally, projectors introduce higher numbers of terms for VQE measurement compared to the constraint approach. On the other hand, the projection formalism improves accuracy of the variational wavefunction ansatz without introducing additional unitary transformations, which is beneficial for reducing depths of quantum circuits.

quant-ph↗