SearcharxivSearch

arXiv subjects

Guglielmo Mazzola

Publications and source records attributed to Guglielmo Mazzola.

At least 19 recordsLinked to original sources

A low-symmetry ground state of dense two-dimensional hydrogen

Hydrogen under pressure is an extremely complex system featuring molecular dissociation, metallization, and anomalous melting. While bulk hydrogen has been studied for nearly a century, its two-dimensional counterpart remains unexplored. Using first-principles structural searches and relaxations in supercells containing up to 512 atoms, we identify ground-state structures of dense two-dimensional hydrogen showing no evidence of long-range crystalline order over the simulated length scales. Within density functional theory, these structures have lower enthalpy than all crystalline candidates considered over an intermediate pressure interval between molecular and atomic crystals. This preference already emerges with classical nuclei and persists as the supercell size increases, while the dominant structure-factor peaks grow substantially more slowly than in the crystalline reference phases. Although crystals with very large primitive cells cannot be rigorously excluded, these findings support the possibility of a disordered ground state and identify dense two-dimensional hydrogen as a promising setting for investigating competition between crystallization and structural disorder.

cond-mat.mtrl-sci

Practical advantage beyond the quadratic speedup limit with fully-quantum walks

We introduce a new class of fully-quantum Metropolis walks in which both the proposal and acceptance steps are intrinsically quantum. Unlike standard quantum walks obtained by quantizing classically efficient Markov chains, our algorithm employs Hamiltonian simulation as a quantum-native proposal mechanism, enlarging the class of quantum walks beyond classical counterparts. We target the problem of sampling from the low-temperature Gibbs distribution of classical dense Ising models, within a fixed error in total variation distance. This approach achieves about a cubic polynomial asymptotic advantage over previous quantum-walks, resulting in a total sixth-degree polynomial queries speedup compared to the best classical walk. This shows that speedups beyond the widely assumed quadratic limit are possible within the quantum walk formalism. We perform a complete fault-tolerant compilation of all algorithmic primitives and benchmark against CPU, GPU, and FPGA implementations of the best classical Markov chain. Under identical hardware assumptions, the resulting advantage runtime crossover is reduced from approximately $10^3$ years for conventional quantum walks to less than one day. These results identify fully-quantum Markov chains as a promising route toward practical quantum advantage.

quant-ph

Accurate and thermodynamically consistent hydrogen equation of state for planetary modeling with flow matching

Accurate determination of the equation of state of dense hydrogen is essential for understanding gas giants. Currently, there is still no consensus on methods for calculating its entropy, which play a fundamental role and can result in qualitatively different predictions for Jupiter's interior. Here, we investigate various aspects of entropy calculation for dense hydrogen based on ab initio molecular dynamics simulations. Specifically, we employ the recently developed flow matching method to validate the accuracy of the traditional thermodynamic integration approach. We then clearly identify pitfalls in previous attempts and propose a reliable framework for constructing the hydrogen equation of state, which is accurate and thermodynamically consistent across a wide range of temperature and pressure conditions. This allows us to conclusively address the long-standing discrepancies in Jupiter's adiabat among earlier studies, demonstrating the potential of our approach for providing reliable equations of state of diverse materials.

astro-ph.EP

A Denser Hydrogen Inferred from First-Principles Simulations Challenges Jupiter's Interior Models

First-principle modeling of dense hydrogen is crucial in materials and planetary sciences. Despite its apparent simplicity, predicting the ionic and electronic structure of hydrogen is a formidable challenge, and it is connected with the insulator-to-metal transition, a century-old problem in condensed matter. Accurate simulations of liquid hydrogen are also essential for modeling gas giant planets. Here we perform an exhaustive study of the equation of state of hydrogen using Density Functional Theory and quantum Monte Carlo simulations. We find that the pressure predicted by Density Functional Theory may vary qualitatively when using different functionals. The predictive power of first-principle simulations is restored by validating each functional against higher-level wavefunction theories, represented by computationally intensive variational and diffusion Monte Carlo calculations. Our simulations provide evidence that hydrogen is denser at planetary conditions, compared to currently used equations of state. For Jupiter, this implies a lower bulk metallicity (i.e., a smaller mass of heavy elements). Our results further amplify the inconsistency between Jupiter's atmospheric metallicity measured by the Galileo probe and the envelope metallicity inferred from interior models.

astro-ph.EP

Quantum computing for genomics: conceptual challenges and practical perspectives

