Jump to content

  • Log In with Google      Sign In   
  • Create Account

Interested in a FREE copy of HTML5 game maker Construct 2?

We'll be giving away three Personal Edition licences in next Tuesday's GDNet Direct email newsletter!

Sign up from the right-hand sidebar on our homepage and read Tuesday's newsletter for details!


RayTracing using photonic quantum computers


Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.

  • You cannot reply to this topic
1 reply to this topic

#1 Alundra   Members   -  Reputation: 884

Like
0Likes
Like

Posted 22 June 2014 - 08:35 AM

Hi all,

I'm waiting real time ray tracing using photonic quantum computers.

I think that will be the bigger advance since long long time.

That will be the new world of graphic on computer.

The end of rasterization will be awesome.



Sponsor:

#2 Hodgman   Moderators   -  Reputation: 30883

Like
1Likes
Like

Posted 22 June 2014 - 08:53 AM

Having computers that are fast enough that we can ray-trace everything, would be nice, yes... Though for an initial batch of camera or light rays that are all uniformly distributed and not bouncing around, rasterization still might be more efficient wink.png 

 

You haven't given us much to discuss though, so googling turned up this paper that actually gives some big-O figures on the algorithmic improvements that are up for grabs when we have qubits available to us:

http://www12.tuiasi.ro/users/103/f4_2012_2_Caraiman.pdf

The TL;DR big-O parts:

The complexity of the quantum Z-Buffering algorithm is O(P*sqrt(d*N)) while the classical algorithm needs O(P*(d+N))) steps. Here P represents the total number of pixels, d is the average number of polygons intersecting one pixel and N is the number of polygons in the scene. The main advantages of the quantum variant of the algorithm are the fact that it has a much better scalability with respect to the number N of polygons than its classical counterpart and that it copes with arbitrarily shaped objects and it is not limited to simple polygons
...
The main advantage of this quantum [ray-tracing] solution over the classical case is the optimal time complexity for general object queries, with linear space complexity. In the classical case, polygons are used because computing the intersection is easier than in the case of generic objects
...
Thus, the first step of the quantum photon mapping algorithm has O(sqrt(N)) time complexity, unlike O(N) in the classical case






Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.



PARTNERS