International Business Machines Corporation

Globalfoundries Inc.

John A Gunnels

Fred Gehrung Gustavson

Alexandre E Eichenberger

Catherine Helen Crawford

Michael K Gschwind

Lior Horesh

Robert G Farrell

Mustafa Canim

David Louis Kaminsky

Mark N Wegman

James C Sexton

Arun Kwangil Iyengar

Giacomo Nannicini

Edwin Peter Dawson Pednault

Grzegorz Michal Swirszcz

Tal Kachman

Valentina Salapura

Achille Belly Fokoue-Nkoutche

Daniel Alan Brokenshire

Michael D Kistler

Tomasz J Nowicki

Vijay Anand Saraswat

Ryan A Musa

Marco Pistoia

Dong Chen

Paul William Coteus

Michael A Blocksome

Jay Michael Gambetta

Alan G Gara

Joseph D Ratterman

Philip Heidelberger

Adam James Muff

Todd Edward Takken

Inseok Hwang

Shakti Kapoor

Martin Ohmacht

Bruce Martin Fleischer

Thomas M Gooding

Robert William Wisniewski

Mark Edwin Giampapa

Burkhard Steinmacher-Burow

Kathryn Mary O'Brien

Mark Gregory Megerian

Ramya Raghavendra

Matthias Augustin Blumrich

Sameh W Asaad

Shawn Anthony Hall

Thomas Winters Fox

John Kevin O'Brien

Ravi Kothari

Chen-Yong Cher

Barry Marshall Trager

Peng Wu

Richard Chen

Charles David Wait

Sameer Kumar

David C Mckay

James Anthony Marcella

Todd Alan Inglett

Mark Steven Squillante

George L Chiu

Krishnan Sugavanam

Gerard Vincent Kopcsay

Jeffrey John Parker

Shaohan Hu

Ali Javadiabhari

Aisha Walcott

Robert Matthew Senger

Yogish Sabharwal

Noel A Eisley

Kenneth Lee Clarkson

Antonio Mezzacapo

Douglas R Miller

Rudolf Adriaan Haring

David L Satterfield

Craig Brian Stunkel

Yutaka Sugawara

Peng Liu

Amith R Mamidala

Kristan D Davis

Jose R Brunheroto

Michael B Mundy

Matthew Roger Ellavsky

Robert E Walkup

James Lee Van Oosten

Samuel J Miller

Ruth Janine Poole

Gabor J Dozsa

Ralph E Bellofatto

Peter Boyle

Brant L Knudson

Norman Christ

Siddhartha Chatterjee

Sarbajit Kumar Rakshit

Brian E Smith

Brett Olsson

James Lawrence McInnes

Shahrokh Daijavad

Henry C Will, Iv

Jayram S Thathachar

Described herein is a simulation of an input quantum circuit, comprising a machine-readable specification of a quantum circuit. Aspects include partitioning the input quantum circuit into a group of sub-circuits based on at least two groups of qubits identified for tensor slicing, wherein the resulting sub-circuits have associated sets of qubits to be used for tensor slicing. The simulating can occur in stages, one stage per sub-circuit. A set of qubits associated with a sub-circuit can be used to partition the simulated quantum state tensor for the input quantum state circuit into quantum state tensor slices, and the quantum gates in that sub-circuit can used to update the quantum state tensor slices into updated quantum state tensor slices. The updated quantum state tensor slices are stored to secondary storage as micro slices.

Simulating quantum circuits on a computer using hierarchical storage

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 method, apparatus and computer program product for establishing a logical connection between an indirect utterance and a transaction is described. An indirect utterance is received from a user as an input to a conversational system. The indirect utterance is parsed to a first logical form. A first set of predicates and terms is mapped from the first logical form to a first subgraph in a knowledge graph. A second set of predicates and terms is mapped from a second logical form belonging to a transaction to a second subgraph of the knowledge graph. A best path in the knowledge graph between the first subgraph and the second subgraph is searched for while transforming the first logical form using the node and edge labels along the best path to generate an intermediate logical form. A system action is performed for a transaction if a graph structure of the intermediate logical form matches the graph structure of the logical form of the transaction above a threshold.

Establishing a logical connection between an indirect utterance and a transaction

