arXiv subjects

Stefano Barison

Publications and source records attributed to Stefano Barison.

13 recordsLinked to original sources

arXiv2026

Exploring pathways towards quantum advantage in quantum chemistry: the case of a molecule with half-M\"obius topology

We report quantum chemistry calculations performed on superconducting quantum processors for a molecule exhibiting the half-M\"obius electronic topology originally introduced by Ron\v{c}evi\'c et al. Using SqDRIFT, a randomized sample-based Krylov quantum diagonalization algorithm, we achieve reliable quantum simulations on active spaces corresponding to 36 orbitals (72 qubits) and extend previous studies up to 50 orbitals (100 qubits). We demonstrate that a systematic increase of active space sizes, which has a concrete impact on the accuracy of the electronic structure description, is achievable with state-of-the-art quantum processors, thus offering a promising path towards practically relevant quantum-assisted electronic-structure calculations.

quant-ph↗

arXiv2026

On-surface synthesis and aromaticity of large cyclocarbons

Molecular rings of N carbon atoms, that is, cyclo[N]carbons, or C$_N$, can be formed by tip-induced chemistry [1-7]. Because of their monocyclic geometry, cyclocarbons are fundamentally important for testing theoretical models of aromaticity [8-11]. Here, we synthesized large cyclo[N]carbons, with N up to 88, by tip-induced chemistry on a NaCl surface and studied their aromaticity by measuring their transport gaps by scanning tunnelling spectroscopy. We first generated C$_{20}$ and C$_{22}$, and then fused multiple cyclocarbons [5-7] by means of atom manipulation, obtaining C$_{42}$, C$_{44}$, C$_{46}$, C$_{66}$ and C$_{88}$. In agreement with predictions obtained using a finely tuned density functional [12-15] and large active space approximate configuration interaction calculations executed on quantum hardware [16, 17], we observe a substantially smaller transport gap for C$_{20}$ (N = 4n) compared to C$_{22}$ (4n+2), and for C$_{44}$ (4n) relative to C$_{42}$ (4n+2). In larger cyclocarbons, the oscillation of the transport gap between anti-aromatic N = 4n and aromatic N = 4n+2 cyclocarbons becomes smaller, and is expected to eventually vanish with increasing N, indicating non-aromaticity. Our experimental results show that aromaticity persists at N = 42, and theory predicts ring currents comparable in magnitude to that of benzene in cyclocarbons of this size. In the future, such large cyclocarbons could be used to study conductance, quantum interference, and the effects of aromaticity in single atomic carbon wires and circuits.

cond-mat.mes-hall↗

arXiv2025

Classically Prepared, Quantumly Evolved: Hybrid Algorithm for Molecular Spectra

We introduce a hybrid classical-quantum algorithm to compute dynamical correlation functions and excitation spectra in many-body quantum systems, with a focus on molecular systems. The method combines classical preparation of a perturbed ground state with short-time quantum evolution of product states sampled from it. The resulting quantum samples define an effective subspace of the Hilbert space, onto which the Hamiltonian is projected to enable efficient classical simulation of long-time dynamics. This subspace-based approach achieves high-resolution spectral reconstruction using shallow circuits and few samples. Benchmarks on molecular systems show excellent agreement with exact diagonalization and demonstrate access to dynamical timescales beyond the reach of purely classical methods, highlighting its suitability for near-term and early fault-tolerant quantum hardware.

quant-ph↗

arXiv2025

Quantum chemistry with provable convergence via randomized sample-based Krylov quantum diagonalization

Quantum algorithms based on classical processing of individual samples have recently emerged as the most effective and robust methods to approximate ground-state wave functions of many-body quantum systems on pre-fault-tolerant and early-fault-tolerant quantum devices. In these algorithms, the quantum computer acts as a sampling engine that generates the subspace in which the Hamiltonian is classically diagonalized. The recently proposed Sample-based Krylov Quantum Diagonalization (SKQD), uses quantum Krylov states as circuits from which samples are collected. Convergence guarantees can be derived for SKQD under similar assumptions to those of quantum phase estimation, provided that the ground-state wave function is well approximated by a polynomial subset of the full Hilbert space. However, implementations of SKQD for complex many-body Hamiltonians, such as quantum chemistry ones, are limited by the depths of time-evolution circuits needed to generate Krylov vectors. In this work, we introduce a method that combines SKQD with a qDRIFT randomized compilation of the Hamiltonian propagator. The resulting algorithm, termed SqDRIFT, enables quantum chemistry experiments on quantum processors, while preserving the convergence guarantees similar to the phase estimation algorithm. We demonstrate its viability by applying SqDRIFT to calculate the electronic ground-state energy of several polycyclic aromatic hydrocarbons, up to system sizes beyond the reach of exact diagonalization.

