Abstract: A method, apparatus, and non-transitory computer readable medium comprising: obtaining an original quantum circuit comprising a plurality of quantum gates and qubits; selecting a target qubit; determining a set of segments for the target qubit based on 2-qubit gates operating on the target qubit. Further comprising: computing an optimized value of a target function comprising decision variables, each corresponding to a different segment, said computing comprising determining a value assignment for each decision variable; determining, for each segment, based on the value assignment for a corresponding decision variable, whether to perform magnitude approximation; and generating an approximated quantum circuit based on the determining.

Abstract: A method, a computerized apparatus, and a computer program product for automatic quantum circuit control skips. The method comprises obtaining a controlled sequence of quantum operations defining a complete order with at least two computation-uncomputation pairs of operations separated by a sub-sequence of one or more quantum operations. Computation-uncomputation pairs to be reduced are selected based on an optimization of a score of the reduced control sequence in comparison to a score of an alternative reduced control sequence in which the pairs are not reduced, in accordance with a score of each operation in a respective quantum circuit control. A reduced control sequence with a reduced number of controls is obtained by excluding a selected computation-uncomputation pairs of operations.

Abstract: An apparatus, method, and system comprising: a quantum computer that is configured to execute a parametric quantum circuit a plurality of times, the parametric quantum circuit comprising: a qubit with an unknown quantum state at an initial cycle of the parametric quantum circuit, an ansatz parametric circuit for receiving the unknown quantum state and outputting a processed quantum state, and a detection sub-circuit for indicating a distance measure of the processed quantum state from a target state, wherein said quantum computer implements a Variational Quantum Algorithm (VQA) scheme to iteratively set parameter values of the ansatz parametric circuit until obtaining a parameter value that causes the parametric quantum circuit to output an approximation of zero; and an output module for outputting the ansatz parametric circuit.

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 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 product comprising: obtaining alternative quantum circuits implementing a quantum program, each having a respective design error; identifying, for each quantum circuit, respective quantum resources that are used by the quantum circuit and are associated with respective hardware errors of a quantum computer; determining a total hardware error bound for the quantum circuit; determining a total error bound for the quantum circuit; applying a search algorithm over a plurality of total error bounds of the plurality of alternative quantum circuits, to identify an optimal total error bound that is associated with an optimal quantum circuit; and providing the optimal quantum circuit for execution on the quantum computer.

Abstract: A method, apparatus, and product comprising: obtaining an indication of an execution task, the execution task comprises executing a quantum program a number of times, the number of times is larger than two times; and selecting a quantum computer from a set of two or more quantum computers for performing the execution task, the set of two or more quantum computers comprise a first quantum computer and a second quantum computer, said selecting the quantum computer is performed based on a first value of a performance parameter that is associated with the first quantum computer and based on a second value of the performance parameter that is associated with the second quantum computer.

Abstract: A method, apparatus, a product comprising: obtaining a propagator module of a quantum function of a quantum program, the propagator module is programmed using a classical programming language, the propagator module configured to obtain as input a first domain of values for a first circuit parameter and a second domain of values for a second circuit parameter, and to output first and second sub-domains of the first and second domains of values, respectively; obtaining constraints of the quantum function; obtaining an optimization scheme that is defined over the first and second circuit parameters; generating a constraint problem based on the propagator module, the constraints, and the optimization scheme; resolving the constraint problem based on a constraint solver, a resolution comprising at least first and second values for the first and second circuit parameter; and synthesizing the quantum function according to the resolution.

Abstract: A method, product and apparatus for controlled propagation of input values in quantum computing. The method comprises obtaining a quantum program to be compiled. The quantum program has a first input qubit having a first value and a second input qubit having a second value. The method comprises identifying an intermediate cycle after which the first input qubit is not used in the quantum program, synthesizing a transformative quantum program that is applicable on a qubit being processed based on the first value and based on the second value; and updating the quantum program which comprises: modifying the quantum program to perform the transformative quantum program on the first input qubit at the intermediate cycle; and causing the quantum program to utilize the first input qubit instead of the second input qubit.

Abstract: A method, system, and product for performance analysis of quantum programs. A quantum program comprises plurality of code artifacts and is compilable into a quantum circuit. A representation of the quantum circuit that implements the quantum program is obtained. The quantum circuit manipulates a plurality of qubits over a plurality of cycles using a plurality of quantum gates. The representation of the quantum circuit includes circuit components. A performance measurement of a code artifact of the quantum program is automatically computed based on one or more circuit components that are mapped to the code artifact by a component to code mapping. The component to code mapping maps circuit components of the representation to the quantum circuit to respective code artifacts of the quantum program.

Abstract: A method, system and product for synthesizing a quantum circuit using Constraint Satisfaction Problem (CSP). A functional-level representation of a quantum circuit that includes a first functional blocks and a second functional block is obtained. The functional-level representation defines a relationship between the first functional block and the second functional block. A CSP that is determined based on the functional-level representation, is automatically solved. The CSP is solved by identifying a first and second implementations to the first and second functional blocks that adhere to the CSP. A gate-level representation of the quantum circuit is synthesized using the first and second implementations.

Abstract: An apparatus, product and method includes partially compiling a quantum circuit from an initial cycle and until one or more intermediate cycles. A partial executable quantum circuit and measurements regarding a group of candidate auxiliary qubits are obtained by executing the partial executable quantum circuit multiple times and classifying the group of candidate auxiliary qubits to a qubit class with respect to a target group of qubits. The qubit class indicates that the group of candidate auxiliary qubits is not entangled with the target group. The quantum circuit is modified to apply a cleaning process on the group of candidate auxiliary qubits, whereby a modified quantum circuit is obtained. The modified quantum circuit is compiled thus obtaining an executable quantum circuit.

Abstract: A method, apparatus and product comprising: obtaining a logical representation of a quantum circuit, wherein the logical representation comprises a plurality of logical qubits manipulated by a plurality of logical gates; and generating a physical representation of the quantum circuit, the physical representation is configured to allocate a set of physical qubits of a quantum computer to the plurality of logical qubits in order to implement error correction operations The generating includes selecting a first quantity of physical qubits from the set of physical qubits for a first separate section of the quantum circuit; selecting a second quantity of physical qubits from the set of physical qubits for a second separate section of the quantum circuit, and synthesizing the quantum circuit using the first and second quantities for the first and second separate sections.

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 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, 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 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, 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: 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.