arXiv subjects

Alessandro Baroni

Publications and source records attributed to Alessandro Baroni.

16 recordsLinked to original sources

arXiv2026

Nuclear Many-Body Systems as Benchmarks for Quantum Computing

We present a framework for benchmarking quantum algorithms for nuclear many-body systems based on realistic nuclear Hamiltonians such as chiral effective field theory. To this end, we introduce a workflow that maps nuclear interactions in second quantization formalism to qubit Hamiltonians. This enables the systematic construction of benchmark instances spanning no-core and valence-space formulations with two-body (NN) and selected three-body (3N) interactions. Then, we proceed to provide resource estimates for three representative eigenvalue algorithms: Quantum Phase Estimation, Quantum Krylov methods, and Observable Dynamic Mode Decomposition. We compare their resource requirements in terms of T-gate counts and system size, and examine the impact of model-space choices and many-body interactions. The primitives included in our analysis are Trotterization, Qubitization, and Quantum Singular Value Transformation. Our results quantify scaling trends across algorithms and problem classes, and provide a basis for consistent comparisons of quantum approaches to nuclear many-body problems. The implementation is provided by the NuQuLib software stack.

quant-ph↗

arXiv2024

Integrating Quantum Computing Resources into Scientific HPC Ecosystems

Quantum Computing (QC) offers significant potential to enhance scientific discovery in fields such as quantum chemistry, optimization, and artificial intelligence. Yet QC faces challenges due to the noisy intermediate-scale quantum era's inherent external noise issues. This paper discusses the integration of QC as a computational accelerator within classical scientific high-performance computing (HPC) systems. By leveraging a broad spectrum of simulators and hardware technologies, we propose a hardware-agnostic framework for augmenting classical HPC with QC capabilities. Drawing on the HPC expertise of the Oak Ridge National Laboratory (ORNL) and the HPC lifecycle management of the Department of Energy (DOE), our approach focuses on the strategic incorporation of QC capabilities and acceleration into existing scientific HPC workflows. This includes detailed analyses, benchmarks, and code optimization driven by the needs of the DOE and ORNL missions. Our comprehensive framework integrates hardware, software, workflows, and user interfaces to foster a synergistic environment for quantum and classical computing research. This paper outlines plans to unlock new computational possibilities, driving forward scientific inquiry and innovation in a wide array of research domains.

quant-ph↗

arXiv2024

Solving reaction dynamics with quantum computing algorithms

The description of quantum many-body dynamics is extremely challenging on classical computers, as it can involve many degrees of freedom. On the other hand, the time evolution of quantum states is a natural application for quantum computers that are designed to efficiently perform unitary transformations. In this paper, we study quantum algorithms for response functions, relevant for describing different reactions governed by linear response. We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations. For the case of a contact interaction, we develop an algorithm for time evolution based on the Trotter approximation that scales logarithmically with the lattice size, and is combined with quantum phase estimation. We eventually focus on the nuclear two-body system and a typical response function relevant for electron scattering as an example. We also investigate ground-state preparation and examine the total circuit depth required for a realistic calculation and the hardware noise level required to interpret the signal.

quant-ph↗

arXiv2023

Deep Quantum Circuit Simulations of Low-Energy Nuclear States

Numerical simulation is an important method for verifying the quantum circuits used to simulate low-energy nuclear states. However, real-world applications of quantum computing for nuclear theory often generate deep quantum circuits that place demanding memory and processing requirements on conventional simulation methods. Here, we present advances in high-performance numerical simulations of deep quantum circuits to efficiently verify the accuracy of low-energy nuclear physics applications. Our approach employs several novel methods for accelerating the numerical simulation including 1- and 2-qubit gate fusion techniques as well as management of simulated mid-circuit measurements to verify state preparation circuits. We test these methods across a variety of high-performance computing systems and our results show that circuits up to 21 qubits and more than 115,000,000 gates can be efficiently simulated.

quant-ph↗

