Emerging Technology from the arXiv

A View from Emerging Technology from the arXiv

How to Build a Superluminal Computer

Physicists have come up with a way to process information faster than the speed of light. But what could they do with such a hypercomputer?

  • March 9, 2010

The speed of light represents one of the fundamental limits of the laws of physics. Nothing can travel faster than the speed of light, right?

Well, yes and no, say Volkmar Putz and Karl Svozil at the Vienna University of Technology in Austria. They say there are several ways that signals can cross the superluminal line, although none of them allow the kind of time travel paradoxes beloved of science fiction writers. For example, the quantum phenomenon of entanglement occurs when two quantum particles are described by the same wave function. These particles can be separated by the diameter of the universe and yet a measurement on one will instantaneously influence the other.

So-called “nonlocal” phenomenon cannot be used to transmit information faster than the speed of light but Putz and Svozil today ask whether it can be used to process it, to carry out computational tasks at superluminal speeds. They say there is no reason why not, provided the processing does not lead to any time travel paradoxes.

How might such a machine work? Putz and Svozil point out that nonlocal phenomenon can lead to materials in which the index of refraction is less than one, thereby allowing superluminal speeds. For example, light travelling through a vacuum can be made to spontaneously form into an electron-positron pair–an entangled pair–which then recombine to form a photon again. This process happens instantaneously, allowing the photon to effectively “jump” across space.

A material in which this kind of pair formation and recombination was promoted would have a refractive index less than one, they say. Various physicists have proposed such materials made of things like metamaterials. Putz and Svozil themselves suggest that a vacuum filled with either electrons or positrons would do the trick.

Having created a medium in which the refractive index is less than one, Putz and Svozil’s idea is simply to immerse a computer in it. That simple act (and presumably some clever design to create an optical computer in the first place) would allow superluminal computation to take place.

Assuming that this device could actually be built, what could you do with a superluminal computer? That’s a good question that Putz and Svozil do not address directly. They say such a device would fall into a class of processing machine known as hypercomputers. These are hypothetical devices more powerful than Turing machines, that allow non-Turing computations. They were first discussed by Alan Turing in the 1930s.

In theory, hypercomputers can compute certain kinds of otherwise noncomputable functions. That sounds handy but even though there are uncountably many non-computable functions, it’s actually quite hard to come up with an example of one that might seem useful. If you have any ideas, post them in the comments section.

Otherwise sit back and wait for a new era of superluminal hyprcomputers. But don’t hold your breath.

Ref: arxiv.org/abs/1003.1238: On the physical limit of communication speed by light signals

Tech Obsessive?
Become an Insider to get the story behind the story — and before anyone else.

Subscribe today

Uh oh–you've read all of your free articles for this month.

Insider Premium
$179.95/yr US PRICE

Want more award-winning journalism? Subscribe to Insider Basic.
  • Insider Basic {! insider.prices.basic !}*

    {! insider.display.menuOptionsLabel !}

    Six issues of our award winning magazine and daily delivery of The Download, our newsletter of what’s important in technology and innovation.

    See details+

    What's Included

    Bimonthly magazine delivery and unlimited 24/7 access to MIT Technology Review’s website

    The Download: our daily newsletter of what's important in technology and innovation

You've read all of your free articles this month. This is your last free article this month. You've read of free articles this month. or  for unlimited online access.