Abstract: Performing quantum file copying is disclosed herein. In one example, upon receiving a request to copy a source quantum file comprising a plurality of source qubits, a quantum file manager accesses a quantum file registry record identifying the plurality of source qubits and a location of each of the plurality of source qubits. The quantum file manager next allocates a plurality of target qubits equal in number to the plurality of source qubits, and copies data stored by each of the source qubits into a corresponding target qubit. The quantum file manager then generates a target quantum file registry record that identifies the plurality of target qubits and their locations. In some examples, a quantum file move operation may be performed by deleting the source quantum file after the copy operation, and updating the target quantum file registry record with the same quantum file identifier as the source quantum file.

Abstract: Quantum entanglement protection is disclosed. An entanglement checker receives, from a requestor, a request associated with a first qubit. In response to receiving the request, the entanglement checker accesses qubit entanglement information that identifies an entanglement status of the first qubit. The entanglement checker determines, based on the qubit entanglement information, the entanglement status of the first qubit, and sends a response to the requestor based on the entanglement status.

Abstract: Performing quantum file concatenation is disclosed herein. In one example, a quantum file manager receives a request to concatenate a first quantum file comprising a first plurality of qubits and a second quantum file comprising a second plurality of qubits. Responsive to receiving the request, the quantum file manager concatenates the first quantum file and the second quantum file into a concatenated quantum file comprising a third plurality of qubits, wherein the third plurality of qubits comprises a same number of qubits as a union of the first plurality of qubits and the second plurality of qubits, and stores an identical sequence of data values as the first plurality of qubits followed by the second plurality of qubits.

Abstract: It is determined that a first quantum process is to be initiated and will utilize a first quantity of qubits. Quantum computing system (QCS) metadata is accessed that identifies a plurality of QCSs and, for each respective QCS in the plurality of QCSs, a plurality of qubits implemented by the respective QCS. Based on the QCS metadata, a set of QCSs from the plurality of QCSs is selected to form a first distributed QCS. A set of qubits implemented by the QCSs in the set of QCSs is selected. Distributed QCS information is sent to each QCS in the set of QCSs, the distributed QCS information identifying one QCS in the set of QCSs as a primary QCS.

Abstract: Application lifecycle management based on real-time resource usage. A first plurality of resource values that quantify real-time computing resources used by a first instance of an application is determined at a first point in time. Based on the first plurality of resource values, one or more utilization values are stored in a profile that corresponds to the application. Subsequent to storing the one or more utilization values in the profile, it is determined that a second instance of the application is to be initiated. The profile is accessed, and the second instance of the application is caused to be initiated on a first computing device utilizing the one or more utilization values identified in the profile.

Abstract: Managing runtime qubit allocation for executing quantum services is disclosed. In one example, a processor device of a quantum computing system implements a quantum backoff service (QBS) that enables safe runtime qubit allocation for executing quantum services. The QBS receives a request from a quantum service scheduler for allocation of one or more qubits for an executing quantum service. Upon receiving the request for allocation, the QBS determines whether the one or more qubits are unavailable for execution. If the QBS determines that the one or more qubits are unavailable for allocation, the QBS places the executing quantum service into a sleep state. The QBS in some examples may subsequently receive an indication that the one or more qubits have become available for allocation. The QBS then restores the executing quantum service into an executing state and allocates the one or more qubits for the executing quantum service.

Abstract: Simulating operating conditions for quantum computing devices is disclosed. In one example, a processor device of a staging computing device (i.e., a classical non-quantum computing device) receives an operating parameter from a quantum computing device, wherein the operating parameter represents an operating condition of the quantum computing device. The processor device also receives a quantum service definition that defines a quantum service. A quantum simulator of the processor device accesses the quantum service definition, simulates the operating condition of the quantum computing device based on the operating parameter, and then executes the quantum service under the simulated operating condition based on the quantum service definition.

