Systems and methods for solving computational problems
View Patent ↗Solving computational problems may include generating a logic circuit representation of the computational problem, encoding the logic circuit representation as a discrete optimization problem, and solving the discrete optimization problem using a quantum processor. Output(s) of the logic circuit representation may be clamped such that the solving involves effectively executing the logic circuit representation in reverse to determine input(s) that corresponds to the clamped output(s). The representation may be of a multiplication circuit. The discrete optimization problem may be composed of a set of miniature optimization problems, where each miniature optimization problem encodes a respective logic gate from the logic circuit representation. A multiplication circuit may employ binary representations of factors, and these binary representations may be decomposed to reduce the total number of variables required to represent the multiplication circuit.
1. A method of operating a digital computer system and a quantum processor to factor an N-bit integer p as a product of a pair of integers a and b, the method comprising:
representing a, b, and p in binary using the digital computer system;
decomposing the binary representations of a and b into two respective components (a h , a l ) and (b h , b l ) via the digital computer system;
constructing at least three component logic circuits which perform the multiplications of a h b h , a l b l , and (a h +a l )(b h +b l ), respectively, via the digital computer system, wherein each of the at least three component logic circuits includes at least one respective logic gate;
encoding each respective one of the at least three component logic circuits which perform the multiplications of a h b h , a l b l , and (a h +a l )(b h +b l ), respectively, as a respective discrete optimization problem using the digital computer system, wherein each respective discrete optimization problem includes a respective set of miniature optimization problems, each miniature optimization problem encoding a respective one of the logic gates from the at least three component logic circuits, and wherein each respective miniature optimization problem is characterized by a respective objective function that is minimized when a truth table of the corresponding logic gate is obeyed; and
solving each respective discrete optimization problem using the quantum processor, wherein solving each respective discrete optimization problem gives the components (a h , a l ) and (b h , b l ) of the binary representations of a and b.
2. The method of claim 1 wherein solving each respective discrete optimization problem using a quantum processor includes performing at least one of adiabatic quantum computation and quantum annealing.
3. The method of claim 1 , further comprising mapping each respective discrete optimization problem to the quantum processor.
4. The method of claim 3 wherein the quantum processor comprises qubits and couplers, and wherein mapping each respective discrete optimization problem to the quantum processor includes, for each respective discrete optimization problem, programming the qubits and the couplers of the quantum processor in a configuration representing a problem Hamiltonian that corresponds to the discrete optimization problem.
5. A system to factor an N-bit integer p as a product of a pair of integers a and b, the system comprising:
at least one quantum processor;
a digital computer system including at least one non-transitory digital processor-readable medium which stores instructions that cause the at least one quantum processor to factor an N-bit integer p by:
representing a, b, and p in binary using the digital computer system;
decomposing the binary representations of a and b into two respective components (a h , a l ) and (b h , b l ) via the digital computer system;
constructing at least three component logic circuits which perform the multiplications of a h b h , a l b l , and (a h +a l )(b h +b l ), respectively, via the digital computer system, wherein each of the at least three component logic circuits includes at least one respective logic gate;
encoding each respective one of the at least three component logic circuits which perform the multiplications of a h b h , a l b l , and (a h +a l )(b h +b l ), respectively, as a respective discrete optimization problem using the digital computer system, wherein each respective discrete optimization problem includes a respective set of miniature optimization problems, each miniature optimization problem encoding a respective one of the logic gates from the at least three component logic circuits, and wherein each respective miniature optimization problem is characterized by a respective objective function that is minimized when a truth table of the corresponding logic gate is obeyed; and
solving each respective discrete optimization problem using the quantum processor, wherein solving each respective discrete optimization problem gives the components (a h , a l ) and (b h , b i ) of the binary representations of a and b.
6. The system of claim 5 wherein the at least one quantum processor includes at least one quantum processor configured to perform adiabatic quantum computation or quantum annealing.
7. The system of claim 5 wherein the at least one quantum processor includes at least one superconducting quantum processor.
8. The system of claim 5 wherein the non-transitory processor-readable medium stores a discrete optimization module, and the instructions that cause the at least one quantum processor to factor an N-bit integer p are stored in the discrete optimization module.