International Business Machines Corporation

Globalfoundries Inc.

Mark N Wegman

Michele M Franceschini

Luis Alfonso Lastras-Montano

Livio B Soares

Vadakkedathu Thomas Rajan

Murray Robert Cantor

Peter Kenneth Malkin

Douglas Neil Kimelman

Tova Roth

Paul Michael Matchen

David Louis Kaminsky

John A Gunnels

Evelyn Duesterwald

Tamir Klinger

Peri L Tarr

Stanley M Sutton

Darrell Christopher Reimer

Vugranam Chakravarthy Sreedhar

Haifeng Qian

Clay Edwin Williams

Richard B Segal

Karin Hogstedt

John Peter Karidis

Stephen Fink

John Thomas Richards

Bard Bloom

Ian D Simmonds

Sunita Chulani

Giuseppe Valetto

Dimitri Kanevsky

Ali Afzali-Ardakani

Jay Michael Gambetta

Thomas Mittelholzer

Sara H Basson

Gustavo Alejandro Stolovitzky

Peter Anthony Franaszek

Stanislav Polonsky

Hongbo Peng

Rafah A Hosn

David C Mckay

Bruce D Lucas

Ali Javadiabhari

Jason L Crawford

Charles Francis Wiecha

Mary Elizabeth Helander

Barry Leiba

John H Field

John L Carter

Joel P Ossher

Kate Ehrlich

Maria-Cristina V Marinescu

Ajay A Royyuru

Alan A Donovan

Ashish Jagmohan

Jing Min Xu

Lin Y Yang

Jeffrey Owen Kephart

Samuel Scott Adams

Fan Jing Meng

David Francis Bacon

Peter Francis Sweeney

John Martin Prager

Peter C Bahrs

David M Ungar

Vasanth Bala

Todd W Mummert

Wim De Pauw

Dharmashankar Subramanian

Anthony T Brew

Paul Turquand Keyser

Gerald James Tesauro

Bowen L Alpern

Arun Raman

Glenn S Ammons

Balachandar Rajaraman

Eran Yahav

Martin Vechev

Vinh Tuan Thai

Roy Jefferson Byrd

Yael Ravin

John M Vlissides

Alina Beygelzimer

Joseph Gil

Tawanna R Dillahunt

Sarah C McAllister

Nathan Cullen

Greta Yorsh

Avik Sinha

Annie T T Ying

Robert Delmonico

Victor S Miller

Daniel Tunkelang

Shlomo Hershkop

Vadekkadathu T Rajan

David Hod Lorenz

Frank Kenneth Zadeck

George Markowsky

Sunita Devnani Chulani

Giuiseppe Valetto

Vedakkedathu T Rajan

Systems, computer-implemented methods, and computer program products to facilitate quantum computing job scheduling 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 scheduler component that can determine a run order of quantum computing jobs based on one or more quantum based run constraints. The computer executable components can further comprise a run queue component that can store the quantum computing jobs based on the run order. In an embodiment, the scheduler component can determine the run order based on availability of one or more qubits comprising a defined level of fidelity.

Co-scheduling quantum computing jobs

A training method, system, and computer program product include training a neural network including at least one of using norm-pooling as a non-linear function, using a two-sided ReLU as a non-linear function, and increasing a confidence gap and further training such that the network comprises a non-expansive network.

L2-nonexpansive neural networks

Techniques facilitating cached result use through quantum gate rewrite are provided. In one example, a computer-implemented method comprises converting, by a device operatively coupled to a processor, an input quantum circuit to a normalized form, resulting in a normalized quantum circuit; detecting, by the device, a match between the normalized quantum circuit and a cached quantum circuit among a set of cached quantum circuits; and providing, by the device, a cached run result of the cached quantum circuit based on the detecting.

Cached result use through quantum gate rewrite

A training method, system, and computer program product include training a neural network including using two-sided ReLU as a non-linear function or norm-pooling as a non-linear function and increasing a confidence gap.

