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, 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: 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, 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: 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, apparatus and product includes obtaining a logical representation of a quantum circuit that is implementable by a plurality of alternative physical representations of the quantum circuit, each of which implementing the logical representation with a different error correction scheme and defining error correction schemes for the quantum circuit. The defining error correction schemes includes implementing a search algorithm on the alternative physical representations, wherein the search algorithm is configured to search for a physical representation of the quantum circuit with an assignment of a plurality of physical qubits to a plurality of logical qubits that is defined in view of a quality score. A quality metric used to compute the quality score is monotonically correlated to error rates of logical output qubits of the quantum circuit when implementing each alternative physical representation. The assignment is utilized to define the error correction schemes for the quantum circuit.

Abstract: A method, product and apparatus comprising: obtaining an indication of an execution task to be performed by a quantum computer, wherein the execution task comprises executing, by the quantum computer, a quantum program for a number of times that is larger than two times: obtaining a graph comprising nodes that are connected by edges, the graph represents a gate-level implementation of the quantum program, the graph depicts quantum restrictions of the quantum program; and packing multiple graphs according to the quantum restrictions to synthesize a joint circuit, the joint circuit is configured, when executed by the quantum computer, to implement the execution task, the multiple graphs comprise at least one instance of the graph, the one instance of the graph represents a single execution of the quantum program, whereby execution of the joint circuit implements execution of the quantum program for the number of times.

Abstract: A method, product and apparatus for efficient execution of a quantum program. The method comprises: determining a target qubit of a quantum program and a target cycle, wherein the quantum program is configured to manipulate a set of qubits, including the target qubit, using a set of quantum gates, wherein the quantum program is defined to use a predetermined number of gates; performing an impact analysis of the quantum program with respect to a value of the target qubit at the target cycle to identify a gate that does not impact the value of the target qubit at the target cycle; modifying the quantum program based on the impact analysis by removing the gate, whereby determining a modified quantum program, wherein the modified quantum program is defined to use a number of gates that is smaller than the predetermined number of gates; and executing the modified quantum program.

Abstract: A method, product and apparatus of implemented controlled propagation in quantum computing. The method includes obtaining an instruction to implement a controlled propagation of a modified value of a qubit in a quantum program at a target cycle; determining an existing value of the qubit at the target cycle in the quantum program; synthesizing a transformative quantum program based on the existing value and the modified value; and updating the quantum program to perform the transformative quantum program after the target cycle, whereby creating a modified quantum program implementing the instruction.

Abstract: A method, apparatus and product includes obtaining a logical representation of a quantum circuit and selecting a quantity of physical qubits for a physical representation of the quantum circuit, wherein the selecting of the quantity is based on a utility per-qubit metric that is used to define a utility per-qubit score of the quantum circuit. The utility per-qubit score is determined based on a ratio between a quality score of the quantum circuit when using the quantity of physical qubits and between a cost function of the quantum circuit, wherein the quality score is defined by a quality metric that is monotonically correlated to error rates of logical output qubits. The quantum circuit is synthesized using the quantity of the physical qubits that was selected.

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 comprising: obtaining a directed acyclic graph representing a quantum circuit, the directed acyclic graph comprising a set of blocks and connections therebetween, wherein a connection between a first block and a second block indicates passing an output value of a qubit outputted by the first block to be an input value of a qubit manipulated by the second block; determining a Constraint Satisfaction Problem (CSP) based on the directed acyclic graph, wherein the CSP comprises one or more constraints based on the connections defined by the directed acyclic graph; automatically solving the CSP, wherein said automatically solving comprises selecting an implementation to each block that adheres to the one or more constraints; and synthesizing a gate-level representation of the quantum circuit based on the solution to the CSP.

Abstract: Method, apparatus and product for modeling of quantum circuits and usages thereof. A method includes 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 includes 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 comprising: obtaining a functional-level representation of a quantum circuit that comprises a functional block; synthesizing a gate-level representation of the quantum circuit based on the functional-level representation of the quantum circuit, wherein the gate-level representation of the quantum circuit comprises a first sub-circuit and a second sub-circuit; providing the gate-level representation to a gate-level processing component; obtaining, from the gate-level processing component, a change indication indicating that the gate-level processing component modified the first sub-circuit, whereby determining a modified first sub-circuit; in response to the change indication, synthesizing a modified second sub-circuit based on a knowledge of an existence of the modified first sub-circuit.

Abstract: In one embodiment, payoffs to an actor during the strategic game according to a solution concept is simulated a predetermined number of times. A machine learning tool is used to predict a payoff based on the predetermined number of payoffs according to the solution concept, wherein the machine learning tool is trained with plurality of pairs, each pair comprising a set of simulated payoffs and an actual payoff, wherein the simulated payoffs are predetermined number of payoffs determined in accordance with the solution concept. In another embodiment, a process tree representative of a strategic game involving actors is obtained. The process tree may comprise computational nodes, and leaf nodes which define payoff based on computations of the computational nodes. The process tree is reduced to a game tree representing the strategic game by simulating routes in the process tree.

Abstract: Techniques for using a scaling relationship between crop drymass and elevation at a farm level to redistribute crop yield data are provided. In one aspect, a method for analyzing crop yield is provided. The method includes the steps of: obtaining crop yield data for a farm; cleansing the crop yield data using a data filter(s), wherein one or more data points are eliminated from the crop yield data by the data filter; and redistributing a value of the data points eliminated from the crop yield data to data points remaining in the crop yield data to create a crop yield distribution for the farm.

Abstract: A computer-implemented method performed by a computerized device, comprising: obtaining consumption data comprising readings indicating consumption of a product, the consumption data is monitored by a plurality of metering devices, wherein the metering devices are associated with a plurality of consumption entities, wherein the plurality of consumption entities comprising a consumption unit and one or more sub consumption units of the consumption unit, wherein the product is supplied serially to the one or more sub consumption units via the consumption unit; and calculating residual consumption of the plurality of consumption entities at a point in time, wherein the residual consumption is consumption of the consumption unit and which is not associated with a sub consumption unit, wherein the residual consumption is calculated based on the consumption by the plurality of consumption entities at a plurality of points in time.

Abstract: Techniques for using a scaling relationship between crop drymass and elevation at a farm level to redistribute crop yield data are provided. In one aspect, a method for analyzing crop yield is provided. The method includes the steps of: obtaining crop yield data for a farm; cleansing the crop yield data using a data filter(s), wherein one or more data points are eliminated from the crop yield data by the data filter; and redistributing a value of the data points eliminated from the crop yield data to data points remaining in the crop yield data to create a crop yield distribution for the farm.

Abstract: A method comprising calculating for each agent, an average quality of tasks that were completed in the past by the agent; allocating tasks to the agents, wherein said allocating comprises selecting an agent to perform a task, the selection is based on the average quality of the agent; in response to the agent completing the task, computing a reward for the agent, wherein the reward is calculated according to a total contribution of the agent to the system by completing the task; whereby biasing said allocating to prefer allocating tasks to a first agent over a second agent, if a quality of the first agent is greater than a quality of the second agent, wherein said biasing is not dependent on prior knowledge of the qualities. Optionally, the agents choose whether or not to perform a task and an agent's quality affects the contributions of the agent performing tasks.