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

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Quantum rendering

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

Published Aug 5, 2003• 4 citations
Publisher

Abstract

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.

DOI
10.1117/12.486410

Related papers

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•1 citation

Quantum-Inspired Geometry for Computer Graphics

Jincheng Zhang

Quantum-inspired geometry, a novel approach to computer graphics, leverages the principles of quantum mechanics, specifically superposition and entanglement, to enhance the realism and efficiency of rendering algorithms. This paper explores the application of these concepts to the rendering process, proposing a framework that addresses limitations inherent in traditional methods. We demonstrate the potential of this methodology through the development of a new rendering technique that incorporates quantum-inspired transformations and optimizes the representation of complex scenes, leading to visually stunning results and improved computational performance. The research focuses on creating more nuanced and detailed representations of objects, reducing the need for excessive geometric detail and increasing rendering speed.

•Sep 4, 2026•0 citations

Towards Quantum Ray Tracing

Luís Paulo Santos, Thomas Bashford‐Rogers, João Barbosa +1 more

Rendering on conventional computers is capable of generating realistic imagery, but the computational complexity of these light transport algorithms is a limiting factor of image synthesis. Quantum computers have the potential to significantly improve rendering performance through reducing the underlying complexity of the algorithms behind light transport. This article investigates hybrid quantum-classical algorithms for ray tracing, a core component of most rendering techniques. Through a practical implementation of quantum ray tracing in a 3D environment, we show quantum approaches provide a quadratic improvement in query complexity compared to the equivalent classical approach. Based on domain specific knowledge, we then propose algorithms to significantly reduce the computation required for quantum ray tracing through exploiting image space coherence and a principled termination criteria for quantum searching. We show results obtained using a simulator for both Whitted style ray tracing, and for accelerating ray tracing operations when performing classical Monte Carlo integration for area lights and indirect illumination.

arXiv:2204.12797•IEEE Transactions on Visualization and Computer Graphics•Apr 8, 2024•8 citations

Quantum Ray Tracing with Simulation

Xi Lu, Hongwei Lin

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.

SPIN•Nov 14, 2022•2 citations

Quantum algorithms for scientific computing

Rhonda Au-Yeung, Bruno Camino, Omer Rathore +1 more

Quantum computing promises to provide the next step up in computational power for diverse application areas. In this review, we examine the science behind the quantum hype, and the breakthroughs required to achieve true quantum advantage in real world applications. Areas that are likely to have the greatest impact on high performance computing (HPC) include simulation of quantum systems, optimization, and machine learning. We draw our examples from electronic structure calculations and computational fluid dynamics which account for a large fraction of current scientific and engineering use of HPC. Potential challenges include encoding and decoding classical data for quantum devices, and mismatched clock speeds between classical and quantum processors. Even a modest quantum enhancement to current classical techniques would have far-reaching impacts in areas such as weather forecasting, aerospace engineering, and the design of 'green' materials for sustainable development. This requires significant effort from the computational science, engineering and quantum computing communities working together.

arXiv:2312.14904•Reports on Progress in Physics•Oct 11, 2024•20 citations

Quantum Computing Algorithms and Their Emerging Applications in Complex Scientific Problems

Hira Fatima, Waqar Ahmad

Quantum computing (QC) presents transformative potential for solving complex scientific problems that remain intractable for classical computers. Leveraging quantum superposition, entanglement, and interference, quantum algorithms such as Shor’s factoring algorithm, Grover’s search algorithm, variational quantum eigensolvers (VQE), and quantum approximate optimization algorithms (QAOA) enable exponential or polynomial speedups for selected problem classes. This paper explores recent advancements in quantum computing algorithms, their practical implementations, and emerging applications in fields such as molecular simulations, material science, cryptography, optimization, and machine learning. We highlight the strengths and limitations of current approaches, present performance analyses through graphical comparisons, and discuss prospective directions for integrating quantum algorithms into real-world scientific workflows. Our findings demonstrate that quantum computing is gradually transitioning from theoretical frameworks to experimental platforms capable of addressing highly complex computational challenges.

International Research Journal of Advanced Science•Jun 30, 2025•0 citations
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.
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.
Quantum-inspired geometry, a novel approach to computer graphics, leverages the principles of quantum mechanics, specifically superposition and entanglement, to enhance the realism and efficiency of rendering algorithms. This paper explores the application of these concepts to the rendering process, proposing a framework that addresses limitations inherent in traditional methods. We demonstrate the potential of this methodology through the development of a new rendering technique that incorporates quantum-inspired transformations and optimizes the representation of complex scenes, leading to visually stunning results and improved computational performance. The research focuses on creating more nuanced and detailed representations of objects, reducing the need for excessive geometric detail and increasing rendering speed.
Rendering on conventional computers is capable of generating realistic imagery, but the computational complexity of these light transport algorithms is a limiting factor of image synthesis. Quantum computers have the potential to significantly improve rendering performance through reducing the underlying complexity of the algorithms behind light transport. This article investigates hybrid quantum-classical algorithms for ray tracing, a core component of most rendering techniques. Through a practical implementation of quantum ray tracing in a 3D environment, we show quantum approaches provide a quadratic improvement in query complexity compared to the equivalent classical approach. Based on domain specific knowledge, we then propose algorithms to significantly reduce the computation required for quantum ray tracing through exploiting image space coherence and a principled termination criteria for quantum searching. We show results obtained using a simulator for both Whitted style ray tracing, and for accelerating ray tracing operations when performing classical Monte Carlo integration for area lights and indirect illumination.
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.
Quantum computing promises to provide the next step up in computational power for diverse application areas. In this review, we examine the science behind the quantum hype, and the breakthroughs required to achieve true quantum advantage in real world applications. Areas that are likely to have the greatest impact on high performance computing (HPC) include simulation of quantum systems, optimization, and machine learning. We draw our examples from electronic structure calculations and computational fluid dynamics which account for a large fraction of current scientific and engineering use of HPC. Potential challenges include encoding and decoding classical data for quantum devices, and mismatched clock speeds between classical and quantum processors. Even a modest quantum enhancement to current classical techniques would have far-reaching impacts in areas such as weather forecasting, aerospace engineering, and the design of 'green' materials for sustainable development. This requires significant effort from the computational science, engineering and quantum computing communities working together.
Quantum computing (QC) presents transformative potential for solving complex scientific problems that remain intractable for classical computers. Leveraging quantum superposition, entanglement, and interference, quantum algorithms such as Shor’s factoring algorithm, Grover’s search algorithm, variational quantum eigensolvers (VQE), and quantum approximate optimization algorithms (QAOA) enable exponential or polynomial speedups for selected problem classes. This paper explores recent advancements in quantum computing algorithms, their practical implementations, and emerging applications in fields such as molecular simulations, material science, cryptography, optimization, and machine learning. We highlight the strengths and limitations of current approaches, present performance analyses through graphical comparisons, and discuss prospective directions for integrating quantum algorithms into real-world scientific workflows. Our findings demonstrate that quantum computing is gradually transitioning from theoretical frameworks to experimental platforms capable of addressing highly complex computational challenges.