International Business Machines Corporation

Takashi Imamichi

Rudy Raymond Harry Putra

Ikko Hamamura

Marco Aurelio Stelmar Netto

Marcos Dias De Assuncao

Hidetoshi Numata

Tsuyoshi Ide

Atsushi Matsuo

Bruno Flach

Maira A De C Gatti

Marco Pistoia

Tetsuro Morimura

Hiroki Yanagisawa

Stefan Woerner

Raymond Harry Rudy

Daniel Josef Egger

Maira Athanazio De Cerqueira Gatti

Teruo Koyanagi

Toshinari Itoko

Alvaro Bueno Buoro

Yachiko Obara

Bruno Da Costa Flach

Raymond H P Rudy

Yuya Unno

Jennifer Ranae Glick

VQE is accelerated by performing receiving a qubit Hamiltonian representing a linear combination of a plurality of Pauli strings. Selecting, among the plurality of Pauli strings, one or more Pauli strings that have less influence than a threshold on an eigenvalue of the qubit Hamiltonian. Grouping, based on joint measurability, the unselected Pauli strings among the plurality of Pauli strings into a plurality of groups of jointly measurable Pauli strings Determining that one or more of the selected one or more Pauli strings is jointly measurable with Pauli strings in one of the plurality of groups And adding one or more of the selected one or more Pauli strings to the one of the plurality of groups.

Selection of pauli strings for variational quantum eigensolver

Methods and apparatuses for designing quantum circuits include generating a Pauli graph from Pauli strings in a qubit Hamiltonian. Nodes are merged in the Pauli graph, responsive to a determination that some Pauli strings are observables that are jointly measurable by entangled measurement. A quantum circuit based is generated on a merged Pauli graph that results from merging the nodes.

Grouping of Pauli strings using entangled measurements

Systems and methods that address an optimized method to improve systems and methods for handling inequality constraints in mixed binary optimization problems on quantum computers and to solve local optima which significantly improves system performance. Embodiments employ an improved methodology that can optimize parameters, determine an optimal slack variable and optimize variational parameters for fixed slack variables. This procedure allows to move out of local minima, solve an optimization and improve the system performance by providing optimal results. These embodiments also extend to variational hybrid quantum/classical algorithms for gate-based quantum computers.

System and method for handling inequality constraints in mixed binary optimization on quantum computers

Selection of Pauli strings for Variational Quantum Eigensolver

Configuring a quantum computing system to determine a solution to an optimization problem includes encoding the optimization problem in an encoding language to produce an encoded optimization model. The encoded optimization model is transformed into a unconstrained model. The encoded optimization model includes an objective function having one or more terms. The one or more terms are converted to one or more Pauli terms. An Ising Hamiltonian is generated using the one or more terms. The Ising Hamiltonian corresponds to the optimization problem. An instruction indicative of the Ising Hamiltonian is provided to the quantum computing system.

Automatic generation of Ising Hamiltonians for solving optimization problems in quantum computing

The illustrative embodiments provide a method, system, and computer program product. In an embodiment, a method includes receiving a set of Pauli observables. In an embodiment, a method includes initializing a measurement basis, the measurement basis comprising a set of Pauli bases equivalent to a number of qubits of a quantum processor. In an embodiment, a method includes creating a list of a set of Bell basis candidates, each of the set of Bell basis candidates configured to measure at least one of the set of Pauli observables. In an embodiment, a method includes selecting a Bell basis candidate from the set of Bell basis candidates. In an embodiment, a method includes reconfiguring the measurement basis to replace a subset of the set of Pauli bases with the selected Bell basis candidate.

Grouping of Pauli observables using Bell measurements

Methods and apparatuses for designing quantum circuits include obtaining Pauli strings included in a qubit Hamiltonian. At least some of the strings are grouped, based at least partially on a judgment of whether Pauli strings are observables that are jointly measurable by entangled measurement, at least at some operators. A quantum circuit is designed based on a result obtained from the grouping.

A computer-implemented method is provided for generating a new formulation. The method includes dividing each of input formulations into constituent topics, based on analysis results for an analysis of the input formulations using a topic model algorithm. The method further incudes includes receiving an input query that specifies a set of fragrance. notes to he used to generate the new formulation, The method also includes choosing one of the input formulations which includes the set of fragrance notes to be used to generate the new formulation. The method additionally includes clustering the constituent topics of the chosen one of the input formulations based on a similarity metric. The method further includes generating the new formulation as a response to the input query by selecting, from the input formulations, materials for each of the clustered ones of the constituent topics.

Topic clustering to generate formulations

A computer-implemented method, an automatic pest control monitoring system and computer program product automatically monitor for pests on crops. An autonomous vehicle equipped with a normal camera and at least one alternate camera, simultaneously captures a normal image and a true alternate image containing a same portion of the crops. A composite image is generated using the difference of the captured images. If at least one pest is determined to present by applying an object recognition algorithm to the composite image, reactive measures are automatically deployed. The alternate camera may be an infrared camera or an ultraviolet camera. The composite image is generated by correlating the normal image with the true alternate image, determining the differences between the normal image and the true alternate image, and generating the composite image based on the differences between the normal image and the true alternate image.

Automatic pest monitoring by cognitive image recognition with two cameras on autonomous vehicles

An information processing apparatus, a calculation method, a program, and a storage medium for generating a uniformly distributed discrete pattern. To calculate a spatial arrangement of a plurality of elements of a discrete pattern, the plurality of elements being arranged in a spatially discrete manner, an information processing apparatus according to the present invention determines, for each of the elements, a density in an initial position given to the element from a density distribution of the elements in a region where the elements are arranged in the discrete pattern and places, for the initial position of each of the elements, a figure having a size corresponding to the density and representing a region where the element repels other elements and a movement range of the figure. The information processing apparatus minimizes an objective function, computes an optimal solution, and outputs the optimal solutions.

Information processing apparatus, calculation method, program, and storage medium

Embodiments relate to a computer implemented information processing system, method and program product for data access. The information processing system includes a data store having a top tier store and at least another tier store with the top tier store including a counter for each entry of a symbol and another tier store including a representative frequency value defined for the another tier store. A sorter is also provided configured to sort the symbol in the top tier store and the another tier stores according to a value generated in the counter for the assessed symbol. The said sorter is also configured to restore entry of the symbol in the top tier store, in response to a symbol having moved from said top tier store to another tier store, by using the representative frequency value defined for said another store to which said symbol was moved.

Data store capable of efficient storing of keys

Likely disconnections or system-level-impact producing slowdown in a flow parameter in a network can be identified by annotating a graph representing the network with a weight to edges of a graph representing the network. The weight can be linearly or non-linearly proportional to the inverse of the severity of the impact, and/or linearly or non-linearly proportional to the inverse of the likelihood of disconnection. Minimal cut sets needed to generate a disconnection in the network are identified from the annotated network based on the weights on the edges. Subsets of each minimal cut set are generated and evaluated during a simulation. The subsets can correspond to almost isolated scenarios for the network. The scope of the simulations can be reduced by selecting the minimal cut sets employing the weight.

Efficient evaluation of network robustness with a graph

A weather forecast system, method of forecasting weather and a computer program product therefor. A forecasting computer applies a grid to a forecast area and provides a weather forecast for each grid cell. Population movement sensors sense population movement in the area. A swarm detector detects patterns in area population movement that indicate swarm activity, from which the swarm detector predicts swarm patterns. A planning module receives area weather forecasts and swarm patterns, and provides swarm path indications to the forecasting system for adjusting the grid applied to the forecast area.

Growing community of inventors

Kanagawa, Japan

Takashi Imamichi