Searcharxiv⌕ Search

arXiv subjects

Karol Kowalski

Publications and source records attributed to Karol Kowalski.

At least 19 recordsLinked to original sources

Toward Resilient Many-Body Formulations under Incomplete Correlation Models: A Dual-Space Variational Formulation

Quantum simulations of correlated many-body systems will inevitably operate with imperfect information: the prepared states may arise from incomplete or approximate ansatze, while their measured Hamiltonian and overlap matrix elements are additionally affected by hardware and statistical noise. Robust quantum algorithms will be those that can improve upon reliable lower-level descriptions in spite of these imperfections. We introduce a dual-space nonorthogonal configuration-interaction (DS-NOCI) framework built around this principle. Rather than replacing a classically accessible NOCI reference manifold with correlated quantum states, DS-NOCI retains both spaces and couples them variationally. The reference sector provides a stable many-body backbone, while the quantum states contribute whatever additional correlation directions they contain. With exact matrix elements, the enlarged dual space gives a ground-state energy no higher than either the reference-only NOCI or correlated-only quantum-NOCI spaces, ensuring that an incomplete correlation model cannot degrade the underlying variational description. The additional reference--correlated matrix elements require only one correlated state preparation and are therefore less demanding than the correlated--correlated block already required by quantum variant of NOCI. Molecular benchmarks further show enhanced resilience to imperfect amplitudes and noisy matrix elements. DS-NOCI thus provides a general strategy for building quantum many-body formulations that remain useful when both correlation models and quantum computations are necessarily incomplete and noisy.

quant-ph↗

Prediction of Runtime Parameters of Parallel Chemistry Applications via Active and Generative Learning

In this work, we develop two main Machine Learning based approaches to predict the runtime parameters of highly scalable parallel chemistry computations.These approaches employ active and generative learning together with the empirically determined gradient boosted regression tree models chosen among a rich suite of machine learning models. When evaluated on Coupled-Cluster with Singles and Doubles computations, our models achieve a mean absolute error percentage (MAPE) as low as 0.023 and a coefficient of determination as high as 99.9%. Furthermore, when combined with active learning to mitigate the lack of large amounts of training data, our models score a MAPE about 0.2 with 20-25% of the original dataset.

cs.LG↗

Quantum Information Harvesting with the Parallel Quantum Flow Algorithm

The Quantum Flow (QFlow) algorithm provides a resource-efficient framework for describing correlated many-body systems on hybrid quantum-classical architectures. By enabling parallel utilization of quantum and classical resources, QFlow offers a scalable pathway toward simulations of realistic systems. In this Letter, we report a high-performance computing (HPC) implementation of the QFlow formalism based on a singles-and-doubles model. We demonstrate its performance for target spaces comprising 82 and 114 orbitals, where the flow includes all 6 active electrons in 6 active orbitals type active spaces. In the largest QFlow simulations, we optimize 1.17 million wave function parameters using the equivalent of 12 qubits. Despite the modest qubit requirements of the underlying active-space problems, the method recovers over $95\%$ of the total correlation energy obtained with the coupled cluster singles and doubles (CCSD) approach for systems dominated by dynamical correlation effects, which remain challenging for existing quantum algorithms. We further show that the QFlow formalism retains high accuracy in extended basis sets with diffuse functions, highlighting its potential for realistic large-scale quantum chemistry simulations.

quant-ph↗

Fermionic mean-field dynamics for spin systems beyond free fermions

We introduce the fermionized time-dependent Hartree-Fock (fTDHF), a real-time quantum dynamics method for spin-1/2 Hamiltonians following their mapping to fermions via the Jordan-Wigner transformation. fTDHF is formally equivalent to exact dynamics in the case of free fermions and can efficiently handle non-local string operators arising from long-range interactions via transition matrix elements between non-orthogonal Slater determinants. We show that the fTDHF method can be implemented on a classical computer with a cost that scales polynomially with system size, and linearly with the time steps. We benchmark fTDHF against exact dynamics on three separate spin-1/2 models, representing adiabatic preparation of states with long-range correlations, disorder-driven observation of many-body localization, and particle production in the Schwinger model. For each of these systems, fTDHF is shown to reproduce the qualitative dynamics generated by the exact evolutions, while maintaining a simple physical picture due to its mean-field nature.