Abstract: Monitoring activity of an application prior to deployment is disclosed. A plurality of messages destined for a first application are received. Each message of the plurality of messages is duplicated to create a corresponding plurality of duplicate messages. Each message of the plurality of messages is successively sent to the first application and each duplicate message to a second application. Based on behavior information that identifies behaviors of the first application and the second application, it is determined that a behavior of the second application differs from a behavior of the first application beyond an alert criterion. In response to determining that the behavior of the second application differs from the behavior of the first application beyond the alert criterion, a message is sent to a destination indicating that the behavior of the second application differs from the behavior of the first application, the message identifying the behavior that differs.

Abstract: Managing runtime qubit allocation for executing quantum services is disclosed. In one example, a processor device of a quantum computing system implements a quantum backoff service (QBS) that enables safe runtime qubit allocation for executing quantum services. The QBS receives a request from a quantum service scheduler for allocation of one or more qubits for an executing quantum service. Upon receiving the request for allocation, the QBS determines whether the one or more qubits are unavailable for execution. If the QBS determines that the one or more qubits are unavailable for allocation, the QBS places the executing quantum service into a sleep state. The QBS in some examples may subsequently receive an indication that the one or more qubits have become available for allocation. The QBS then restores the executing quantum service into an executing state and allocates the one or more qubits for the executing quantum service.

Abstract: Classical management of qubit requests is provided. In particular, a classical computing device receives a payload from another classical computing device via a classical computing connection, such as a Hypertext Transfer Protocol (HTTP) connection. The classical computing device queries a quantum computing device regarding availability of a qubit, whether targeted or agnostic, according to instructions provided in the payload. Such instructions may include inserting data into a qubit, manipulating a qubit, and/or reserving a qubit. If the qubit is available, the classical computing device sends the payload to the quantum computing device. If the qubit is unavailable, the classical computing device continues to query the quantum computing device until the qubit is available. Such a configuration provides granular control of qubits by a classical computing device and/or shifts management loads from the quantum computing device to the classical computing device.

Abstract: Hotswapping qubits for resource-limited quantum computing devices is disclosed. In one example, a processor device of a quantum computing device executes a first quantum service that comprises one or more qubits. The processor device receives a first request from a quantum service scheduler to allow a second quantum service to access the one or more qubits. In response to receiving the first request, the processor device suspends execution of the first quantum service. The processor device exports first metadata representing a first state of each qubit of the one or more qubits to a classical computing device. After exporting the first metadata, the processor device allocates the one or more qubits to the second quantum service, and executes the second quantum service.

Abstract: Qubit reservation is disclosed. A first request to reserve at least one qubit is received from a requestor. The first request includes an application identifier (ID) of a first quantum application. Qubit metadata that describes characteristics of a first plurality of qubits implemented by a first quantum computing system is accessed to identify a first qubit that is available to be reserved. The qubit metadata is modified to reserve the first qubit to thereby inhibit access to the first qubit by any quantum application other than the first quantum application.

Abstract: Generating quantum service definitions from executing quantum services is disclosed. In one example, a processor device of a quantum computing system executes a quantum service comprise one or more qubits. The processor device (e.g., by executing a quantum analysis service (QAS)) receives a request to profile the quantum service. Based on the request, the processor device obtains service metadata corresponding to the quantum service. A quantum service definition that defines one or more features of the quantum service is then generated based on the service metadata, and the quantum service definition is stored on a persistent data store. In this manner, quantum service definitions may be partially or wholly reverse-engineered for quantum services for which original quantum services definitions are unavailable or inaccessible.

Abstract: Performing comparative testing of quantum services is disclosed. In one example, a processor device of a quantum computing system (e.g., by executing a quantum testing service (QTS)) receives a first request for testing from a requestor, wherein the first request comprises an identifier of a quantum service. The quantum computing device retrieves a plurality of quantum service definitions corresponding to a plurality of different versions of the quantum service, based on the first request. A plurality of instances of the quantum service are then instantiated for parallel execution by the quantum computing device, wherein each instance is defined by a quantum service definition of the plurality of quantum service definitions. The quantum computing device next performs testing of each instance of the plurality of instances, based on the first request, and generates a testing result report based on the testing.

