arXiv subjects

Denis Lacroix

Publications and source records attributed to Denis Lacroix.

At least 19 recordsLinked to original sources

arXiv2026

Algebraic Diagrammatic Construction of the Multichannel Dyson Equation

The multichannel Dyson equation (MCDE) was recently introduced as a new approximation scheme to compute the one-body Green function in many-body systems, as reported by Riva et al. in Physical Review Letters, volume 131, article 216401, published in 2023. The physical content of this novel approximation scheme is further clarified by recovering it from an extended version of the algebraic diagrammatic construction (ADC) truncation scheme. It is thus demonstrated that the MCDE approximation lies in between the so-called ADC(2) and ADC(3) truncations of the dynamical self energy. Building on this clarification, the MCDE approximation is tested on the periodic one-dimensional Hubbard model with 4, 6, and 8 site lattices and shown to deliver an improved treatment over ADC(2) of both the quasiparticle peaks and the so-called satellites in the spectral strength distribution.

cond-mat.str-el↗

arXiv2026

Emulation of large-scale qubit registers with a phase-space approach

A phase-space approach is used and benchmarked for the simulation of the continuous-time evolution of large registers of qubits. It is based on a statistical ensemble of independent mean-field trajectories, where mean field is introduced at the level of the qubits, substituting quantum fluctuations/correlations with classical ones. The approach only involves at worse a quadratic cost in the system size, allowing to simulate up to several thousands of qubits on a classical computer. It provides qualitatively accurate description of one-qubit observables evolutions, making it a useful reference in comparison to techniques limited to small qubit numbers. The predictive power is, however, less robust for multi-qubits observables. We benchmark the method on the $k$-local transverse-field Ising model, considering a large variety of systems ranging from local to all-to-all interactions, and from weak to strong coupling regimes, with up to 2000 qubits. To showcase the versatility of the approach, simulations on 2D and 3D Ising models are also made.

quant-ph↗

arXiv2025

Exploring fixed points and eigenstates of quantum systems with reinforcement learning

We introduce a reinforcement learning algorithm designed to identify the fixed points of a given quantum operation. The method iteratively constructs the unitary transformation that maps the computational basis onto the basis of fixed points through a reward-penalty scheme based on quantum measurements. In cases where the operation corresponds to a Hamiltonian evolution, this task reduces to determining the Hamiltonian eigenstates. The algorithm is first benchmarked on random Hamiltonians acting on two and three qubits and then applied to many-body systems of up to six qubits, including the transverse-field Ising model and the all-to-all pairing Hamiltonian. In both cases, the algorithm is demonstrated to perform successfully; in the pairing model, it can also reveal hidden symmetries, which can be exploited to restrict learning to specific symmetry sectors. Finally, we discuss the possibility of post-selecting high-fidelity states even when full convergence has not been reached.

quant-ph↗

arXiv2025

Neutrino thermalization via randomization on a quantum processor

The dynamical evolution of neutrino flavor in supernovae can be modeled by an all-to-all spin Hamiltonian with random couplings. Simulating such two-local Hamiltonian dynamics remains a major challenge, as methods with controllable accuracy require circuit depths that increase at least linearly with system size, exceeding the capabilities of current quantum devices. The eigenstate thermalization hypothesis predicts that these systems should thermalize, a behavior confirmed in small-scale classical simulations. In this work, we investigate flavor thermalization in much larger systems using random quantum circuits as an empirical tool to emulate the non-local dynamics, and demonstrate that the thermal behavior can be reproduced using a depth independent of the system size. By simulating dynamics of over one hundred qubits, we find that the thermalization time grows approximately as the square root of the system size, consistent with predictions from semi-classical methods. Beyond this specific result, our study illustrates that near-term quantum devices are useful tools to test and validate empirical classical methods. It also highlights a new application of random circuits in physics, providing insight into complex many-body dynamics that are classically intractable.

quant-ph↗

arXiv2025

Quantum simulations of Green's functions for small superfluid systems

An end-to-end strategy for hybrid quantum-classical computations of Green's functions in many-body systems is presented and applied to the pairing model. The scheme makes explicit use of the spectral representation of the Green's function, which entails the calculation of the $N$-body ground state as well as eigenstates and associated energies of the $(N\pm1)$-body neighbors. While the former is accessed via variational techniques, the latter are constructed by means of the quantum subspace expansion method. Different ansatzes for the ground-state wave function, originating from either classical or quantum approaches, are tested and compared to exact calculations. The resulting one-body Green's functions prove to be accurate approximations of the exact one for a large range of parameters, including across the normal-to-superfluid transition. As a byproduct, this approach yields a good description of odd systems provided that the starting even system is well reproduced by the variational ansatz.

