Track your comments!
[x]


When you register, comments on your articles and replies to your comments appear here. Register Now!

Sign in to your account
[x]

Not a Scientific Blogging member yet?

Register Now for a Free Scientificblogging.com Account

  • Customize your profile with pictures, banner, a blogroll and more.
  • Leave comments on articles, add other members to your friend lists, chat with people on the site.
  • Write blog posts that can be seen by hundreds of thousands of readers.

It's free and it only takes a minute!

Already a Scientific Blogging member?

Sign In Now

Fake Banner
By Gerhard Adam | October 12th 2009 02:17 PM | 2 comments | Print | E-mail | Track Comments
It seems that some people have misinterpreted the recent publication of Levitin and Toffoli's paper as implying that somehow there are alternative technologies or approaches that can salvage Moore's Law.  This is incorrect.

"In the early 1980s, Levitin singled out a quantum elementary operation, the most basic task a quantum computer could carry out. In a paper published today in the journal Physical Review Letters, Levitin and Toffoli present an equation for the minimum sliver of time it takes for this elementary operation to occur. This establishes the speed limit for all possible computers (emphasis added)."
http://www.livescience.com/technology/091009-computer-speed.html

The point is that there are no silver bullets or ways in which this limit can be circumvented.  It is based on the most fundamental operation that can occur.  Unless a new quantum theory is developed, this limit represents a natural boundary that cannot be crossed by architecture or technology.


Comments

hi,
The speed of computer is depend on it's processor,Storage capacity and which os you can use in it.it can also depend on the work which work you can done...

Gerhard Adam's picture
Actually you're referring to the impediments to achieving the rated speed which is a factor in how quickly work can be processed.  In other words, storage capacity and operating systems are overhead costs if they are constrained in any way.  If there is no constraint, then those resources can't speed anything up beyond the clock speed of the processor time per instruction.

However, the point is that there is a finite time for a quantum event, which says that IF quantum computers are ever built, then there is a limit to the speed that can be attained regardless of architecture.

Add a comment

The content of this field is kept private and will not be shown publicly.
  • Allowed HTML tags: <sup> <sub> <a> <em> <strong> <center> <cite> <code> <TH><ul> <ol> <li> <dl> <dt> <dd> <img> <br> <p> <blockquote> <strike> <object> <param> <embed> <del> <pre> <b> <i> <table> <tbody> <div> <tr> <td> <h1> <h2> <h3> <h4> <h5> <h6> <hr> <iframe>
  • Lines and paragraphs break automatically.
  • Web page addresses and e-mail addresses turn into links automatically.
CAPTCHA
If you register, you will never be bothered to prove you are human again. And you get a real editor toolbar to use instead of this HTML thing that wards off spam bots.