Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Parallel and Distributed Processing Symposium (IPDPS)

Parameterization based on randomized quasi-Monte Carlo methods

Giray Ökten, Matthew Willyard

Published Apr 1, 2008• 2 citations
Publisher

Abstract

We present a theoretical framework where any randomized quasi-Monte Carlo method can be viewed and analyzed as a parameterization method for parallel quasi-Monte Carlo. We present deterministic and stochastic error bounds when different processors of the computing environment run at different speeds. We implement two parameterization methods, both based on randomized quasi-Monte Carlo, and apply them to pricing digital options and collateralized mortgage obligations. Numerical results are used to compare the parameterization methods by their parallel performance as well as their Monte Carlo efficiency.

DOI
10.1109/ipdps.2008.4536457

Related papers

American option pricing with randomized quasi-Monte Carlo simulations

Maxime Dion, Pierre L’Ecuyer

We study the pricing of American options using least-squares Monte Carlo combined with randomized quasi-Monte Carlo (RQMC), viewed as a variance reduction method. We find that RQMC reduces both the variance and the bias of the option price obtained in an out-of-sample evaluation of the retained policy, and improves the quality of the returned policy on average. Various sampling methods of the underlying stochastic processes are compared and the variance reduction is analyzed in terms of a functional ANOVA decomposition.

Winter Simulation Conference•Dec 1, 2010•18 citations

Parallel Randomized Quasi-Monte Carlo Simulation for Asian Basket Option Pricing

Yonghong Hu, Da-Qian Chen

High-dimensional derivatives pricing, such as Asian basket options, poses great computational challenges in practice. In this paper, parallel Randomized Quasi-Monte Carlo (RQMC) simulation method is investigated to tackle this kind of intractable problems. By using the intrinsic nature of “embarrassingly parallel”, parallel RQMC algorithm for Asian basket option pricing is effectively implemented using MPI. Numerical experiments are performed on supercomputer DeepComp6800 and the parallel performance is then analyzed. Our parallel algorithm has exerted perfect performance and good scalability. Parallel computing has greatly improved the computational efficiency of derivatives pricing.

Journal of Algorithms & Computational Technology•Mar 1, 2012•6 citations

Efficient quasi-Monte Carlo sampling for quantum random walks

Emanouil I. Atanassov, Mariya K. Durchova

Quantum random walks are the natural counterpart of the classical random walk, arising when quantum effects are taken into consideration. Many Monte Carlo methods use the classical Brownian motion as a building block. Although it appears naturally in various problems of computational physics, it is also used extensively in the stochastic models used for pricing of financial assets. When quantum random walks are used instead, more complex behaviors can be observed. However, the simulation of a quantum random walk requires more computational resources. By using low-discrepancy sequences instead of pseudorandom numbers, one may hope to decrease the statistical error of the simulation. Another approach for improved efficiency is to use the power of computational accelerators, which are suitable for problems, where a well-ordered sequence of computations is to be performed repeatedly. In our work we concentrated on using GPGPU computing in order to speed-up the operations involved in the generation of the low-discrepancy sequence as well as the subsequent sampling of the quantum random walks. In this work we explain our sampling algorithm and demonstrate its efficiency on model problems from the domain of option pricing.

AIP conference proceedings•Jan 1, 2020•2 citations

Scrambled quasirandom sequences and their applications

Hongmei Chi, Michael Mascagni

Quasi-Monte Carlo methods are a variant of ordinary Monte Carlo methods that employ highly uniform quasirandom numbers in place of Monte Carlo's pseudorandom numbers. Monte Carlo methods offer statistical error estimates; however, while quasi-Monte Carlo has a faster convergence rate than normal Monte Carlo, one cannot obtain error estimates from quasi-Monte Carlo sample values by any practical way. A recently proposed method, called randomized quasi-Monte Carlo methods, takes advantage of Monte Carlo and quasi-Monte Carlo methods. Randomness can be brought to bear on quasirandom sequences through scrambling and other related randomization techniques in randomized quasi-Monte Carlo methods, which provide an elegant approach to obtain error estimates for quasi-Monte Carlo based on treating each scrambled sequence as a different and independent random sample. The core of randomized quasi-Monte Carlo is to find an effective and fast algorithm to scramble (randomize) quasirandom sequences. This dissertation surveys research on algorithms and implementations of scrambled quasirandom sequences and proposes some new algorithms to improve the quality of scrambled quasirandom sequences. Besides obtaining error estimates for quasi-Monte Carlo, scrambling techniques provide a natural way to parallelize quasirandom sequences. This scheme is especially suitable for distributed or grid computing. By scrambling a quasirandom sequence we can produce a family of related quasirandom sequences. Finding one or a subset of optimal quasirandom sequences within this family is an interesting problem, as such optimal quasirandom sequences can be quite useful for quasi-Monte Carlo. The process of finding such optimal quasirandom sequences is called the derandomization of a randomized (scrambled) family. We summarize aspects of this technique and propose some new algorithms for finding optimal sequences from the Halton, Faure and Sobol sequences. Finally we explore applications of derandomization.

