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

SPIN

Quantum Ray Tracing with Simulation

Xi Lu, Hongwei Lin

Published Nov 14, 2022• 3 citations
Publisher

Abstract

Rendering is a computer graphics process that generates images from a three-dimensional scene including models, lights and cameras. Ray tracing is a category of rendering algorithms that calculates pixel colors by simulating the physical movements of light rays such as reflections, refractions and scatterings. The core problem of ray tracing is a high-dimensional numerical integration, and the classical Monte Carlo ray tracing requires a big number of rays to reduce error. By leveraging the inherent parallelism of quantum computing, we propose a framework of quantum ray tracing algorithm, and do simulation experiments to prove that it has a quadratically faster error convergence than classical Monte Carlo ray tracing.

DOI
10.1142/s2010324722500308

Related papers

A Framework for Quantum Ray Tracing

Xi Lu, Hongwei Lin

Ray tracing algorithm simulates the physical movements of a huge amount of rays to render a high quality image, in which the tracing procedure for each ray can be implemented in parallel. By leveraging the inherent parallelism of quantum computing, we propose a quantum ray tracing algorithm, which is proved to have a quadratic speedup over the classical path tracing.

arXiv:2203.15451•Mar 29, 2022•9 citations

Quantum Ray Marching: Reformulating Light Transport for Quantum Computers

Logan Mosier, Morgan McGuire, Toshiya Hachisuka

The use of quantum computers in computer graphics has gained interest in recent years, especially for the application to rendering. The current state of the art in quantum rendering relies on Grover’s search for finding ray intersections in for M primitives. This quantum approach is faster than the naive approach of O(M) but slower than O(log M) of modern ray tracing with an acceleration data structure. Furthermore, this quantum ray tracing method is fundamentally limited to casting one ray at a time, leaving quantum rendering scales for the number of rays the same as non-quantum algorithms. We present a new quantum rendering method, quantum ray marching, based on the reformulation of ray marching as a quantum random walk. Our work is the first complete quantum rendering pipeline capable of light transport simulation and remains asymptotically faster than non-quantum counterparts. Our quantum ray marching can trace an exponential number of paths with polynomial cost, and it leverages quantum numerical integration to converge in O(1/N) for N estimates as opposed to non-quantum . These properties led to first quantum rendering that is asymptotically faster than non-quantum Monte Carlo rendering. We numerically tested our algorithm by rendering 2D and 3D scenes.

SIGGRAPH Asia Conference Papers•Dec 10, 2023•3 citations

Quantum rendering

Marco O. Lanzagorta, Richard B. Gomez, Jeffrey K. Uhlmann

In recent years, computer graphics has emerged as a critical component of the scientific and engineering process, and it is recognized as an important computer science research area. Computer graphics are extensively used for a variety of aerospace and defense training systems and by Hollywood's special effects companies. All these applications require the computer graphics systems to produce high quality renderings of extremely large data sets in short periods of time. Much research has been done in "classical computing" toward the development of efficient methods and techniques to reduce the rendering time required for large datasets. Quantum Computing's unique algorithmic features offer the possibility of speeding up some of the known rendering algorithms currently used in computer graphics. In this paper we discuss possible implementations of quantum rendering algorithms. In particular, we concentrate on the implementation of Grover's quantum search algorithm for Z-buffering, ray-tracing, radiosity, and scene management techniques. We also compare the theoretical performance between the classical and quantum versions of the algorithms.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 5, 2003•4 citations

A Quantum Algorithm for Ray Casting using an Orthographic Camera

Carolina Alves, Luís Paulo Santos, Thomas Bashford‐Rogers

Quantum computing has the potential to provide solutions to many problems which are challenging or out of reach of classical computers. There are several problems in rendering which are amenable to being solved in quantum computers, but these have yet to be demonstrated in practice. This work takes a first step in applying quantum computing to one of the most fundamental operations in rendering: ray casting. This technique computes visibility between two points in a 3D model of the world which is described by a collection of geometric primitives. The algorithm returns, for a given ray, which primitive it intersects closest to its origin. Without a spatial acceleration structure, the classical complexity for this operation is$O(N)$. In this paper, we propose an implementation of Grover's Algorithm (a quantum search algorithm) for ray casting. This provides a quadratic speed up allowing for visibility evaluation for unstructured primitives in$O(\sqrt{N})$. However, due to technological limitations associated with current quantum computers, in this work the geometrical setup is limited to rectangles and parallel rays (orthographic projection).

International Conference on Graphics and Interaction (ICGI)•Nov 1, 2019•10 citations

Rendering Coherent Scattering via Quantum Collision Models

João S. Ferreira, Spencer S. Topel, Pierre Fromholz +1 more

Traditional light rendering techniques treat the optical properties of materials as static, yet this assumption breaks down in cases where these properties dynamically evolve in response to incident illumination. We present a novel shading framework that combines classical ray-tracing with a quantum collision model to explore the effect of coherent light-matter interactions in rendering. By treating incident light and material excitations as quantized modes, we model sub-surface scattering as a sequence of symmetry-constrained unitary collisions. This formulation allows for the incorporation of non-integrable dynamics and chaotic optical responses due to multi-layer interference effects. We demonstrate how these collision operators can be pre-computed using near-term quantum computers to generate standard BSDFs, enabling the rendering of new physics-inspired materials with distinct optical signatures.

cs.GRCross-listedarXiv:2606.29989•Jun 30, 2026

Quantum Coin Method for Numerical Integration

