Research
On-device research index

arXiv research

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.

168,695 papers · 148 categories

Trend · papers per month

1223 · Jun 202019922001200920172026
48 results for IBM qiskit

Quantum algorithm improves ensemble classification with reduced memory and time requirements.

problem High memory and computational time requirements in ensemble methods.
method Quantum superposition, entanglement, and interference to build an ensemble of classification models.
result Exponential growth of ensemble size with linear increase in depth of circuit.

Quantum computing speeds up CDO pricing models.

problem Efficiently pricing complex financial products like CDOs.
method Implemented quantum circuits for Gaussian and Normal Inverse Gaussian copula models, using quantum amplitude estimation.
result Quantum computing can significantly speed up CDO pricing compared to Monte Carlo simulations.

This study compares feature importance and explainability in quantum vs classical ML models.

problem Lack of transparency in ML models, especially in sensitive fields.
method Comparison of classical ML (SVM, Random Forest) and hybrid quantum ML (VQC, QSVC) models using feature importance and explainability methods.
result Quantum ML models provide insights similar to classical models but with unique quantum features.

Detecting patterns in real time streaming data has been an interesting and challenging data analytics problem. With the proliferation of a variety of sensor devices, real-time analytics of data from the Internet of Things (IoT) to learn regular and irregular patterns has become an important machine learning problem to …

2018-11-16abs ↗pdf ↗

Quantum computing techniques applied to Monte Carlo simulations in finance.

problem Efficiently simulating quantum algorithms for financial modeling.
method Introduces quantum computing basics, amplitude estimation, and Grover's algorithm for unstructured search.
result Demonstrates quantum approaches to Monte Carlo integration and counting in finance.

Quantum computers can optimize foreign exchange reserves management.

problem Optimizing foreign exchange reserves management using quantum computing.
method Demonstrated through quantum Monte Carlo risk measurement and quantum algorithms for portfolio optimization.
result Quantum computers can theoretically optimize FX reserves management in the future.

New method uses quantum computing to process classical data efficiently.

problem Inefficient quantum machine learning due to data loading and trainability issues.
method Linear Hamiltonian-based machine learning with ground state problems for k-local Hamiltonians.
result Demonstrated the effectiveness and scalability of the method on up to 50 qubits.

The purpose of this paper is to propose a time-varying vector autoregressive model (TV-VAR) for forecasting multivariate time series. The model is casted into a state-space form that allows flexible description and analysis. The volatility covariance matrix of the time series is modelled via inverted Wishart and singul…

2008-02-01abs ↗pdf ↗

We present the recent advances along with an error analysis of the IBM speaker recognition system for conversational speech. Some of the key advancements that contribute to our system include: a nearest-neighbor discriminant analysis (NDA) approach (as opposed to LDA) for intersession variability compensation in the i-…

2016-05-05abs ↗pdf ↗

In this paper we describe the recent advancements made in the IBM i-vector speaker recognition system for conversational speech. In particular, we identify key techniques that contribute to significant improvements in performance of our system, and quantify their contributions. The techniques include: 1) a nearest-neig…

2016-02-23abs ↗pdf ↗

Quantum Monte Carlo speeds up option pricing for complex payoff functions.

problem Efficiently pricing options with complex payoff functions using quantum computing.
method Developed a quantum Monte Carlo algorithm for multidimensional Black-Scholes PDEs.
result Proved polynomial computational complexity and speed-up over classical methods.

Quantum method speeds up risk estimation for insurance tail risks.

problem Sample-sparsity in classical Monte Carlo methods for tail risk pricing.
method Quantum Amplitude Estimation (QAE) with Grover amplification.
result Quantum method achieves convergence approaching order reciprocal N, enabling high-resolution tail estimation within practical budgets.

Value-at-Risk (VaR) is an institutional measure of risk favored by financial regulators. VaR may be interpreted as a quantile of future portfolio values conditional on the information available, where the most common quantile used is 95%. Here we demonstrate Conditional Autoregressive Value at Risk, first introduced by…

2016-03-05abs ↗pdf ↗

Deep learning (DL) training-as-a-service (TaaS) is an important emerging industrial workload. The unique challenge of TaaS is that it must satisfy a wide range of customers who have no experience and resources to tune DL hyper-parameters, and meticulous tuning for each user's dataset is prohibitively expensive. Therefo…

2016-11-18abs ↗pdf ↗

The existence of forbidden patterns, i.e., certain missing sequences in a given time series, is a recently proposed instrument of potential application in the study of time series. Forbidden patterns are related to the permutation entropy, which has the basic properties of classic chaos indicators, thus allowing to sep…

