DRDavide Rattacaso

Davide Rattacaso

*This is an algorithmically generated author record based on publicly available information.

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


Davide Rattacaso has a total of 17 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Quantum algorithms for equational reasoning

    by Davide Rattacaso, Daniel Jaschke, Marco Ballarin, Ilaria Siloi, Simone Montangero

    As a cornerstone of automated reasoning, equational reasoning finds equivalences between symbolic expressions and fuels advances across scientific disciplines. Yet, its potential remains limited by the exponential growth of equivalent expressions with increasing problem size. We introduce quantum normal form reduction, a quantum computational framework designed to address this challenge. We construct an efficiently implementable quantum Hamiltonian whose ground state encodes all equivalent expressions in a quantum superposition. By preparing and manipulating these states, we tackle fundamental problems in equational reasoning, including verifying and counting equivalent expressions and identifying structural properties of equivalence classes. We demonstrate a quantum-inspired version of the algorithm using tensor networks to solve instances involving up to 10 28 equivalent expressions, far beyond the reach of classical graph exploration. This framework opens the path for quantum symbolic computation in areas from circuit design to data compression, computational group theory, linguistics, and macromolecular modeling, unlocking previously inaccessible problems.

  • Open Access

    Quantum circuit compilation with quantum computers

    by Davide Rattacaso, Daniel Jaschke, Marco Ballarin, Ilaria Siloi, Simone Montangero

    Compilation optimizes quantum algorithms’ performances on real-world quantum computers. To date, it is performed via classical optimization strategies. We introduce a class of quantum algorithms to perform compilation via quantum computers, paving the way for a quantum advantage in compilation. We demonstrate the effectiveness of this approach via quantum and simulated annealing-based compilation: We successfully compile a Trotterized Hamiltonian simulation with up to 64 qubits and 64 time steps and a quantum Fourier transform with up to 40 qubits and 771 time steps. We show that, for a translationally invariant circuit, the compilation results in a fidelity gain that grows extensively in the size of the input circuit, outperforming any local or quasilocal compilation approach.


  • Open Access

    Parent Hamiltonian Reconstruction via Inverse Quantum Annealing

    by Davide Rattacaso, Gianluca Passarelli, Angelo Russomanno, Procolo Lucignano, Giuseppe E. Santoro, Rosario Fazio

    Finding a local Hamiltonian $\hat{\mathcal{H}}$ having a given many-body wavefunction $|ψ\rangle$ as its ground state, i.e. a parent Hamiltonian, is a challenge of fundamental importance in quantum technologies. Here we introduce a numerical method, inspired by quantum annealing, that efficiently performs this task through an artificial inverse dynamics: a slow deformation of the states $|ψ(λ(t))\rangle$, starting from a simple state $|ψ_0\rangle$ with a known $\hat{\mathcal{H}}_0$, generates an adiabatic evolution of the corresponding Hamiltonian. We name this approach inverse quantum annealing. The method, implemented through a projection onto a set of local operators, only requires the knowledge of local expectation values, and, for long annealing times, leads to an approximate parent Hamiltonian whose degree of locality depends on the correlations built up by the states $|ψ(λ)\rangle$. We illustrate the method on two paradigmatic models: the Kitaev fermionic chain and a quantum Ising chain in longitudinal and transverse fields.


  • Parent Hamiltonian Reconstruction via Inverse Quantum Annealing

    by Davide Rattacaso, Gianluca Passarelli, Angelo Russomanno, Procolo Lucignano, Giuseppe E. Santoro, Rosario Fazio

    Finding a local Hamiltonian H^ that has a given many-body wave function |ψ⟩ as its ground state, i.e., a parent Hamiltonian, is a challenge of fundamental importance in quantum technologies. Here we introduce a numerical method, inspired by quantum annealing, that efficiently performs this task through an artificial inverse dynamics: a slow deformation of the states |ψ(λ(t))⟩, starting from a simple state |ψ0⟩ with a known H^0, generates an adiabatic evolution of the corresponding Hamiltonian. We name this approach inverse quantum annealing. The method, implemented through a projection onto a set of local operators, only requires the knowledge of local expectation values, and, for long annealing times, leads to an approximate parent Hamiltonian whose degree of locality depends on the correlations built up by the states |ψ(λ)⟩. We illustrate the method on two paradigmatic models: the Kitaev fermionic chain and a quantum Ising chain in longitudinal and transverse fields.


  • Stabilizer entropy dynamics after a quantum quench

    by Davide Rattacaso, Lorenzo Leone, Salvatore F. E. Oliviero, Alioscia Hamma

    Stabilizer entropies (SE) measure deviations from stabilizer resources and as such are a fundamental ingredient for quantum advantage. In particular, the interplay of SE and entanglement is at the root of the complexity of classically simulating quantum many-body systems. In this paper, we study the dynamics of SE in a quantum many-body system away from the equilibrium after a quantum quench in an integrable system. We obtain two main results: (i) we show that SE, despite being an L-extensive quantity, equilibrates in a time that scales at most linearly with the subsystem size and (ii) we show that there is a SE length increasing linearly in time, akin to correlations and entanglement spreading.


  • Open Access

    High-accuracy Hamiltonian learning via delocalized quantum state evolutions

    by Davide Rattacaso, Gianluca Passarelli, Procolo Lucignano

    Learning the unknown Hamiltonian governing the dynamics of a quantum many-body system is a challenging task. In this manuscript, we propose a possible strategy based on repeated measurements on a single time-dependent state. We prove that the accuracy of the learning process is maximized for states that are delocalized in the Hamiltonian eigenbasis. This implies that delocalization is a quantum resource for Hamiltonian learning, that can be exploited to select optimal initial states for learning algorithms. We investigate the error scaling of our reconstruction with respect to the number of measurements, and we provide examples of our learning algorithm on simulated quantum systems.


  • Open Access

    High-accuracy Hamiltonian learning via delocalized quantum state evolutions

    by Davide Rattacaso, Gianluca Passarelli, Procolo Lucignano

    Learning the unknown Hamiltonian governing the dynamics of a quantum many-body system is a challenging task. In this manuscript, we propose a possible strategy based on repeated measurements on a single time-dependent state. We prove that the accuracy of the learning process is maximized for states that are delocalized in the Hamiltonian eigenbasis. This implies that delocalization is a quantum resource for Hamiltonian learning, that can be exploited to select optimal initial states for learning algorithms. We investigate the error scaling of our reconstruction with respect to the number of measurements, and we provide examples of our learning algorithm on simulated quantum systems.

  • Optimal Parent Hamiltonians for Many-Body States

    by Davide Rattacaso, Gianluca Passarelli, Procolo Lucignano, Rosario Fazio

  • Optimal parent Hamiltonians for time-dependent states

    by Davide Rattacaso, Gianluca Passarelli, Antonio Mezzacapo, Procolo Lucignano, Rosario Fazio

    Given a generic time-dependent many-body quantum state, we determine the associated parent Hamiltonian. This procedure may require, in general, interactions of any sort. Enforcing the requirement of a fixed set of engineerable Hamiltonians, we find the optimal Hamiltonian once a set of realistic elementary interactions is defined. We provide three examples of this approach. We first apply the optimization protocol to the ground states of the one-dimensional Ising model and a ferromagnetic p-spin model but with time-dependent coefficients. We also consider a time-dependent state that interpolates between a product state and the ground state of a p-spin model. We determine the time-dependent optimal parent Hamiltonian for these states and analyze the capability of this Hamiltonian of generating the state evolution. Finally, we discuss the connections of our approach to shortcuts to adiabaticity.


  • Towards a Geometrization of Quantum Complexity and Chaos

    by Davide Rattacaso, Patrizia Vitale, Alioscia Hamma