We assess the potential of quantum computing to accelerate computation of central tasks in genomics, focusing on often-neglected theoretical limitations. We discuss state-of-the-art challenges of quantum search, optimization, and machine learning algorithms. Examining database search with Grover's algorithm, we show that the expected speedup vanishes under realistic assumptions. For combinatorial optimization prevalent in genomics, we discuss the limitations of theoretical complexity in practice and suggest carefully identifying problems genuinely suited for quantum acceleration. Given the competition from excellent classical approximate solvers, quantum computing could offer a speedup in the near future only for a specific subset of hard enough tasks in assembly, gene selection, and inference. These tasks need to be characterized by core optimization problems that are particularly challenging for classical methods while requiring relatively limited variables. We emphasize rigorous empirical validation through runtime scaling analysis to avoid misleading claims of quantum advantage. Finally, we discuss the problem of trainability and data-loading in quantum machine learning. This work advocates for a balanced perspective on quantum computing in genomics, guiding future research toward targeted applications and robust validation.

quant-ph

From quantum-enhanced to quantum-inspired Monte Carlo

We perform a comprehensive analysis of the quantum-enhanced Monte Carlo method [Nature, 619, 282-287 (2023)], aimed at identifying the optimal working point of the algorithm. We observe an optimal mixing Hamiltonian strength and analyze the scaling of the total evolution time with the size of the system. We also explore extensions of the circuit, including the use of time-dependent Hamiltonians and reverse digitized annealing. Additionally, we propose that classical, approximate quantum simulators can be used for the proposal step instead of the original real-hardware implementation. We observe that tensor-network simulators, even with unconverged settings, can maintain a scaling advantage over standard classical samplers. This may extend the utility of quantum-enhanced Monte Carlo as a quantum-inspired algorithm, even before the deployment of large-scale quantum hardware.

quant-ph

Challenges and Opportunities in Quantum Optimization

Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization being one of the most pronounced domains. Across computer science and physics, there are a number of different approaches for major classes of optimization problems, such as combinatorial optimization, convex optimization, non-convex optimization, and stochastic extensions. This work draws on multiple approaches to study quantum optimization. Provably exact versus heuristic settings are first explained using computational complexity theory - highlighting where quantum advantage is possible in each context. Then, the core building blocks for quantum optimization algorithms are outlined to subsequently define prominent problem classes and identify key open questions that, if answered, will advance the field. The effects of scaling relevant problems on noisy quantum devices are also outlined in detail, alongside meaningful benchmarking problems. We underscore the importance of benchmarking by proposing clear metrics to conduct appropriate comparisons with classical optimization techniques. Lastly, we highlight two domains - finance and sustainability - as rich sources of optimization problems that could be used to benchmark, and eventually validate, the potential real-world impact of quantum optimization.

quant-ph

Variational Benchmarks for Quantum Many-Body Problems

The continued development of computational approaches to many-body ground-state problems in physics and chemistry calls for a consistent way to assess its overall progress. In this work, we introduce a metric of variational accuracy, the V-score, obtained from the variational energy and its variance. We provide an extensive curated dataset of variational calculations of many-body quantum systems, identifying cases where state-of-the-art numerical approaches show limited accuracy, and future algorithms or computational platforms, such as quantum computing, could provide improved accuracy. The V-score can be used as a metric to assess the progress of quantum variational methods toward a quantum advantage for ground-state problems, especially in regimes where classical verifiability is impossible.

quant-ph

The linear-mixing approximation in silica-water mixtures at planetary conditions

The Linear Mixing Approximation (LMA) is often used in planetary models for calculating the equations of state (EoSs) of mixtures. A commonly assumed planetary composition is a mixture of rock and water. Here we assess the accuracy of the LMA for pressure-temperature conditions relevant to the interiors of Uranus and Neptune. We perform MD simulations using ab-initio simulations and consider pure-water, pure-silica, and 1:1 and 1:4 silica-water molecular fractions at temperature of 3000 K and pressures between 30 and 600 GPa. We find that the LMA is valid within a few percent (<~5%) between ~150-600 Gpa, where the sign of the difference in inferred density depends on the specific composition of the mixture. We also show that the presence of rocks delays the transition to superionic water by ~70 GPa for the 1:4 silica-water mixture. Finally, we note that the choice of electronic theory (functionals) affect the EoS and introduces an uncertainty in of the order of 10% in density. Our study demonstrates the complexity of phase diagrams in planetary conditions and the need for a better understanding of rock-water mixtures and their effect on the inferred planetary composition.

astro-ph.EP

Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics

