Related papers: Quantum algorithm for copula-based risk aggregatio…
Risk aggregation is a popular method used to estimate the sum of a collection of financial assets or events, where each asset or event is modelled as a random variable. Applications, in the financial services industry, include insurance,…
We consider the problem of estimating an expectation $ \mathbb{E}\left[ h(W)\right]$ by quasi-Monte Carlo (QMC) methods, where $ h $ is an unbounded smooth function on $ \mathbb{R}^d $ and $ W$ is a standard normal distributed random…
Advances in the experimental demonstration of quantum processors have provoked a surge of interest to the idea of practical implementation of quantum computing over last years. It is expected that the use of quantum algorithms will…
We study quasi-Monte Carlo (QMC) integration over the multi-dimensional unit cube in several weighted function spaces with different smoothness classes. We consider approximating the integral of a function by the median of several integral…
Quantum Machine Learning (QML) offers a new paradigm for addressing complex financial problems intractable for classical methods. This work specifically tackles the challenge of few-shot credit risk assessment, a critical issue in inclusive…
We present Quafu-Qcover, an open-source cloud-based software package designed for combinatorial optimization problems that support both quantum simulators and hardware backends. Quafu-Qcover provides a standardized and complete workflow for…
We propose a Jacobi-style distributed algorithm to solve convex, quadratically constrained quadratic programs (QCQPs), which arise from a broad range of applications. While small to medium-sized convex QCQPs can be solved efficiently by…
We apply quantum integration to elementary particle-physics processes. In particular, we look at scattering processes such as ${\rm e}^+{\rm e}^- \to q \bar q$ and ${\rm e}^+{\rm e}^- \to q \bar q' {\rm W}$. The corresponding probability…
We describe a number of strategies for minimizing and calculating accurately the statistical uncertainty in quantum Monte Carlo calculations. We investigate the impact of the sampling algorithm on the efficiency of the variational Monte…
We propose a novel sampling framework for inference in probabilistic models: an active learning approach that converges more quickly (in wall-clock time) than Markov chain Monte Carlo (MCMC) benchmarks. The central challenge in…
Quantum bits have technological imperfections. Additionally, the capacity of a component that can be implemented feasibly is limited. Therefore, distributed quantum computation is required to scale up quantum computers. This dissertation…
For a long time, people have been focusing on how to extract more information, such as off-diagonal observables, from the quantum Monte Carlo (QMC) simulation of the partition function, but there have been numerous difficulties, and many of…
We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm in the impulse regime, that is, where the counterdiabatic terms are dominant. Our approach…
Quantum signal processing (QSP) provides a systematic framework for implementing a polynomial transformation of a linear operator, and unifies nearly all known quantum algorithms. In parallel, recent works have developed randomized…
Successful implementations of quantum technologies require protocols and algorithms that use as few quantum resources as possible. However, many important quantum operations, such as continuous rotation gates in quantum computing or…
We present quantum algorithms for sampling from non-logconcave probability distributions in the form of $\pi(x) \propto \exp(-\beta f(x))$. Here, $f$ can be written as a finite sum $f(x):= \frac{1}{N}\sum_{k=1}^N f_k(x)$. Our approach is…
Quantum Monte Carlo (QMC) methods are essential for the numerical study of large-scale quantum many-body systems, yet their utility has been significantly hampered by the difficulty in computing key quantities such as off-diagonal operators…
We propose and analyze a quasi-Monte Carlo (QMC) algorithm for efficient simulation of wave propagation modeled by the Helmholtz equation in a bounded region in which the refractive index is random and spatially heterogenous. Our focus is…
The Markov Chain Monte Carlo method is at the heart of efficient approximation schemes for a wide range of problems in combinatorial enumeration and statistical physics. It is therefore very natural and important to determine whether…
We have reformulated the quantum Monte Carlo (QMC) technique so that a large part of the calculation scales linearly with the number of atoms. The reformulation is related to a recent alternative proposal for achieving linear-scaling QMC,…