Systems and methods for solving combinatorial problems
    7.
    发明授权
    Systems and methods for solving combinatorial problems 有权
    解决组合问题的系统和方法

    公开(公告)号:US09396440B2

    公开(公告)日:2016-07-19

    申请号:US13796949

    申请日:2013-03-12

    CPC classification number: G06N99/002 B82Y10/00 G06N5/003 G06N5/04

    Abstract: Systems and methods to solve combinatorial problems employ a permutation network which may be modeled after a sorting network where comparators are replaced by switches that controllably determine whether inputs are swapped or are left unchanged at the outputs. A quantum processor may be used to generate permutations by the permutation network by mapping the state of each switch in the network to the state of a respective qubit in the quantum processor. In this way, a quantum computation may explore all possible permutations simultaneously to identify a permutation that satisfies at least one solution criterion. The Travelling Salesman Problem is discussed as an example of a combinatorial problem that may be solved using these systems and methods.

    Abstract translation: 用于解决组合问题的系统和方法采用置换网络,其可以在分类网络之后建模,其中比较器被可控地确定输入是否被交换或在输出处保持不变的开关替代。 量子处理器可以用于通过将网络中每个交换机的状态映射到量子处理器中相应量子位的状态来通过置换网络来产生置换。 以这种方式,量子计算可以同时探索所有可能的排列以识别满足至少一个解决标准的置换。 讨论旅行销售员问题作为可以使用这些系统和方法解决的组合问题的示例。

    SYSTEMS AND METHODS FOR SOLVING COMBINATORIAL PROBLEMS
    8.
    发明申请
    SYSTEMS AND METHODS FOR SOLVING COMBINATORIAL PROBLEMS 有权
    用于解决组合问题的系统和方法

    公开(公告)号:US20130282636A1

    公开(公告)日:2013-10-24

    申请号:US13796949

    申请日:2013-03-12

    CPC classification number: G06N99/002 B82Y10/00 G06N5/003 G06N5/04

    Abstract: Systems and methods to solve combinatorial problems employ a permutation network which may be modeled after a sorting network where comparators are replaced by switches that controllably determine whether inputs are swapped or are left unchanged at the outputs. A quantum processor may be used to generate permutations by the permutation network by mapping the state of each switch in the network to the state of a respective qubit in the quantum processor. In this way, a quantum computation may explore all possible permutations simultaneously to identify a permutation that satisfies at least one solution criterion. The Travelling Salesman Problem is discussed as an example of a combinatorial problem that may be solved using these systems and methods.

    Abstract translation: 用于解决组合问题的系统和方法采用置换网络,其可以在分类网络之后建模,其中比较器被可控地确定输入是否被交换或在输出处保持不变的开关替代。 量子处理器可以用于通过将网络中每个交换机的状态映射到量子处理器中相应量子位的状态来通过置换网络来产生置换。 以这种方式,量子计算可以同时探索所有可能的排列以识别满足至少一个解决标准的置换。 讨论旅行销售员问题作为可以使用这些系统和方法解决的组合问题的示例。

Patent Agency Ranking