A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
This work shows how to efficiently simulate parts of quantum landscapes using classical computers.
Quantum CNNs can be efficiently simulated classically on simple datasets.
Given a classical channel---a stochastic map from inputs to outputs---the input can often be transformed to an intermediate variable that is informationally smaller than the input. The new channel accurately simulates the original but at a smaller transmission rate. Here, we examine this procedure when the intermediate…
Quantum models avoiding barren plateaus can also be efficiently simulated classically.
Simulating the time-evolution of quantum mechanical systems is BQP-hard and expected to be one of the foremost applications of quantum computers. We consider classical algorithms for the approximation of Hamiltonian dynamics using subsampling methods from randomized numerical linear algebra. We derive a simulation tech…
Proposes a new simulator for complex arrival processes.
Quantum circuits reveal pathways to dequantization in machine learning models.
A new ML method speeds up PDE simulations without needing classical training.
Quantum computing exploits basic quantum phenomena such as state superposition and entanglement to perform computations. The Quantum Approximate Optimization Algorithm (QAOA) is arguably one of the leading quantum algorithms that can outperform classical state-of-the-art methods in the near term. QAOA is a hybrid quant…
Quantum computing speeds up multi-period asset allocation.
Study analyzes 3,171 stocks to pick efficient portfolios using quantum and classical solvers.
Quantum machine learning solves high-dimensional PDEs with lower variance and improved accuracy.
New method bounds hardware noise without assumptions.
Quantum computing techniques applied to Monte Carlo simulations in finance.
Recommender systems play an essential role in the modern business world. They recommend favorable items like books, movies, and search queries to users based on their past preferences. Applying similar ideas and techniques to Monte Carlo simulations of physical systems boosts their efficiency without sacrificing accura…
This work proposes efficient classical training protocols for IQP circuits to train quantum generative models.
VQAs use classical optimization to train quantum circuits, promising quantum advantage.
Quantum computers can simulate flow models efficiently.
Simulators enable learning with generalization guarantees in computationally bounded worlds.
Two simulation-based methods improve optimal sampling design in systems biology.
Researchers analyze a new neural network training method.
Quantum walks are at the heart of modern quantum technologies. They allow to deal with quantum transport phenomena and are an advanced tool for constructing novel quantum algorithms. Quantum walks on graphs are fundamentally different from classical random walks analogs, in particular, they walk faster than classical o…
Quantum computing is a computational paradigm with the potential to outperform classical methods for a variety of problems. Proposed recently, the Quantum Approximate Optimization Algorithm (QAOA) is considered as one of the leading candidates for demonstrating quantum advantage in the near term. QAOA is a variational …
Study evaluates ML methods for two-sample testing with right-censored data.
A new framework bridges classical and machine learning methods for reliable inference from complex models.
Comma.ai's approach to Artificial Intelligence for self-driving cars is based on an agent that learns to clone driver behaviors and plans maneuvers by simulating future events in the road. This paper illustrates one of our research approaches for driving simulation. One where we learn to simulate. Here we investigate v…
New MC simulation methods use classifiers to estimate pdf ratios without explicit pdfs.
We introduce a new deep-learning based algorithm to evaluate options in affine rough stochastic volatility models. Viewing the pricing function as the solution to a curve-dependent PDE (CPDE), depending on forward curves rather than the whole path of the process, for which we develop a numerical scheme based on deep le…
Classical multidimensional scaling is an important dimension reduction technique. Yet few theoretical results characterizing its statistical performance exist. This paper provides a theoretical framework for analyzing the quality of embedded samples produced by classical multidimensional scaling. This lays the foundati…
Quantum walk algorithm optimizes quantum state preparation for financial simulations.
We construct realistic equity option market simulators based on generative adversarial networks (GANs). We consider recurrent and temporal convolutional architectures, and assess the impact of state compression. Option market simulators are highly relevant because they allow us to extend the limited real-world data set…
Deep RL drone trained to compete against classical path planning in drone racing.
In this paper, we face the problem of simulating discrete random variables with general and varying distributions in a scalable framework, where fully parallelizable operations should be preferred. The new paradigm is inspired by the context of discrete choice models. Compared to classical algorithms, we add paralleliz…
Improved flow-based inference speeds up and boosts accuracy for complex simulations.
Quantum annealing (QA) is a generic method for solving optimization problems using fictitious quantum fluctuation. The current device performing QA involves controlling the transverse field; it is classically simulatable by using the standard technique for mapping the quantum spin systems to the classical ones. In this…
A mean field variational Bayes approach to support vector machines (SVMs) using the latent variable representation on Polson & Scott (2012) is presented. This representation allows circumvention of many of the shortcomings associated with classical SVMs including automatic penalty parameter selection, the ability to ha…
Hybrid quantum-classical method optimizes financial index tracking.
Quantum annealing is a generic solver of the optimization problem that uses fictitious quantum fluctuation. Its simulation in classical computing is often performed using the quantum Monte Carlo simulation via the Suzuki--Trotter decomposition. However, the negative sign problem sometimes emerges in the simulation of q…
We propose a novel quantum model for the restricted Boltzmann machine (RBM), in which the visible units remain classical whereas the hidden units are quantized as noninteracting fermions. The free motion of the fermions is parametrically coupled to the classical signal of the visible units. This model possesses a quant…
Quantum mechanics is inherently probabilistic in light of Born's rule. Using quantum circuits as probabilistic generative models for classical data exploits their superior expressibility and efficient direct sampling ability. However, training of quantum circuits can be more challenging compared to classical neural net…
It is known that quantum computers can speed up Monte Carlo simulation compared to classical counterparts. There are already some proposals of application of the quantum algorithm to practical problems, including quantitative finance. In many problems in finance to which Monte Carlo simulation is applied, many random n…
Proposes ABIDES-Gym for financial markets simulation.
Enhances quantum computing for symmetrical systems, proving a new class of problems.
Marine buoys aid in the battle against Illegal, Unreported and Unregulated (IUU) fishing by detecting fishing vessels in their vicinity. Marine buoys, however, may be disrupted by natural causes and buoy vandalism. In this paper, we formulate marine buoy placement as a clustering problem, and propose dropout k-means an…
Efficiently simulates risk budgeting portfolios using novel algorithms.
Generative Adversarial Networks simulate elevator group control without extensive data.
The paper develops a faster surrogate model for simulators using hybrid methods.
Inspired by the possibility that generative models based on quantum circuits can provide a useful inductive bias for sequence modeling tasks, we propose an efficient training algorithm for a subset of classically simulable quantum circuit models. The gradient-free algorithm, presented as a sequence of exactly solvable …