Ivano Tavernelli
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ivano Tavernelli has a total of 426 co-authors. Here are the top co-authors by number of shared publications:
- Francesco Tacchino
IBM Quantum, IBM Research Zurich, 8803 Rüschlikon, Switzerland
28 shared publications Francesco Tacchino
11 shared publications- Panagiotis Kl. Barkoutsos
IBM Quantum, IBM Research - Zurich, Rüschlikon, Switzerland
11 shared publications - Max Rossmannek
IBM Quantum IBM Research Europe -Zürich 8803 Rüschlikon Switzerland
10 shared publications - Leo Gross
IBM Research Europe – Zurich, Rüschlikon, Switzerland
9 shared publications Panagiotis Kl. Barkoutsos
IBM Quantum, IBM Research Europe—Zurich, Rüschlikon, Switzerland
9 shared publications
Latest Publications
- Open Access
- 30 May 2026
- Published by Springer Nature in Communications Physics
- Vol. 9 (1)
Neutrino thermalization via randomization on a quantum processor
- 30 May 2026
- Published by Springer Nature in Communications Physics
- Vol. 9 (1)
Open AccessNeutrino thermalization via randomization on a quantum processor
- Top Cited Papers
- 7 May 2026
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 392 (6798) , eaea3321
A molecule with half-Möbius 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 tunneling microscopy. A π-orbital basis of the helical, nonplanar singlets that twists by 90° in one circulation is consistent with a half-Möbius topology. In such a topology, the π-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 π/2. We demonstrate reversible switching of the topology between the two singlets of oppositely threaded half-Möbius topology and the planar, topologically trivial triplet state. Multireference calculations, including large-scale, sample-based ab initio calculations executed on quantum hardware, revealed that the switching is associated with a helical pseudo–Jahn-Teller effect.
- 7 May 2026
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 392 (6798) , eaea3321
Top Cited PapersA molecule with half-Möbius 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 tunneling microscopy. A π-orbital basis of the helical, nonplanar singlets that twists by 90° in one circulation is consistent with a half-Möbius topology. In such a topology, the π-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 π/2. We demonstrate reversible switching of the topology between the two singlets of oppositely threaded half-Möbius topology and the planar, topologically trivial triplet state. Multireference calculations, including large-scale, sample-based ab initio calculations executed on quantum hardware, revealed that the switching is associated with a helical pseudo–Jahn-Teller effect.
- Open Access
- 13 April 2026
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 10
A circuit-differentiation framework for Green's functions on quantum computers
We propose a general framework for computing Retarded Green's Functions (RGFs) on quantum computers by recasting their evaluation as a problem of circuit differentiation. Our proposal is based on real-time evolution and specifically designed circuit components, which we refer to as circuit perturbations, acting as a direct representation of the external perturbative force within the quantum circuit in a linear-response setting. The direct mapping between circuit derivatives and the computation of RGFs enables the use of a broad range of differentiation strategies. We provide two such examples, including a class of stochastic estimators which do not require extra qubit connectivity with respect to the underlying time-evolution operations. We demonstrate our approach on interacting spin and fermionic models, showing that accurate dynamical correlations can be obtained even under realistic noise assumptions. Finally, we outline how our proposal can be tied to efficient gradient-estimation techniques relevant for the fault-tolerant regime.
- 13 April 2026
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 10
Open AccessA circuit-differentiation framework for Green's functions on quantum computers
We propose a general framework for computing Retarded Green's Functions (RGFs) on quantum computers by recasting their evaluation as a problem of circuit differentiation. Our proposal is based on real-time evolution and specifically designed circuit components, which we refer to as circuit perturbations, acting as a direct representation of the external perturbative force within the quantum circuit in a linear-response setting. The direct mapping between circuit derivatives and the computation of RGFs enables the use of a broad range of differentiation strategies. We provide two such examples, including a class of stochastic estimators which do not require extra qubit connectivity with respect to the underlying time-evolution operations. We demonstrate our approach on interacting spin and fermionic models, showing that accurate dynamical correlations can be obtained even under realistic noise assumptions. Finally, we outline how our proposal can be tied to efficient gradient-estimation techniques relevant for the fault-tolerant regime.
- Top Cited Papers
- 20 January 2026
- Published by Springer Nature in Nature Physics
- Vol. 22 (2) , 302-307
Dynamical simulations of many-body quantum chaos on a quantum computer
- 20 January 2026
- Published by Springer Nature in Nature Physics
- Vol. 22 (2) , 302-307
Top Cited PapersDynamical simulations of many-body quantum chaos on a quantum computer
- Open Access
- 14 January 2026
- Published by Royal Society of Chemistry (RSC) in Physical Chemistry Chemical Physics
- Vol. 28 (4) , 3035-3054
Approximate quantum circuit compilation for proton-transfer kinetics on quantum processors
Proton transfer reactions are central to chemical and biological systems, where quantum effects—such as tunneling, delocalization, and zero-point motion—critically influence reaction kinetics. Classical methods that capture these phenomena scale poorly with system size, limiting their applicability. Here, we extend and benchmark a quantum computing framework based on the Nuclear–Electronic Orbital formalism, treating the transferring proton quantum mechanically, to assess the feasibility of computing accurate energy barriers on current quantum devices. Using malonaldehyde as a prototypical system, we construct deep initial circuits via ADAPT-VQE combined with the frozen natural orbital approximation and apply adaptive approximate quantum compiling to balance circuit depth and fidelity. Transpiling these circuits for the ibm_pittsburgh device and simulating with realistic noise models, we compute barrier heights and delocalized proton densities along the reaction pathway. Circuit refinement and compression yield compact representations that preserve essential quantum features of the transfer process. Notably, our shallowest circuits (AQC-low) reproduce key qualitative features, such as proton density localization, and are near the frontier of feasibility for current hardware. In contrast, deeper circuits (AQC-high) retain higher fidelity to reference barrier height, reducing the error to 1.6 mHa (13%) while still yielding a 98% underestimation of the rate constant at 120 K.
- 14 January 2026
- Published by Royal Society of Chemistry (RSC) in Physical Chemistry Chemical Physics
- Vol. 28 (4) , 3035-3054
Open AccessApproximate quantum circuit compilation for proton-transfer kinetics on quantum processors
Proton transfer reactions are central to chemical and biological systems, where quantum effects—such as tunneling, delocalization, and zero-point motion—critically influence reaction kinetics. Classical methods that capture these phenomena scale poorly with system size, limiting their applicability. Here, we extend and benchmark a quantum computing framework based on the Nuclear–Electronic Orbital formalism, treating the transferring proton quantum mechanically, to assess the feasibility of computing accurate energy barriers on current quantum devices. Using malonaldehyde as a prototypical system, we construct deep initial circuits via ADAPT-VQE combined with the frozen natural orbital approximation and apply adaptive approximate quantum compiling to balance circuit depth and fidelity. Transpiling these circuits for the ibm_pittsburgh device and simulating with realistic noise models, we compute barrier heights and delocalized proton densities along the reaction pathway. Circuit refinement and compression yield compact representations that preserve essential quantum features of the transfer process. Notably, our shallowest circuits (AQC-low) reproduce key qualitative features, such as proton density localization, and are near the frontier of feasibility for current hardware. In contrast, deeper circuits (AQC-high) retain higher fidelity to reference barrier height, reducing the error to 1.6 mHa (13%) while still yielding a 98% underestimation of the rate constant at 120 K.
- Open Access
- 30 December 2025
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 6 (4) , 045076
Encoding molecular structures in quantum machine learning
Quantum machine learning (QML) has great potential for the analysis of chemical datasets. However, conventional quantum data-encoding schemes, such as fingerprint encoding, are generally unfeasible for the accurate representation of chemical moieties in such datasets. In this contribution, we introduce the quantum molecular structure encoding (QMSE) scheme, which encodes the molecular bond orders and interatomic couplings expressed as a hybrid Coulomb-adjacency matrix, directly as one- and two-qubit rotations within parametrised circuits. We show that this strategy provides an efficient and interpretable method in improving state separability between encoded molecules compared to other fingerprint encoding methods, which is especially crucial for the success in preparing feature maps in QML workflows. To benchmark our method, we train a parametrised ansatz on molecular datasets to perform classification of state phases and regression on boiling points, demonstrating the competitive trainability and generalisation capabilities of QMSE. We further prove a fidelity-preserving chain-contraction theorem that reuses common substructures to cut qubit counts, with an application to long-chain fatty acids. We expect this scalable and interpretable encoding framework to greatly pave the way for practical QML applications of molecular datasets.
- 30 December 2025
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 6 (4) , 045076
Open AccessEncoding molecular structures in quantum machine learning
Quantum machine learning (QML) has great potential for the analysis of chemical datasets. However, conventional quantum data-encoding schemes, such as fingerprint encoding, are generally unfeasible for the accurate representation of chemical moieties in such datasets. In this contribution, we introduce the quantum molecular structure encoding (QMSE) scheme, which encodes the molecular bond orders and interatomic couplings expressed as a hybrid Coulomb-adjacency matrix, directly as one- and two-qubit rotations within parametrised circuits. We show that this strategy provides an efficient and interpretable method in improving state separability between encoded molecules compared to other fingerprint encoding methods, which is especially crucial for the success in preparing feature maps in QML workflows. To benchmark our method, we train a parametrised ansatz on molecular datasets to perform classification of state phases and regression on boiling points, demonstrating the competitive trainability and generalisation capabilities of QMSE. We further prove a fidelity-preserving chain-contraction theorem that reuses common substructures to cut qubit counts, with an application to long-chain fatty acids. We expect this scalable and interpretable encoding framework to greatly pave the way for practical QML applications of molecular datasets.
- Open Access
Hardware-efficient formulation of molecular cavity-QED Hamiltonians
Light-matter coupled Hamiltonians are central to cavity materials engineering and polaritonic chemistry, but are challenging to simulate with classical hardware due to the scaling of the Hilbert space with the number of quantum photon modes and matter complexity. Leveraging the fact that quantum computers naturally represent photonic modes efficiently, we present a novel approach to simulate quantum-electrodynamical (QED) systems on near-term quantum hardware. After developing the bosonic and mixed operators in the Qiskit Nature framework, we employ them to simulate a first-order Trotterized Hamiltonian for a spontaneous-emission problem of a two-level system in an optical cavity. We find that using a standing-waves photonic basis approach leads to fidelity issues due to hardware connectivity constraints and two-qubits gates errors. Hence, we propose using a localized photonic basis approach that enforces nearest-neighbor couplings, thanks to which we can map the Hamiltonian as a 1D qubit chain. We significantly reduce the noise and, by applying the zero-noise extrapolation error mitigation technique, we recover the accurate quantum dynamics. Finally, we also show that this approach is resilient when relaxing the 1D qubit chain approximation.
Open AccessHardware-efficient formulation of molecular cavity-QED Hamiltonians
Light-matter coupled Hamiltonians are central to cavity materials engineering and polaritonic chemistry, but are challenging to simulate with classical hardware due to the scaling of the Hilbert space with the number of quantum photon modes and matter complexity. Leveraging the fact that quantum computers naturally represent photonic modes efficiently, we present a novel approach to simulate quantum-electrodynamical (QED) systems on near-term quantum hardware. After developing the bosonic and mixed operators in the Qiskit Nature framework, we employ them to simulate a first-order Trotterized Hamiltonian for a spontaneous-emission problem of a two-level system in an optical cavity. We find that using a standing-waves photonic basis approach leads to fidelity issues due to hardware connectivity constraints and two-qubits gates errors. Hence, we propose using a localized photonic basis approach that enforces nearest-neighbor couplings, thanks to which we can map the Hamiltonian as a 1D qubit chain. We significantly reduce the noise and, by applying the zero-noise extrapolation error mitigation technique, we recover the accurate quantum dynamics. Finally, we also show that this approach is resilient when relaxing the 1D qubit chain approximation.
- Open Access
- 11 August 2025
- Published by Annual Reviews in Annual Review of Biomedical Data Science
- Vol. 8 (1) , 509-536
Quantum Computing for Photosensitizer Design in Photodynamic Therapy
Use of light in healthcare is evolving with increasing applications of photodynamic therapy (PDT) for treating various cancers. PDT utilizes light-activated molecules called photosensitizers (PSs) that generate reactive oxygen species (ROSs) to induce tumor cell apoptosis and necrosis. However, the use of PDT is limited by the availability of PSs that can be activated by deep tissue–penetrating near-infrared light, exhibit low dark toxicity, and produce ROSs efficiently. Here we review the different categories of PS currently used in clinical or preclinical trials and highlight the significance of advanced computational methods, including density functional and wave function–based quantum chemistry, for understanding the molecular mechanisms involved in PS activation. Despite advancements in classical computational techniques, the complexities of excited state dynamics in highly correlated molecular systems demand innovative simulation approaches such as quantum computing. We propose that quantum computing holds promise for accurately modeling the excited-state properties of PSs to optimize their design and broaden clinical applications.
- 11 August 2025
- Published by Annual Reviews in Annual Review of Biomedical Data Science
- Vol. 8 (1) , 509-536
Open AccessQuantum Computing for Photosensitizer Design in Photodynamic Therapy
Use of light in healthcare is evolving with increasing applications of photodynamic therapy (PDT) for treating various cancers. PDT utilizes light-activated molecules called photosensitizers (PSs) that generate reactive oxygen species (ROSs) to induce tumor cell apoptosis and necrosis. However, the use of PDT is limited by the availability of PSs that can be activated by deep tissue–penetrating near-infrared light, exhibit low dark toxicity, and produce ROSs efficiently. Here we review the different categories of PS currently used in clinical or preclinical trials and highlight the significance of advanced computational methods, including density functional and wave function–based quantum chemistry, for understanding the molecular mechanisms involved in PS activation. Despite advancements in classical computational techniques, the complexities of excited state dynamics in highly correlated molecular systems demand innovative simulation approaches such as quantum computing. We propose that quantum computing holds promise for accurately modeling the excited-state properties of PSs to optimize their design and broaden clinical applications.
- Open Access
Quantum Algorithm for Protein Side-Chain Optimisation: Comparing Quantum to Classical Methods
Modelling and predicting protein configurations is crucial for advancing drug discovery, enabling the design of treatments for life-threatening diseases. A critical aspect of this challenge is rotamer optimisation - the determination of optimal side-chain conformations given a fixed protein backbone. This problem, involving the internal degrees of freedom of amino acid side-chains, significantly influences the protein's overall structure and function. In this work, we develop a resource-efficient optimisation algorithm to compute the ground state energy of protein structures, with a focus on side-chain configuration. We formulate the rotamer optimisation problem as a Quadratic Unconstrained Binary Optimisation problem and map it to an Ising model, enabling efficient quantum encoding. Building on this formulation, we propose a quantum algorithm based on the Quantum Approximate Optimisation Algorithm to explore the conformational space and identify low-energy configurations. To benchmark our approach, we conduct a classical study using custom-built libraries tailored for structural characterisation and energy optimisation. Our quantum method demonstrates a reduction in computational cost compared to classical simulated annealing techniques, offering a scalable and promising framework for protein structure optimisation in the quantum era.
Open AccessQuantum Algorithm for Protein Side-Chain Optimisation: Comparing Quantum to Classical Methods
Modelling and predicting protein configurations is crucial for advancing drug discovery, enabling the design of treatments for life-threatening diseases. A critical aspect of this challenge is rotamer optimisation - the determination of optimal side-chain conformations given a fixed protein backbone. This problem, involving the internal degrees of freedom of amino acid side-chains, significantly influences the protein's overall structure and function. In this work, we develop a resource-efficient optimisation algorithm to compute the ground state energy of protein structures, with a focus on side-chain configuration. We formulate the rotamer optimisation problem as a Quadratic Unconstrained Binary Optimisation problem and map it to an Ising model, enabling efficient quantum encoding. Building on this formulation, we propose a quantum algorithm based on the Quantum Approximate Optimisation Algorithm to explore the conformational space and identify low-energy configurations. To benchmark our approach, we conduct a classical study using custom-built libraries tailored for structural characterisation and energy optimisation. Our quantum method demonstrates a reduction in computational cost compared to classical simulated annealing techniques, offering a scalable and promising framework for protein structure optimisation in the quantum era.
- Open Access
Resource-Efficient Simulations of Particle Scattering on a Digital Quantum Computer
We develop and demonstrate methods for simulating the scattering of particle wave packets in the interacting Thirring model on digital quantum computers, with hardware implementations on up to 80 qubits. We identify low-entanglement time slices of the scattering dynamics and exploit their efficient representation by tensor networks. Circuit compression based on matrix product state techniques yields on average a reduction by a factor of 3.2 in circuit depth compared to conventional approaches, allowing longer evolution times to be evaluated with higher fidelity on contemporary quantum processors. Utilizing zero-noise extrapolation in combination with Pauli twirling, on quantum hardware we accurately simulate the full scattering dynamics on 40 qubits, and further demonstrate the wave packet state-preparation on 80 qubits.
Open AccessResource-Efficient Simulations of Particle Scattering on a Digital Quantum Computer
We develop and demonstrate methods for simulating the scattering of particle wave packets in the interacting Thirring model on digital quantum computers, with hardware implementations on up to 80 qubits. We identify low-entanglement time slices of the scattering dynamics and exploit their efficient representation by tensor networks. Circuit compression based on matrix product state techniques yields on average a reduction by a factor of 3.2 in circuit depth compared to conventional approaches, allowing longer evolution times to be evaluated with higher fidelity on contemporary quantum processors. Utilizing zero-noise extrapolation in combination with Pauli twirling, on quantum hardware we accurately simulate the full scattering dynamics on 40 qubits, and further demonstrate the wave packet state-preparation on 80 qubits.