Improved quantum supersampling for quantum ray tracing

DOI10.1007/S11128-023-04114-XMaRDI QIDQ6048728zbMATH OpenOpenAlexFDO

Authors Xi Lu, Hongwei Lin

Publication date 13 October 2023

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2208.05171

zbMATH Keywords

computer graphicsquantum algorithmray tracing

Mathematics Subject Classification ID

Quantum computation (81P68)

Abstract: Ray tracing algorithm is a category of rendering algorithms that calculate the color of pixels by simulating the physical movements of a huge amount of rays and calculating their energies, which can be implemented in parallel. Meanwhile, the superposition and entanglement property make quantum computing a natural fit for parallel tasks.Here comes an interesting question, is the inherently parallel quantum computing able to speed up the inherently parallel ray tracing algorithm? The ray tracing problem can be regarded as a high-dimensional numerical integration problem. Suppose $N$ queries are used, classical Monte Carlo approaches has an error convergence of $O(1/sqrtN)$, while the quantum supersampling algorithm can achieve an error convergence of approximately $O(1/N)$. However, the outputs of the origin form of quantum supersampling obeys a probability distribution that has a long tail, which shows up as many detached abnormal noisy dots on images. In this paper, we improve quantum supersampling by replacing the QFT-based phase estimation in quantum supersampling with a robust quantum counting scheme, the QFT-based adaptive Bayesian phase estimation. We quantitatively study and compare the performances of different quantum counting schemes. Finally, we do simulation experiments to show that the quantum ray tracing with improved quantum supersampling does perform better than classical path tracing algorithm as well as the original form of quantum supersampling.

Recommendations

• Quantum computer graphics algorithms
• Bidirectional ray tracing for the integration of illumination by the quasi-Monte Carlo method
• An adaptive threshold-based quantum image segmentation algorithm and its simulation
• A quantum Richardson-lucy image restoration algorithm based on controlled rotation operation and Hamiltonian evolution
• Quantum image scaling up based on nearest-neighbor interpolation with integer scaling ratio

Cites work

• Amplitude estimation without phase estimation
• Hierarchical geometric models for visible surface algorithms
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• scientific article; zbMATH DE number 1406124 (Why is no real title available?)
• Multidimensional binary search trees used for associative searching
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum addition circuits and unbounded fan-out
• Quantum computer graphics algorithms
• Quantum random access memory

Cited in

(1)

• Improved quantum dilation and erosion operations

This page was built for publication: Improved quantum supersampling for quantum ray tracing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6048728)