Stories
Slash Boxes
Comments

SoylentNews is people

SoylentNews is powered by your submissions, so send in your scoop. Only 15 submissions in the queue.
posted by LaminatorX on Wednesday November 19 2014, @03:58PM   Printer-friendly
from the super-position dept.

phys.org is reporting that a team of South African Researchers have successfully run Simon's algorithm on a quantum computer.

Simon's algorithm, named after Daniel Simon, is a solution to Simon's Problem that is:

...designed specifically to run faster on a quantum computer than it would, on a standard computer. Its purpose is to figure out whether a black box returns a unique output for every possible input. The team ran the simplest version of the algorithm on a quantum computer that used just six qubits, and report that it took just two iterations to solve the problem, where it would take a normal computer three.

If verified it's the first unambiguous case where an algorithm designed specifically for a quantum computer has been able to demonstrate an exponential gap to the equivalent classical computer algorithm run time.

The paper detailing this experiment is available at arXiv.

 
This discussion has been archived. No new comments can be posted.
Display Options Threshold/Breakthrough Mark All as Read Mark All as Unread
The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
  • (Score: 2) by DeathMonkey on Wednesday November 19 2014, @07:26PM

    by DeathMonkey (1380) on Wednesday November 19 2014, @07:26PM (#117810) Journal

    A Quantum Co-Processor like the Math Co-Processors of yore might be interesting.
     
      All the benefits of a traditional processor but divert to the quantum processor to run that O(n^n) operation.

    Starting Score:    1  point
    Karma-Bonus Modifier   +1  

    Total Score:   2