Abstract: A computer-implemented method, system, and computer program product for dynamic access control to a node in a knowledge graph includes: structuring nodes of a knowledge graph into a plurality of hierarchically organized graph layers; assigning, to a user, an access right to a node of the knowledge graph, the access right to the node selected from a plurality of access rights; and changing the access right to the node dynamically, the changing based on at least one of a structure of the knowledge graph, an access history of the user to the node, and a parameter of the user indicative of a condition outside the knowledge graph.
Type:
Application
Filed:
February 13, 2018
Publication date:
August 15, 2019
Inventors:
Stefan Ravizza, Tim U. Scheideler, Florian Graf, Andrea Giovannini, Frederik Flöther, Erik Rueger
Abstract: A computer-implemented method, system, and computer program product for dynamic access control to a node in a knowledge graph includes: structuring nodes of a knowledge graph into a plurality of hierarchically organized graph layers; assigning, to one or more users, an access right to a first node of the knowledge graph, the access right to the node selected from a plurality of access rights, where different types of users have different access rights; and assigning, to at least one user from the one or more users, an additional access right to a second node of the knowledge graph.
Type:
Application
Filed:
February 26, 2020
Publication date:
June 18, 2020
Inventors:
Stefan Ravizza, Tim U. Scheideler, Florian Graf, Andrea Giovannini, Frederik Flöther, Erik Rueger
Abstract: A computer-implemented method, system, and computer program product for dynamic access control to a node in a knowledge graph includes: structuring nodes of a knowledge graph into a plurality of hierarchically organized graph layers; assigning, to a user, an access right to a node of the knowledge graph, the access right to the node selected from a plurality of access rights; and changing the access right to the node dynamically, the changing based on at least one of a structure of the knowledge graph, an access history of the user to the node, and a parameter of the user indicative of a condition outside the knowledge graph.
Type:
Grant
Filed:
February 13, 2018
Date of Patent:
April 14, 2020
Assignee:
International Business Machines Corporation
Inventors:
Stefan Ravizza, Tim U. Scheideler, Florian Graf, Andrea Giovannini, Frederik Flöther, Erik Rueger
Abstract: A computer-implemented method, system, and computer program product for dynamic access control to a node in a knowledge graph includes: structuring nodes of a knowledge graph into a plurality of hierarchically organized graph layers; assigning, to one or more users, an access right to a first node of the knowledge graph, the access right to the node selected from a plurality of access rights, where different types of users have different access rights; and assigning, to at least one user from the one or more users, an additional access right to a second node of the knowledge graph.
Type:
Grant
Filed:
February 26, 2020
Date of Patent:
September 14, 2021
Assignee:
International Business Machines Corporation
Inventors:
Stefan Ravizza, Tim U. Scheideler, Florian Graf, Andrea Giovannini, Frederik Flöther, Erik Rueger
Abstract: A computer-implemented method, system and computer program product for watermarking quantum models. A precision for a parameter of a quantum model on a quantum computer is determined. The parameter is then truncated based on the determined precision. Furthermore, the watermark is appended in one or more positions of truncated portion of the truncated parameter. In this manner, watermarking quantum models, such as quantum machine learning models, is achieved.
Type:
Application
Filed:
May 18, 2022
Publication date:
November 23, 2023
Inventors:
Frederik Frank Flöther, Matthias Biniok, Shikhar Kwatra, Vladimir Rastunkov
Abstract: Apparatuses, system, and computer-implemented methods to facilitate physical representation of quantum entanglement are provided. According to an embodiment, an apparatus can comprise two or more qubit representation devices that interact with one another in a defined manner, and a display component operatively coupled to at least one of the two or more qubit representation devices, wherein the display component outputs a visual indicator of quantum entanglement between the two or more qubit representation devices.
Type:
Application
Filed:
December 17, 2021
Publication date:
June 22, 2023
Inventors:
Frederik Frank Flöther, Jared Andrew Limberg, Vinod A. Valecha, Freddy Lorge
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.
Type:
Application
Filed:
July 10, 2019
Publication date:
January 14, 2021
Inventors:
Andrea Giovannini, Frederik Frank Flöther, Florian Graf, Stefan Ravizza, Erik Rueger
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.
Type:
Application
Filed:
April 16, 2019
Publication date:
October 22, 2020
Inventors:
Jared Andrew Limberg, Frederik Frank Flöther, Cameron Donald Ferstat, Vinod A. Valecha
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.
Type:
Grant
Filed:
July 10, 2019
Date of Patent:
July 5, 2022
Assignee:
International Business Machines Corporation
Inventors:
Andrea Giovannini, Frederik Frank Flöther, Florian Graf, Stefan Ravizza, Erik Rueger
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.
Type:
Grant
Filed:
April 16, 2019
Date of Patent:
February 7, 2023
Assignee:
International Business Machines Corporation
Inventors:
Jared Andrew Limberg, Frederik Frank Flöther, Cameron Donald Ferstat, Vinod A. Valecha
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.
Type:
Application
Filed:
September 30, 2019
Publication date:
April 1, 2021
Inventors:
Jared Andrew Limberg, Frederik Frank Flöther, Vinod A. Valecha
Abstract: A processor may gather raw data comprising a plurality of characteristic data samples of a target user group. The processor may categorize the characteristic data samples into a plurality of user-related classes and triggers. The processor may build an input property graph for each characteristic data sample. The processor may augment the input property graph by a concept of hierarchies. The processor may determine a modification vector from the augmented input property graph. The processor may train an encoder/decoder combination machine-learning system. An embedding vector and a modification vector are used as input for the decoder to build a trained machine-learning generative model.
Type:
Application
Filed:
May 20, 2022
Publication date:
November 23, 2023
Inventors:
Andrea Giovannini, Frederik Frank Flöther, Patrick Lustenberger, David Ocheltree
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.
Type:
Application
Filed:
May 7, 2020
Publication date:
November 11, 2021
Inventors:
Christian Eggenberger, Frederik Frank Flöther, Shikhar Kwatra, Stefan Ravizza
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.
Type:
Application
Filed:
May 9, 2023
Publication date:
October 12, 2023
Inventors:
Frederik Frank Flöther, Robert E. Loredo, Shikhar Kwatra, Paul R. Bastide
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.
Type:
Grant
Filed:
September 30, 2019
Date of Patent:
January 10, 2023
Assignee:
INTERNATIONAL BUSINESS MACHINES CORPORATION
Inventors:
Jared Andrew Limberg, Frederik Frank Flöther, Vinod A. Valecha
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.
Type:
Application
Filed:
January 28, 2021
Publication date:
July 28, 2022
Inventors:
Frederik Frank Flöther, Robert E. Loredo, Shikhar Kwatra, Paul R. Bastide
Abstract: A knowledge graph is divided into a plurality of sub-graphs, each sub-graph comprising a plurality of vertices and a plurality of edges. The knowledge graph is represented as a summary graph comprising for each of the sub-graphs a summary-graph vertex. A local sub-graph is generated as a copy of one of the sub-graphs together with a copy of a surrounding graph to the one of the sub-graphs. The content of the local sub-graph is modified. The local sub-graph is reintegrated, upon a reintegration trigger event, back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph.
Type:
Application
Filed:
February 28, 2020
Publication date:
June 25, 2020
Inventors:
Tim U. Scheideler, Erik Rueger, Frederik F. Flöther, Stefan Ravizza
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.
Type:
Application
Filed:
September 22, 2020
Publication date:
March 24, 2022
Inventors:
Stefan Ravizza, Shikhar Kwatra, Frederik Frank Flöther, Saurabh Yadav
Abstract: To obtain meaningful computational results despite limits on the amount of data that can be input to a quantum computer, a data selection system uses an iterative approach to select a suitable subset of data to be input to a quantum device for processing by a quantum algorithm. The system compresses and clusters a data set according to a task-specific distribution criteria and selects a subset of this clustered data corresponding to representative cases of the data. The selected subset is processed by the quantum device and the system generates a metric score based on the degree to which the results satisfy a performance criterion. The selected subset is refined over multiple iterations based on successive metric scores until a termination criterion is reached, and the final selected subset of data is used as input to the quantum computer for execution of the processing task.
Type:
Application
Filed:
December 2, 2021
Publication date:
June 8, 2023
Inventors:
Frederik Frank Flöther, Michele Grossi, Vaibhaw KUMAR, Robert E. Loredo
Abstract: A knowledge graph is divided into a plurality of sub-graphs, each sub-graph comprising a plurality of vertices and a plurality of edges. The knowledge graph is represented as a summary graph comprising for each of the sub-graphs a summary-graph vertex. A local sub-graph is generated as a copy of one of the sub-graphs together with a copy of a surrounding graph to the one of the sub-graphs. The content of the local sub-graph is modified. The local sub-graph is reintegrated, upon a reintegration trigger event, back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph.
Type:
Application
Filed:
March 23, 2018
Publication date:
September 26, 2019
Inventors:
Tim U. Scheideler, Erik Rueger, Frederik F. Flöther, Stefan Ravizza