Parcelled Quantum Resources

Abstract

In a general aspect, methods and systems are described for dynamically partitioning and virtualizing a monolithic quantum-classical hybrid computing resource into multiple different and independently-saleable, as a resource to a user, parcels. These parcels may comprise configurations of qubits and qubit-qubit links on one or more quantum processor units for use by users for running computer programs.

1 - 10 . (canceled) 
     
     
         11 . A method for calculating a price for use of a configuration of qubits and qubit-qubit links on one or more quantum processor units by a user for running a computer program, comprising:
 accessing a first database by a computer processor unit to collect design characteristics of the one or more quantum processor units, including inferred characteristics pertaining to the expressiveness of the one or more quantum processor units, wherein the inferred characteristics include instruction availability;   accessing a second database by the computer processor unit to collect measurements of physical characteristics of the one or more quantum processor units;   accessing a third database by the computer processor unit to collect characteristics of a specific user's request; and   determining the price by the computer processor unit using data collected from the first, second and third databases.   
     
     
         12 . The method of  claim 11 , further comprising accessing a fourth database by the computer processor unit to collect data characterizing a multiplicity of user requests, including user requests by different users, and wherein the determining the price uses data collected from the first, second, third and fourth databases. 
     
     
         13 . The method of  claim 11 , wherein the computer processor unit is configured to calculate a price based at least in part on the physical characteristics of the one or more quantum processor units. 
     
     
         14 . The method of  claim 11 , wherein the computer processor unit is configured to determine a price based at least in part on user demand for use of the one or more quantum processor units, and preferably, the price is determined through a pricing auction comprising one or more rounds. 
     
     
         15 . (canceled) 
     
     
         16 . The method of  claim 14 , wherein the computer processor unit is configured to determine a price based at least in part on a popularity of the specific configuration of qubits and qubit-qubit links being requested by the user. 
     
     
         17 . The method of  claim 14 , wherein a user requests to run the program within a specified time frame, and wherein the computer processor unit is configured to determine a price based at least in part on the specified time frame. 
     
     
         18 . The method of  claim 14 , wherein the first database includes information on qubit count and qubit connectivity. 
     
     
         19 . The method of  claim 11 , wherein the second database includes one or more physical measurements of: gate fidelity, native gate availability, qubit count, link count, link topology, readout fidelity, qubit coherence time and qubit relaxation time. 
     
     
         20 . The method of  claim 12 , wherein the fourth database includes one or more of data characterizing system-wide strain and historical usage patterns. 
     
     
         21 . The method of  claim 11 , wherein the third database includes one or more of an expected duration of use of one of the connected sets of qubits and a requested calendar time for running the program. 
     
     
         22 - 25 .(canceled) 
     
     
         26 . A computer system for calculating a price for use of a configuration of qubits and qubit-qubit links on one or more quantum processor units by a user for running a program, comprising:
 a first database for storing design characteristics of the one or more quantum processor units, including inferred characteristics pertaining to the expressiveness of the device, wherein the inferred characteristics include instruction availability;   a second database for storing measurements of physical characteristics of the one or more quantum processor units;   a third database for storing characteristics of a specific user's request; and   a computer processor unit for determining the price, wherein the computer processor unit is linked to the first, second and third databases for accessing input data for the determining.   
     
     
         27 . The computer system of  claim 26 , further comprising a fourth database for storing data characterizing a multiplicity of user requests, including user requests by different users, and wherein the computer processor unit is linked to the first, second, third and fourth databases for accessing input data for the determining. 
     
     
         28 . The computer system of  claim 26 , wherein the computer processor unit is configured to calculate a price based at least in part on the physical characteristics of the one or more quantum processor units. 
     
     
         29 . The computer system of  claim 26 , wherein the computer processor unit is configured to determine a price based at least in part on user demand for use of the one or more quantum processor units, and preferably, the price is determined through a pricing auction comprising one or more rounds. 
     
     
         30 . (canceled) 
     
     
         31 . The computer system of  claim 26 , wherein the computer processor unit is configured to determine a price based at least in part on the popularity of the specific configuration of qubits and qubit-qubit links being requested by the user. 
     
     
         32 . The computer system of  claim 26 , wherein a user requests to run the program within a specified time frame, and wherein the computer processor unit is configured to determine a price based at least in part on the specified time frame. 
     
     
         33 . The computer system of  claim 26 , wherein the first database includes information on qubit count and qubit connectivity. 
     
     
         34 . The computer system of  claim 26 , wherein the second database includes one or more physical measurements of: gate fidelity, native gate availability, qubit count, link count, link topology, readout fidelity, qubit coherence time and qubit relaxation time. 
     
     
         35 . The computer system of  claim 27 , wherein the fourth database includes one or more of data characterizing system-wide strain and historical usage patterns. 
     
     
         36 . The computer system of  claim 26 , wherein the third database includes one or more of an expected duration of use of one of the connected sets of qubits and a requested calendar time for running the program. 
     
     
         37 . The computer system of  claim 26 , wherein one or more of the first, second, and third databases are remote databases accessible via network communication. 
     
     
         38 . The computer system of  claim 26 , wherein one or more of the first, second, and third databases are accessible from remote agents via network communication. 
     
     
         39 . The computer system of  claim 26 , wherein one or more of the first, second, and third databases are local caches. 
     
     
         40 . The computer system of  claim 26 , wherein two or more of the first, second, and third databases are combined. 
     
     
         41 . The method of  claim 14 , wherein the pricing auction comprises:
 opening an auction and receiving price bids electronically submitted by users, each price bid having an order with a user desired qubit configuration, each order including a number of qubits, a configuration of qubit connectivities, a lower bound on qubit quality and one or more of a duration, a particular segment of time and a minimum duration;   rejecting a specific price bid of the price bids unless the specific price bid satisfies a criteria, the criteria including one or more of: a minimum number of qubits and qubit-qubit links on one or more quantum processor units, a start time of at least a fixed time in the future, and a maximum duration;   on satisfaction of one or more specific criteria, closing the auction to any new price bids;   activating an order filling process, the order filling process including calculating a plurality of solutions for filling non-conflicting orders, and selecting one of the plurality of solutions according to a metric; and   informing users of a status of their price bids.   
     
     
         42 - 71 .(canceled)