-
1.发明公开公开(公告)号：US20240311673A1
公开(公告)日：2024-09-19
申请号：US18274442
申请日：2022-01-27
发明人： Amir Jafari Salim , Caleb Jordan , Matthew Hutchings , Oleg Mukhanov , Pooya Ronagh , Krishanu Roy Sankar , Navid Ghadermarzy
摘要： This patent document is directed to implementations of embodiments of an error correction module or gadget using a cryogenic classical superconducting circuit that can be used as a decoder of quantum error correcting codes correcting errors in quantum computing.
-
公开(公告)号：US12051005B2
公开(公告)日：2024-07-30
申请号：US17110729
申请日：2020-12-03
IPC分类号： G06N3/10 , G06F9/30 , G06F9/455 , G06F30/27 , G06N3/04 , G06N3/044 , G06N3/045 , G06N3/08 , G06N10/00 , G06N10/20 , G06Q90/00
CPC分类号： G06N3/10 , G06F9/30 , G06F9/455 , G06F9/45504 , G06F30/27 , G06N3/04 , G06N3/044 , G06N3/045 , G06N3/08 , G06N10/00 , G06N10/20 , G06Q90/205
摘要： A computing system and a method are disclosed for enabling a processing device to remotely access a computing platform over a network, wherein the computing platform comprises at least one physics-inspired computer simulator comprising tunable parameters, the computing system comprising a communications interface configured to receive a request, wherein the request comprises at least one computational task to process using at least one physics-inspired computer simulator comprising tunable parameters; a control unit operatively connected to the communications interface and to the at least one physics-inspired computer simulator comprising tunable parameters, the control unit configured to translate the request into instructions for the at least one physics-inspired computer simulator deliver the instructions to the at least one physics-inspired computer simulator to perform the at least one computational task, receive at least one corresponding solution; and a memory operatively connected to the to the control unit and the at least one physics-inspired computer simulator, the memory being configured to store one or more of the at least one computational task, a dataset contained in the request, the tunable parameters of the at least one physics-inspired computer simulator, and the at least one corresponding solution.
-
3.发明授权公开(公告)号：US10929576B2
公开(公告)日：2021-02-23
申请号：US15831751
申请日：2017-12-05
发明人： Pooya Ronagh , Anna Levit , Ehsan Zahedinejad , Daniel Crawford
IPC分类号： G06F30/20 , G06N10/00 , G06F111/10 , G06F119/08 , G06F30/30 , G06F30/00 , G06N7/00
摘要： A method for estimating a thermodynamic property of a quantum Ising model with transverse field is disclosed. The method comprises obtaining an indication of a thermodynamic property to approximate for the quantum Ising model with transverse field; obtaining data representative of the quantum Ising model with transverse field; setting the quantum Ising model with transverse field using the obtained data representative of the quantum Ising model with transverse field on a quantum Ising model sampling device, the quantum Ising model sampling device being operatively coupled to a processing device and to a quantum Ising model sampling device control system; performing a plurality of measurements of the quantum Ising model with transverse field in a measurement axis using the quantum Ising model sampling device, each measurement providing a corresponding measured configuration; generating an effective classical Ising model corresponding to the quantum Ising model with transverse field; generating a plurality of effective configurations of the effective classical Ising model, each effective configuration comprising a set of more than one of the measured configurations; generating an approximation of the thermodynamic property of the effective classical Ising model using the generated plurality of effective configurations of the effective classical Ising model to approximate the thermodynamic property of the quantum Ising model with transverse field; and providing the approximation of the thermodynamic property.
-
公开(公告)号：US11017289B2
公开(公告)日：2021-05-25
申请号：US15590614
申请日：2017-05-09
发明人： Daniel Crawford , Pooya Ronagh , Anna Levit
摘要： A method and system for improving a stochastic control problem policy, the method including a sampling device obtaining data representing sample Boltzmann machine configurations, obtaining a stochastic control problem's initialization data and initial policy; assigning representative data of initial coupler weights and node biases and the Boltzmann machine's transverse field strength to the sampling device; until a stopping criterion is met, generating a present-epoch state-action pair, amending, sampling for the present-epoch state-action pair, approximating a present-epoch state-action Q-function value, obtaining a future-epoch state-action pair through a stochastic state process including a stochastic optimization test on all state-action pairs to provide the action at the future-epoch and update the future-epoch state's policy; amending the representative data, sampling for the future-epoch state-action pair, obtaining a future-epoch state-action Q-function value, updating each weight and bias and providing the policy when the stopping criterion is met.
-
公开(公告)号：US09836432B2
公开(公告)日：2017-12-05
申请号：US14509783
申请日：2014-10-08
发明人： Pooya Ronagh
CPC分类号： G06F17/11 , B82Y10/00 , G06N99/002
摘要： A method and system are disclosed for solving a convex integer quadratic programming problem using a binary optimizer, the method comprising use of a processor for receiving a convex integer quadratic programming problem; converting the convex integer quadratic programming problem into a plurality of constrained and unconstrained binary quadratic programming problems and providing the plurality of unconstrained binary quadratic programming problems to the binary optimizer to thereby solve the convex integer quadratic programming problem.
-
公开(公告)号：US11989256B2
公开(公告)日：2024-05-21
申请号：US18047882
申请日：2022-10-19
发明人： Pooya Ronagh , Ehsan Iranmanesh , Brad Woods
摘要： A method is disclosed for solving the Lagrangian dual of a constrained binary quadratic programming problem. The method comprises obtaining a constrained quadratic binary programming problem; until a convergence is detected, iteratively, performing a Lagrangian relaxation of the constrained quadratic binary programming problem to provide an unconstrained quadratic binary programming problem, providing the unconstrained quadratic binary programming problem to a quantum annealer, obtaining from the quantum annealer at least one corresponding solution, using the at least one corresponding solution to generate a new approximation for the Lagrangian dual bound; and providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem after convergence.
-
公开(公告)号：US10275423B2
公开(公告)日：2019-04-30
申请号：US14737868
申请日：2015-06-12
发明人： Pooya Ronagh
摘要： A method and system are disclosed for continuous optimization. The method comprises obtaining an optimization problem involving continuous or semi-continuous variables in a digital computer; initiating a stochastic search process in the digital computer in order to solve the optimization problem; until a stopping criterion is met constructing in the digital computer at least one stochastically generated polynomial in binary variables representative of choices of candidate future state of the stochastic search process, providing the at least one polynomial in binary variables to a binary sampling device, sampling from domains of the at least one polynomial in binary variables using the binary sampling device to generate binary sample points, receiving the generated binary sample points in the digital computer and transiting to next state of the stochastic search process and providing a best known solution found as a solution of the optimization problem using the digital computer.
-
公开(公告)号：US20170242824A1
公开(公告)日：2017-08-24
申请号：US15051271
申请日：2016-02-23
发明人： Sahar Karimi , Pooya Ronagh
IPC分类号： G06F17/11
CPC分类号： G06F17/11
摘要： A method for solving the Lagrangian dual of a binary polynomially constrained polynomial programming problem comprises obtaining a binary polynomially constrained polynomial programming problem; until a convergence is detected, iteratively, providing a set of Lagrange multipliers, providing an unconstrained binary quadratic programming problem representative of the Lagrangian relaxation of the binary polynomially constrained polynomial programming problem at these Lagrange multipliers, providing the unconstrained binary quadratic programming problem to a quantum annealer, obtaining from the quantum annealer at least one corresponding solution, using the at least one corresponding solution to generate a new set of Lagrange multipliers; and providing all corresponding best-known primal-dual pairs and best-known feasible solutions after convergence.
-
公开(公告)号：US11797641B2
公开(公告)日：2023-10-24
申请号：US18047981
申请日：2022-10-19
发明人： Pooya Ronagh , Sahar Karimi
摘要： A method is disclosed for solving the Lagrangian dual of a constrained binary quadratic programming problem. The method comprises obtaining a constrained quadratic binary programming problem; until a convergence is detected, iteratively, performing a Lagrangian relaxation of the constrained quadratic binary programming problem to provide an unconstrained quadratic binary programming problem, providing the unconstrained quadratic binary programming problem to a quantum annealer, obtaining from the quantum annealer at least one corresponding solution, using the at least one corresponding solution to generate a new approximation for the Lagrangian dual bound; and providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem after convergence.
-
公开(公告)号：US10229355B2
公开(公告)日：2019-03-12
申请号：US15097823
申请日：2016-04-13
发明人： Pooya Ronagh , Anna Levit , Daniel Crawford
摘要： A quantum processor comprises a first set of qubits comprising a first plurality of substantially parallel qubits; a second set of qubits comprising N successive groups of a plurality of qubits (1, 2, . . . , N), wherein N is greater than or equal to two; wherein each group of qubits comprises a plurality of substantially parallel qubits; wherein each qubit of the first plurality of substantially parallel qubits of the first set of qubits crosses substantially perpendicularly a portion of the plurality of substantially parallel qubits of a first group of the second set of qubits; wherein each qubit of any given group of the second set of qubits crosses substantially perpendicularly a portion of the plurality of substantially parallel qubits of a successive group of the second set of qubits and a plurality of couplers, each coupler for providing a communicative coupling at a crossing of two qubits.
-
-
-
-
-
-
-
-
-
搜索结果
15 条记录 (耗时 0.021 秒)