arXiv2023

Quantum Information Science and Technology for Nuclear Physics. Input into U.S. Long-Range Planning, 2023

In preparation for the 2023 NSAC Long Range Plan (LRP), members of the Nuclear Science community gathered to discuss the current state of, and plans for further leveraging opportunities in, QIST in NP research at the Quantum Information Science for U.S. Nuclear Physics Long Range Planning workshop, held in Santa Fe, New Mexico on January 31 - February 1, 2023. The workshop included 45 in-person participants and 53 remote attendees. The outcome of the workshop identified strategic plans and requirements for the next 5-10 years to advance quantum sensing and quantum simulations within NP, and to develop a diverse quantum-ready workforce. The plans include resolutions endorsed by the participants to address the compelling scientific opportunities at the intersections of NP and QIST. These endorsements are aligned with similar affirmations by the LRP Computational Nuclear Physics and AI/ML Workshop, the Nuclear Structure, Reactions, and Astrophysics LRP Town Hall, and the Fundamental Symmetries, Neutrons, and Neutrinos LRP Town Hall communities.

nucl-ex↗

arXiv2022

Ab initio calculation of the $β$ decay spectrum of $^6$He

We calculate the $β$ spectrum in the decay of $^6$He using Quantum Monte Carlo methods with nuclear interactions derived from chiral Effective Field Theory and consistent weak vector and axial currents. We work at second order in the multipole expansion, retaining terms suppressed by $\mathcal O(q^2/m_π^2)$, where $q$ denotes low-energy scales such as the reaction's $\mathcal Q$-value or the electron energy, and $m_π$ the pion mass. We go beyond the impulse approximation by including the effects of two-body vector and axial currents. We estimate the theoretical error on the spectrum by using four potential models in the Norfolk family of local two- and three-nucleon interactions, which have different cut-off, fit two-nucleon data up to different energies and use different observables to determine the couplings in the three-body force. We find the theoretical uncertainty on the $β$ spectrum, normalized by the total rate, to be well below the permille level, and to receive contributions of comparable size from first and second order corrections in the multipole expansion. We consider corrections to the $β$ decay spectrum induced by beyond-the-Standard Model charged-current interactions in the Standard Model Effective Field Theory, with and without sterile neutrinos, and discuss the sensitivity of the next generation of experiments to these interactions.

nucl-th↗

arXiv2021

Nuclear two point correlation functions on a quantum-computer

The calculation of dynamic response functions is expected to be an early application benefiting from rapidly developing quantum hardware resources. The ability to calculate real-time quantities of strongly-correlated quantum systems is one of the most exciting applications that can easily reach beyond the capabilities of traditional classical hardware. Response functions of fermionic systems at moderate momenta and energies corresponding roughly to the Fermi energy of the system are a potential early application because the relevant operators are nearly local and the energies can be resolved in moderately short real time, reducing the spatial resolution and gate depth required. This is particularly the case in quasielastic electron and neutrino scattering from nuclei, a topic of great interest in the nuclear and particle physics communities and directly related to experiments designed to probe neutrino properties. In this work we use current quantum hardware and error mitigation protocols to calculate response functions for a highly simplified nuclear model through calculations of a 2-point real time correlation function for a modified Fermi-Hubbard model in two dimensions with three distinguishable nucleons on four lattice sites.

quant-ph↗

arXiv2021

Electroweak Currents from Chiral Effective Field Theory

Since the pioneering work of Weinberg, Chiral Effective Field Theory ($χ$EFT) has been widely and successfully utilized in nuclear physics to study many-nucleon interactions and associated electroweak currents. Nuclear $χ$EFT has now developed into an intense field of research and is applied to study light to medium mass nuclei. In this contribution, we focus on the development of electroweak currents from $χ$EFT and present applications to selected nuclear electroweak observables.

nucl-th↗

arXiv2021

Simulation of Collective Neutrino Oscillations on a Quantum Computer

