Abstract: A method for analyzing a simulation of the execution of a quantum circuit comprises: a step of post-selecting (S2) one or more particular values of one or more qubits at one or more steps of the simulation, a step of retrieving (S5), by an iterator (7), all or some of the quantum states of the quantum state vector(s) derived from the post-selection(s) of qubits, a step of analyzing (S6) the part of the simulation that corresponds to the post-selection(s) of qubits and to the quantum state vector(s) retrieved.

Abstract: A method for analyzing a simulation of the execution of a quantum circuit includes: a step of post-selecting one or more particular values of one or more qubits at one or more steps of the simulation; a step of setting filtration that sets the value of one or more quantum states of the quantum state vector(s) derived from the post-selection(s) of qubits; a step of analyzing the part of the simulation that corresponds to the post-selection(s) of qubits and to the quantum state vector(s) filtered.

Abstract: A method of deploying a task includes allocating nodes to the task; determining, in the network, a subnetwork, for interconnecting the allocated nodes, satisfying one or more predefined determination criteria including a first criterion according to which the determined subnetwork is the one, from among at least two subnetworks meeting the criteria other than the first criterion, using the most switches already allocated, each to at least one already deployed task; allocating the subnetwork, and in particular the links belonging to that subnetwork, to the task; and implementing inter-node communication routes in the allocated subnetwork.

Abstract: A method for deploying a task includes deploying the task in the supercomputer; executing the task; at the end of the execution of the task, detecting at least one link which is not allocated to any task, and setting each detected link in an inactive state, wherein the link requires a power consumption less than the power consumption required by a link associated with at least one task.

Abstract: A method for compressing a quantum state vector includes: aggregating a group of several neighboring states of the vector into a cluster of states of the vector, a parameter representative of the probability of this cluster being associated with it and corresponding to the sum of the probabilities of the aggregated neighboring states in this cluster, the probability of each aggregated neighboring state being below a given aggregation threshold, and/or the sum of the probabilities of the aggregated neighboring states in a cluster being below another given aggregation threshold; and preserving a state of the vector not aggregated in a cluster, the parameter representative of its probability remaining unchanged. The method includes several steps of aggregating several distinct groups of several neighboring states of the vector, respectively into several clusters of states of the vector, and/or an aggregation step and a preservation step.

Abstract: A method includes obtaining the topology of a computer cluster, with first global numbers respectively assigned to the nodes thereof, and implementing, for each pair of nodes, an algorithm adapted for providing a communication route between the nodes, based on respective numbers of the nodes and the topology of the computer cluster. The method further includes selecting nodes and numbering the nodes in order to assign second global numbers thereto, which numbers are different from the first global numbers for at least one part of the selected nodes, the second global numbers of the selected nodes being successively separated by values each of which is different from the periodicity of each of at least one part of the communication links. Moreover, in order to implement the algorithm, the nodes are identified by the second global numbers thereof.

Abstract: A method for deploying a task includes allocating nodes to the task; determining, in the network, a subnetwork, for interconnecting the allocated nodes, satisfying one or more predefined determination criteria including a first criterion according to which the subnetwork uses only links that are not allocated to any other task already deployed or that are allocated to fewer than N other tasks already deployed, N being a predefined number equal to one or more; allocating the subnet, and in particular the links belonging to that subnet, to the task; and implementing inter-node communication routes in the allocated subnet.

Abstract: The invention relates to a network of equipment interconnected by switches incorporating routing tables, comprising a routing table manager implementing two modes of operation, an off-line mode of operation in which all the routing tables are calculated initially, then loaded subsequently into the switches, at least when booting up the network, an on-line mode of operation in which, in case of an event rendering an element of the network not usable or operational, only the routing tables impacted by said event are recomputed and loaded into the switches, said routing tables being recomputed by a computer of the routing table manager, said recomputed routing tables being loaded by several loaders of routing tables of the routing table manager into their groups of respective switches.

Abstract: A method for analyzing a simulation of the execution of a quantum circuit comprises: a step of post-selecting (S2) one or more particular values of one or more qubits at one or more steps of the simulation, a step of retrieving (S5), by an iterator (7), all or some of the quantum states of the quantum state vector(s) derived from the post-selection(s) of qubits, a step of analyzing (S6) the part of the simulation that corresponds to the post-selection(s) of qubits and to the quantum state vector(s) retrieved.

Abstract: This method for deploying a task comprises: deploying the task in the supercomputer; executing the task; at the end of the execution of the task, detecting at least one link which is not allocated to any task, and setting each detected link in an inactive state, wherein the link requires a power consumption less than the power consumption required by a link associated with at least one task.

