Advertisement

Science Friday
Quantum computers could tackle enormous linear equations
Trillions of variables may prove no match for envisioned systems
font_down font_up Text Size

A new algorithm may give quantum computers a new, practical job: quickly solving monster linear equations. Such problems are at the heart of complex processes such as image and video processing, genetic analyses and even Internet traffic control. The new work, published October 7 in Physical Review Letters, may dramatically expand the range of potential uses for quantum computers.

The new quantum algorithm is “head-smackingly good,” says computer scientist Daniel Spielman of Yale University. “It is both very powerful, and very natural. I read the abstract and said, ‘Why didn’t I think of that?’”

In the new study, Aram Harrow of the University of Bristol in England along with Avinatan Hassidim and Seth Lloyd, both of MIT, propose that large datasets of linear equations could be encoded in quantum forms, such as the spins of nuclei, individual atoms or photons. Such a system would allow quantum computers to handily solve problems made up of billions or even trillions of variables (such as the x’s, y’s and z’s that plague algebra students).

“Solving these gigantic equations is a really huge problem,” Lloyd says. “Even though there are good algorithms for doing it, it still takes a very long time.”

A trillion-variable problem would take a classical computer at least a hundred trillion steps to solve, Lloyd says. But with the newly proposed algorithm, a quantum computer could solve the problem in just a few hundred steps, the researchers calculate.

Strange quantum mechanical principles that operate on very small scales give quantum computers their immense number-crunching power. One of the strangest physical properties, called superposition, allows a single quantum bit of information to represent both a 0 and 1 at the same time, while a classical bit can only represent either a 0 or a 1. Performing a mathematical operation on a single quantum bit, or qubit, is like doing many operations simultaneously, says Lloyd. “You don’t have to read all the data individually — you can read aspects of them all at once,” he says.

Lloyd and his colleagues plan to test the algorithm in the lab by having a quantum computer solve a set of linear equations with four variables. After that, Lloyd says he plans to look around for “more fun problems to solve.”

Spielman says that this newly proposed algorithm is exciting because it hints that quantum computers may have many more hidden talents. “It’s given me a lot of hope for quantum computing,” he says.
Found in: Computers, Physics and Technology
Comments 6
  • I remember talking with a certain mathematician about a sticky point with quantum computing that I didn't understand. He looked up and laughed, saying, "Yes. But if you put quantum computing on your grant it gets funded. Mathematics doesn't get enough funding these days, and we both know it should." I had to agree with him about the funding.
    John Toradze John Toradze
    Oct. 17, 2009 at 12:00pm
  • Will this work even if the equations are badly conditioned? Or are not independent?
    Ralph Dratman Ralph Dratman
    Oct. 17, 2009 at 2:31pm
  • As Q machines become common, computer and internet security may well need to adapt. If a system of a trillion variables becomes solvable, couldn't the same computing power be used to brute-force through encryption key guessing? And would longer keys even be a reasonable counter-approach?
    Edward Smith Edward Smith
    Oct. 18, 2009 at 12:19pm
  • Large scale quantum computers, although more efficient, are computationally equivalent to a turing machine. Taking RSA as an example, the best known algorithms (like the Special Number Field Sieve) for discovering prime factors of large (1000+ bits) numbers are exponential. From what I know, there should be a finite RSA key that is intractable to crack by brute-force factoring with ANY computer.
    Connor Doyle Connor Doyle
    Oct. 21, 2009 at 5:25pm
  • I'm less worried about encryption because I'm too excited by the POWER that Q will bring Protein Folding, Fluid Dynamics, Plasma Dynamics, etc., etc., etc..
    BTW; What, duz ya figger, DARPA - with their 'twenty-five year ahead of what we're reading here' madate - is Hiding?
    'Hal'? Self-Assembling Implantable Wet-Ware?
    James Staples James Staples
    Oct. 24, 2009 at 6:15pm

  • [Link was removed]
    [Link was removed]
    [Link was removed]
    [Link was removed]
    [Link was removed]
    [Link was removed]
    [Link was removed]
    [Link was removed]
    [Link was removed]
    [Link was removed]
    [Link was removed]
    m9bnat m9bnat2 m9bnat m9bnat2
    Jan. 9, 2010 at 5:10pm
Post a comment (Please note: All links will be removed from comments.)

Please login or register to participate.


Advertisement
Suggested Reading:
seperator
  • Sanders, Laura. 2009. Minifridge makes quantum computers last: Study repeatedly manipulates information held in ions. Science News Online (Aug. 6). Available at [Go to]_
Citations & References:
seperator
  • Harrow, Aram W., Avinatan Hassidim, and Seth Lloyd. 2009. Quantum Algorithm for Linear Systems of Equations. Physical Review Letters, published 7 October 2009.
Reader Favorites:
seperator
SN on the Web:
seperator