cond-mat.str-el↗

Quantum Flow algorithm: quantum simulations of chemical systems using reduced quantum resources and constant depth quantum circuits

We assess the performance of the Quantum Flow (QFlow) algorithm employing cost-effective solvers based on the unitary coupled-cluster ansatz with single and double excitations (QFlow-SD). The resulting energies are benchmarked against those obtained with an analogous QFlow formulation defined in the same active spaces but augmented by higher-rank excitations, including triples and quadruples (QFlow-SDTQ). Across all molecular systems considered, QFlow-SD exhibits close agreement with results from the canonical unitary coupled cluster with singles and doubles framework, while requiring substantially fewer qubits than the latter. For the water molecule in the cc-pVTZ basis, we further demonstrate the performance of a composite two-step downfolding strategy. In this approach, an initial coupled-cluster downfolding based on the double unitary coupled-cluster ansatz is followed by a QFlow treatment within the resulting target space, illustrating the effectiveness of combining classical downfolding with quantum flow optimization.

physics.chem-ph↗

Compile-once block encodings for masked similarity-transformed effective Hamiltonians

We present COMPOSER, a compile-once modular parametric oracle for similarity-encoded effective reduction of electronic-structure operators (e.g., Schrieffer-Wolff-type constructions). Low-rank factorizations compress Hamiltonians and anti-Hermitian generators into rank-one bilinear and projected-quadratic ladders with near-linear scaling at fixed thresholds; each ladder admits deterministic, number-conserving preparation and a block encoding using constant number of signal ancillas. A fixed PREP-SELECT-PREP template multiplexes these ladders, and one QSP polynomial performs the spectral transformation with degree set by operator norms. For a fixed orbital pool and qubit register, the two-qubit fabric is compiled once; geometry, active-space (mask) updates, and truncations are absorbed by re-dialed single-qubit rotations. We introduce a mask-aware similarity-sandwich effective-Hamiltonian construction and benchmark stability under low-rank and second-order-perturation-guided screening. COMPOSER is an execution architecture: algorithmic errors (block-encoding and QSP approximation) are tunable for any supplied parameters, while physical accuracy depends on how those parameters are obtained if not refined.

quant-ph↗

Single-reference coupled-cluster theory based on the multi-purpose cluster operator

In this paper, we develop a theoretical framework that extends single-reference (SR) coupled-cluster (CC) theory beyond its conventional role of describing a single electronic state-typically the lowest-energy state within the symmetry sector defined by the reference determinant. Rather than viewing the SR-CC cluster operator solely as a device for reproducing one target state, we consider more general constructions in which different components of the cluster operator play distinct roles, ranging from encoding states of different symmetry than the reference to enabling SR-CC Ansatz to describe multiple states simultaneously. These developments lead to a new class of SR-CC downfolding formalisms in which the resulting active-space effective Hamiltonians are capable of concurrently representing multiple correlated states nonorthogonal to the reference function. We establish three theorems that formalize this extension and demonstrate that standard CC downfolding emerges as a special case of the proposed framework. Finally, we introduce a Hermitian variant based on a unitary CC representation, which enables realistic simulations of ground and excited states while reducing the quantum resources required.

quant-ph↗

A Perspective on Quantum Computing Applications in Quantum Chemistry using 25--100 Logical Qubits