nucl-th↗

arXiv2025

Three-flavor neutrino oscillations using the Phase Space Approach

The Phase-Space Approximation (PSA) approach, originally applied in [Phys. Rev. D 106, 123006 (2022)] to describe neutrino oscillations from a stellar object in the two-flavor limit, is extended here to describe the more realistic case where neutrinos can oscillate between three different flavors. The approach is successfully validated against the exact solutions up to eight neutrinos. In all cases where the exact solution is feasible, the PSA provides excellent reproduction of the neutrino oscillation dynamics. By replacing the full problem with a set of simple mean-field equations, the PSA offers a versatile, predictive, and easily parallelizable approach for tackling three-flavor problems. This enables the simulation of large-scale neutrino oscillations, as illustrated here with simulations involving up to 300 neutrinos. Additionally, the method provides insight into the system's equilibration properties.

hep-ph↗

arXiv2025

Excited States from ADAPT-VQE convergence path in Many-Body Problems: application to nuclear pairing problem and $H_4$ molecule dissociation

A quantum computing algorithm is proposed to obtain low-lying excited states in many-body interacting systems. The approximate eigenstates are obtained by using a quantum space diagonalization method in a subspace of states selected from the convergence path of the ADAPT-VQE (adaptive derivative-assembled pseudo-Trotter Ansatz variational quantum eigensolver) towards the ground state of the many-body problem. This method is shown to be accurate with only a small overhead in terms of quantum resources required to get the ground state. We also show that the quantum algorithm might be used to facilitate the convergence of the ADAPT-VQE method itself. Successful applications of the technique are made to like-particle pairing as well as neutron-proton pairing. Finally, the $H_4$ molecule's dissociation also illustrates the technique, demonstrating its accuracy and versatility.

quant-ph↗

arXiv2024

Phase-Space methods for neutrino oscillations: extension to multi-beams

The Phase-Space approach (PSA), which was originally introduced in [Lacroix et al., Phys. Rev. D 106, 123006 (2022)] to describe neutrino flavor oscillations for interacting neutrinos emitted from stellar objects is extended to describe arbitrary numbers of neutrino beams. The PSA is based on mapping the quantum fluctuations into a statistical treatment by sampling initial conditions followed by independent mean-field evolution. A new method is proposed to perform this sampling that allows treating an arbitrary number of neutrinos in each neutrino beam. We validate the technique successfully and confirm its predictive power on several examples where a reference exact calculation is possible. We show that it can describe many-body effects, such as entanglement and dissipation induced by the interaction between neutrinos. Due to the complexity of the problem, exact solutions can only be calculated for rather limited cases, with a limited number of beams and/or neutrinos in each beam. The PSA approach considerably reduces the numerical cost and provides an efficient technique to accurately simulate arbitrary numbers of beams. Examples of PSA results are given here, including up to 200 beams with time-independent or time-dependent Hamiltonian. We anticipate that this approach will be useful to bridge exact microscopic techniques with more traditional transport theories used in neutrino oscillations. It will also provide important reference calculations for future quantum computer applications where other techniques are not applicable to classical computers.

hep-ph↗

arXiv2024

Neutron-proton pairing correlations described on quantum computers

The ADAPT-VQE approach is used to solve the neutron-proton pairing problem in atomic nuclei. This variational approach is considered today as one of the most powerful methods to iteratively find the ground state of a many-body problem, provided a performing set of operators, called the pool of operators, is used to explore the Hilbert space of many-body wave-functions. Three different pools of operators, which might eventually break one or several symmetries of the Hamiltonian during the descent to the ground state, are tested for the neutron-proton pairing problem. We observe that the breaking of some symmetries during the optimization of the trial wave-function might, in general, help to speed up the convergence towards the ground state. Still, we rejected the pool of operators that might explicitly break the total particle number because they become uncontrollable during the optimization process. Overall, we observed that the iterative optimization process rapidly becomes a delicate problem when the number of parameters to build the ansatz increases, and the energy might get stuck at energies higher than the ground state energy. To improve the convergence in this case, several techniques have been proposed, with some better controlling the symmetries during the energy minimization. Among the proposed methods, two have proven effective: one based on an embedding technique and the other on a randomized preparation of the initial state. We conclude that the ADAPT-VQE, complemented by these techniques, can provide a very accurate description of the neutron-proton pairing problem, and can outperform other standardly used techniques that break the particle number symmetry and restore afterwards.