A method for performing sparse quantum Fourier transform computation includes defining a set of quantum circuits, each quantum circuit comprising a Hadamard gate and a single frequency rotation operator, said set of quantum circuits being equivalent to a quantum Fourier transform circuit. The method includes constructing a subset of said quantum circuits in a quantum processor, said quantum processor having a quantum representation of a classical distribution loaded into a quantum state of said quantum processor. The method includes executing said subset of said quantum circuits on said quantum state, and performing a measurement in a frequency basis to obtain a frequency distribution corresponding to said quantum state.

Quantum sparse Fourier transform

Techniques and a system for quantum circuit decomposition by integer programming are provided. In one example, a system includes a quantum circuit decomposition component and a simulation component. The quantum circuit decomposition component generates graphical data for a quantum circuit that is indicative of a graphical representation of the quantum circuit. The graphical representation is formatted as a hypergraph. The simulation component simulates the quantum circuit based on the graphical data associated with the hypergraph.

Quantum circuit decomposition by integer programming

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

Methods and systems for locking a cache line of a cache. A cache line is locked based on a count of a plurality of threads that access the cache line and maintained in the cache until all of the plurality of threads have loaded the cache line.

Thread embedded cache management

Physical assistance for identification of an input location on a touchscreen may include detecting that a user has contacted a touchscreen at an initial touch point with a pointing device, predicting an input location from one or more input locations for receiving input on the touchscreen, determining a path from the initial touch point to the predicted input location, and generating a physical cursor on the touchscreen at a location proximate to the pointing device, wherein the physical cursor is a raised portion of the touchscreen.

Physical cursor control in microfluidic display devices

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

A method of detecting cliques in a graph includes determining, based on a number of nodes in the graph, a number of qubits to be included in a quantum processor. The method includes assigning to each node in the graph, a qubit of the quantum processor. The method includes operating on the qubits with a preparation circuit to create a quantum state in the qubits that corresponds to the graph. The method includes operating on the quantum state with a random walk circuit, and measuring the qubits of the quantum processor to detect cliques in the graph. The preparation circuit comprises a plurality of single- and two-qubit operators, wherein, for each pair of adjacent nodes in the graph, an operator of the plurality of two-qubit operators acts on a pair of qubits corresponding to the pair of adjacent nodes to create the quantum state.

Quantum walk for community clique detection

In an embodiment, a method of sketching using a hybrid quantum-classical system includes creating a set of clustered data sets from a first data set. In an embodiment, the method includes evaluating, using a quantum processor and quantum memory, the set of clustered data sets. In an embodiment, the method includes evaluating, using the quantum processor and quantum memory, a set of quality metrics for the set of clustered data sets. In an embodiment, the method includes reclustering, responsive to at least one of the set of quality metrics failing to meet a quality criterion, the first data set.

Sketching using a hybrid quantum-classical system

Techniques for providing a reusable filled bottle are provided. A stations receives a bottle request from a user and uses information from the request to select and associate a sanitized bottle to the user. The user is charged for a bottle rental and provided with a filled reusable bottle. The user may also return the bottle to the station to have the bottle refilled or return the bottle such that the bottle rental is completed and the bottle no longer associated with the user.

Liquid bottle processing and refilling

A computer implemented method includes receiving a digital description of a quantum circuit, partitioning the digital description of the quantum circuit into a plurality of quantum sub-circuits wherein each quantum sub-circuit of the plurality of quantum sub-circuits comprises one or more quantum gates, determining sub-circuit dependencies for the plurality of quantum sub-circuits, simulating the plurality of quantum sub-circuits according to the sub-circuit dependencies to produce simulation results for each quantum sub-circuit of the plurality of quantum sub-circuits, wherein a first and a second quantum sub-circuit of the plurality of quantum sub-circuits each contain one or more gates that are applied to a common qubit, and wherein the first and the second quantum sub-circuit are simulated independently using an entangled tensor index. A corresponding computer system and computer program product are also disclosed herein.

Simulating quantum circuits

Hybrid classical-quantum decision maker training includes receiving a training data set, and selecting, by a first processor, a sampling of objects from the training set, each object represented by at least one vector. A quantum processor applies a quantum feature map to the selected objects to produce one or more output vectors. The first processor determines one or more distance measures between pairs of the output vectors, and determines at least one portion of the quantum feature map to modify the classical feature map. The first processor adds an implementation of the at least one portion of the quantum feature map to the classical feature map to generate an updated classical feature map.

Quantum space distance estimation for classifier training using hybrid classical-quantum computing system

Growing community of inventors

Somers, NY, United States of America

John A Gunnels