The real-time simulation of large many-body quantum systems is a formidable task, that may only be achievable with a genuine quantum computational platform. Currently, quantum hardware with a number of qubits sufficient to make classical emulation challenging is available. This condition is necessary for the pursuit of a so-called quantum advantage, but it also makes verifying the results very difficult. In this manuscript, we flip the perspective and utilize known theoretical results about many-body quantum critical dynamics to benchmark quantum hardware and various error mitigation techniques on up to 133 qubits. In particular, we benchmark against known universal scaling laws in the Hamiltonian simulation of a time-dependent transverse field Ising Hamiltonian. Incorporating only basic error mitigation and suppression methods, our study shows reliable control up to a two-qubit gate depth of 28, featuring a maximum of 1396 two-qubit gates, before noise becomes prevalent. These results are transferable to applications such as Hamiltonian simulation, variational algorithms, optimization, or quantum machine learning. We demonstrate this on the example of digitized quantum annealing for optimization and identify an optimal working point in terms of both circuit depth and time step on a 133-site optimization problem.

quant-ph

Challenges of variational quantum optimization with measurement shot noise

Quantum enhanced optimization of classical cost functions is a central theme of quantum computing due to its high potential value in science and technology. The variational quantum eigensolver (VQE) and the quantum approximate optimization algorithm (QAOA) are popular variational approaches that are considered the most viable solutions in the noisy-intermediate scale quantum (NISQ) era. Here, we study the scaling of the quantum resources, defined as the required number of circuit repetitions, to reach a fixed success probability as the problem size increases, focusing on the role played by measurement shot noise, which is unavoidable in realistic implementations. Simple and reproducible problem instances are addressed, namely, the ferromagnetic and disordered Ising chains. Our results show that: (i) VQE with the standard heuristic ansatz scales comparably to direct brute-force search when energy-based optimizers are employed. The performance improves at most quadratically using a gradient-based optimizer. (ii) When the parameters are optimized from random guesses, also the scaling of QAOA implies problematically long absolute runtimes for large problem sizes. (iii) QAOA becomes practical when supplemented with a physically-inspired initialization of the parameters. Our results suggest that hybrid quantum-classical algorithms should possibly avoid a brute force classical outer loop, but focus on smart parameters initialization.

quant-ph

Quantum computing for chemistry and physics applications from a Monte Carlo perspective

This Perspective focuses on the several overlaps between quantum algorithms and Monte Carlo methods in the domains of physics and chemistry. We will analyze the challenges and possibilities of integrating established quantum Monte Carlo solutions in quantum algorithms. These include refined energy estimators, parameter optimization, real and imaginary-time dynamics, and variational circuits. Conversely, we will review new ideas in utilizing quantum hardware to accelerate the sampling in statistical classical models, with applications in physics, chemistry, optimization, and machine learning. This review aims to be accessible to both communities and intends to foster further algorithmic developments at the intersection of quantum computing and Monte Carlo methods. Most of the works discussed in this Perspective have emerged within the last two years, indicating a rapidly growing interest in this promising area of research.

quant-ph

A Jastrow wave function for the spin-1 Heisenberg chain: the string order revealed by the mapping to the classical Coulomb gas

We show that a two-body Jastrow wave function is able to capture the ground-state properties of the $S=1$ antiferromagnetic Heisenberg chain with the single-ion anisotropy term, in both the topological and trivial phases. Here, the optimized Jastrow pseudo potential assumes a very simple form in Fourier space, i.e., $v_{q} \approx 1/q^2$, which is able to give rise to a finite string-order parameter in the topological regime. The results are analysed by using an exact mapping from the quantum expectation values over the variational state to the classical partition function of the one-dimensional Coulomb gas of particles with charge $q=\pm 1$. Here, two phases are present at low temperatures: the first one is a diluted gas of dipoles (bound states of particles with opposite charges), which are randomly oriented (describing the trivial phase); the other one is a dense liquid of dipoles, which are aligned thanks to the residual dipole-dipole interactions (describing the topological phase, with the finite string order being related to the dipole alignment). Our results provide an insightful interpretation of the ground-state nature of the spin-1 antiferromagnetic Heisenberg model.

cond-mat.str-el

Phenomenological Theory of Variational Quantum Ground-State Preparation

The variational approach is a cornerstone of computational physics, considering both conventional and quantum computing computational platforms. The variational quantum eigensolver (VQE) algorithm aims to prepare the ground state of a Hamiltonian exploiting parametrized quantum circuits that may offer an advantage compared to classical trial states used, for instance, in quantum Monte Carlo or tensor network calculations. While traditionally, the main focus has been on developing better trial circuits, we show that the algorithm's success crucially depends on other parameters such as the learning rate, the number $N_s$ of measurements to estimate the gradient components, and the Hamiltonian gap $Δ$. We first observe the existence of a finite $N_s$ value below which the optimization is impossible, and the energy variance resembles the behavior of the specific heat in second-order phase transitions. Secondly, when $N_s$ is above such threshold level, and learning is possible, we develop a phenomenological model that relates the fidelity of the state preparation with the optimization hyperparameters as well as $Δ$. More specifically, we observe that the computational resources scale as $1/Δ^2$, and we propose a symmetry-enhanced simulation protocol that should be used if the gap closes. We test our understanding on several instances of two-dimensional frustrated quantum magnets, which are believed to be the most promising candidates for near-term quantum advantage through variational quantum simulations.