nucl-th↗

arXiv2024

Construction of continuous collective energy landscapes for large amplitude nuclear many-body problems

Several protocols are proposed to build continuous energy surfaces of many-body quantum systems, regarding both energy and states. The standard variational principle is augmented with constraints on state overlap, ensuring arbitrary precision on continuity. As an illustration, the lowest energy and excited state paths relevant for the $^{240}$Pu asymmetric fission are studied. The scission is clearly signed, with a neutron excess in the neck, the ultimate glue before its rupture. Our approach can potentially connect any couple of Hilbert space states, which opens up new horizons for various applications.

nucl-th↗

arXiv2024

Entanglement in selected Binary Tree States: Dicke/Total spin states, particle number projected BCS states

Binary Tree States (BTS) are states whose decomposition on a quantum register basis formed by a set of qubits can be made sequentially. Such states sometimes appear naturally in many-body systems treated in Fock space when a global symmetry is imposed, like the total spin or particle number symmetries. Examples are the Dicke states, the eigenstates of the total spin for a set of particles having individual spin $1/2$, or states obtained by projecting a BCS states onto particle number, also called projected BCS in small superfluid systems. Starting from a BTS state described on the set of $n$ qubits or orbitals, the entanglement entropy of any subset of $ k$ qubits is analyzed. Specifically, a practical method is developed to access the $k$ qubits/particles von Neumann entanglement entropy of the subsystem of interest. Properties of these entropies are discussed, including scaling properties, upper bounds, or how these entropies correlate with fluctuations. Illustrations are given for the Dicke state and the projected BCS states.

nucl-th↗

arXiv2023

Solving the Lipkin model using quantum computers with two qubits only with a hybrid quantum-classical technique based on the Generator Coordinate Method

The possibility of using the generator coordinate method (GCM) using hybrid quantum-classical algorithms with reduced quantum resources is discussed. The task of preparing the basis states and calculating the various kernels involved in the GCM is assigned to the quantum computer, while the remaining tasks, such as finding the eigenvalues of a many-body problem, are delegated to classical computers for post-processing the generated kernels. This strategy reduces the quantum resources required to treat a quantum many-body problem. We apply the method to the Lipkin model. Using the permutation symmetry of the Hamiltonian, we show that, ultimately, only two qubits is enough to solve the problem regardless of the particle number. The classical computing post-processing leading to the full energy spectrum can be made using standard generalized eigenvalues techniques by diagonalizing the so-called Hill-Wheeler equation. As an alternative to this technique, we also explored how the quantum state deflation method can be adapted to the GCM problem. In this method, variational principles are iteratively designed to access the different excited states with increasing energies. The methodology proposed here is successfully applied to the Lipkin model with a minimal size of two qubits for the quantum register. The performances of the two classical post-processing approaches with respect to the statistical noise induced by the finite number of measurements and quantum devices noise are analyzed. Very satisfactory results for the full energy spectra are obtained once noise correction techniques are employed.

quant-ph↗

arXiv2023

Efficient solution of the non-unitary time-dependent Schrodinger equation on a quantum computer with complex absorbing potential

We explore the possibility of adding complex absorbing potential at the boundaries when solving the one-dimensional real-time Schr\"odinger evolution on a grid using a quantum computer with a fully quantum algorithm described on a $n$ qubit register. Due to the complex potential, the evolution mixes real- and imaginary-time propagation and the wave function can potentially be continuously absorbed during the time propagation. We use the dilation quantum algorithm to treat the imaginary-time evolution in parallel to the real-time propagation. This method has the advantage of using only one reservoir qubit at a time, that is measured with a certain success probability to implement the desired imaginary-time evolution. We propose a specific prescription for the dilation method where the success probability is directly linked to the physical norm of the continuously absorbed state evolving on the mesh. We expect that the proposed prescription will have the advantage of keeping a high probability of success in most physical situations. Applications of the method are made on one-dimensional wave functions evolving on a mesh. Results obtained on a quantum computer identify with those obtained on a classical computer. We finally give a detailed discussion on the complexity of implementing the dilation matrix. Due to the local nature of the potential, for $n$ qubits, the dilation matrix only requires $2^n$ CNOT and $2^n$ unitary rotation for each time step, whereas it would require of the order of $4^{n+1}$ C-NOT gates to implement it using the best-known algorithm for general unitary matrices.

quant-ph↗

arXiv2023