quant-ph↗

arXiv2025

A molecule with half-M\"obius topology

Stereoisomers of C$_{13}$Cl$_2$ exhibiting helical orbitals around a ring of carbon atoms were synthesized by atom manipulation on NaCl surfaces. We resolved the enantiomeric geometries of the singlet states by atomic force microscopy and mapped their helical orbital densities by scanning tunnelling microscopy. A ${\pi}$-orbital basis of the helical, non-planar singlets that twists by 90{\deg} in one circulation is consistent with a half-M\"obius topology. In such a topology, the ${\pi}$-orbital basis changes sign with respect to two circumnavigations and is periodic with respect to four circumnavigations. A quasiparticle on a ring with this boundary condition could be interpreted as carrying a Berry phase of ${\pi}$/2. We demonstrate reversible switching of the topology, between the two singlets of oppositely threaded half-M\"obius topology, and the planar, topologically trivial, triplet state. Multireference calculations, including large-scale sample-based ab initio calculations executed on quantum hardware, reveal that the switching is associated with a helical pseudo Jahn-Teller effect.

cond-mat.mes-hall↗

arXiv2024

Local fermion-to-qudit mappings: a practical recipe for four-level systems

In this paper, we present a new set of local fermion-to-qudit mappings for simulating fermionic lattice systems. We focus on the use of multi-level qudits, specifically ququarts. Traditional mappings, such as the Jordan-Wigner transformation (JWT), while useful, often result in non-local operators that scale unfavorably with system size. To address these challenges, we introduce mappings that efficiently localize fermionic operators on qudits, reducing the non-locality and operator weights associated with JWT. We propose one mapping for spinless fermions and two mappings for spinful fermions, comparing their performance in terms of qudit-weight, circuit depth, and gate complexity. By leveraging the extended local Hilbert space of qudits, we show that these mappings enable more efficient quantum simulations in terms of two-qudit gates, reducing hardware requirements without increasing computational complexity. We validate our approach by simulating prototypical models such as the spinless t-V model and the Fermi-Hubbard model in two dimensions, using Trotterized time evolution. Our results highlight the potential of qudit-based quantum simulations in achieving scalability and efficiency for fermionic systems on near-term quantum devices.

quant-ph↗

arXiv2024

Quantum-centric computation of molecular excited states with extended sample-based quantum diagonalization

The simulation of molecular electronic structure is an important application of quantum devices. Recently, it has been shown that quantum devices can be effectively combined with classical supercomputing centers in the context of the sample-based quantum diagonalization (SQD) algorithm. This allowed the largest electronic structure quantum simulation to date (77 qubits) and opened near-term devices to practical use cases in chemistry toward the hundred-qubit mark. However, the description of many important physical and chemical properties of those systems, such as photo-absorption/-emission, requires a treatment that goes beyond the ground state alone. In this work, we extend the SQD algorithm to determine low-lying molecular excited states. The extended-SQD method improves over the original SQD method in accuracy, at the cost of an additional computational step. It also improves over quantum subspace expansion based on single and double electronic excitations, a widespread approach to excited states on pre-fault-tolerant quantum devices, in both accuracy and efficiency. We employ the extended SQD method to compute the first singlet (S$_1$) and triplet (T$_1$) excited states of the nitrogen molecule with a correlation-consistent basis set, and the ground- and excited-state properties of the [2Fe-2S] cluster.

quant-ph↗

arXiv2023

Variational Embeddings for Many Body Quantum Systems

We propose a variational scheme to represent composite quantum systems using multiple parameterized functions of varying accuracies on both classical and quantum hardware. The approach follows the variational principle over the entire system, and is naturally suited for scenarios where an accurate description is only needed in a smaller subspace. We show how to include quantum devices as high-accuracy solvers on these correlated degrees of freedom, while handling the remaining contributions with a classical device. We demonstrate the effectiveness of the protocol on spin chains and small molecules and provide insights into its accuracy and computational cost.