The intersection of quantum computing and quantum chemistry represents a promising frontier for achieving quantum utility in domains of both scientific and societal relevance. Owing to the exponential growth of classical resource requirements for simulating quantum systems, quantum chemistry has long been recognized as a natural candidate for quantum computation. This perspective focuses on identifying scientifically meaningful use cases where early fault-tolerant quantum computers, which are considered to be equipped with approximately 25--100 logical qubits, could deliver tangible impact. While recent advances in classical computing have pushed the boundaries of tractable simulations to unprecedented scales, this logical-qubit regime represents the first window where quantum devices can pursue qualitatively distinct strategies, such as polynomial-scaling phase estimation, direct simulation of quantum dynamics, and active-space embedding, that remain challenging for classical solvers, for instance, multireference charge-transfer and conical-intersection states central to photochemistry and materials design. We highlight near-term opportunities in algorithm and software design, discuss representative chemical problems suited for quantum acceleration, and propose strategic roadmaps and collaborative pathways for advancing practical quantum utility in quantum chemistry.

quant-ph↗

Guiding Application Users via Estimation of Computational Resources for Massively Parallel Chemistry Computations

In this work, we develop machine learning (ML) based strategies to predict resources (costs) required for massively parallel chemistry computations, such as coupled-cluster methods, to guide application users before they commit to running expensive experiments on a supercomputer. By predicting application execution time, we determine the optimal runtime parameter values such as number of nodes and tile sizes. Two key questions of interest to users are addressed. The first is the shortest-time question, where the user is interested in knowing the parameter configurations (number of nodes and tile sizes) to achieve the shortest execution time for a given problem size and a target supercomputer. The second is the cheapest-run question in which the user is interested in minimizing resource usage, i.e., finding the number of nodes and tile size that minimizes the number of node-hours for a given problem size. We evaluate a rich family of ML models and strategies, developed based on the collections of runtime parameter values for the CCSD (Coupled Cluster with Singles and Doubles) application executed on the Department of Energy (DOE) Frontier and Aurora supercomputers. Our experiments show that when predicting the total execution time of a CCSD iteration, a Gradient Boosting (GB) ML model achieves a Mean Absolute Percentage Error (MAPE) of 0.023 and 0.073 for Aurora and Frontier, respectively. In the case where it is expensive to run experiments just to collect data points, we show that active learning can achieve a MAPE of about 0.2 with just around 450 experiments collected from Aurora and Frontier.

cs.LG↗

Integrated Software/Hardware Execution Models for High-Accuracy Methods in Chemistry

The effective deployment and application of advanced methodologies for quantum chemistry is inherently linked to the optimal usage of emerging and highly diversified computational resources. This paper examines the synergistic utilization of Micron memory technologies and Azure Quantum Element cloud computing in Density Matrix Renormalization Group (DMRG) simulations leveraging coupled-cluster (CC) downfolded/effective Hamiltonians based on the double unitary coupled cluster (DUCC) Ansatz. We analyze the performance of the DMRG-DUCC workflow, emphasizing the proper choice of hardware that reflects the numerical overheads associated with specific components of the workflow. We report a hybrid approach that takes advantage of Micron CXL hardware for the memory capacity intensive CC downfolding phase while employing AQE cloud computing for the less resource-intensive DMRG simulations. Furthermore, we analyze the performance of the scalable ExaChem suite of electronic simulations conducted on Micron prototype systems.

physics.comp-ph↗

Coupled Cluster Downfolding Theory in Simulations of Chemical Systems on Quantum Hardware

The practical application of quantum technologies to chemical problems faces significant challenges, particularly in the treatment of realistic basis sets and the accurate inclusion of electron correlation effects. A direct approach to these problems is currently infeasible due to limitations in the number of logical qubits, their fidelity, and the shallow circuit depths supported by existing hardware; all of which hinder simulations at the required level of accuracy. A promising alternative is hybrid quantum-classical computing, where classical resources are used to construct effective Hamiltonians characterized by dimensions that conform to the constraints of current quantum devices. In this paper, we demonstrate the performance of a hybrid approach: coupled-cluster downfolded Hamiltonians are first evaluated in reduced-dimensionality active spaces, and the corresponding ground-state energies are subsequently computed using quantum algorithms. Our comprehensive analysis explores the achievable accuracy in recovering correlation energies when hundreds of orbitals are downfolded into a problem size tractable by today's quantum hardware. We argue that such flexible hybrid algorithms, where problem size can be tailored to available quantum resources, can serve as a bridge between noisy intermediate-scale quantum (NISQ) devices and future fault-tolerant quantum computers, marking a step toward the early realization of quantum advantage in chemistry.

