Abstract: Systems and techniques that facilitate backend quantum runtimes are provided. In various embodiments, a system can comprise a backend receiver component that can access a computer program provided by a client device, wherein the computer program is configured to indicate a quantum computation. In various aspects, the system can further comprise a backend runtime manager component that can host the computer program by instantiating a backend classical computing resource. In various instances, the backend classical computing resource can orchestrate both classical execution of the computer program and quantum execution of the quantum computation indicated by the computer program.

Abstract: Devices and methods that facilitate modular quantum systems with discreet levels of connectivity are provided. In various embodiments, a quantum computing device can comprise one or more modules comprising at least qubits, buses, and readout structures; a plurality of couplers, wherein the plurality of couplers comprises at least two couplers selected from a group consisting of: classical couplers, short-range couplers, and long-range couplers, that are adapted for coupling a plurality of the at least qubits, buses, and readout structures; and a connection from the one or more modules to one or more classical controllers external to a cryogenic environment comprising the one or more modules.

Abstract: A method of generating a randomized benchmarking protocol includes providing a randomly generated plurality of Hadamard gates; applying the Hadamard gates to a plurality of qubits; and generating randomly a plurality of Hadamard-free Clifford circuits. Each of the plurality of Hadamard-free Clifford circuits is generated by at least randomly generating a uniformly distributed phase (P) gate, and randomly generating a uniformly distributed linear Boolean invertible matrix of conditional NOT (CNOT) gate, and combining the P and CNOT gates to form each of the plurality of Hadamard-free Clifford circuits. The method also includes combining each of the plurality of Hadamard-free Clifford circuits with corresponding each of the plurality of Hadamard gates to form a sequence of alternating Hadamard-free Clifford-Hadamard pairs circuit to form the randomized benchmarking protocol; and measuring noise in a quantum mechanical processor using the randomized benchmarking protocol.

Abstract: One or more systems, computer-implemented methods and/or computer program products provided herein relate to obfuscating an input specification of a quantum circuit, one or more gate parameters of a quantum circuit, and/or at least a portion of a quantum circuit. A system can comprise a processor, operatively coupled to a memory, wherein the processor executes the following computer executable components: an obfuscation component that encodes an original quantum control computation by introducing a specified variable into the original quantum control computation, wherein the introduction of the specified variable creates an encoded quantum control computation that is decodable by performing a quantum compiling operation on the encoded quantum control computation.

Abstract: Systems and techniques that facilitate backend quantum runtimes are provided. In various embodiments, a system can comprise a memory that can store computer-executable components. The system can further comprise a processor that can be operably coupled to the memory and that can execute the computer-executable components stored in the memory. In various embodiments, the computer-executable components can comprise an execution orchestration engine component that can parse a computer program into classical and quantum portions and that can host the computer program by instantiating a classical computing resource.

Abstract: Systems and techniques that facilitate Stark shift cancellation are provided. In various embodiments, a system can comprise a control qubit that is coupled to a target qubit. In various cases, the control qubit can be driven by a first tone that entangles the control qubit with the target qubit. In various aspects, the control qubit can be further driven by a second tone simultaneously with the first tone. In various cases, the second tone can have an opposite detuning sign than the first tone. In various instances, the first tone can cause a Stark shift in an operational frequency of the control qubit, and the second tone can cancel the Stark shift.

Abstract: A method of generating a randomized benchmarking protocol includes providing a randomly generated plurality of Hadamard gates; applying the Hadamard gates to a plurality of qubits; and generating randomly a plurality of Hadamard-free Clifford circuits. Each of the plurality of Hadamard-free Clifford circuits is generated by at least randomly generating a uniformly distributed phase (P) gate, and randomly generating a uniformly distributed linear Boolean invertible matrix of conditional NOT (CNOT) gate, and combining the P and CNOT gates to form each of the plurality of Hadamard-free Clifford circuits. The method also includes combining each of the plurality of Hadamard-free Clifford circuits with corresponding each of the plurality of Hadamard gates to form a sequence of alternating Hadamard-free Clifford-Hadamard pairs circuit to form the randomized benchmarking protocol; and measuring noise in a quantum mechanical processor using the randomized benchmarking protocol.

Abstract: A method of generating a randomized benchmarking protocol includes providing a randomly generated plurality of Hadamard gates; applying the Hadamard gates to a plurality of qubits; and generating randomly a plurality of Hadamard-free Clifford circuits. Each of the plurality of Hadamard-free Clifford circuits is generated by at least randomly generating a uniformly distributed phase (P) gate, and randomly generating a uniformly distributed linear Boolean invertible matrix of conditional NOT (CNOT) gate, and combining the P and CNOT gates to form each of the plurality of Hadamard-free Clifford circuits. The method also includes combining each of the plurality of Hadamard-free Clifford circuits with corresponding each of the plurality of Hadamard gates to form a sequence of alternating Hadamard-free Clifford-Hadamard pairs circuit to form the randomized benchmarking protocol; and measuring noise in a quantum mechanical processor using the randomized benchmarking protocol.

Abstract: Systems, computer-implemented methods and/or computer program products are provided for facilitating error mitigation for classical data output from a classical system and/or for qubit data output from a quantum system. A system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise a computation component that performs error mitigation employing less than a full set of assignment matrix elements. In one or more embodiments, the error mitigation can be performed without constructing an assignment matrix. Additionally and/or alternatively, the computer executable components can comprise a computation component that performs error mitigation employing an iterative solver using the less than a full set of assignment matrix elements as the initial input set for the iterative solver.

