Abstract: Systems and techniques that facilitate quantum circuit valuation are provided. In various embodiments, a system can comprise an input component that can access a first quantum circuit. In various embodiments, the system can further comprise a valuation component that can appraise the first quantum circuit based on one or more factors (e.g., frequency factor, complexity factor, resource factor, similarity factor), thereby yielding a value score that characterizes the first quantum circuit. In various instances, the system can further comprise an execution component that can recommend deployment of the first quantum circuit based on determining that the value score exceeds a threshold.

Abstract: A method for event predictions is provided. The method includes receiving input data. The method further includes identifying an object in the input data with the identified object associated with a first node in a knowledge graph. The method further includes determining a second node of a first object event with the second node related to the first node in the knowledge graph. The method further includes contextualizing the identified input object with the first object event.

Abstract: In an approach, a processor creates a multi-layered knowledge graph (KG), wherein a first layer is a core KG, a second layer has application-specific structured facts, and a third layer has individualized facts. A processor adapts weights in each layer of the multi-layered KG based on the individualized facts. A processor uses, as input data to the multi-layered KG, individual environmental data. A processor maps the input data to the multi-layered KG in a sequence of the first layer, the second layer, and the third layer. A processor selects, as relevant nodes in the first layer and the second layer, the relevant nodes lying on a selected path from the input data via the first layer, the second layer, and the third layer having the highest average weight value along the selected path. A processor outputs facts of the relevant nodes from the first layer and the second layer.

Abstract: A method and a related system for allocating target locations to optimize trajectories between several objects and the target locations may be provided. The method comprises capturing location data of the target locations as well as location and movement data of the objects, building a graph using the target locations as well as the location and movement data and integrating constraints into the graph. Furthermore, the method comprises determining for each of the several objects a desired target location using a first optimization system, thereby determining endpoints of a trajectory between each of the objects and its respective desired target location and selecting for each of the several objects an optimal path as the trajectory between the object and the desired target location, using a second optimization system, and taking into account movements of other objects along their trajectories.

Abstract: A method for personalizing a message between a sender and a receiver is provided. The method comprises semantically analyzing a communication history to form a knowledge graph, deriving formality level values using a first trained ML model, analyzing parameter values of replies to determine receiver impact score, and training a second ML system to generate a model to predict the receiver impact score value. The method also comprises selecting a linguistic expression in a message being drafted, determining an expression intent, modifying the linguistic expression based on the formality level and the expression intent to generate a modified linguistic expression, and testing whether the modified linguistic expression has an increased likelihood of a higher receiver impact score. The method also comprises repeating selecting the linguistic expression, determining the expression intent, modifying the linguistic expression, and testing until a stop criterion is met.

Abstract: A system for enhancing a classifier prediction in respect to underrepresented classes may be provided. A classifier system trained with training data to build a model is used for classifying unknown input data, and an evaluator engine adapted for a determination of an underrepresented class. Additionally, the system comprises an extractor engine adapted for an extraction of relating data from an additional source, and a similarity engine adapted for a selection of data sets out of the relating data wherein the similarity engine is also adapted for comparing features of the relating data and a representative data set for the underrepresented class. Finally, the system comprises a recursion unit adapted for triggering the evaluator engine, the extractor engine and the similarity engine treating selected data set as input data until the evaluator engine classifies the selected data set with a confidence level which is above a confidence threshold level.

Abstract: A method for performing an iteration of an output of a trained GAN may be provided. The method comprises receiving an object as input for the GAN, determining a set of features of the input by the generator adversarial network, generating, by the GAN, at least one modification to one feature of the set of features of the object, generating as output of the GAN the received object as a basis, and the generated modification building a modified object, capturing a feedback signal, and receiving the feedback signal as input by the GAN in a feedback loop for a next iteration. Moreover, the method comprises repeating the determination of a set of features, the generation of at least one modification, the generation of the output and the caption of the feedback signal in the next iteration, wherein as object the modified object is used as the object.

Abstract: A method for partitioning a knowledge graph is provided. The method analyzes past searches and determines an access frequency of a plurality of edges. The method marks, as intermediate cluster cores, edges having the highest access frequencies, sorts the marked intermediate cluster cores according to their access frequencies, and selects a first cluster core having the highest access frequency. The method assigns first edges in a first radius around the first cluster core to build the first cluster. The method selects a second cluster core having the highest access frequency apart from edges of the first cluster, and assigns second edges in a second radius around second cluster core to build the second cluster. The method partitions the knowledge graph into a first sub-knowledge-graph comprising the first cluster and a second sub-knowledge-graph comprising the second cluster.