•Jan 1, 2004•8 citations

Quasi-Monte Carlo methods for simulation

Pierre L’Ecuyer

Quasi-Monte Carlo (QMC) methods are numerical techniques for estimating large-dimensional integrals, usually over the unit hypercube. They can be applied, at least in principle, to any simulation whose aim is to estimate a mathematical expectation. This covers a very wide range of applications. In this paper, we review some of the key ideas of quasi-Monte Carlo methods from a broad perspective, with emphasis on some recent results. We visit lattice rules in different types of spaces and make the connections between these rules and digital nets, thus covering the two most widely used QMC methods.

International Conference on Machine Learning and Cybernetics•May 6, 2004•4 citations

Quantum Quasi-Monte Carlo: a window for pre-asymptotic quantum advantage

Paolo Recchia, Zhan Yu, Kelvin Koor +1 more

Numerical integration with Monte Carlo methods is a central computational task in many scientific and industrial applications, including financial derivative pricing and risk management. Classical Monte Carlo algorithms are computationally demanding: achieving an accuracy $ε$ typically requires a number of function evaluations scaling as $O(1/ε^2)$. Quantum-accelerated Monte Carlo methods based on quantum amplitude estimation can in principle quadratically improve this dependence. However, \textit{quasi}-Monte Carlo methods have not been explored in the quantum context. In this work, we introduce a quantum quasi-Monte Carlo algorithm that combines low-discrepancy nets with quantum amplitude estimation. The proposed method prepares the quasi-random point set coherently in superposition. The method does not yield an asymptotic improvement over classical quasi-Monte Carlo, since the total error separates into a discretization error, determined by the finite net, and a quantum estimation error. Instead, we explore a pre-asymptotic advantage window: for a target accuracy that would classically require $2^q$ low discrepancy points, one can prepare a higher-resolution net of size $2^Q$, with $Q>q$, in superposition and reach the same accuracy using significantly fewer function queries. This window can be controlled by tuning the circuit resolution and amplitude-estimation parameters, making the approach relevant for practical regimes where the number of queries is finite rather than asymptotically large.

