Abstract: One embodiment includes a method for quantum-mechanically archiving data. The method includes receiving, by a quantum computing device (QD), a request to store the data. The data may be associated with a file identifier (ID). A set of bits encodes the data in a classical encoding and the set of bits has a first cardinality. In response to receiving the request to store the data, generating, the QD may generate, based on a superdense coding protocol, a quantum-mechanical (QM) encoding of the data via a set of qubits that has a second cardinality that is less than the first cardinality. The QD may cause a generation of a data structure that encodes an association between the file ID and the set of qubits. The QD may further cause a storage of the data structure.

Abstract: A system and method including calculating a plurality of risk scores associated with a pool of quantum computers, and selectively distributing, based on the plurality of risk scores, each of the plurality of blocks to a single quantum computer of the pool of quantum computers to cause the single quantum computer to generate a block output by processing the block.

Abstract: Embodiments of the present disclosure provide techniques for seamlessly switching between a classical controller and a quantum controller that both implement an application, based on which controller is better suited for processing a received request for functionality of the application. The classical controller and the quantum controller both implement the same logic for the application, and the classical controller interfaces with a model and a view as part of a model, view and controller (MVC) framework. A Quantum Model View Controller (QMVC) service determines whether the request is to be processed by the classical or quantum controller. In response to determining that the request is to be processed by the quantum controller, the QMVC service diverts the request to the quantum controller and provide a first application program interface (API) gateway between the quantum controller and the model and a second API gateway between the quantum controller and the view.

Abstract: In one example described herein a system can receive, by a gate analysis service, a quantum assembly language (QASM) file. The QASM file can define a quantum algorithm that can include logic gates that can be executed on a quantum computer system. The system can access, by the gate analysis service, a data repository that can include an estimated amount of quantum decoherence associated with each logic gate of a plurality of logic gates that includes the logic gates. The system can determine, by the gate analysis service, a prediction of an amount of quantum decoherence associated with executing at least one logic gate of the logic gates on the quantum computer system. Additionally, the system can adjust, by the gate analysis service, the QASM file to modify the prediction associated with executing the logic gates on the quantum computer system.

Abstract: A first set of qubits is allocated to an error correcting process, the error correcting process is configured to utilize the first set of qubits to correct errors identified in a second set of qubits being used by a quantum process. Error correcting information is received from the error correcting process. A quantity of qubits in the first set of qubits is altered based on the error correcting information. Information that identifies an alteration of the quantity of qubits in the first set of qubits is communicated to the error correcting process.

Abstract: A method for updating content is disclosed that includes receiving, by a first quantum computing device (QD), a classical encoding of an update for content. The classical encoding is stored in a first set of bits with a first cardinality. The content is stored on a first classical computing device (CD) that is enabled to update the content via a patching protocol. In response to receiving the classical encoding, the first QD causes a transmission of the classical encoding. The transmission of the classical encoding includes transmitting a first set of qubits that have a second cardinality that is less than the first cardinality. Quantum states of the first set of qubits store a quantum-mechanical (QM) encoding of the update. The QM encoding of the update was generated based on a superdense coding protocol.

Abstract: Examples relating to qubit layers for containerized like execution are provided. In one example, a method may include obtaining a quantum service definition file. The method may include parsing the quantum service definition file to identify one or more instructions sets associated with qubit physical configuration. The method may include generating a qubit layer specification file based at least in part on the one or more instructions sets. The method may include storing the qubit layer specification file.

Abstract: Examples relating to transfer of quantum services among quantum computing devices in a quantum computing system are provided. In one example, a request to transfer a quantum service in a quantum computing system is received at a first quantum computing device. A second quantum computing device to which to transfer the quantum service is determined. The quantum service is paused at the first quantum computing device. A service replication for the quantum service is communicated from a first task manager service associated with the first quantum computing device to a second task manager service associated with the second quantum computing device.

Abstract: Qubit predictability services for a quantum computing system are disclosed. In one example, a processor device of a computing system receives qubit utilization data that encodes a utilization history for each qubit in a set of qubits of a QCS. The processor device further performs one or more hypothesis tests for each qubit of the set of qubits based on the utilization history for the qubit and a set of quantum algorithms. The processor device further generates one or more predictability scores for each qubit of the set of qubits based on the one or more hypothesis tests for the set of qubits. The processor device further provides an indication of the one or more predictability scores for each qubit of the set of qubits to the QCS.

Abstract: Examples relating to configuration of quantum computing devices using state maps are provided. In one example, data associated with one or more quantum service runs executed by a quantum computing device is obtained. A current state map for the quantum computing device is generated based at least in part on the data associated with the one or more quantum service runs. A simulated state map is generated based at least in part by performing a simulated execution of the one or more quantum service runs. A difference between the current state map and the simulated state map is determined. One or more configuration settings for the quantum computing device are determined based at least in part on the difference between the current state map and the simulated state map.