Abstract: A computer-implemented method for generating a group of representative model cases for a trained machine learning model may be provided. The method comprising determining an input space, determining an initial plurality of model cases, and expanding the initial plurality of model cases by stepwise modifying field values of the records representing the initial plurality of model cases resulting in an exploration set of model cases. Additionally, the method comprises obtaining a model score value for each record of the exploration set of model cases, continuing the expansion of the exploration set of model cases thereby generating a refined model case set, and selecting the records in the refined model case set based on relative record distance values and related model score values between pairs of records, thereby generating the group of representative model cases.

Abstract: Systems, computer-implemented methods, and computer program products to facilitate quantum platform routing of a quantum application component are provided. According to an embodiment, a system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise a dissection component that identifies one or more components of a quantum application. The computer executable components can further comprise a determination component that selects at least one quantum platform to execute the one or more components of the quantum application based on a defined run criterion.

Abstract: A method for event predictions is provided. The method includes receiving input data. The method further includes identifying an object in the input data with the identified object associated with a first node in a knowledge graph. The method further includes determining a second node of a first object event with the second node related to the first node in the knowledge graph. The method further includes contextualizing the identified input object with the first object event.

Abstract: A system for enhancing a classifier prediction in respect to underrepresented classes may be provided. A classifier system trained with training data to build a model is used for classifying unknown input data, and an evaluator engine adapted for a determination of an underrepresented class. Additionally, the system comprises an extractor engine adapted for an extraction of relating data from an additional source, and a similarity engine adapted for a selection of data sets out of the relating data wherein the similarity engine is also adapted for comparing features of the relating data and a representative data set for the underrepresented class. Finally, the system comprises a recursion unit adapted for triggering the evaluator engine, the extractor engine and the similarity engine treating selected data set as input data until the evaluator engine classifies the selected data set with a confidence level which is above a confidence threshold level.

Abstract: A quantum state visualization device comprising at least a portion of a spherical shell and a support structure affixed to the spherical shell. A portion of the support structure can intersect a center of the spherical shell. The quantum state visualization device further comprising a indicator pivotally attached to the support structure at the portion of the support structure intersecting the center of the spherical shell. The indicator is representative of a quantum state based on its position relative to the spherical shell.

Abstract: A computer-implemented method for improving fairness in a supervised machine-learning model may be provided. The method comprises linking the supervised machine-learning model to a reinforcement learning meta model, selecting a list of hyper-parameters and parameters of the supervised machine-learning model, and controlling at least one aspect of the supervised machine-learning model by adjusting hyper-parameters values and parameter values of the list of hyper-parameters and parameters of the supervised machine-learning model by a reinforcement learning engine relating to the reinforcement learning meta model by calculating a reward function based on multiple conflicting objective functions. The method further comprises repeating iteratively the steps of selecting and controlling for improving a fairness value of the supervised machine-learning model.

Abstract: A method for linking a first knowledge graph (KG) and a second KG in the presence of a third KG is provided. Content of nodes of the first KG is compared to nodes of the second KG. If a first KG node has a content relationship to a related second KG node, an edge identified by a tuple identifying the first KG and the first KG node and a tuple identifying the second KG and the second KG node is stored in a meta-layer KG. The method comprises comparing content of the nodes from the third KG with the content of nodes from the first and second KG, and in case relationships are identified, more complex tuples establishing this relationship in the meta-layer are stored. Finally, the method also comprises storing at least all nodes and edges of the meta-layer knowledge graph.

Abstract: A method for partitioning a knowledge graph is provided. The method analyzes past searches and determines an access frequency of a plurality of edges. The method marks, as intermediate cluster cores, edges having the highest access frequencies, sorts the marked intermediate cluster cores according to their access frequencies, and selects a first cluster core having the highest access frequency. The method assigns first edges in a first radius around the first cluster core to build the first cluster. The method selects a second cluster core having the highest access frequency apart from edges of the first cluster, and assigns second edges in a second radius around second cluster core to build the second cluster. The method partitions the knowledge graph into a first sub-knowledge-graph comprising the first cluster and a second sub-knowledge-graph comprising the second cluster.