quant-pharXiv:2609.03625•Sep 4, 2026•0 citations
We present a theoretical framework where any randomized quasi-Monte Carlo method can be viewed and analyzed as a parameterization method for parallel quasi-Monte Carlo. We present deterministic and stochastic error bounds when different processors of the computing environment run at different speeds. We implement two parameterization methods, both based on randomized quasi-Monte Carlo, and apply them to pricing digital options and collateralized mortgage obligations. Numerical results are used to compare the parameterization methods by their parallel performance as well as their Monte Carlo efficiency.
We study the pricing of American options using least-squares Monte Carlo combined with randomized quasi-Monte Carlo (RQMC), viewed as a variance reduction method. We find that RQMC reduces both the variance and the bias of the option price obtained in an out-of-sample evaluation of the retained policy, and improves the quality of the returned policy on average. Various sampling methods of the underlying stochastic processes are compared and the variance reduction is analyzed in terms of a functional ANOVA decomposition.
High-dimensional derivatives pricing, such as Asian basket options, poses great computational challenges in practice. In this paper, parallel Randomized Quasi-Monte Carlo (RQMC) simulation method is investigated to tackle this kind of intractable problems. By using the intrinsic nature of “embarrassingly parallel”, parallel RQMC algorithm for Asian basket option pricing is effectively implemented using MPI. Numerical experiments are performed on supercomputer DeepComp6800 and the parallel performance is then analyzed. Our parallel algorithm has exerted perfect performance and good scalability. Parallel computing has greatly improved the computational efficiency of derivatives pricing.
Quantum random walks are the natural counterpart of the classical random walk, arising when quantum effects are taken into consideration. Many Monte Carlo methods use the classical Brownian motion as a building block. Although it appears naturally in various problems of computational physics, it is also used extensively in the stochastic models used for pricing of financial assets. When quantum random walks are used instead, more complex behaviors can be observed. However, the simulation of a quantum random walk requires more computational resources. By using low-discrepancy sequences instead of pseudorandom numbers, one may hope to decrease the statistical error of the simulation. Another approach for improved efficiency is to use the power of computational accelerators, which are suitable for problems, where a well-ordered sequence of computations is to be performed repeatedly. In our work we concentrated on using GPGPU computing in order to speed-up the operations involved in the generation of the low-discrepancy sequence as well as the subsequent sampling of the quantum random walks. In this work we explain our sampling algorithm and demonstrate its efficiency on model problems from the domain of option pricing.
Quasi-Monte Carlo methods are a variant of ordinary Monte Carlo methods that employ highly uniform quasirandom numbers in place of Monte Carlo's pseudorandom numbers. Monte Carlo methods offer statistical error estimates; however, while quasi-Monte Carlo has a faster convergence rate than normal Monte Carlo, one cannot obtain error estimates from quasi-Monte Carlo sample values by any practical way. A recently proposed method, called randomized quasi-Monte Carlo methods, takes advantage of Monte Carlo and quasi-Monte Carlo methods. Randomness can be brought to bear on quasirandom sequences through scrambling and other related randomization techniques in randomized quasi-Monte Carlo methods, which provide an elegant approach to obtain error estimates for quasi-Monte Carlo based on treating each scrambled sequence as a different and independent random sample. The core of randomized quasi-Monte Carlo is to find an effective and fast algorithm to scramble (randomize) quasirandom sequences. This dissertation surveys research on algorithms and implementations of scrambled quasirandom sequences and proposes some new algorithms to improve the quality of scrambled quasirandom sequences. Besides obtaining error estimates for quasi-Monte Carlo, scrambling techniques provide a natural way to parallelize quasirandom sequences. This scheme is especially suitable for distributed or grid computing. By scrambling a quasirandom sequence we can produce a family of related quasirandom sequences. Finding one or a subset of optimal quasirandom sequences within this family is an interesting problem, as such optimal quasirandom sequences can be quite useful for quasi-Monte Carlo. The process of finding such optimal quasirandom sequences is called the derandomization of a randomized (scrambled) family. We summarize aspects of this technique and propose some new algorithms for finding optimal sequences from the Halton, Faure and Sobol sequences. Finally we explore applications of derandomization.
Quasi-Monte Carlo (QMC) methods are numerical techniques for estimating large-dimensional integrals, usually over the unit hypercube. They can be applied, at least in principle, to any simulation whose aim is to estimate a mathematical expectation. This covers a very wide range of applications. In this paper, we review some of the key ideas of quasi-Monte Carlo methods from a broad perspective, with emphasis on some recent results. We visit lattice rules in different types of spaces and make the connections between these rules and digital nets, thus covering the two most widely used QMC methods.
Numerical integration with Monte Carlo methods is a central computational task in many scientific and industrial applications, including financial derivative pricing and risk management. Classical Monte Carlo algorithms are computationally demanding: achieving an accuracy εεε typically requires a number of function evaluations scaling as O(1/ε2)O(1/ε^2)O(1/ε2). Quantum-accelerated Monte Carlo methods based on quantum amplitude estimation can in principle quadratically improve this dependence. However, \textit{quasi}-Monte Carlo methods have not been explored in the quantum context. In this work, we introduce a quantum quasi-Monte Carlo algorithm that combines low-discrepancy nets with quantum amplitude estimation. The proposed method prepares the quasi-random point set coherently in superposition. The method does not yield an asymptotic improvement over classical quasi-Monte Carlo, since the total error separates into a discretization error, determined by the finite net, and a quantum estimation error. Instead, we explore a pre-asymptotic advantage window: for a target accuracy that would classically require 2q2^q2q low discrepancy points, one can prepare a higher-resolution net of size 2Q2^Q2Q, with Q>qQ>qQ>q, in superposition and reach the same accuracy using significantly fewer function queries. This window can be controlled by tuning the circuit resolution and amplitude-estimation parameters, making the approach relevant for practical regimes where the number of queries is finite rather than asymptotically large.