N. H. Shimada, Toshiya Hachisuka

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 . Recently, Johnston [Joh16] introduced quantum super‐sampling (QSS) into rendering as a numerical integration method that can run on quantum computers. QSS breaks the fundamental limitation of the convergence rate of Monte Carlo integration and achieves the faster convergence rate of approximately which is the best possible bound of any quantum algorithms we know today [NW99]. We introduce yet another quantum numerical integration algorithm, quantum coin (QCoin) [AW99], and provide numerical experiments that are unprecedented in the fields of both quantum computing and rendering. We show that QCoin's convergence rate is equivalent to QSS's. We additionally show that QCoin is fundamentally more robust under the presence of noise in actual quantum computers due to its simpler quantum circuit and the use of fewer qubits. Considering various aspects of quantum computers, we discuss how QCoin can be a more practical alternative to QSS if we were to run light transport simulation in quantum computers in the future.

arXiv:1910.00263•Computer Graphics Forum•May 21, 2020•9 citations
Rendering is a computer graphics process that generates images from a three-dimensional scene including models, lights and cameras. Ray tracing is a category of rendering algorithms that calculates pixel colors by simulating the physical movements of light rays such as reflections, refractions and scatterings. The core problem of ray tracing is a high-dimensional numerical integration, and the classical Monte Carlo ray tracing requires a big number of rays to reduce error. By leveraging the inherent parallelism of quantum computing, we propose a framework of quantum ray tracing algorithm, and do simulation experiments to prove that it has a quadratically faster error convergence than classical Monte Carlo ray tracing.
The use of quantum computers in computer graphics has gained interest in recent years, especially for the application to rendering. The current state of the art in quantum rendering relies on Grover’s search for finding ray intersections in for M primitives. This quantum approach is faster than the naive approach of O(M) but slower than O(log M) of modern ray tracing with an acceleration data structure. Furthermore, this quantum ray tracing method is fundamentally limited to casting one ray at a time, leaving quantum rendering scales for the number of rays the same as non-quantum algorithms. We present a new quantum rendering method, quantum ray marching, based on the reformulation of ray marching as a quantum random walk. Our work is the first complete quantum rendering pipeline capable of light transport simulation and remains asymptotically faster than non-quantum counterparts. Our quantum ray marching can trace an exponential number of paths with polynomial cost, and it leverages quantum numerical integration to converge in O(1/N) for N estimates as opposed to non-quantum . These properties led to first quantum rendering that is asymptotically faster than non-quantum Monte Carlo rendering. We numerically tested our algorithm by rendering 2D and 3D scenes.
In recent years, computer graphics has emerged as a critical component of the scientific and engineering process, and it is recognized as an important computer science research area. Computer graphics are extensively used for a variety of aerospace and defense training systems and by Hollywood's special effects companies. All these applications require the computer graphics systems to produce high quality renderings of extremely large data sets in short periods of time. Much research has been done in "classical computing" toward the development of efficient methods and techniques to reduce the rendering time required for large datasets. Quantum Computing's unique algorithmic features offer the possibility of speeding up some of the known rendering algorithms currently used in computer graphics. In this paper we discuss possible implementations of quantum rendering algorithms. In particular, we concentrate on the implementation of Grover's quantum search algorithm for Z-buffering, ray-tracing, radiosity, and scene management techniques. We also compare the theoretical performance between the classical and quantum versions of the algorithms.
Quantum computing has the potential to provide solutions to many problems which are challenging or out of reach of classical computers. There are several problems in rendering which are amenable to being solved in quantum computers, but these have yet to be demonstrated in practice. This work takes a first step in applying quantum computing to one of the most fundamental operations in rendering: ray casting. This technique computes visibility between two points in a 3D model of the world which is described by a collection of geometric primitives. The algorithm returns, for a given ray, which primitive it intersects closest to its origin. Without a spatial acceleration structure, the classical complexity for this operation isO(N)O(N)O(N). In this paper, we propose an implementation of Grover's Algorithm (a quantum search algorithm) for ray casting. This provides a quadratic speed up allowing for visibility evaluation for unstructured primitives inO(N)O(\sqrt{N})O(N​). However, due to technological limitations associated with current quantum computers, in this work the geometrical setup is limited to rectangles and parallel rays (orthographic projection).
Traditional light rendering techniques treat the optical properties of materials as static, yet this assumption breaks down in cases where these properties dynamically evolve in response to incident illumination. We present a novel shading framework that combines classical ray-tracing with a quantum collision model to explore the effect of coherent light-matter interactions in rendering. By treating incident light and material excitations as quantized modes, we model sub-surface scattering as a sequence of symmetry-constrained unitary collisions. This formulation allows for the incorporation of non-integrable dynamics and chaotic optical responses due to multi-layer interference effects. We demonstrate how these collision operators can be pre-computed using near-term quantum computers to generate standard BSDFs, enabling the rendering of new physics-inspired materials with distinct optical signatures.
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 . Recently, Johnston [Joh16] introduced quantum super‐sampling (QSS) into rendering as a numerical integration method that can run on quantum computers. QSS breaks the fundamental limitation of the convergence rate of Monte Carlo integration and achieves the faster convergence rate of approximately which is the best possible bound of any quantum algorithms we know today [NW99]. We introduce yet another quantum numerical integration algorithm, quantum coin (QCoin) [AW99], and provide numerical experiments that are unprecedented in the fields of both quantum computing and rendering. We show that QCoin's convergence rate is equivalent to QSS's. We additionally show that QCoin is fundamentally more robust under the presence of noise in actual quantum computers due to its simpler quantum circuit and the use of fewer qubits. Considering various aspects of quantum computers, we discuss how QCoin can be a more practical alternative to QSS if we were to run light transport simulation in quantum computers in the future.