arXiv subjects

Cristian L. Cortes

Publications and source records attributed to Cristian L. Cortes.

At least 19 recordsLinked to original sources

arXiv2026

Faster quantum chemistry simulations on a quantum computer with improved tensor factorization and active volume compilation

Electronic structure calculations of molecular systems are among the most promising applications for fault-tolerant quantum computing (FTQC) in quantum chemistry and drug design. However, while recent algorithmic advancements such as qubitization and Tensor Hypercontraction (THC) have significantly reduced the complexity of such calculations, they do not yet achieve computational runtimes short enough to be practical for industrially relevant use cases. In this work, we introduce several advances to electronic structure calculation for molecular systems, resulting in a two-orders-of-magnitude speedup of estimated runtimes over prior-art algorithms run on comparable quantum devices. One of these advances is a novel framework for block-invariant symmetry-shifted Tensor Hypercontraction (BLISS-THC), with which we achieve the tightest Hamiltonian factorizations reported to date. We compile our algorithm for an Active Volume (AV) architecture, a technical layout that has recently been proposed for fusion-based photonic quantum hardware. AV compilation contributes towards a lower runtime of our computation by eliminating overheads stemming from connectivity issues in the underlying surface code. We present a detailed benchmark of our approach, focusing primarily on the computationally challenging benchmark molecule P450. Leveraging a number of hardware tradeoffs in interleaving-based photonic FTQC, we estimate runtimes for the electronic structure calculation of P450 as a function of the device footprint.

quant-ph↗

arXiv2025

Reducing quantum resources for observable estimation with window-assisted coherent QPE

Quantum Phase Estimation (QPE) routines are known to fail probabilistically even with perfect gates and input states. This effect stems from an incompatibility of finite-sized quantum registers to capture a phase within QPE with phase angles of infinite precision, and the effect extend even beyond what would be reasonably expected from rounding. This effect can be partially mitigated by biasing the phase register with a window, or taper state, from classical signal processing. This paper focuses on how windowing a coherent QPE used as a subroutine can improve the accuracy of the overall algorithm. Specifically we study the quantum task of estimating observables where window-assisted coherent QPE is used as a subroutine to implement a reflection about an eigenstate. Quantum resource estimates show over 2-orders-of-magnitude reduction in Toffoli counts over the previous costed techniques -- also assisted by the use of improved block encoding techniques -- demonstrating an encouraging decrease in resources for quantum computation of molecular observables. Since QPE, as one of only a few quantum building blocks, appears as a subroutine in many algorithms; this analysis also provides a model for understanding how window functions propagate to an improved error in composite algorithms.

quant-ph↗

arXiv2025

Molecular Properties from Quantum Krylov Subspace Diagonalization

Quantum Krylov subspace diagonalization is a prominent candidate for early fault tolerant quantum simulation of many-body and molecular systems, but so far the focus has been mainly on computing ground-state energies. We go beyond this by deriving analytical first-order derivatives for quantum Krylov methods and show how to obtain relaxed one and two particle reduced density matrices of the Krylov eigenstates. The direct approach to measuring these matrices requires a number of distinct measurement that scales quadratically with the Krylov dimension $D$. Here, we show how to reduce this scaling to a constant. This is done by leveraging quantum signal processing to prepare Krylov eigenstates, including exited states, in depth linear in $D$. We also compare several measurement schemes for efficiently obtaining the expectation value of an operator with states prepared using quantum signal processing. We validate our approach by computing the nuclear gradient of a small molecule and estimating its variance.

quant-ph↗

arXiv2024

Assessing the query complexity limits of quantum phase estimation using symmetry aware spectral bounds

The computational cost of quantum algorithms for physics and chemistry is closely linked to the spectrum of the Hamiltonian, a property that manifests in the necessary rescaling of its eigenvalues. The typical approach of using the 1-norm as an upper bound to the spectral norm to rescale the Hamiltonian suits the most general case of bounded Hermitian operators but neglects the influence of symmetries commonly found in chemical systems. In this work, we introduce a hierarchy of symmetry-aware spectral bounds that provide a unified understanding of the performance of quantum phase estimation algorithms using block-encoded electronic structure Hamiltonians. We present a variational and numerically tractable method for computing these bounds, based on orbital optimization, to demonstrate that the computed bounds are smaller than conventional spectral bounds for a variety of molecular benchmark systems. We also highlight the unique analytical and numerical scaling behavior of these bounds in the thermodynamic and complete basis set limits. Our work shows that there is room for improvement in reducing the 1-norm, not yet achieved through methods like double factorization and tensor hypercontraction, but highlights potential challenges in improving the performance of current quantum algorithms beyond small constant factors through 1-norm reduction techniques alone.