Abstract: This method for deploying a task involves: allocating nodes (1 . . .

Abstract: This method of deploying a task involves: allocating nodes (1 16) to the task; determining, in the network (110), a subnetwork, for interconnecting the allocated nodes, satisfying one or more predefined determination criteria including a first criterion according to which the determined subnetwork is the one, from among at least two subnetworks meeting the criteria other than the first criterion, using the most switches already allocated, each to at least one already deployed task; allocating the subnetwork, and in particular the links belonging to that subnetwork, to the task; and implementing inter-node communication routes in the allocated subnetwork.

Abstract: A method for analyzing a simulation of the execution of a quantum circuit includes: a step of post-selecting one or more particular values of one or more qubits at one or more steps of the simulation; a step of setting filtration that sets the value of one or more quantum states of the quantum state vector(s) derived from the post-selection(s) of qubits; a step of analyzing the part of the simulation that corresponds to the post-selection(s) of qubits and to the quantum state vector(s) filtered.

Abstract: Method of routing data in a network, this data originating from a first node and being destined for a second node, this method comprising the following steps: —pre-recording in each of the switches of a list of switches directly interfaced with one or more nodes; —reception of the data by a first switch and determination of its destination; when the first switch is directly interfaced with the second node via an output port-selection then in routing of the data by said output port; otherwise —identification of the switch to which the second node is directly interfaced; —routing of the data to the identified switch via an output port of the first switch, so that the data can be forwarded to said identified switch.

Abstract: A method for compressing a quantum state vector includes: aggregating a group of several neighboring states of the vector into a cluster of states of the vector, a parameter representative of the probability of this cluster being associated with it and corresponding to the sum of the probabilities of the aggregated neighboring states in this cluster, the probability of each aggregated neighboring state being below a given aggregation threshold, and/or the sum of the probabilities of the aggregated neighboring states in a cluster being below another given aggregation threshold; and preserving a state of the vector not aggregated in a cluster, the parameter representative of its probability remaining unchanged. The method includes several steps of aggregating several distinct groups of several neighboring states of the vector, respectively into several clusters of states of the vector, and/or an aggregation step and a preservation step.

Abstract: A method includes obtaining the topology of a computer cluster, with first global numbers respectively assigned to the nodes thereof, and implementing, for each pair of nodes, an algorithm adapted for providing a communication route between the nodes, based on respective numbers of the nodes and the topology of the computer cluster. The method further includes selecting nodes and numbering the nodes in order to assign second global numbers thereto, which numbers are different from the first global numbers for at least one part of the selected nodes, the second global numbers of the selected nodes being successively separated by values each of which is different from the periodicity of each of at least one part of the communication links. Moreover, in order to implement the algorithm, the nodes are identified by the second global numbers thereof.

Abstract: A method of extracting, from a physical topology, a virtual topology, the physical network topology including a plurality of switches connected to each other by their ports. The method includes the following steps: distribution of the leaf switches into sub-topologies according to the characteristics of the target topology, the sub-topologies being included in the virtual topology; inclusion of the neighboring switches connected only to the switches of a same sub-topology to the sub-topology; splitting of neighboring switches connected to a first sub-topology and to a second sub-topology into two virtual switches, the first virtual switch having the ports of the neighboring switch by which it is connected to the first sub-topology, the second virtual switch having the ports of the neighboring switch by which it is connected to the second sub-topology.

Abstract: The invention relates to a network of equipment interconnected by switches incorporating routing tables, comprising a routing table manager implementing two modes of operation, an off-line mode of operation in which all the routing tables are calculated initially, then loaded subsequently into the switches, at least when booting up the network, an on-line mode of operation in which, in case of an event rendering an element of the network not usable or operational, only the routing tables impacted by said event are recomputed and loaded into the switches, said routing tables being recomputed by a computer of the routing table manager, said recomputed routing tables being loaded by several loaders of routing tables of the routing table manager into their groups of respective switches.

Abstract: Method of routing data in a network, this data originating from a first node and being destined for a second node, this method comprising the following steps:—pre-recording in each of the switches of a list of switches directly interfaced with one or more nodes;—reception of the data by a first switch and determination of its destination; when the first switch is directly interfaced with the second node via an output port-selection then in routing of the data by said output port; otherwise—identification of the switch to which the second node is directly interfaced;—routing of the data to the identified switch via an output port of the first switch, so that the data can be forwarded to said identified switch.

Abstract: Method of extracting, from a physical topology, a virtual topology, the physical network topology including a plurality of switches connected to each other by their ports, said method comprising the following steps: distribution of the leaf switches into sub-topologies according to the characteristics of the target topology, said sub-topologies being included in the virtual topology; inclusion of the neighboring switch(es) connected only to the switch(es) of a same sub-topology to said sub-topology; splitting of neighboring switch(es) connected to a first sub-topology and to a second sub-topology into two virtual switches, the first virtual switch comprising the ports of said neighboring switch by means of which it is connected to said first sub-topology, the second virtual switch comprising the ports of said neighboring switch by means of which it is connected to said second sub-topology.