quant-ph↗

Qubit-efficient quantum chemistry with the ADAPT variational quantum eigensolver and double unitary downfolding

In this work, we combine the recently developed double unitary coupled cluster (DUCC) theory with the adaptive, problem-tailored variational quantum eigensolver (ADAPT-VQE) to explore accuracy of unitary downfolded Hamiltonians for quantum simulation of chemistry. We benchmark the ability of DUCC effective Hamiltonians to recover dynamical correlation energy outside of an active space. We consider the effects of strong correlation, commutator truncation, higher-body terms, and approximate external amplitudes on the accuracy of these effective Hamiltonians. When combining these DUCC Hamiltonians with ADAPT-VQE, we observe similar convergence of the ground state as compared to bare active space Hamiltonians, demonstrating that DUCC Hamiltonians provide increased accuracy without increasing the load on the quantum processor.

quant-ph↗

Unleashed from Constrained Optimization: Quantum Computing for Quantum Chemistry Employing Generator Coordinate Inspired Method

Hybrid quantum-classical approaches offer potential solutions to quantum chemistry problems, yet they often manifest as constrained optimization problems. Here, we explore the interconnection between constrained optimization and generalized eigenvalue problems through the Unitary Coupled Cluster (UCC) excitation generators. Inspired by the generator coordinate method, we employ these UCC excitation generators to construct non-orthogonal, overcomplete many-body bases, projecting the system Hamiltonian into an effective Hamiltonian, which bypasses issues such as barren plateaus that heuristic numerical minimizers often encountered in standard variational quantum eigensolver (VQE). Diverging from conventional quantum subspace expansion methods, we introduce an adaptive scheme that robustly constructs the many-body basis sets from a pool of the UCC excitation generators. This scheme supports the development of a hierarchical ADAPT quantum-classical strategy, enabling a balanced interplay between subspace expansion and ansatz optimization to address complex, strongly correlated quantum chemical systems cost-effectively, setting the stage for more advanced quantum simulations in chemistry.

quant-ph↗

Quantum Simulation of Boson-Related Hamiltonians: Techniques, Effective Hamiltonian Construction, and Error Analysis

A broad spectrum of physical systems in condensed-matter and high-energy physics, vibrational spectroscopy, and circuit and cavity QED necessitates the incorporation of bosonic degrees of freedom, such as phonons, photons, and gluons, into optimized fermion algorithms for near-future quantum simulations. In particular, when a quantum system is surrounded by an external environment, its basic physics can usually be simplified to a spin or fermionic system interacting with bosonic modes. Nevertheless, troublesome factors such as the magnitude of the bosonic degrees of freedom typically complicate the direct quantum simulation of these interacting models, necessitating the consideration of a comprehensive plan. This strategy should specifically include a suitable fermion/boson-to-qubit mapping scheme to encode sufficiently large yet manageable bosonic modes, and a method for truncating and/or downfolding the Hamiltonian to the defined subspace for performing an approximate but highly accurate simulation, guided by rigorous error analysis. In this pedagogical tutorial review, we aim to provide such an exhaustive strategy, focusing on encoding and simulating certain bosonic-related model Hamiltonians, inclusive of their static properties and time evolutions. Specifically, we emphasize two aspects: (1) the discussion of recently developed quantum algorithms for these interacting models and the construction of effective Hamiltonians, and (2) a detailed analysis regarding a tightened error bound for truncating the bosonic modes for a class of fermion-boson interacting Hamiltonians.

