About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Conference paper
From extensional to intensional description
Abstract
Quantum search is well suited to spaces that can be described in brief encodings, such as integers or a set of algorithmic transformations in an abbreviated representation, but needs adaptation to deal efficiently with datasets. A method is presented for exploiting the global aggregation properties of a search operator so that the data space (extension) and algorithmic space can be explored in parallel rather than in succession.