Techniques for improved neural network modeling are provided. In one embodiment, a system comprises a memory that stores computer-executable components and a processor that executes the components. The computer-executable components can comprise a loss function logic component that determines a penalty based on a training term, the training term being a function of a relationship between an output scalar value of a first neuron of a plurality of neurons of a neural network model, a plurality of input values from the first neuron, and one or more tunable weights of connections between the plurality of neurons; an optimizer component that receives the penalty from the loss function component, and changes one or more of the tunable weights based on the penalty; and an output component that generates one or more output values indicating whether a defined pattern is detected in unprocessed input values received at the neural network evaluation component.

Facilitating neural networks

A training method, system, and computer program product include computing a matrix norm over a product of a weight matrix and a transpose of the weight matrix and using the matrix norm to constrain the L2 non-expansive neural network.

A method for adaptive error correction in quantum computing includes executing a calibration operation on a set of qubits, the calibration operation determining an initial state of a quantum processor. In an embodiment, the method includes estimating, responsive to determining an initial state of the quantum processor, a runtime duration for a quantum circuit design corresponding to a quantum algorithm, the quantum processor configured to execute the quantum circuit design. In an embodiment, the method includes computing an error scenario for the quantum circuit design. In an embodiment, the method includes selecting, using the error scenario and the initial state of the quantum processor, a quantum error correction approach for the quantum circuit design. In an embodiment, the method includes transforming the quantum algorithm into the quantum circuit design, the quantum circuit design including a set of quantum logic gates.

Adaptive error correction in quantum computing

According to an aspect, searching, recommending, and exploring documents through conceptual associations includes a method for receiving a plurality of documents and extracting concepts from each of the documents. A degree of relation between each of the documents and concepts in a knowledge base is calculated. The method also includes, in response to receiving a query, determining one or more concepts from the query. For each of the concepts, a list of documents having a highest degree of relation to the concept is retrieved. The method also includes outputting a list that is responsive to the one or more retrieved lists.

System for searching, recommending, and exploring documents through conceptual associations

A shared ledger of transactions may be used for various purposes and may be later accessed by interested parties for ledger verification. Authenticity of transactions requires active measures to ensure transaction participants including parties to the transactions, observers to the transaction, etc., are providing accurate information for each transaction. One example method of operation may include one or more of performing one or more transactions between a subset of participants of a shared ledger system or subsystem which includes the subset of participants and witnesses assigned to the subset of participants, and synchronizing the one or more transactions exclusively by the subset of participants and the assigned witnesses, so the one or more of the transactions between the subset of participants exist with no common witnesses.

Scalable and distributed shared ledger transaction management

A shared ledger of transactions may be used for various purposes and may be later accessed by interested parties for ledger verification. Authenticity of transactions requires active measures to ensure transaction participants including parties to the transactions, observers to the transaction, etc., are providing accurate information for each transaction. One example method of operation may include one or more of identifying a set of participants to one or more transactions, transmitting a request from an initiating participant to enable each of the set of participants to generate local numbers based on a number source, forwarding the local numbers to one or more of the set of participants before expiration of a specified time interval, receiving the local numbers at the initiating participant, and generating a final number based on the local numbers received, so that after a last participant among the set of participants has forwarded the local number, none of the set of participants can obtain the final number until after a limited amount of time.

According to an aspect, automatically adding new concepts to a concept graph includes receiving a string of text, searching a corpus of data to locate additional text related to the string of text, and extracting concepts from the additional text. The extracted concepts include a subset of concepts in the concept graph. The adding new concepts also includes determining whether the string of text should be linked to an existing concept in the concept graph, performing the linking based on determining that the string of text should be linked to the existing concept in the concept graph and, based on determining that the string of text should not be linked to an existing concept in the concept graph, adding a new concept to the concept graph. The new concept is associated with the string of text.

Automatic new concept definition

According to an aspect, searching, recommending, and exploring documents through conceptual associations includes receiving a plurality of documents and extracting concepts from each of the documents. A degree of relation between each of the documents and concepts in a knowledge base is calculated. An aspect also includes, in response to receiving a query, determining one or more concepts from the query. For each of the concepts, a list of documents having a highest degree of relation to the concept is retrieved. An aspect also includes outputting a list that is responsive to the one or more retrieved lists.

Growing community of inventors

Ossining, NY, United States of America

Mark N Wegman