Classiq Technologies LTD.

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.

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.

A method, product and apparatus including obtaining a logical representation of a quantum circuit having logical qubits and determining a physical representation of the quantum circuit by allocating physical qubits of a quantum computer to quantum components of the physical representation. Such allocating includes determining a pattern of qubit patches representing the logical qubits. A qubit patch includes two slots for representing two logical qubits. The pattern includes an arrangement of the qubit patches in a first number of rows and a second number of columns. The method then includes determining a mapping of the logical qubits to the qubit patches based on first and second factors, determining, based on the mapping, a number of T-factories to be included in each T-factory patch, and synthesizing the quantum circuit according to the physical representation.

A method, apparatus and product are provided for using classical control flow in quantum programming. A quantum program that comprises a sequence of instructions including compilable instructions and a non-compilable instruction is received. A first subset of the compilable instructions is selected based on the non-compilable instruction. The first subset is compiled to obtain a first quantum circuit, which is executed using a quantum execution platform. An outcome of the execution is determined. A second subset of the compilable instructions, different from the first subset, is selected. The second subset is compiled to obtain a second quantum circuit executable by the quantum execution platform. In another aspect, compilable instructions are selected based on the type and position of a non-compilable instruction. The selected instructions are compiled to obtain an executable quantum circuit.

A method, apparatus, and product comprising: obtaining a logical representation of a quantum program that comprises logical qubits and gate operations; converting the logical representation to a physical representation to be executed on a measurement-based quantum computer, said converting comprising: determining a segmentation of quantum sources into disjoint segments configured to generate consecutive layers of clusters of physical qubits separated by time delays; selecting for each segment an interleaving depth, said selecting comprises selecting a non-uniform distribution of interleaving depths between first and second disjoint segments; and allocating for each segment one or more logical qubits to be represented by the each segment; and synthesizing the quantum program according to the physical representation.

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.

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.

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.

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.

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.