quant-ph↗

arXiv2024

Enhancing initial state overlap through orbital optimization for faster molecular electronic ground-state energy estimation

The quantum phase estimation algorithm stands as the primary method for determining the ground state energy of a molecular electronic Hamiltonian on a quantum computer. In this context, the ability to initialize a classically tractable state that has a strong overlap with the desired ground state is critical as it directly affects the runtime of the algorithm. However, several numerical studies have shown that this overlap decays exponentially with system size. In this work, we demonstrate that this decay can be alleviated by optimizing the molecular orbital basis, for an initial state constructed from a single Slater determinant. We propose a practical method to achieve this optimization without knowledge of the true molecular ground state and test this method numerically. By comparing the resulting optimized orbitals to the natural orbitals, we find improved overlap. Specifically, for four iron-sulfur molecules, which are known to suffer from the mentioned decay, we show that our method yields one to two orders of magnitude improvement compared to localized molecular orbitals.

quant-ph↗

arXiv2024

Reducing the runtime of fault-tolerant quantum simulations in chemistry through symmetry-compressed double factorization

Quantum phase estimation based on qubitization is the state-of-the-art fault-tolerant quantum algorithm for computing ground-state energies in chemical applications. In this context, the 1-norm of the Hamiltonian plays a fundamental role in determining the total number of required iterations and also the overall computational cost. In this work, we introduce the symmetry-compressed double factorization (SCDF) approach, which combines a compressed double factorization of the Hamiltonian with the symmetry shift technique, significantly reducing the 1-norm value. The effectiveness of this approach is demonstrated numerically by considering various benchmark systems, including the FeMoco molecule, cytochrome P450, and hydrogen chains of different sizes. To compare the efficiency of SCDF to other methods in absolute terms, we estimate Toffoli gate requirements, which dominate the execution time on fault-tolerant quantum computers. For the systems considered here, SCDF leads to a sizeable reduction of the Toffoli gate count in comparison to other variants of double factorization or even tensor hypercontraction, which is usually regarded as the most efficient approach for qubitization.

quant-ph↗

arXiv2023

Fault-tolerant quantum computation of molecular observables

Over the past three decades significant reductions have been made to the cost of estimating ground-state energies of molecular Hamiltonians with quantum computers. However, comparatively little attention has been paid to estimating the expectation values of other observables with respect to said ground states, which is important for many industrial applications. In this work we present a novel expectation value estimation (EVE) quantum algorithm which can be applied to estimate the expectation values of arbitrary observables with respect to any of the system's eigenstates. In particular, we consider two variants of EVE: std-EVE, based on standard quantum phase estimation, and QSP-EVE, which utilizes quantum signal processing (QSP) techniques. We provide rigorous error analysis for both both variants and minimize the number of individual phase factors for QSPEVE. These error analyses enable us to produce constant-factor quantum resource estimates for both std-EVE and QSP-EVE across a variety of molecular systems and observables. For the systems considered, we show that QSP-EVE reduces (Toffoli) gate counts by up to three orders of magnitude and reduces qubit width by up to 25% compared to std-EVE. While estimated resource counts remain far too high for the first generations of fault-tolerant quantum computers, our estimates mark a first of their kind for both the application of expectation value estimation and modern QSP-based techniques.

quant-ph↗

arXiv2023

Fault-tolerant quantum algorithm for symmetry-adapted perturbation theory

The efficient computation of observables beyond the total energy is a key challenge and opportunity for fault-tolerant quantum computing approaches in quantum chemistry. Here we consider the symmetry-adapted perturbation theory (SAPT) components of the interaction energy as a prototypical example of such an observable. We provide a guide for calculating this observable on a fault-tolerant quantum computer while optimizing the required computational resources. Specifically, we present a quantum algorithm that estimates interaction energies at the first-order SAPT level with a Heisenberg-limited scaling. To this end, we exploit a high-order tensor factorization and block encoding technique that efficiently represents each SAPT observable. To quantify the computational cost of our methodology, we provide resource estimates in terms of the required number of logical qubits and Toffoli gates to execute our algorithm for a range of benchmark molecules, also taking into account the cost of the eigenstate preparation and the cost of block encoding the SAPT observables. Finally, we perform the resource estimation for a heme and artemisinin complex as a representative large-scale system encountered in drug design, highlighting our algorithm's performance in this new benchmark study and discussing possible bottlenecks that may be improved in future work.

quant-ph↗

arXiv2022

Quantum Kerr Learning

