{ "items" : [
    { "id" : "http://dbpedia.org/resource/Shor's_algorithm"
      "properties" : {
        "http://www.w3.org/2000/01/rdf-schema#comment" : [ "Shor's algorithm, named after mathematician Peter Shor, is a quantum algorithm (an algorithm that runs on a quantum computer) for integer factorization formulated in 1994. Informally it solves the following problem: given an integer N, find its prime factors.On a quantum computer, to factor an integer N, Shor's algorithm runs in polynomial time (the time taken is polynomial in log N, which is the size of the input)."] } } }
