×

SOLVING RANDOM MODULAR SUBSET SUM PROBLEMS

  • US 20200133996A1
  • Filed: 10/31/2018
  • Published: 04/30/2020
  • Est. Priority Date: 10/31/2018
  • Status: Active Application
First Claim
Patent Images

1. A method, the method comprising:

  • obtaining a plurality of random integers, a divisor, and a remainder associated with a random modular subset sum problem;

    generating an Ising Model connection weight matrix “

    W”

    , at least some elements of the matrix “

    W”

    determined based on the plurality of random integers;

    generating an Ising Model bias vector “

    b”

    , elements of the vector “

    b”

    determined based on the remainder;

    providing the matrix “

    W” and

    the vector “

    b”

    to an annealing system configured to solve problems written according to the Ising Model;

    obtaining an output from the annealing system that represents a set of integers of the plurality of random integers where a sum of the set of integers divided by the divisor results in an integer quotient and the remainder; and

    using the set of integers as a solution to the random modular subset sum problem defined by the plurality of random integers, the divisor, and the remainder.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×