Abstract: A method for providing teleportation services includes receiving, by a computing device, a first signal. The first signal indicates a request for a teleportation event between a first quantum computing system (QCS) and a second QCS. A first set of qubits is associated with the first QCS. A second set of qubits is associated with the second QCS. In response to receiving the first signal, the computing device causes an allocation of a first qubit of the first set of qubits for the teleportation event. In response to receiving the signal, the computing device causes an allocation of a second qubit of the second set of qubits for the teleportation event. The computing device receives a second signal that indicates a successful completion of the teleportation event. In response to receiving the second signal, the computing system causes a deallocation of the first qubit of the first set of qubits.

Abstract: Embodiments of the present disclosure provide techniques for performing a quantum computing-based diamond dependency analysis. A classical diamond dependency service may analyze a service and determine a set of dependencies that the service requires to execute. The classical DDS may then generate a quantum assembly language (QASM) file comprising a diamond dependency algorithm (DDA) and a mapping of a configuration file of the service and a configuration file of each of the set of dependencies to a respective qubit among a plurality of qubits. The classical DDS may interface with one or more quantum DDSs (QDDSs) that are each part of a respective quantum environment in order to determine qubits that are available to be mapped to the configuration files of the service and its dependencies. The classical DDS may execute the QASM file using the one or more QDDSs to detect one or more diamond dependencies.

Abstract: Examples relating to quantum computing networks are provided. In one example, data indicative of a quantum computing device joining a quantum computing network is received. A plurality of quantum simulator nodes are generated for the quantum computing device. Each quantum simulator node simulates one of a plurality of different operating states of the quantum computing device. Each of the quantum simulator nodes is stored as an execution node of the quantum computing network for execution of a quantum service.

Abstract: A quantum computing system receives, from a requestor, a first access request that identifies a subject, an action, and a resource. A mapping structure that identifies a plurality of qubits that are in superposition and encoded with a plurality of rules that govern access to the resource is accessed. Based on the mapping structure it is determined that a set of qubits of the plurality of qubits applies to the access request. Data encoded in the set of qubits or a reference to each qubit in the set of qubits is provided to the requestor.

Abstract: A quantum file management system is disclosed. A quantum file manager receives, from a requestor, a request to access a quantum file that comprises a plurality of qubits. The quantum file manager determines, for each respective qubit of the plurality of qubits, a qubit identifier of the respective qubit. The quantum file manager sends, to the requestor in response to the request, information that includes the qubit identifier for each respective qubit of the plurality of qubits.

Abstract: A method for providing teleportation services includes receiving, by a computing device, a first signal. The first signal indicates a request for a teleportation event between a first quantum computing system (QCS) and a second QCS. A first set of qubits is associated with the first QCS. A second set of qubits is associated with the second QCS. In response to receiving the first signal, the computing device causes an allocation of a first qubit of the first set of qubits for the teleportation event. In response to receiving the signal, the computing device causes an allocation of a second qubit of the second set of qubits for the teleportation event. The computing device receives a second signal that indicates a successful completion of the teleportation event. In response to receiving the second signal, the computing system causes a deallocation of the first qubit of the first set of qubits.

Abstract: Qubit allocation for dynamic network topographies is disclosed. In one example, a processor device of a computing system implements a configuration to quantum definition (C2Q) service that performs real time qubit allocation for dynamic network topographies. The C2Q service can ensure synchronization between a configuration file for a network topography and a quantum definition file for qubits allocated to the network topography.

Abstract: A system and method of selectively distributing blocks of a quantum assembly language (QASM) file over resources of a quantum computing environment to optimize performance of the quantum computing environment. The method includes receiving a quantum assembly language (QASM) file comprising a plurality of blocks. The method includes calculating a plurality of complexity scores each indicative of a degree of complexity to process a respective block of the plurality of blocks. The method includes calculating a plurality of risk scores associated with a pool of quantum computers, each risk score is indicative of a likelihood of a respective quantum computer of the pool of quantum computers entering an undesired state responsive to processing a respective block of the plurality of blocks. The method includes selectively distributing, based on the plurality of risk scores, each of the plurality of blocks to a single quantum computer of the pool of quantum computers.

Abstract: Examples relating to simulating quantum services are provided. In one example, a quantum service definition file comprising a plurality of instructions is obtained. One or more instruction sets are determined from the plurality of instructions. Each instruction set is communicated to a plurality of quantum simulator nodes. Each quantum simulator node is associated with a different configuration profile for a quantum computing device. For each instruction set, a result set is obtained from each quantum simulator node. The result set includes data indicative of one or more performance metrics associated with an execution of the instruction set by a quantum computing device. A composite result set is determined based at least in part on the result set from each quantum simulator node.

Abstract: The examples disclosed herein provide classifying quantum errors. In particular, a classical computing system receives quantum error data from a first quantum computing device of a quantum computing system. The quantum error data includes error identification data and error correction data. The error identification data is associated with occurrence of a quantum error. The error correction data is associated with a corrective action taken by the first quantum computing device to correct the quantum error. The classical computing system determines an error type of the quantum error of the error identification data. The classical computing system associates an error classification tag with the quantum error data. The error classification tag identifies a quantum error type. The classical computing system sends the error classification tag to the first quantum computing device. The classical computing system processes a quantum computing request based on the error classification tag.