Home Patent Forecast® Sectors Log In   Contact  
How it works Patent Forecast® Sectors Insights
Menu
Enjoy your FREE PREVIEW which shows only 2022 data and 25 documents. Contact Patent Forecast for full access.        

Quantum Computing

Search All Applications in Quantum Computing


Application US20190019103


Published 2019-01-17

Methods And Systems For Quantum Computing

Described herein are methods, systems, and media for generating a quantum-ready or quantum-enabled software development kit (SDK) for a quantum computing system. Such methods may comprise accepting user input from an application at an application interface, which application is executed on a digital computer, and implementing one or more algorithms, at an algorithms layer, that may be solved heuristically or exactly depending on the requirements of the user input. The one or more algorithms may abstract away a complexity of the application; transforming the one or more algorithms from the application space into the one or more instructions in polynomial unconstrained binary optimization (PUBO) form. The one or more instructions may be executed in PUBO form at the common interface of the solver layer.



Much More than Average Length Specification


View the Patent Matrix® Diagram to Explore the Claim Relationships

USPTO Full Text Publication >

3 Independent Claims

  • 1. A method for generating one or more instructions for execution by a solver layer comprising a common interface, wherein the one or more instructions are generated by a digital computer comprising at least one computer processor and memory, the digital computer coupled to a quantum-ready or quantum-enabled computing system comprising the solver layer, and wherein the solver layer executes the one or more instructions to generate an output, the method comprising: a. accepting user input from an application at an application interface, which application is executed on the digital computer; b. implementing one or more algorithms, at an algorithms layer, that are solved heuristically or exactly depending at least in part on requirements of the user input, wherein the one or more algorithms abstract away a complexity of the application; c. transforming the one or more algorithms from the application space into the one or more instructions in polynomial unconstrained binary optimization (PUBO) form; and d. executing the one or more instructions in PUBO form at the common interface of the solver layer, wherein the common interface comprises one or more polynomial unconstrained binary optimization (PUBO) solvers that provide an interface that is agnostic to quantum or classical computers.

  • 14. A system for generating one or more instructions for execution by a solver layer comprising a common interface, comprising: a. a quantum-ready or quantum-enabled computing system comprising the solver layer; b. a digital computer comprising at least one computer processor, the digital computer coupled to the quantum-ready or quantum-enabled computing system; c. a computer memory storing computer processor executable instructions which, when executed by the at least one computer processor, implement a method comprising: i. accepting user input from an application at an application interface, which application is executed on the digital computer; ii. implementing one or more algorithms, at an algorithms layer, that are solved heuristically or exactly depending at least in part on requirements of the user input, wherein the one or more algorithms abstract away a complexity of the application; iii. transforming the one or more algorithms from the application space into the one or more instructions in polynomial unconstrained binary optimization (PUBO) form; and iv. executing the one or more instructions in PUBO form at the common interface of the solver layer, wherein the common interface comprises one or more polynomial unconstrained binary optimization (PUBO) solvers that provide an interface that is agnostic to quantum or classical computers.

  • 27. A non-transitory computer-readable medium comprising machine-executable code that, upon execution by one or more computer processors, generates an application that is executable by a digital computer comprising at least one computer processor and memory to generate one or more instructions for execution by a solver layer of a quantum-ready or quantum-enabled computing system, the solver layer comprising a common interface, to generate an output, the application comprising: a. a software module programmed or otherwise configured to accept user input from an application at an application interface, which application is executed on the digital computer; b. a software module programmed or otherwise configured to implement one or more algorithms, at an algorithms layer, that are solved heuristically or exactly at least in part depending on the requirements of the user input, wherein the one or more algorithms abstract away a complexity of the application; c. a software module programmed or otherwise configured to transform the one or more algorithms from the application space into one or more instructions in polynomial unconstrained binary optimization (PUBO) form; and d. a software module programmed or otherwise configured to execute the one or more instructions in PUBO form at the common interface of the solver layer, wherein the common interface comprises one or more polynomial unconstrained binary optimization (PUBO) solvers that provide an interface that is agnostic to quantum or classical computers.