quant-ph↗

arXiv2023

Adaptive projected variational quantum dynamics

We propose an adaptive quantum algorithm to prepare accurate variational time evolved wave functions. The method is based on the projected Variational Quantum Dynamics (pVQD) algorithm, that performs a global optimization with linear scaling in the number of variational parameters. Instead of fixing a variational ansatz at the beginning of the simulation, the circuit is grown systematically during the time evolution. Moreover, the adaptive step does not require auxiliary qubits and the gate search can be performed in parallel on different quantum devices. We apply the new algorithm, named Adaptive pVQD, to the simulation of driven spin models and fermionic systems, where it shows an advantage when compared to both Trotterized circuits and non-adaptive variational methods. Finally, we use the shallower circuits prepared using the Adaptive pVQD algorithm to obtain more accurate measurements of physical properties of quantum systems on hardware.

quant-ph↗

arXiv2023

Sequence of penalties method to study excited states using VQE

We propose an extension of the Variational Quantum Eigensolver (VQE) that leads to more accurate energy estimations and can be used to study excited states. The method is based on the introduction of a sequence of increasing penalties in the cost function. This approach does not require circuit modifications and thus can be applied with no additional depth cost. Through numerical simulations, we show that we are able to produce variational states with desired physical properties, such as total spin and charge. We assess its performance both on classical simulators and on currently available quantum devices, calculating the potential energy curves of small molecular systems in different physical configurations. Finally, we compare our method to the original VQE and to another extension, obtaining a better agreement with exact simulations for both energy and targeted physical quantities.

quant-ph↗

arXiv2022

Variational dynamics as a ground-state problem on a quantum computer

We propose a variational quantum algorithm to study the real time dynamics of quantum systems as a ground-state problem. The method is based on the original proposal of Feynman and Kitaev to encode time into a register of auxiliary qubits. We prepare the Feynman-Kitaev Hamiltonian acting on the composed system as a qubit operator and find an approximate ground state using the Variational Quantum Eigensolver. We apply the algorithm to the study of the dynamics of a transverse field Ising chain with an increasing number of spins and time steps, proving a favorable scaling in terms of the number of two qubit gates. Through numerical experiments, we investigate its robustness against noise, showing that the method can be use to evaluate dynamical properties of quantum systems and detect the presence of dynamical quantum phase transitions by measuring Loschmidt echoes.

quant-ph↗

arXiv2021

An efficient quantum algorithm for the time evolution of parameterized circuits

We introduce a novel hybrid algorithm to simulate the real-time evolution of quantum systems using parameterized quantum circuits. The method, named "projected - Variational Quantum Dynamics" (p-VQD) realizes an iterative, global projection of the exact time evolution onto the parameterized manifold. In the small time-step limit, this is equivalent to the McLachlan's variational principle. Our approach is efficient in the sense that it exhibits an optimal linear scaling with the total number of variational parameters. Furthermore, it is global in the sense that it uses the variational principle to optimize all parameters at once. The global nature of our approach then significantly extends the scope of existing efficient variational methods, that instead typically rely on the iterative optimization of a restricted subset of variational parameters. Through numerical experiments, we also show that our approach is particularly advantageous over existing global optimization algorithms based on the time-dependent variational principle that, due to a demanding quadratic scaling with parameter numbers, are unsuitable for large parameterized quantum circuits.

quant-ph↗

arXiv2020

Quantum simulations of molecular systems with intrinsic atomic orbitals

Quantum simulations of molecular systems on quantum computers often employ minimal basis sets of Gaussian orbitals. In comparison with more realistic basis sets, quantum simulations employing minimal basis sets require fewer qubits and quantum gates, but yield results of lower accuracy. A natural strategy to achieve more accurate results is to increase the basis set size, which in turn requires increasing the number of qubits and quantum gates. Here we explore the use of intrinsic atomic orbitals (IAOs) in quantum simulations of molecules, to improve the accuracy of energies and properties at the same computational cost required by a minimal basis. We investigate ground-state energies and one- and two-body density operators in the framework of the variational quantum eigensolver, employing and comparing different Ans\"{a}tze. We also demonstrate the use of this approach in the calculation of ground- and excited-states energies of small molecules by a combination of quantum algorithms, using IBM Quantum computers.

quant-ph↗