quant-ph↗

Exploring the Nexus of Many-Body Theories through Neural Network Techniques: the Tangent Model

In this paper, we present a physically informed neural network representation of the effective interactions associated with coupled-cluster downfolding models to describe chemical systems and processes. The neural network representation not only allows us to evaluate the effective interactions efficiently for various geometrical configurations of chemical systems corresponding to various levels of complexity of the underlying wave functions, but also reveals that the bare and effective interactions are related by a tangent function of some latent variables. We refer to this characterization of the effective interaction as a tangent model. We discuss the connection between this tangent model for the effective interaction with the previously developed theoretical analysis that examines the difference between the bare and effective Hamiltonians in the corresponding active spaces.

quant-ph↗

Density Matrix Renormalization Group Approach Based on the Coupled-Cluster Downfolded Hamiltonians

The Density Matrix Renormalization Group (DMRG) method has become a prominent tool for simulating strongly correlated electronic systems characterized by dominant static correlation effects. However, capturing the full scope of electronic interactions, especially for complex chemical processes, requires an accurate treatment of static and dynamic correlation effects, which remains a significant challenge in computational chemistry. This study presents a new approach integrating a Hermitian coupled-cluster-based downfolding technique, incorporating dynamic correlation into active-space Hamiltonians, with the DMRG method. By calculating the ground-state energies of these effective Hamiltonians via DMRG, we achieve a more comprehensive description of electronic structure. We demonstrate the accuracy and efficiency of this combined method for advancing simulations of strongly correlated systems using benchmark calculations on molecular systems, including N$_2$, benzene, and tetramethyleneethane (TME).

physics.chem-ph↗

GALIC: Hybrid Multi-Qubitwise Pauli Grouping for Quantum Computing Measurement

Observable estimation is a core primitive in NISQ-era algorithms targeting quantum chemistry applications. To reduce the state preparation overhead required for accurate estimation, recent works have proposed various simultaneous measurement schemes to lower estimator variance. Two primary grouping schemes have been proposed: fully commutativity (FC) and qubit-wise commutativity (QWC), with no compelling means of interpolation. In this work we propose a generalized framework for designing and analyzing context-aware hybrid FC/QWC commutativity relations. We use our framework to propose a noise-and-connectivity aware grouping strategy: Generalized backend-Aware pauLI Commutation (GALIC). We demonstrate how GALIC interpolates between FC and QWC, maintaining estimator accuracy in Hamiltonian estimation while lowering variance by an average of 20\% compared to QWC. We also explore the design space of near-term quantum devices using the GALIC framework, specifically comparing device noise levels and connectivity. We find that error suppression has a more than $10\times$ larger impact on device-aware estimator variance than qubit connectivity with even larger correlation differences in estimator biases.

quant-ph↗

Resource-adaptive quantum flow algorithms for quantum simulations of many-body systems: sub-flow embedding procedures

In this study, we utilized the quantum flow (QFlow) method to perform quantum simulations of correlated systems. The QFlow approach allows for sampling large sub-spaces of the Hilbert space by solving coupled variational problems in reduced dimensionality active spaces. Our research demonstrates that the circuits for evaluating the low dimensionality subproblems of the QFlow algorithms on quantum computers are significantly less complex than the parent (large subspace of the Hilbert space) problem, opening up possibilities for scalable and constant-circuit-depth quantum computing. Our simulations indicate that QFlow can be used to optimize a large number of wave function parameters without an increase in the required number of qubits. We were able to showcase that a variation of the QFlow procedure can optimize 1,100 wave function parameters using modest quantum resources. Furthermore, we investigated an adaptive approach known as the sub-flow approach, which involves a limited number of active spaces in the quantum flow process. Our findings shed light on the potential of QFlow in efficiently handling correlated systems via quantum simulations.

quant-ph↗