Towards Quantum Ray Tracing

被引:0
作者
Santo, Luis Paulo [1 ,2 ]
Bashford-Rogers, Thomas [3 ]
Barbosa, Joao [2 ]
Navratil, Paul [4 ]
机构
[1] Univ Minho, P-4710057 Braga, Portugal
[2] INESC TEC, P-4710057 Braga, Portugal
[3] Univ Warwick, Coventry CV4 7AL, England
[4] Univ Texas Austin, Texas Adv Comp Ctr, Austin, TX 78712 USA
关键词
Quantum computing; Complexity theory; Ray tracing; Rendering (computer graphics); Computers; Three-dimensional displays; Quantum algorithm; Quadratic query complexity quantum advantage; quantum computing; ray tracing;
D O I
10.1109/TVCG.2024.3386103
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:2223 / 2234
页数:12
相关论文
共 29 条
[1]  
Ahuja A, 1999, Arxiv, DOI arXiv:quant-ph/9911082
[2]  
Alves C, 2019, PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON GRAPHICS AND INTERACTION (ICGI 2019), P56, DOI [10.1109/ICGI47575.2019.8955061, 10.1109/icgi47575.2019.8955061]
[3]   THE COMPUTER AS A PHYSICAL SYSTEM - A MICROSCOPIC QUANTUM-MECHANICAL HAMILTONIAN MODEL OF COMPUTERS AS REPRESENTED BY TURING-MACHINES [J].
BENIOFF, P .
JOURNAL OF STATISTICAL PHYSICS, 1980, 22 (05) :563-591
[4]  
Brassard G., 2002, Contemp. Math., V305, P53
[5]  
Caraiman Simona., 2012, Buletinul Institutului Politehnic din Iasi, Sectia Automatica si Calculatoare, V62, P21
[6]   Validating quantum computers using randomized model circuits [J].
Cross, Andrew W. ;
Bishop, Lev S. ;
Sheldon, Sarah ;
Nation, Paul D. ;
Gambetta, Jay M. .
PHYSICAL REVIEW A, 2019, 100 (03)
[7]   QUANTUM-THEORY, THE CHURCH-TURING PRINCIPLE AND THE UNIVERSAL QUANTUM COMPUTER [J].
DEUTSCH, D .
PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 1985, 400 (1818) :97-117
[8]  
Durr C, 1999, Arxiv, DOI arXiv:quant-ph/9607014
[9]   SIMULATING PHYSICS WITH COMPUTERS [J].
FEYNMAN, RP .
INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 1982, 21 (6-7) :467-488
[10]   Quantum random access memory [J].
Giovannetti, Vittorio ;
Lloyd, Seth ;
Maccone, Lorenzo .
PHYSICAL REVIEW LETTERS, 2008, 100 (16)