相关论文: Comparative Benchmarks of full QCD Algorithms

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…

We present a protocol for Interleaved Randomized Benchmarking of arbitrary quantum gates using Monte Carlo sampling of quantum states. It is generally applicable, including non-Clifford gates while preserving key advantages of Randomized…

We reformulate the projected imaginary-time evolution of Full Configuration Interaction Quantum Monte Carlo in terms of a Lagrangian minimization. This naturally leads to the admission of polynomial complex wavefunction parameterizations,…

This paper proposes an efficient method for the simultaneous estimation of the state of a quantum system and the classical parameters that govern its evolution. This hybrid approach benefits from efficient numerical methods for the…

Recent demonstrations of superconducting quantum computers by Google and IBM and trapped-ion computers from IonQ fueled new research in quantum algorithms, compilation into quantum circuits, and empirical algorithmics. While online access…

Starting from the Schr\"odinger-equation of a composite system, we derive unified dynamics of a classical harmonic system coupled to an arbitrary quantized system. The classical subsystem is described by random phase-space coordinates…

This review describes the multiboson algorithm for Monte Carlo simulations of lattice QCD, including its static and dynamical aspects, and presents a comparison with Hybrid Monte Carlo.

Motivated by the similarity to QCD, specifically the property of asymptotic freedom, we simulate the dynamics of the SU(2) $\times$ SU(2) model in two dimensions using the Hybrid Monte Carlo algorithm. By introducing Fourier Acceleration,…

Partial differential equations frequently appear in the natural sciences and related disciplines. Solving them is often challenging, particularly in high dimensions, due to the "curse of dimensionality". In this work, we explore the…

We propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics, which does not require complicated quantum control logic for handling time-ordering operators. To our knowledge, this is the first quantum algorithm…

We derive the improved estimators for general interactions and employ these for the continuous-time quantum Monte Carlo method. Using a worm algorithm we show how measuring higher-ordered correlators leads to an improved high-frequency…

We give a detailed description of the so-called Polynomial Hybrid Monte Carlo (PHMC) algorithm. The effects of the correction factor, which is introduced to render the algorithm exact, are discussed, stressing their relevance for the…

We survey old and new results about optimal algorithms for summation of finite sequences and for integration of functions from Hoelder or Sobolev spaces. First we discuss optimal deterministic and randomized algorithms. Then we add a new…

Quantum Monte Carlo simulations offer an unbiased means to study the static and dynamic properties of quantum critical systems, while quantum field theory provides direct analytical results. We study three dimensional, critical quantum…

This study systematically benchmarks several non-fault-tolerant quantum computing algorithms across four distinct optimization problems: max-cut, number partitioning, knapsack, and quantum spin glass. Our benchmark includes noisy…

We report on some preparatory investigations for the simulation of the QCD Schroedinger functional with a non-hermitian polynomial hybrid Monte Carlo algorithm. The complex spectrum of the non-hermitean free operator with SF boundary…

Computational methods both open the frontiers of economic analysis and serve as a bottleneck in what can be achieved. We are the first to study whether Quantum Monte Carlo (QMC) algorithm can improve the runtime of economic applications and…

The improvement of simulations of QCD with dynamical Wilson fermions by combining the Hybrid Monte Carlo algorithm with parallel tempering is studied on $10^4$ and $12^4$ lattices. As an indicator for decorrelation the topological charge is…

UKQCD's dynamical fermion project uses the Generalised Hybrid Monte-Carlo (GHMC) algorithm to generate QCD gauge configurations for a non-perturbatively O(a) improved Wilson action with two degenerate sea-quark flavours. We describe our…

The QED-C suite of Application-Oriented Benchmarks provides the ability to gauge performance characteristics of quantum computers as applied to real-world applications. Its benchmark programs sweep over a range of problem sizes and inputs,…