2007-11-05abs ↗pdf ↗

Quantum walk algorithm optimizes quantum state preparation for financial simulations.

problem Efficiently loading classical data into quantum states for quantum computers.
method Split-step quantum walks (SSQW) to design parameterized quantum circuits (PQC).
result SSQW facilitates generating desired probability amplitude distributions for quantum simulations.

A general nonlinear logistic equation has been proposed to model long-time saturation in industrial growth. An integral solution of this equation has been derived for any arbitrary degree of nonlinearity. A time scale for the onset of nonlinear saturation in industrial growth can be estimated from an equipartition cond…

2009-03-02abs ↗pdf ↗

Quantum circuits represent binary classification trees with binary features.

problem Classifying data using binary classification trees with binary features.
method Quantum circuits and probabilistic approach for traversing decision trees.
result First realization of a decision tree classifier on a quantum device.

In this pedagogical study, carried out by adopting standard mathematical methods of nonlinear dynamics, we have presented some simple analytical models to understand terminal behaviour in industrial growth. This issue has also been addressed from a dynamical systems perspective, with especial emphasis on the concept of…

2007-08-26abs ↗pdf ↗

A new model captures irregularly spaced high-frequency prices and their volatility.

problem Modeling high-frequency prices with irregular spacing and market noise.
method Observation-driven model using Skellam distribution with time-varying volatility and smoothing splines.
result The model provides a good fit to IBM stock data and measures daily realized volatility.

We extend the concept of transfer learning, widely applied in modern machine learning algorithms, to the emerging context of hybrid neural networks composed of classical and quantum elements. We propose different implementations of hybrid transfer learning, but we focus mainly on the paradigm in which a pre-trained cla…

2019-12-17abs ↗pdf ↗

Adaptive Quantum Conformal Prediction improves reliability of quantum machine learning predictions.

problem Quantum machine learning lacks robust uncertainty quantification methods.
method Adaptive Conformal Inference applied to quantum conformal prediction to maintain validity over time.
result AQCP achieves target coverage levels and is more stable than standard quantum conformal prediction.

Benchmark data sets are an indispensable ingredient of the evaluation of graph-based machine learning methods. We release a new data set, compiled from International Planning Competitions (IPC), for benchmarking graph classification, regression, and related tasks. Apart from the graph construction (based on AI planning…

2019-05-15abs ↗pdf ↗

Study characterizes memory capacity of quantum reservoirs using transmon qubits.

problem Understanding the memory capacity of quantum reservoirs built with transmon qubits.
method Characterized memory capacity of quantum reservoirs using transmon qubits from IBM, focusing on NMSE and topology complexity.
result Found a peak in memory capacity for configurations with n-1 self-loops, suggesting optimal design for forecasting tasks.

Decentralized Parallel SGD (D-PSGD) and its asynchronous variant Asynchronous Parallel SGD (AD-PSGD) is a family of distributed learning algorithms that have been demonstrated to perform well for large-scale deep learning tasks. One drawback of (A)D-PSGD is that the spectral gap of the mixing matrix decreases when the …

2020-02-04abs ↗pdf ↗

We propose the Sobolev Independence Criterion (SIC), an interpretable dependency measure between a high dimensional random variable X and a response variable Y . SIC decomposes to the sum of feature importance scores and hence can be used for nonlinear feature selection. SIC can be seen as a gradient regularized Integr…

2019-10-31abs ↗pdf ↗

The distribution of health care payments to insurance plans has substantial consequences for social policy. Risk adjustment formulas predict spending in health insurance markets in order to provide fair benefits and health care coverage for all enrollees, regardless of their health status. Unfortunately, current risk a…

2019-01-28abs ↗pdf ↗

FSPA bypasses eigenvalue estimation for quantum PCA, achieving optimal complexity and robustness.

problem Quantum PCA eigenvalue estimation is computationally expensive and prone to errors.
method Filtered Spectral Projection Algorithm (FSPA) that projects onto the dominant spectral subspace directly.
result FSPA achieves optimal complexity and robustness, outperforming classical methods.

Quantum computing aids in optimizing currency reserves for central banks.

problem Optimizing currency composition in foreign exchange reserves.
method Comparison of quantum and classical algorithms for portfolio optimization.
result Quantum algorithms outperform classical methods in currency optimization.

New quantum state reconstruction method accelerates convergence.

problem Quantum state reconstruction for larger systems.
method Momentum-Inspired Factored Gradient Descent (MiFGD) combining compressed sensing, non-convex optimization, and acceleration.
result Converges to true density matrix at an accelerated linear rate, provably close to the true matrix.