Quantum machine learning is a rapidly evolving field of research that could facilitate important applications for quantum computing and also significantly impact data-driven sciences. In our work, based on various arguments from complexity theory and physics, we demonstrate that a single Kerr mode can provide some "quantum enhancements" when dealing with kernel-based methods. Using kernel properties, neural tangent kernel theory, first-order perturbation theory of the Kerr non-linearity, and non-perturbative numerical simulations, we show that quantum enhancements could happen in terms of convergence time and generalization error. Furthermore, we make explicit indications on how higher-dimensional input data could be considered. Finally, we propose an experimental protocol, that we call \emph{quantum Kerr learning}, based on circuit QED.

quant-ph↗

arXiv2022

A stochastic quantum Krylov protocol with double factorized Hamiltonians

We propose a class of randomized quantum Krylov diagonalization (rQKD) algorithms capable of solving the eigenstate estimation problem with modest quantum resource requirements. Compared to previous real-time evolution quantum Krylov subspace methods, our approach expresses the time evolution operator, $e^{-i\hat{H} τ}$, as a linear combination of unitaries and subsequently uses a stochastic sampling procedure to reduce circuit depth requirements. While our methodology applies to any Hamiltonian with fast-forwardable subcomponents, we focus on its application to the explicitly double-factorized electronic-structure Hamiltonian. To demonstrate the potential of the proposed rQKD algorithm, we provide numerical benchmarks for a variety of molecular systems with circuit-based statevector simulators, achieving ground state energy errors of less than 1~kcal~mol$^{-1}$ with circuit depths orders of magnitude shallower than those required for low-rank deterministic Trotter-Suzuki decompositions.

quant-ph↗

arXiv2022

Fast-forwarding quantum simulation with real-time quantum Krylov subspace algorithms

Quantum subspace diagonalization (QSD) algorithms have emerged as a competitive family of algorithms that avoid many of the optimization pitfalls associated with parameterized quantum circuit algorithms. While the vast majority of the QSD algorithms have focused on solving the eigenpair problem for ground, excited-state, and thermal observable estimation, there has been a lot less work in considering QSD algorithms for the problem of quantum dynamical simulation. In this work, we propose several quantum Krylov fast-forwarding (QKFF) algorithms capable of predicting long-time dynamics well beyond the coherence time of current quantum hardware. Our algorithms use real-time evolved Krylov basis states prepared on the quantum computer and a multi-reference subspace method to ensure convergence towards high-fidelity, long-time dynamics. In particular, we show that the proposed multi-reference methodology provides a systematic way of trading off circuit depth with classical post-processing complexity. We also demonstrate the efficacy of our approach through numerical implementations for several quantum chemistry problems including the calculation of the auto-correlation and dipole moment correlation functions

quant-ph↗

arXiv2021

Quantum Krylov subspace algorithms for ground and excited state energy estimation

Quantum Krylov subspace diagonalization (QKSD) algorithms provide a low-cost alternative to the conventional quantum phase estimation algorithm for estimating the ground and excited-state energies of a quantum many-body system. While QKSD algorithms typically rely on using the Hadamard test for estimating Krylov subspace matrix elements of the form, $\langle ϕ_i|e^{-i\hat{H}τ}|ϕ_j \rangle$, the associated quantum circuits require an ancilla qubit with controlled multi-qubit gates that can be quite costly for near-term quantum hardware. In this work, we show that a wide class of Hamiltonians relevant to condensed matter physics and quantum chemistry contain symmetries that can be exploited to avoid the use of the Hadamard test. We propose a multi-fidelity estimation protocol that can be used to compute such quantities showing that our approach, when combined with efficient single-fidelity estimation protocols, provides a substantial reduction in circuit depth. In addition, we develop a unified theory of quantum Krylov subspace algorithms and present three new quantum-classical algorithms for the ground and excited-state energy estimation problems, where each new algorithm provides various advantages and disadvantages in terms of total number of calls to the quantum computer, gate depth, classical complexity, and stability of the generalized eigenvalue problem within the Krylov subspace.

quant-ph↗

arXiv2021

Sample-efficient adaptive calibration of quantum networks using Bayesian optimization

Indistinguishable photons are imperative for advanced quantum communication networks. Indistinguishability is difficult to obtain because of environment-induced photon transformations and loss imparted by communication channels, especially in noisy scenarios. Strategies to mitigate these transformations often require hardware or software overhead that is restrictive (e.g. adding noise), infeasible (e.g. on a satellite), or time-consuming for deployed networks. Here we propose and develop resource-efficient Bayesian optimization techniques to rapidly and adaptively calibrate the indistinguishability of individual photons for quantum networks using only information derived from their measurement. To experimentally validate our approach, we demonstrate the optimization of Hong-Ou-Mandel interference between two photons -- a central task in quantum networking -- finding rapid, efficient, and reliable convergence towards maximal photon indistinguishability in the presence of high loss and shot noise. We expect our resource-optimized and experimentally friendly methodology will allow fast and reliable calibration of indistinguishable quanta, a necessary task in distributed quantum computing, communications, and sensing, as well as for fundamental investigations.

