Methods and systems for quantum computing

• US 10,044,638 B2
• Filed: 12/04/2017
• Issued: 08/07/2018
• Est. Priority Date: 05/26/2016
• Status: Active Grant

• Current Assignee: 1QB Information Technologies Inc.
• Original Assignee: 1QB Information Technologies Inc.
• Inventors: Dadashikelayeh, Majid, Zaribafiyan, Arman, Karimi, Sahar, Ronagh, Pooya
• Primary Examiner(s): NANO, SARGON N
• Application Number:
  US15/830,953
• Publication Number:
  US 20180091440A1
• Time in Patent Office: 246 Days
• CPC Class Codes: G06F 16/245 Query processing
• CPC Class Codes: G06F 16/25 Integrating or interfacing systems involving database management systems
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 21/44 Program or device authentication
• CPC Class Codes: G06F 9/4806 Task transfer initiation or dispatching
• CPC Class Codes: G06F 9/5083 Techniques for rebalancing the load in a distributed system
• CPC Class Codes: G06F 9/54 Interprogram communication
• CPC Class Codes: G06N 10/00 Quantum computing, i.e. information processing based on quantum-mechanical phenomena
• CPC Class Codes: G06N 3/006 based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
• CPC Class Codes: G06N 5/01 Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
• CPC Class Codes: H04L 41/046 comprising network management agents or mobile agents therefor
• CPC Class Codes: H04L 45/741 Routing in networks with a plurality of addressing schemes, e.g. with both IPv4 and IPv6
• CPC Class Codes: H04L 47/82 Miscellaneous aspects
• CPC Class Codes: H04L 63/08 for authentication of entities cryptographic mechanisms or cryptographic arrangements for entity authentication H04L9/32
• CPC Class Codes: H04L 63/20 for managing network security; network security policies in general filtering policies H04L63/0227
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• CPC Class Codes: H04L 67/565 Conversion or adaptation of application format or content adding application control or application functional data H04L67/561

Abstract

The present disclosure provides methods, systems, and media for quantum computing, including allowing access to quantum ready and/or quantum enabled computers in a distributed computing environment (e.g., the cloud). Such methods and systems may provide optimization and computational services. Methods and systems of the present disclosure may enable quantum computing to be relatively and readily scaled across various types of quantum computers and users at various locations, in some cases without the need for users to have a deep understanding of the resources, implementation or the knowledge that may be required for solving optimization problems using a quantum computer. Systems provided herein may include user interfaces that enable users to perform data analysis in a distributed computing environment while taking advantage of quantum technology in the backend.

Claims

1. A method for using a digital computer to generate and direct a computational task to a quantum computing resource comprising at least one quantum computer over a network, wherein said digital computer comprises at least one computer processor and at least one computer memory, said method comprising:

(a) retrieving a programming problem from said computer memory of said digital computer;

(b) using said at least one computer processor of said digital computer to generate an equivalent of said programming problem;

(c) generating a request comprising said equivalent of said programming problem generated by said at least one computer processor of said digital computer; and

(d) directing said request from said digital computer to said quantum computing resource over said network, wherein said equivalent of said programming problem is usable by said at least one quantum computer of said quantum computing resource to solve said programming problem.

2. The method of claim 1, wherein said request is directed from said digital computer to said quantum computing resource through a cloud-based interface.

3. The method of claim 1, wherein said network is a local network.

4. The method of claim 1, wherein said at least one quantum computer performs one or more quantum algorithms to said programming problem.

5. The method of claim 1, wherein said request is generated using an application programming interface (API).

6. The method of claim 1, wherein (a) comprises obtaining (i) a polynomial on a bounded integer domain and (ii) integer encoding parameters, and wherein (b) comprises computing a bounded-coefficient encoding using said integer encoding parameters.

7. The method of claim 6, wherein (b) further comprises using said at least one computer processor to transform each integer variable of said polynomial to a linear function of binary variables using said bounded-coefficient encoding.

8. The method of claim 7, further comprising providing constraints on said binary variables to avoid degeneracy in said bounded-coefficient encoding, if required by a user.

9. The method of claim 7, further comprising substituting each integer variable of said polynomial with an equivalent binary representation, and using said at least one computer processor to compute coefficients of said equivalent binary representation of said polynomial on said bounded integer domain.

10. The method of claim 9, further comprising performing a degree reduction on said equivalent binary representation of said polynomial on said bounded integer domain to generate an equivalent polynomial.

11. The method of claim 10, wherein said equivalent polynomial is of a degree of at most two in binary variables.

12. The method of claim 11, further comprising setting local field biases and coupling strengths on said at least one quantum computer using said coefficients of said equivalent polynomial of said degree of at most two in binary variables to generate said equivalent of said programming problem.

13. The method of claim 12, wherein said equivalent of said programming problem comprises a Hamiltonian representative of said polynomial on said bounded integer domain.

14. The method of claim 13, wherein said Hamiltonian is usable by said at least one quantum computer to solve said programming problem.

15. A system comprising a digital computer for generating and directing a computational task to a quantum computing resource comprising at least one quantum computer over a network, wherein said digital computer comprises at least one computer processor and at least one computer memory, wherein said at least one computer processor is programmed to:

(a) retrieve a programming problem from said computer memory of said digital computer;

(b) use said at least one computer processor of said digital computer to generate an equivalent of said programming problem;

(c) generate a request comprising said equivalent of said programming problem generated by said at least one computer processor of said digital computer; and

(d) direct said request from said digital computer to said quantum computing resource over said network, wherein said equivalent of said programming problem is usable by said at least one quantum computer of said quantum computing resource to solve said programming problem.

16. The system of claim 15, wherein said at least one computer processor is programmed to direct said request from said digital computer to said quantum computing resource through a cloud-based interface.

17. The system of claim 15, wherein said network is a local network.

18. The system of claim 15, wherein said at least one computer processor is programmed to obtain (i) a polynomial on a bounded integer domain and (ii) integer encoding parameters, and compute a bounded-coefficient encoding using said integer encoding parameters.

19. The system of claim 18, wherein said at least one computer processor is programmed to (i) transform each integer variable of said polynomial to a linear function of binary variables using said bounded-coefficient encoding, and (ii) substitute each integer variable of said polynomial with an equivalent binary representation, and compute coefficients of an equivalent binary representation of said polynomial on said bounded integer domain.

20. The system of claim 19, wherein said at least one computer processor is programmed to perform a degree reduction on said equivalent binary representation of said polynomial on said bounded integer domain to generate an equivalent polynomial, wherein said equivalent polynomial is of a degree of at most two in binary variables.

21. The system of claim 20, wherein said at least one computer processor is programmed to set local field biases and coupling strengths on said at least one quantum computer using said coefficients of said equivalent polynomial of said degree of at most two in binary variables to generate said equivalent of said programming problem.

22. The system of claim 21, wherein said equivalent of said programming problem comprises a Hamiltonian representative of said polynomial on said bounded integer domain.

23. The system of claim 22, wherein said Hamiltonian is usable by said at least one quantum computer to solve said programming problem.