Quantum processor based systems and methods that minimize a continuous variable objective function
    3.
    发明授权
    Quantum processor based systems and methods that minimize a continuous variable objective function 有权
    基于量子处理器的系统和方法使连续变量目标函数最小化

    公开(公告)号:US09424526B2

    公开(公告)日:2016-08-23

    申请号:US14280204

    申请日:2014-05-16

    Inventor: Mani Ranjbar

    CPC classification number: G06N99/002 B82Y10/00 G06F17/11

    Abstract: Computational techniques for mapping a continuous variable objective function into a discrete variable objective function problem that facilitate determining a solution of the problem via a quantum processor are described. The modified objective function is solved by minimizing the cost of the mapping via an iterative search algorithm.

    Abstract translation: 描述了将连续变量目标函数映射到便于通过量子处理器确定问题的解的离散变量目标函数问题的计算技术。 通过迭代搜索算法最小化映射的成本来解决修改后的目标函数。

    SYSTEMS AND METHODS FOR DOMAIN ADAPTATION
    6.
    发明申请

    公开(公告)号:US20200257984A1

    公开(公告)日:2020-08-13

    申请号:US16779035

    申请日:2020-01-31

    Abstract: The domain adaptation problem is addressed by using the predictions of a trained model over both source and target domain to retain the model with the assistance of an auxiliary model and a modified objective function. Inaccuracy in the model's predictions in the target domain is treated as noise and is reduced by using a robust learning framework during retraining, enabling unsupervised training in the target domain. Applications include object detection models, where noise in retraining is reduced by explicitly representing label noise and geometry noise in the objective function and using the ancillary model to inject information about label noise.

    Quantum processor based systems and methods that minimize an objective function

    公开(公告)号:US10467543B2

    公开(公告)日:2019-11-05

    申请号:US14920235

    申请日:2015-10-22

    Abstract: Quantum processor based techniques minimize an objective function for example by operating the quantum processor as a sample generator providing low-energy samples from a probability distribution with high probability. The probability distribution is shaped to assign relative probabilities to samples based on their corresponding objective function values until the samples converge on a minimum for the objective function. Problems having a number of variables and/or a connectivity between variables that does not match that of the quantum processor may be solved. Interaction with the quantum processor may be via a digital computer. The digital computer stores a hierarchical stack of software modules to facilitate interacting with the quantum processor via various levels of programming environment, from a machine language level up to an end-use applications level.

    Systems and methods for finding quantum binary optimization problems

    公开(公告)号:US10275422B2

    公开(公告)日:2019-04-30

    申请号:US14671862

    申请日:2015-03-27

    Abstract: Methods and systems represent constraint as an Ising model penalty function and a penalty gap associated therewith, the penalty gap separating a set of feasible solutions to the constraint from a set of infeasible solutions to the constraint; and determines the Ising model penalty function subject to the bounds on the programmable parameters imposed by the hardware limitations of the second processor, where the penalty gap exceeds a predetermined threshold greater than zero. Such may be employed to find quantum binary optimization problems and associated gap values employing a variety of techniques.

Patent Agency Ranking