Search arXivSearch

arXiv · 2607.16389

Sample-based quantum diagonalization approach for open-shell transition-metal complexes in gas and implicit-solvent

Abstract

Open-shell $3d$ transition-metal complexes challenge electronic-structure methods because competing spin states, charge transfer, and solvation jointly determine their energetics. Here, we combine sample-based quantum diagonalization (SQD) with the integral-equation-formalism polarizable continuum model (IEF-PCM), extending SQD to correlated open-shell transition-metal systems in a dielectric environment. We investigate the octahedrally coordinated $\mathrm{[Co(H_2O)_5CO_2]^{2+/3+}}$ complex across two oxidation states, four spin multiplicities, and a metal-ligand dissociation coordinate. We study the Co(III) singlet and quintet states and the Co(II) doublet and quartet states, incorporating open-shell references into SQD-IEF-PCM through an outer self-consistent reaction-field loop. Using samples collected on an IBM Heron quantum processor and active spaces of up to 50 qubits, SQD reproduces coupled-cluster and heat-bath configuration-interaction benchmarks within the same active space in the gas phase and implicit solvent, with a largest observed deviation below 9 $mE_h$. Along the dissociation coordinate of high-spin quintet $\mathrm{[Co(H_2O)_5CO_2]^{3+}}$, SQD resolves an avoided crossing caused by internal charge transfer; this feature is absent in the singlet and the lower oxidation state of the complex. Relative to the gas phase, implicit solvation stabilizes for the quintet state the neutral CO$_2$ dissociation and suppresses the avoided-crossing feature. To our knowledge, this is the first hardware demonstration of SQD for an open-shell $3d$ transition-metal complex in gas phase and implict solvent. These results establish SQD as a robust quantum-centric approach for transition-metal chemistry where spin state ordering, charge transfer, and environmental effects are strongly intertwined.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David David, Vedangi Pathak, Marek Kowalik, Hamed Mohammadbagherpoor, Vincent Beltrani, Kara Maller, Niall Moroney, Phalgun Lolur. 2026-07-17. Sample-based quantum diagonalization approach for open-shell transition-metal complexes in gas and implicit-solvent. https://arxiv.org/abs/2607.16389

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fermionic magic resources in disordered quantum spin chains

Fermionic non-Gaussianity quantifies a quantum state's deviation from a classically tractable free-fermionic description, constituting a necessary resource for computational quantum advantage. Here we use fermionic antiflatness (FAF) to measure this deviation across ergodic and many-body localized (MBL) regimes. We focus on the paradigmatic disordered spin-$1\!/2$ XXZ chain and its impurity variant with local interactions. Across highly excited eigenstates, FAF evolves from typical-state behavior at weak disorder to strongly suppressed values deep in the MBL regime, with volume-law scaling in the XXZ chain and an area-law bound in the impurity setting. Rare long-range cat-like eigenstates exhibit a pronounced enhancement of FAF, making it a sensitive diagnostic of mechanisms proposed to destabilize MBL. Starting from product states, we find that in the MBL regime FAF grows slowly in time, approaching saturation via a power-law relaxation. Overall, our results show that MBL suppresses fermionic non-Gaussianity, and the associated complexity beyond free fermions, while ergodicity restores it, motivating explorations of fermionic non-Gaussianity in other ergodicity-breaking phenomena.

quant-ph

Progressive Binarization - Pauli Correlation Encoding: a Continuation Method for Constrained Optimization

Pauli Correlation Encoding (PCE) reduces the qubit requirements of quantum optimization by embedding the problem variables into the expectation values of Pauli observables, so that the number of qubits can be much smaller than the number of variables. PCE has not yet been studied for constrained optimization. We extend it to constrained combinatorial problems, using the budget-constrained MinCut as a case study, and show that the standard formulation fails to reliably enforce the constraint: feasibility hinges on the binarization of the encoded variables, which depends sensitively on hyperparameters that are hard to tune and do not transfer across instances. To address this, we introduce Progressive-Binarization PCE (PB-PCE), an adaptive continuation scheme that progressively increases the binarization parameter while re-optimizing the circuit from the previous solution, driving the variables towards the binary domain. PB-PCE attains near-complete constraint satisfaction (88--100\%) and smaller cut sizes than standard PCE, with a number of stages (10--20) essentially independent of problem size, solving instances of up to 300 variables with only 9-qubit circuits.

quant-ph

A quantum model for synchronizing finite state transition systems

We propose a quantum model for finding a resetting input sequence (RS) which can take a finite state transition system (FA), to particular state independent of its current state. The complexity of finding such sequences for various types of FA can be NP-Hard or even PSPACE-Complete. To this end, we represent the FA states, inputs, and transition function in quantum space. Accordingly, we propose a model to represent the execution of an input sequence of a particular length $l$ starting form an initial FA state. The model is extended considering the application in superposition of all input sequences of length $l$ to an initial state of the FA. The model is further extended considering the application of all input sequences to all initial states of the FA capturing for every input sequence the collection (ordered list) of states reached by applying the sequence to all states of the FA. The amplitude amplification algorithm is then used as it combines similar collections of reached states while preserving all input sequences that reach these collections. A Grover search for a reached collection where its elements correspond to the same FA state provides a RS for the FA. Our approach offers a quadratic gain over the exponential complexity of traditional brute-force method, which is the only method that can be applied to a general FA class.

quant-ph