quant-ph

Towards Quantum Advantage in Financial Market Risk using Quantum Gradient Algorithms

We introduce a quantum algorithm to compute the market risk of financial derivatives. Previous work has shown that quantum amplitude estimation can accelerate derivative pricing quadratically in the target error and we extend this to a quadratic error scaling advantage in market risk computation. We show that employing quantum gradient estimation algorithms can deliver a further quadratic advantage in the number of the associated market sensitivities, usually called greeks. By numerically simulating the quantum gradient estimation algorithms on financial derivatives of practical interest, we demonstrate that not only can we successfully estimate the greeks in the examples studied, but that the resource requirements can be significantly lower in practice than what is expected by theoretical complexity bounds. This additional advantage in the computation of financial market risk lowers the estimated logical clock rate required for financial quantum advantage from Chakrabarti et al. [Quantum 5, 463 (2021)] by a factor of ~7, from 50MHz to 7MHz, even for a modest number of greeks by industry standards (four). Moreover, we show that if we have access to enough resources, the quantum algorithm can be parallelized across 60 QPUs, in which case the logical clock rate of each device required to achieve the same overall runtime as the serial execution would be ~100kHz. Throughout this work, we summarize and compare several different combinations of quantum and classical approaches that could be used for computing the market risk of financial derivatives.

quant-ph

Exponential challenges in unbiasing quantum Monte Carlo algorithms with quantum computers

Recently, Huggins et. al. [Nature, 603, 416-420 (2022)] devised a general projective Quantum Monte Carlo method suitable for implementation on quantum computers. This hybrid approach, however, relies on a subroutine -the computation of the local energy estimator on the quantum computer -that is intrinsically affected by an exponential scaling of the computational time with the number of qubits. By means of numerical experiments, we show that this exponential scaling manifests prominently already on systems below the point of "quantum advantage". For the prototypical transverse-field Ising model, we show that the required time resources to compete with classical simulations on around 40 qubits are already of the order of $10^{13}$ projective measurements, with an estimated running time of a few thousand years on superconducting hardware. These observations strongly suggest that the proposed hybrid method, in its present form, is unlikely to offer a sizeable advantage over conventional quantum Monte Carlo approaches.

quant-ph

Quantum-enhanced Markov chain Monte Carlo

Sampling from complicated probability distributions is a hard computational problem arising in many fields, including statistical physics, optimization, and machine learning. Quantum computers have recently been used to sample from complicated distributions that are hard to sample from classically, but which seldom arise in applications. Here we introduce a quantum algorithm to sample from distributions that pose a bottleneck in several applications, which we implement on a superconducting quantum processor. The algorithm performs Markov chain Monte Carlo (MCMC), a popular iterative sampling technique, to sample from the Boltzmann distribution of classical Ising models. In each step, the quantum processor explores the model in superposition to propose a random move, which is then accepted or rejected by a classical computer and returned to the quantum processor, ensuring convergence to the desired Boltzmann distribution. We find that this quantum algorithm converges in fewer iterations than common classical MCMC alternatives on relevant problem instances, both in simulations and experiments. It therefore opens a new path for quantum computers to solve useful--not merely difficult--problems in the near term.

quant-ph

Extending the reach of quantum computing for materials science with machine learning potentials

Solving electronic structure problems represents a promising field of application for quantum computers. Currently, much effort has been spent in devising and optimizing quantum algorithms for quantum chemistry problems featuring up to hundreds of electrons. While quantum algorithms can in principle outperform their classical equivalents, the polynomially scaling runtime, with the number of constituents, can still prevent quantum simulations of large scale systems. We propose a strategy to extend the scope of quantum computational methods to large scale simulations using a machine learning potential, trained on quantum simulation data. The challenge of applying machine learning potentials in today's quantum setting arises from the several sources of noise affecting the quantum computations of electronic energies and forces. We investigate the trainability of a machine learning potential selecting various sources of noise: statistical, optimization and hardware noise.Finally, we construct the first machine learning potential from data computed on actual IBM Quantum processors for a hydrogen molecule. This already would allow us to perform arbitrarily long and stable molecular dynamics simulations, outperforming all current quantum approaches to molecular dynamics and structure optimization.

quant-ph