Restoring symmetries in quantum computing using Classical Shadows

We introduce a method to enforce some symmetries starting from a trial wave-function prepared on quantum computers that might not respect these symmetries. The technique eliminates the necessity for performing the projection on the quantum computer itself. Instead, this task is conducted as a post-processing step on the system's "Classical Shadow". Illustrations of the approach are given for the parity, particle number, and spin projectors that are of particular interest in interacting many-body systems. We compare the method with another classical post-processing technique based on direct measurements of the quantum register. We show that the present scheme can be competitive to predict observables on symmetry-restored states once optimization through derandomization is employed. The technique is illustrated through its application to compute the projected energy for the pairing model Hamiltonian.

quant-ph↗

arXiv2023

Multiconfigurational time-dependent density functional theory for atomic nuclei: Technical and numerical aspects

The nuclear time-dependent density functional theory (TDDFT) is a tool of choice for describing various dynamical phenomena in atomic nuclei. In a recent study, we reported an extension of the framework - the multiconfigurational TDDFT (MC-TDDFT) model - that takes into account quantum fluctuations in the collective space by mixing several TDDFT trajectories. In this article, we focus on technical and numerical aspects of the model. We outline the properties of the time-dependent variational principle that is employed to obtain the equation of motion for the mixing function. Furthermore, we discuss evaluation of various ingredients of the equation of motion, including the Hamiltonian kernel, norm kernel, and kernels with explicit time derivatives. We detail the numerical methods for resolving the equation of motion and outline the major assumptions underpinning the model. A technical discussion is supplemented with numerical examples that consider collective quadrupole vibrations in $^{40}$Ca, particularly focusing on the issues of convergence, treatment of linearly dependent bases, energy conservation, and prescriptions for the density-dependent part of an interaction.

nucl-th↗

arXiv2023

Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group

Quantum computers offer an intriguing path for a paradigmatic change of computing in the natural sciences and beyond, with the potential for achieving a so-called quantum advantage, namely a significant (in some cases exponential) speed-up of numerical simulations. The rapid development of hardware devices with various realizations of qubits enables the execution of small scale but representative applications on quantum computers. In particular, the high-energy physics community plays a pivotal role in accessing the power of quantum computing, since the field is a driving source for challenging computational problems. This concerns, on the theoretical side, the exploration of models which are very hard or even impossible to address with classical techniques and, on the experimental side, the enormous data challenge of newly emerging experiments, such as the upgrade of the Large Hadron Collider. In this roadmap paper, led by CERN, DESY and IBM, we provide the status of high-energy physics quantum computations and give examples for theoretical and experimental target benchmark applications, which can be addressed in the near future. Having the IBM 100 x 100 challenge in mind, where possible, we also provide resource estimates for the examples given using error mitigated quantum computing.

quant-ph↗

arXiv2023

Quantum fluctuations induce collective multiphonons in finite Fermi liquids

We show that collective multiphonon states in atomic nuclei emerge at high excitation energies when quantum fluctuations in the collective space are included beyond the independent-particle approximation. The quadrupole response of a nucleus is studied using an extension of the nuclear time-dependent density-functional theory that mixes several many-body trajectories. While a single trajectory can account for the excitation of the first collective quantum, the second and the third quanta emerge due to the interference between trajectories. The collective spectrum, found as nearly harmonic, is in excellent agreement with the experimentally observed three quanta of the isoscalar giant quadrupole resonance in $^{40}$Ca. This study offers guidance for multiphonon searches in other self-bound systems and demonstrates the resistance to internal excitation of finite Fermi liquids.

nucl-th↗

arXiv2023

Quantum computing with and for many-body physics

Quantum computing technologies are making steady progress. This has opened new opportunities for tackling problems whose complexity prevents their description on classical computers. A prototypical example of these complex problems are interacting quantum many-body systems: on the one hand, these systems are known to become rapidly prohibitive to describe using classical computers when their size increases. On the other hand, these systems are precisely those which are used in the laboratory to build quantum computing platforms. This arguably makes them one of the most promising early use cases of quantum computing. In this review, we explain how quantum many-body systems are used to build quantum processors, and how, in turn, current and future quantum processors can be used to describe large many-body systems of fermions such as electrons and nucleons. The review includes an introduction to analog and digital quantum devices, the mapping of Fermi systems and their Hamiltonians onto qubit registers, as well as an overview of methods to access their static and dynamical properties. We also highlight some aspects related to entanglement, and touch on the description, influence and processing of decoherence in quantum devices.

quant-ph↗