In astrophysical scenarios with large neutrino density, like supernovae and the early universe, the presence of neutrino-neutrino interactions can give rise to collective flavor oscillations in the out-of-equilibrium collective dynamics of a neutrino cloud. The role of quantum correlations in these phenomena is not yet well understood, in large part due to complications in solving for the real-time evolution of the strongly coupled many-body system. Future fault-tolerant quantum computers hold the promise to overcome much of these limitations and provide direct access to the correlated neutrino dynamic. In this work, we present the first simulation of a small system of interacting neutrinos using current generation quantum devices. We introduce a strategy to overcome limitations in the natural connectivity of the qubits and use it to track the evolution of entanglement in real-time. The results show the critical importance of error-mitigation techniques to extract meaningful results for entanglement measures using noisy, near term, quantum devices.

quant-ph↗

arXiv2021

Preparation of excited states for nuclear dynamics on a quantum computer

We study two different methods to prepare excited states on a quantum computer, a key initial step to study dynamics within linear response theory. The first method uses unitary evolution for a short time $T=\mathcal{O}(\sqrt{1-F})$ to approximate the action of an excitation operator $\hat{O}$ with fidelity $F$ and success probability $P\approx1-F$. The second method probabilistically applies the excitation operator using the Linear Combination of Unitaries (LCU) algorithm. We benchmark these techniques on emulated and real quantum devices, using a toy model for thermal neutron-proton capture. Despite its larger memory footprint, the LCU-based method is efficient even on current generation noisy devices and can be implemented at a lower gate cost than a naive analysis would suggest. These findings show that quantum techniques designed to achieve good asymptotic scaling on fault tolerant quantum devices might also provide practical benefits on devices with limited connectivity and gate fidelity.

quant-ph↗

arXiv2019

Long-range electroweak amplitudes of single hadrons from Euclidean finite-volume correlation functions

A relation is presented between single-hadron long-range matrix elements defined in a finite Euclidean spacetime, and the corresponding infinite-volume Minkowski amplitudes. This relation is valid in the kinematic region where any number of two-hadron states can simultaneously go on shell, so that the effects of strongly-coupled intermediate channels are included. These channels can consist of non-identical particles with arbitrary intrinsic spins. The result accommodates general Lorentz structures as well as non-zero momentum transfer for the two external currents inserted between the single-hadron states. The formalism, therefore, generalizes the work by Christ et al.~[Phys.Rev. D91 114510 (2015)], and extends the reach of lattice quantum chromodynamics (QCD) to a wide class of new observables beyond meson mixing and rare decays. Applications include Compton scattering of the pion ($πγ^\star \to [ππ, K \overline K] \to πγ^\star$), kaon ($K γ^\star \to [πK, ηK] \to K γ^\star$) and nucleon ($N γ^\star \to N π\to N γ^\star$), as well as double-$β$ decays, and radiative corrections to the single-$β$ decay, of QCD-stable hadrons. The framework presented will further facilitate generalization of the result to studies of nuclear amplitudes involving two currents from lattice QCD.

hep-lat↗

arXiv2019

Short-depth circuits for efficient expectation value estimation

The evaluation of expectation values $Tr\left[ρO\right]$ for some pure state $ρ$ and Hermitian operator $O$ is of central importance in a variety of quantum algorithms. Near optimal techniques developed in the past require a number of measurements $N$ approaching the Heisenberg limit $N=\mathcal{O}\left(1/ε\right)$ as a function of target accuracy $ε$. The use of Quantum Phase Estimation requires however long circuit depths $C=\mathcal{O}\left(1/ε\right)$ making their implementation difficult on near term noisy devices. The more direct strategy of Operator Averaging is usually preferred as it can be performed using $N=\mathcal{O}\left(1/ε^2\right)$ measurements and no additional gates besides those needed for the state preparation. In this work we use a simple but realistic model to describe the bound state of a neutron and a proton (the deuteron) and show that the latter strategy can require an overly large number of measurement in order to achieve a reasonably small relative target accuracy $ε_r$. We propose to overcome this problem using a single step of QPE and classical post-processing. This approach leads to a circuit depth $C=\mathcal{O}\left(ε^μ\right)$ (with $μ\geq0$) and to a number of measurements $N=\mathcal{O}\left(1/ε^{2+ν}\right)$ for $0<ν\leq1$. We provide detailed descriptions of two implementations of our strategy for $ν=1$ and $ν\approx0.5$ and derive appropriate conditions that a particular problem instance has to satisfy in order for our method to provide an advantage.