quant-ph↗

arXiv2021

Giant Optomechanical Coupling in the Charge Density Wave State of Tantalum Disulfide

We study the coupling of light and the structural order parameter in the charge density wave (CDW) state of the layered transition-metal dichalcogenide, Tantalum Disulfide ($1T-\mathrm{TaS_2}$). Using time-dependent density functional theory calculations of the dielectric properties along the distortions coordinates, we show that $1T-\mathrm{TaS_2}$ displays very large change in its dielectric function along the amplitude (Higgs) mode due to the coupling of the periodic lattice distortion with an in-plane metal-insulator transition, leading to optomechanical coupling coefficients two orders of magnitude larger than the ones of diamond and ErFeO$_3$. In addition, we derive an effective model of the light-induced dynamics, which is in quantitative agreement with experimental observations in $1T-\mathrm{TaS_2}$. We show that light-induced dynamics of the structural order parameter in $1T-\mathrm{TaS_2}$ can be deterministically controlled to engineer large third-order non-linear optical susceptibilities. Our findings suggest that CDW materials are promising active materials for non-linear optics.

cond-mat.mtrl-sci↗

arXiv2020

Accelerating quantum optics experiments with statistical learning

Quantum optics experiments, involving the measurement of low-probability photon events, are known to be extremely time-consuming. We present a new methodology for accelerating such experiments using physically-motivated ansatzes together with simple statistical learning techniques such as Bayesian maximum a posteriori estimation based on few-shot data. We show that it is possible to reconstruct time-dependent data using a small number of detected photons, allowing for fast estimates in under a minute and providing a one-to-two order of magnitude speed up in data acquisition time. We test our approach using real experimental data to retrieve the second order intensity correlation function, $G^{(2)}(τ)$, as a function of time delay $τ$ between detector counts, for thermal light as well as anti-bunched light emitted by a quantum dot driven by periodic laser pulses. The proposed methodology has a wide range of applicability and has the potential to impact the scientific discovery process across a multitude of domains.

quant-ph↗

arXiv2020

Accelerating ultrafast spectroscopy with compressive sensing

Ultrafast spectroscopy is an important tool for studying photoinduced dynamical processes in atoms, molecules, and nanostructures. Typically, the time to perform these experiments ranges from several minutes to hours depending on the choice of spectroscopic method. It is desirable to reduce this time overhead to not only to shorten time and laboratory resources, but also to make it possible to examine fragile specimens which quickly degrade during long experiments. In this article, we motivate using compressive sensing to significantly shorten data acquisition time by reducing the total number of measurements in ultrafast spectroscopy. We apply this technique to experimental data from ultrafast transient absorption spectroscopy and ultrafast terahertz spectroscopy and show that good estimates can be obtained with as low as 15% of the total measurements, implying a 6-fold reduction in data acquisition time.

physics.optics↗

arXiv2020

Ground-state cooling enabled by critical coupling and dark entangled states

We analyze the cooling of a mechanical resonator coupled to an ensemble of interacting two-level systems via an open quantum systems approach. Using an exact analytical result, we find optimal cooling occurs when the phonon mode is critically coupled ($γ\sim g$) to the two-level system ensemble. Typical systems operate in sub-optimal cooling regimes due to the intrinsic parameter mismatch ($γ\gg g$) between the dissipative decay rate $γ$ and the coupling factor $g$. To overcome this obstacle, we show that carefully engineering the coupling parameters through the strain profile of the mechanical resonator allows phonon cooling to proceed through the dark (subradiant) entangled states of an \emph{interacting} ensemble, thereby resulting in optimal phonon cooling. Our results provide a new avenue for ground-state cooling and should be accessible for experimental demonstrations.

quant-ph↗

arXiv2019

Non-Hermitian approach for quantum plasmonics

We examine the limits of applicability of a simple non-Hermitian model for exciton/plasmon interactions in the presence of dissipation and dephasing. The model can be used as an alternative to the more complete Lindblad density matrix approach and is computationally and conceptually simpler. We find that optical spectra in the linear regime can be adequately described by this approach. The model can fail, however, under continuous optical driving in some circumstances. In the case of two quantum dots or excitons interacting with a plasmon, the model can also describe coherences and entanglement qualitatively when both dissipation and dephasing are present, and quantitatively in the limit with no dephasing. The model can also be extended to the case of many quantum dots interacting with a plasmon and results, within the single-excitation manifold, are presented for the fifty quantum dot case.

quant-ph↗