Abstract: A method, apparatus and product for executing a quantum circuit by a quantum execution platform, comprising: obtaining the quantum circuit, the quantum circuit comprises first and second qubit allocation instructions, the first qubit allocation instruction instructing to obtain a first set of qubits at an initial cycle, the second qubit allocation instruction instructing to obtain a second set of qubits at an intermediate cycle ordered after the initial cycle; performing an execution of cycles of the quantum circuit, said performing comprises allocating, for the initial cycle, qubits from a qubit pool to be utilized by the quantum circuit, the qubits corresponding to the first set of qubits; and in response to the execution reaching the intermediate cycle, dynamically allocating at least one additional qubit from the qubit pool to be utilized by the quantum circuit, the at least one additional qubit corresponding to the second set of qubits.

Abstract: A method for optimizing a quantum circuit includes obtaining a quantum circuit model comprising one or more quantum operations, wherein at least one quantum operation is marked as having permutable input registers. An optimization goal for the quantum circuit is determined. A processor selects a permutation of the input registers for the at least one marked quantum operation based on the optimization goal. An optimized quantum circuit is generated based on the selected permutation. The method may further include providing the generated optimized quantum circuit for execution by a quantum execution platform.

Abstract: A method, apparatus, and product includes obtaining a quantum program having one or more functionalities that are intended to be implemented as quantum operations in a quantum circuit, where the quantum program is not executable on a quantum execution platform; compiling a first portion of the quantum program to generate a first quantum circuit that is executable on the quantum execution platform; providing the first quantum circuit to the quantum execution platform to be executed thereby; compiling a second portion of the quantum program to generate a second quantum circuit that is executable on the quantum execution platform, where the first and second portions of the quantum program are disjoint non-overlapping portions of the quantum program; and providing the second quantum circuit to the quantum execution platform to be executed thereby, thereby performing an iterative compilation and execution of the quantum program.

Abstract: A method, apparatus and product includes dynamically selecting a distribution of a compilation process of a quantum program between a first software compiler and a second software compiler, the selecting including selecting to perform a first set of computations of the compilation process at the first software compiler, and to perform a second set of computations of the compilation process at the second software compiler; generating, at the first software compiler, an intermediate-level data structure based on the quantum program by performing the first set of computations; providing the intermediate-level data structure from the first software compiler to the second software compiler; generating, by the second software compiler, a quantum circuit implementing the intermediate-level data structure by performing the second set of computations; and providing the quantum circuit to a quantum execution platform for execution thereby.

Abstract: A method, apparatus and product for executing a quantum circuit by a quantum execution platform, includes obtaining the quantum circuit, the quantum circuit having first and second qubit allocation instructions, the first qubit allocation instruction instructing to obtain a first set of qubits at an initial cycle, the second qubit allocation instruction instructing to obtain a second set of qubits at an intermediate cycle ordered after the initial cycle; performing an execution of cycles of the quantum circuit, said performing including allocating, for the initial cycle, qubits from a qubit pool to be utilized by the quantum circuit, the qubits corresponding to the first set of qubits, and in response to the execution reaching the intermediate cycle, dynamically allocating at least one additional qubit from the qubit pool to be utilized by the quantum circuit, the at least one additional qubit corresponding to the second set of qubits.

Abstract: A method, apparatus and product for executing a quantum circuit by a quantum execution platform, comprising: obtaining the quantum circuit, the quantum circuit comprises first and second qubit allocation instructions, the first qubit allocation instruction instructing to obtain a first set of qubits at an initial cycle, the second qubit allocation instruction instructing to obtain a second set of qubits at an intermediate cycle ordered after the initial cycle; performing an execution of cycles of the quantum circuit, said performing comprises allocating, for the initial cycle, qubits from a qubit pool to be utilized by the quantum circuit, the qubits corresponding to the first set of qubits; and in response to the execution reaching the intermediate cycle, dynamically allocating at least one additional qubit from the qubit pool to be utilized by the quantum circuit, the at least one additional qubit corresponding to the second set of qubits.