quant-ph↗

arXiv2019

SCube: A Tool for Segregation Discovery

Segregation is the separation of social groups in the physical or in the online world. Segregation discovery consists of finding contexts of segregation. In the modern digital society, discovering segregation is challenging, due to the large amount and the variety of social data. We present a tool in support of segregation discovery from relational and graph data. The SCube system builds on attributed graph clustering and frequent itemset mining. It offers to the analyst a multi-dimensional segregation data cube for exploratory data analysis. The demonstration first guides the audience through the relevant social science concepts. Then, it focuses on scenarios around case studies of gender occupational segregation. Two real and large datasets about the boards of directors of Italian and Estonian companies will be explored in search of segregation contexts. The architecture of the SCube system and its computational efficiency challenges and solutions are discussed.

cs.SI↗

arXiv2018

Form factors of two-hadron states from a covariant finite-volume formalism

In this work we develop a Lorentz-covariant version of the previously derived formalism for relating finite-volume matrix elements to $\textbf 2 + \mathcal J \to \textbf 2$ transition amplitudes. We also give various details relevant for the implementation of this formalism in a realistic numerical lattice QCD calculation. Particular focus is given to the role of single-particle form factors in disentangling finite-volume effects from the triangle diagram that arise when $\mathcal J$ couples to one of the two hadrons. This also leads to a new finite-volume function, denoted $G$, the numerical evaluation of which is described in detail. As an example we discuss the determination of the $ππ+ \mathcal J \to ππ$ amplitude in the $ρ$ channel, for which the single-pion form factor, $F_π(Q^2)$, as well as the scattering phase, $δ_{ππ}$, are required to remove all power-law finite-volume effects. The formalism presented here holds for local currents with arbitrary Lorentz structure, and we give specific examples of insertions with up to two Lorentz indices.

hep-lat↗

arXiv2018

Finite-volume matrix elements of two-body states

In this talk, we present a framework for studying structural information of resonances and bound states coupling to two-hadron scattering states. This makes use of a recently proposed finite-volume formalism to determine a class of observables that are experimentally inaccessible but can be accessed via lattice QCD. In particular, we shown that finite-volume two-body matrix elements with one current insertion can be directly related to scattering amplitudes coupling to the external current. For two-hadron systems with resonances or bound states, one can extract the corresponding form factors of these from the energy-dependence of the amplitudes.

hep-lat↗

arXiv2017

Efficiently Clustering Very Large Attributed Graphs

Attributed graphs model real networks by enriching their nodes with attributes accounting for properties. Several techniques have been proposed for partitioning these graphs into clusters that are homogeneous with respect to both semantic attributes and to the structure of the graph. However, time and space complexities of state of the art algorithms limit their scalability to medium-sized graphs. We propose SToC (for Semantic-Topological Clustering), a fast and scalable algorithm for partitioning large attributed graphs. The approach is robust, being compatible both with categorical and with quantitative attributes, and it is tailorable, allowing the user to weight the semantic and topological components. Further, the approach does not require the user to guess in advance the number of clusters. SToC relies on well known approximation techniques such as bottom-k sketches, traditional graph-theoretic concepts, and a new perspective on the composition of heterogeneous distance measures. Experimental results demonstrate its ability to efficiently compute high-quality partitions of large scale attributed graphs.

cs.SI↗