2020
DOI: 10.1111/cgf.14015
|View full text |Cite
|
Sign up to set email alerts
|

Quantum Coin Method for Numerical Integration

Abstract: Light transport simulation in rendering is formulated as a numerical integration problem in each pixel, which is commonly estimated by Monte Carlo integration. Monte Carlo integration approximates an integral of a black‐box function by taking the average of many evaluations (i.e. samples) of the function (integrand). For N queries of the integrand, Monte Carlo integration achieves the estimation error of O(1/N). Recently, Johnston [Joh16] introduced quantum super‐sampling (QSS) into rendering as a numerical in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(10 citation statements)
references
References 17 publications
0
10
0
Order By: Relevance
“…In [14] they do not exactly match the desired asymptotic complexity, yet the constants involved are much lower. RQAE can be thought of as a generalization of the Quantum Coin algorithm [16,17] and it is based on an iterative strategy, like [14,15]. In particular, RQAE utilizes a set of auxiliary amplitudes which allow to shift in a controlled fashion the amplitude to be retrieved.…”
Section: Introduction Motivation and Main Resultsmentioning
confidence: 99%
“…In [14] they do not exactly match the desired asymptotic complexity, yet the constants involved are much lower. RQAE can be thought of as a generalization of the Quantum Coin algorithm [16,17] and it is based on an iterative strategy, like [14,15]. In particular, RQAE utilizes a set of auxiliary amplitudes which allow to shift in a controlled fashion the amplitude to be retrieved.…”
Section: Introduction Motivation and Main Resultsmentioning
confidence: 99%
“…The third and last step of the pipeline corresponds to extracting the information that we have stored in the quantum state, namely the read-out of the state that encodes the result of the algorithm. There are multiple techniques for this purpose such as those appearing in [7][8][9][10][11].…”
Section: Resultsmentioning
confidence: 99%
“…Shimada et al presented the quantum coin algorithm based on the quantum supersampling algorithm achieving quadratic acceleration 19 , 20 , but the value of the functions is limited to [0,1]. Heinrich raised a quantum integration algorithm with quadratic acceleration for Sobolev-like high-dimensional function 21 .…”
Section: Introductionmentioning
confidence: 99%