Abstract: Systems and techniques that facilitate backend quantum runtimes are provided. In various embodiments, a system can comprise a backend receiver component that can access a computer program provided by a client device, wherein the computer program is configured to indicate a quantum computation. In various aspects, the system can further comprise a backend runtime manager component that can host the computer program by instantiating a backend classical computing resource. In various instances, the backend classical computing resource can orchestrate both classical execution of the computer program and quantum execution of the quantum computation indicated by the computer program.

Abstract: Techniques for managing and compressing quantum output data (QOD) associated with quantum computing are presented. In response to receiving QOD from a quantum computer, a compressor component can compress QOD at first compression level to generate first compressed QOD, and can compress QOD at second compression level to generate second compressed QOD, the second compressed QOD can be less compressed than the first compressed QOD. Compressor management component (CMC) can determine whether first QOD includes sufficient data to enable it to be suitably processed by quantum logic. If so, CMC can allow first compressed QOD to continue to be sent to quantum logic and can discard second compressed QOD. If not sufficient, CMC can determine that second compressed QOD is to be processed by quantum logic. If CMC determines second compressed QOD does not include sufficient data, CMC can determine that the QOD is to be processed by quantum logic.

Abstract: A quantum system includes a qubit array comprising a plurality of qubits. A bus resonator is coupled between at least one pair of qubits in the qubit array. A switch is coupled between the at least one qubit pair of qubits.

Abstract: Techniques for managing and compressing quantum output data (QOD) associated with quantum computing are presented. In response to receiving QOD from a quantum computer, a compressor component can compress QOD at first compression level to generate first compressed QOD, and can compress QOD at second compression level to generate second compressed QOD, the second compressed QOD can be less compressed than the first compressed QOD. Compressor management component (CMC) can determine whether first QOD includes sufficient data to enable it to be suitably processed by quantum logic. If so, CMC can allow first compressed QOD to continue to be sent to quantum logic and can discard second compressed QOD. If not sufficient, CMC can determine that second compressed QOD is to be processed by quantum logic. If CMC determines second compressed QOD does not include sufficient data, CMC can determine that the QOD is to be processed by quantum logic.

Abstract: Systems, computer-implemented methods, and computer program products to facilitate evaluation of quantum circuit optimization routines and knowledge base generation are provided. According to an embodiment, a system can comprise a processor that executes computer executable components stored in memory. The computer executable components can comprise a compilation component that concurrently executes different quantum circuit optimization sequences on multiple copies of a quantum circuit. The computer executable components can further comprise an identification component that identifies at least one of the different quantum circuit optimization sequences that generates an output quantum circuit comprising defined criteria.

Abstract: Techniques that combine quantum error correction and quantum error mitigation are used to simulate a fault-tolerant T-gate with low sampling overhead using the quasiprobability decomposition method. In some embodiments, the T-gate can be simulated using two logical bits and a magic state preparation that mitigates the need for magic state distillation and consequently has a low sampling overhead. Alternatively, the T-gate can be simulated based on code deformation performed on the surface code. Noise is removed from the T-gate using quasiprobability decomposition based on a learned logical error rate.

Abstract: Devices and/or computer-implemented methods to facilitate a cross-resonance operation in a dispersive regime of a qubit frequency space are provided. According to an embodiment, a device can comprise a first qubit having a first operating frequency and a first anharmonicity. The device can further comprise a second qubit that couples to the first qubit to perform a cross-resonance operation. The second qubit having a second operating frequency and a second anharmonicity. A detuning between the first operating frequency and the second operating frequency is larger than the first anharmonicity and the second anharmonicity.

Abstract: Systems, computer-implemented methods, and computer program products to facilitate translation of a quantum design across multiple applications are provided. According to an embodiment, a system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise a quantum library component that stores a data structure representing a quantum geometry that is a physical representation of a quantum element in a quantum component. The computer executable components can further comprise a quantum renderer component that translates the quantum geometry into a defined format of an application based on the data structure.

Abstract: An embodiment includes (CR) gate having a first control qubit coupled with a first target qubit, and a second CR gate having a second control qubit coupled with a second target qubit and the first control qubit. The embodiment also includes controller circuitry for performing operations including first and second iterations of: during a first time period, directing respective CR pulses to the first and second control qubits; during a second time period, directing respective single qubit pulses to the first control qubit and to the second target qubit; during a third time period, directing respective CR pulses to the first and second control qubits; and during a fourth time period, directing respective single qubit pulses to the second control qubit and to the first target qubit.

Abstract: A quantum system includes a qubit array comprising a plurality of qubits. A bus resonator is coupled between at least one pair of qubits in the qubit array. A switch is coupled between the at least one qubit pair of qubits.

Abstract: Systems and methods that can facilitate a quantum adaptive execution method based on previous quantum circuits and its intermediate results. This can generate an optimized adaptive compilation methodology for a specific backend and the previous quantum circuits dependents and thus redirect by the job dispatcher to the right quantum backend. Some of the quantum circuits can be dependent on other quantum circuits based on the intermediate results produced by the previous circuits. Hence, it is valuable that a system can manage the optimization of circuits based on its dependencies and by the results generated by the previous quantum circuits. In this way, the system can get an optimal result for a quantum circuit and inject it to the compiler unit to generate an adaptive compilation result. The resulted post-processing unit is the one in charge to apply this logic and manage the input/output of data to push it in the compiler units and the job dispatcher.