System and method for performing fast computations using quantum counting and pseudo-random sets
AssigneeGoldman, Sachs & Co.
InventorPaul Burchard
Life of this patent
Estimating the term…
Loading patent…
AssigneeGoldman, Sachs & Co.
InventorPaul Burchard
Estimating the term…
A method is provided for solving a computational problem that is reducible to a problem of counting solutions to an associated decision problem. The method includes, using a quantum computer, estimating a number of the solutions to the decision problem by determining if there is at least one solution to the decision problem that lies in a pseudo-random set. The method also includes outputting or using the estimated number of the solutions to the decision problem as a solution to the computational problem. Determining if there is at least one solution to the decision problem that lies in the pseudo-random set could include determining if there is a sequence of solutions to the decision problem that, taken together, lies in the pseudo-random set.
A method comprising:
A non-transitory computer-readable storage medium storing computer program instructions, the computer program instructions, when executed by one or more processors, causing the one or more processors to:
A system comprising:
Dependencies are inferred from the claim text.