Abstract: A method, apparatus and product for executing a quantum circuit by a quantum execution platform, comprising: obtaining the quantum circuit, the quantum circuit comprises first and second qubit allocation instructions, the first qubit allocation instruction instructing to obtain a first set of qubits at an initial cycle, the second qubit allocation instruction instructing to obtain a second set of qubits at an intermediate cycle ordered after the initial cycle; performing an execution of cycles of the quantum circuit, said performing comprises allocating, for the initial cycle, qubits from a qubit pool to be utilized by the quantum circuit, the qubits corresponding to the first set of qubits; and in response to the execution reaching the intermediate cycle, dynamically allocating at least one additional qubit from the qubit pool to be utilized by the quantum circuit, the at least one additional qubit corresponding to the second set of qubits.

Abstract: A method, apparatus and product comprising: generating, by a first software compiler, an intermediate-level data structure based on a quantum program, the intermediate-level data structure is a Directed Acyclic Graph (DAG) that is a non-executable representation of the quantum program; initiating a first execution of the quantum program at the quantum execution platform by: obtaining, at a second software compiler, first real-time constraints on an availability of resources of the quantum execution platform for the first execution; generating, based on the first real-time constraints, a first quantum circuit that implements the DAG; and providing the first quantum circuit to the quantum execution platform to be executed thereon; and initiating a second execution of the quantum program at the quantum execution platform by: obtaining second real-time constraints on an availability of resources; generating a second quantum circuit; and providing the second quantum circuit to the quantum execution platform.

Abstract: A method, apparatus, and product comprising: obtaining a representation of a quantum circuit; determining that a qubit is a candidate auxiliary qubit by estimating that a state of the qubit at a first cycle is identical to a state of the qubit at a second cycle; identifying a function section in the quantum circuit based on the qubit, the function section commencing at a beginning cycle, the beginning cycle is ordered before the second cycle, the function section ending at an ending cycle, the ending cycle is ordered after the first cycle, the ending cycle is ordered after the commencing cycle, the function section utilizing the qubit as an auxiliary qubit; and outputting an indication of the function section.

Abstract: A method, apparatus, and computer product for scheduling Pauli-terms by selecting an order for the Pauli-terms, comprising: obtaining first and second ordered sets of Pauli-terms; obtaining first and second multitree data structures representing the first and second ordered sets, respectively; and determining whether or not the first and second ordered sets should be concatenated by: generating a third multitree data structure that represents all Pauli-terms of the first and second ordered sets; calculating a difference between a resource utilization score of the third multitree data structure and between resource utilization scores of the first and second multitree data structures; and based on the difference, determining whether or not the first and second ordered sets should be concatenated.

Abstract: A method, apparatus, and computer product comprising: obtaining a multitree data structure that represents a plurality of ordered Pauli-terms, the plurality of ordered Pauli-terms representing an exponentiation module, wherein implementing a Pauli-term in a quantum circuit requires to implement a basis change stage and a parity summation stage, the multitree data structure comprises root nodes representing the plurality of Pauli-terms, leaf nodes representing qubits, and a non-leaf node; converting the multitree data structure to an ordered binary multitree that comprises an additional node; and synthesizing the quantum circuit based on the ordered binary multitree, whereby the quantum circuit comprises an implementation of the parity summation stage and an implementation of the basis change stage, whereby the quantum circuit implements at least one cancellation of a given CX gate of the parity summation stage.

Abstract: A method, apparatus, and computer product for constructing a multitree data structure, comprising: obtaining Pauli-terms that are associated with qubits, each Pauli-term defines at least one active qubit, the Pauli-terms are ordered according to a defined order; generating an auxiliary graph that represents the Pauli-terms, the auxiliary graph comprising graph nodes that represent the Pauli-terms, the graph nodes are ordered consecutively according to the defined order, an interface between first and second consecutive graph nodes represents a set of active qubits that is active in first and second Pauli-terms, the first and second Pauli-terms are represented by the first and second consecutive graph nodes; and generating the multitree data structure based on the auxiliary graph.

Abstract: A method, apparatus and product comprising: obtaining a Directed Cycle Graph (DAG) representation of a quantum program, the DAG representation comprises at least one non-executable node that represents a functionality in a high-level representation; generating a Constraint Satisfaction Problem (CSP) model of the DAG representation; generating a partial DAG representation of the quantum program based on the DAG representation, the partial DAG representation comprising at least a first executable node and a second non-executable node, said generating comprising selecting the first executable node and the second non-executable node as implementations of the at least one non-executable node; and synthesizing the quantum program based on the partial DAG representation.