Abstract: Enabling restoration of qubits following quantum process termination is disclosed. In one example, a quantum restore service, executing on a processor device of a quantum computing device, detects an exit request corresponding to a quantum process associated with one or more qubits. The quantum restore service obtains metadata, including an identification of the quantum process (such as a quantum process identifier (ID), a quantum process name, and/or a Quantum Assembly Language (QASM) file descriptor) and an identification of each qubit. The quantum restore service then maintains the qubits in association with the identification of the quantum process based on the metadata after termination of the quantum process. In some examples, the quantum restore service may allocate a logical partition, associate the logical partition with the quantum process, and then associate the qubits with the logical partition. In this manner, the qubits may be preserved after the quantum process has terminated.

Abstract: Providing automated security algorithm identification in software distributions is disclosed herein. In one example, a processor device receives a source code fragment representing a difference between a given source code file of a first software distribution and a corresponding source code file of a second software distribution. The processor device determines whether the source code fragment matches any security profile of one or more security profiles that each corresponds to an approved security algorithm. If so, the processor device generates an approval notification to indicate that the source code fragment comprises the approved security algorithm. However, if the processor device determines that the source code fragment does not match any security profile of the one or more security profiles, the processor device generates a warning notification.

Abstract: A first quantum computing device detects an occurrence of a trigger condition. The first quantum computing device identifies a quantum operation corresponding to the trigger condition and performs the quantum operation on a first qubit maintained by the first quantum computing device, the first qubit being in an entangled state with a corresponding second qubit maintained by a second quantum computing device.

Abstract: A quantum failsafe service (QFS) is disclosed herein. In one example, a first quantum computing device executes a QFS that receives a system stress indicator from a system monitor that tracks a status of the first quantum computing device and/or a status of qubits maintained by the first quantum computing device. The QFS determines, based on the system stress indicator, that a quantum service backup is to be performed for a quantum service running on the first quantum computing device, and obtains a profile snapshot representing a current state of the quantum service. The QFS service then performs superdense encoding of the profile snapshot using a first set of qubits entangled with a second set of qubits of a second quantum computing device, and the first set of qubits are sent to the second quantum computing device (e.g., for storage in a classical data repository, according to some examples).

Abstract: Migration of quantum services from quantum computing devices to quantum simulators is disclosed herein. In one example, a quantum computing device executes a migration service that receives a system stress indicator from a system monitor that tracks a status of the quantum computing device and/or a status of qubits maintained by the quantum computing device. The migration service determines, based on the system stress indicator, that a quantum service running on the quantum computing device is to be migrated. Upon determining that the quantum service is to be migrated, the migration service retrieves a QASM file that contains quantum programming instructions defining the quantum service. The QASM file is then transmitted to a quantum simulator running on a classical computing device for failover execution. In some examples, the classical computing device then executes a simulated quantum service within the quantum simulator based on the QASM file.

Abstract: Enabling restoration of qubits following quantum process termination is disclosed. In one example, a quantum restore service, executing on a processor device of a quantum computing device, detects an exit request corresponding to a quantum process associated with one or more qubits. The quantum restore service obtains metadata, including an identification of the quantum process (such as a quantum process identifier (ID), a quantum process name, and/or a Quantum Assembly Language (QASM) file descriptor) and an identification of each qubit. The quantum restore service then maintains the qubits in association with the identification of the quantum process based on the metadata after termination of the quantum process. In some examples, the quantum restore service may allocate a logical partition, associate the logical partition with the quantum process, and then associate the qubits with the logical partition. In this manner, the qubits may be preserved after the quantum process has terminated.