International Business Machines Corporation

Ismail Yunus Akhalwaya

Lior Horesh

John A Gunnels

Mark Steven Squillante

Kenneth Lee Clarkson

Jayram S Thathachar

Tal Kachman

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

An example embodiment of the invention provides a computer-implemented method of clustering data. The method comprises performing, by a clustering module, an npass of clustering on data to produce a plurality of nclusters. A cluster analysis module calculates a plurality of components of each of the nclusters and de-weights a largest component of each of the nclusters to produce a plurality of de-weighted nclusters. The clustering module performs an n+1pass of clustering on the plurality of de-weighted nclusters to produce a plurality of n+1clusters. The method may be reiterated.

Computer-implemented method and computer system for clustering data

Growing community of inventors

Emmarentia, Saudi Arabia

Ismail Yunus Akhalwaya