Abstract: A method, system and product comprising: obtaining a gate-level representation of a quantum circuit, wherein the gate-level representation comprises a set of quantum gates defining operations on a set of qubits, wherein the gate-level representation comprises a gate-level implementation of a functional block of a functional-level representation of the quantum circuit, wherein the functional block defines an operation of the quantum circuit over at least two cycles; obtaining metadata from a functional-level processing component, wherein the metadata comprise an artifact associated with the gate-level implementation of the functional block; and compiling the gate-level representation of the quantum circuit, wherein said compiling is performed based on the metadata.

Abstract: A method, system and product comprising: obtaining a functional-level representation of a quantum circuit that comprises a functional block; obtaining an indication of one or more resources that are available to the functional block, the indication regarding a range of cycles and an indication regarding a number of qubits; dynamically generating a gate-level implementation of the functional block that adheres to the indication of the one or more resources; and synthesizing a gate-level implementation of the quantum circuit, wherein the gate-level implementation of the quantum circuit comprises the gate-level implementation of the functional block.

Abstract: A method, system and product comprising: obtaining a functional-level representation of a quantum circuit that comprises a functional block, wherein the functional block defines an operation of the quantum circuit over at least two cycles; selecting from a function library an implementation for the functional block, wherein the function library comprises a plurality of alternative implementations of the functional block, wherein each implementation of the plurality of alternative implementations is configured to provide a same functionality of the functional block and is applicable to a quantum computer to be used for executing the quantum circuit; and generating a gate-level representation of the quantum circuit that comprises the implementation for the functional block.

Abstract: A method, apparatus and product comprising: generating, by a first software compiler, an intermediate-level data structure based on a quantum program, the intermediate-level data structure is a Directed Acyclic Graph (DAG) that is a non-executable representation of the quantum program; initiating a first execution of the quantum program at the quantum execution platform by: obtaining, at a second software compiler, first real-time constraints on an availability of resources of the quantum execution platform for the first execution; generating, based on the first real-time constraints, a first quantum circuit that implements the DAG; and providing the first quantum circuit to the quantum execution platform to be executed thereon; and initiating a second execution of the quantum program at the quantum execution platform by: obtaining second real-time constraints on an availability of resources; generating a second quantum circuit; and providing the second quantum circuit to the quantum execution platform.

Abstract: A method, apparatus, and product comprising: computing, using a classical computer, a modified quantum state based on an application of a transformation on an initial quantum state, the initial quantum state is associated with one or more qubits, a quantum circuit comprising the one or more qubits, and an original sub-circuit that is configured to set the initial quantum state on the one or more qubits; and generating a modified quantum circuit that comprises a modified sub-circuit, the modified sub-circuit is configured to set the modified quantum state on the one or more qubits of the modified quantum circuit during one or more cycles of the modified quantum circuit, wherein the modified sub-circuit is configured to apply an inverse transformation on the modified quantum state of the one or more qubits at one or more subsequent cycles.

Abstract: Method, apparatus and product for modeling of quantum circuits and usages thereof. A method comprises obtaining a model of a quantum circuit that comprises a set of decision variables, corresponding domains, and constraints, wherein the set of decision variables comprise gate assignment decision variables that define an assignment of a gate to a qubit in a cycle in the quantum circuit. The method comprises automatically determining a set of valuations for the set of decision variables. The set of valuations are selected from the corresponding domains and satisfy the constraints. Based on the set of valuations the quantum circuit is synthesized.

Abstract: A method, system and product relating to quantum computing. The method comprises using a quantum computer to execute a quantum program a plurality of times, wherein during each execution of the quantum program: reaching an intermediate state, wherein the intermediate state is obtained prior to reaching the terminating cycle of the quantum program; and performing a measurement of a qubit at the intermediate state, whereby obtaining a plurality of measurements of the qubit at the intermediate state in a plurality of executions of the quantum program. The method further comprises determining a value of the qubit at the intermediate state based on the plurality of measurements obtained of the qubit at the intermediate state.