Patent application number | Description | Published |
20080270376 | WEB SPAM PAGE CLASSIFICATION USING QUERY-DEPENDENT DATA - A web spam page classifier is described that identifies web spam pages based on features of a search query and web page pair. The features can be extracted from training instances and a training algorithm can be employed to develop the classifier. Pages identified as web spam pages can be demoted and/or removed from a relevancy ranked list. | 10-30-2008 |
20080313147 | Multi-level search - A computer-implementable method and system for performing a multi-level search. The method includes performing a primary search that involves executing a query submitted by a user, and returning primary search results (a list of documents, for example). The method further includes automatically performing a secondary search. The secondary search involves identifying at least one third-party source of information based on the query, and automatically assessing a semantic interpretation of the query. The secondary search utilizes the identified at least one third-party source of information and the semantic interpretation of the query to derive secondary search results, which are displayed along with the primary search results. | 12-18-2008 |
20100153315 | BOOSTING ALGORITHM FOR RANKING MODEL ADAPTATION - Model adaptation may be performed to take a general model trained with a set of training data (possibly large), and adapt the model using a set of domain-specific training data (possibly small). The parameters, structure, or configuration of a model trained in one domain (called the background domain) may be adapted to a different domain (called the adaptation domain), for which there may be a limited amount of training data. The adaption may be performed using the Boosting Algorithm to select an optimal basis function that optimizes a measure of error of the model as it is being iteratively refined, i.e., adapted. | 06-17-2010 |
Patent application number | Description | Published |
20140026107 | METHOD AND SYSTEM FOR OPTIMAL DECOMPOSITION OF SINGLE-QUBIT QUANTUM CIRCUITS USING STANDARD QUANTUM GATES - The current application is directed to methods and systems which produce a design for an optimal approximation of a target single-qubit quantum operation comprising a representation of a quantum-circuit generated from a discrete, quantum-gate basis. The discrete quantum-gate basis comprises standard, implementable quantum gates. The methods and systems employ a database of canonical-form quantum circuits, an efficiently organized canonical-form quantum-circuit, and efficient searching to identify a minimum-cost design for decomposing and approximating an input target quantum operation. | 01-23-2014 |
20140026108 | METHOD AND SYSTEM FOR DECOMPOSING SINGLE-QUBIT QUANTUM CIRCUITS INTO A DISCRETE BASIS - The current application is directed to methods and systems which transform a given single-qubit quantum circuit expressed in a first quantum-gate basis into a quantum-circuit expressed in a second, discrete, quantum-gate basis. The discrete quantum-gate basis comprises standard, implementable quantum gates. The given single-qubit quantum circuit is expressed as a normal representation. The normal representation is generally compressed, in length, with respect to equivalent non-normalized representations. The method and systems additionally provide a mapping from normal representations to canonical-form representations, which are generally further compressed, in length, with respect to normal representations. The normal and canonical-form representations can be used to implement methods and systems for search-based quantum-circuit design. Neither this section nor the sections which follow are intended to either limit the scope of the claims which follow or define the scope of those claims. | 01-23-2014 |
20140264288 | METHOD AND SYSTEM THAT IMPLEMENT A V-GATE QUANTUM CIRCUIT - The current application is directed to methods and quantum circuits that prepare qubits in specified non-stabilizer quantum states that can, in turn, be used for a variety of different purposes, including in a quantum-circuit implementation of an arbitrary single-qubit unitary quantum gate that imparts a specified, arbitrary rotation to the state-vector representation of the state of an input qubit. In certain implementations, the methods and systems consume multiple magic-state qubits in order to carry out probabilistic rotation operators to prepare qubits with state vectors having specified rotation angles with respect to a rotation axis. These qubits are used as resources input to various quantum circuits, including the quantum-circuit implementation of an arbitrary single-qubit unitary quantum gate, including a V gate. | 09-18-2014 |
20140280404 | METHOD AND SYSTEM THAT PRODUCES NON-STABILIZER QUANTUM STATES THAT ARE USED IN VARIOUS QUANTUM CIRCUITS AND SYSTEMS - The current application is directed to methods and quantum circuits that prepare qubits in specified non-stabilizer quantum states that can, in turn, be used for a variety of different purposes, including in a quantum-circuit implementation of an arbitrary single-qubit unitary quantum gate that imparts a specified, arbitrary rotation to the state-vector representation of the state of an input qubit. In certain implementations, the methods and systems consume multiple magic-state qubits in order to carry out probabilistic rotation operators to prepare qubits with state vectors having specified rotation angles with respect to a rotation axis. These qubits are used as resources input to various quantum circuits, including the quantum-circuit implementation of an arbitrary single-qubit unitary quantum gate. | 09-18-2014 |
Patent application number | Description | Published |
20100318540 | IDENTIFICATION OF SAMPLE DATA ITEMS FOR RE-JUDGING - Described is a technology for identifying sample data items (e.g., documents corresponding to query-URL pairs) having the greatest likelihood of being mislabeled when previously judged, and selecting those data items for re-judging. In one aspect, lambda gradient scores (information associated with ranked sample data items that indicates a relative direction and how “strongly” to move each data item for lowering a ranking cost) are summed for pairs of sample data items to compute re-judgment scores for each of those sample data items. The re-judgment scores indicate a relative likelihood of mislabeling. Once the selected sample data items are re-judged, a new training set is available, whereby a new ranker may be trained. | 12-16-2010 |
20110208735 | Learning Term Weights from the Query Click Field for Web Search - Described is a technology by which a term frequency function for web click data is machine learned from raw click features extracted from a query log or the like and training data. Also described is using combining the term frequency function with other functions/click features to learn a relevance function for use in ranking document relevance to a query. | 08-25-2011 |
20120158710 | MULTI-TIERED INFORMATION RETRIEVAL TRAINING - Methods and systems for multi-tiered information retrieval training are disclosed. A method includes identifying results in a ranked ordering of results that can be swapped without changing a score determined using a first ranking quality measure, determining a first vector and at least one other vector for each identified swappable result in the ranked ordering of results based on the first ranking quality measure and at least one other ranking quality measure respectively, and adding the first vector and the at least one other vector for each identified swappable result in the ranked ordering of results to obtain a function of the first vector and the at least one other vector. Access is provided to the function of the first vector and the at least one other vector for use in the multi-tiered information retrieval training. | 06-21-2012 |
20130091128 | Time-Aware Ranking Adapted to a Search Engine Application - Techniques provide time-aware ranking, such as ranking of information, files or URL (uniform resource locator) links. For example, time-aware modeling assists in determining user intent of a query to a search engine. In response to the query, results are ranked in a time-aware manner to better match the user intent. The ranking may model query, URL and query-URL pair behavior over time to create time-aware query, URL and query-URL pair models, respectively. Such models may predict behavior of a query-URL pair, such as frequency and timing of clicks to the URL of the pair when the query of the pair is posed to the search engine. Results of a query may be ranked by predicted query-URL behavior. Once ranked, the results may be sent to the user in response to the query. | 04-11-2013 |
20130238608 | SEARCH RESULTS BY MAPPING ASSOCIATED WITH DISPARATE TAXONOMIES - Architecture that generates signals/features that capture the match between intent of a query and category of documents. For example, for a query intent related to “autos”, documents that belong to categories related to “Autos” receive a higher score than documents of a “computers” category. The architecture can be applied to a search ecosystem where query intent classification and document category classifier are available, learns the mapping between query intent and document category, and introduces category-match features to a ranking algorithm, thereby improving search result relevance. The architecture learns the mapping between two existing and different taxonomies to create a category match signal from which the ranking algorithm can learn. Moreover, architecture adapts to a complex ecosystem where different taxonomies on the query side and document side exist through learning a mapping score between at least two taxonomies. | 09-12-2013 |
20130246495 | Quantum Arithmetic On Two-Dimensional Quantum Architectures - 2D nearest-neighbor quantum architectures for Shor's factoring algorithm may be accomplished using the form of three arithmetic building blocks: modular addition using Gossett's carry-save addition, modular multiplication using Montgomery's method, and non-modular multiplication using an original method. These arithmetic building blocks may assume that ancillae are cheap, that concurrent control may be available and scalable, and that execution time may be the bottleneck. Thus, the arithmetic building blocks may be optimized in favor of circuit width to provide improved depth existing nearest-neighbor implementations. | 09-19-2013 |
20140280427 | METHOD AND SYSTEM FOR DECOMPOSING SINGLE-QUBIT QUANTUM CIRCUITS INTO A DISCRETE BASIS - A target quantum circuit expressed in a first quantum gate basis may be transformed into a corresponding quantum circuit expressed in a second quantum gate basis, which may be a universal set of gates such as a V gate basis set. The target quantum circuit may be expressed as a linear combination of quantum gates. The linear combination of quantum gates may be mapped to a quaternion. The quaternion may be factorized, based at least in part on an amount of precision between the target quantum circuit and the corresponding quantum circuit expressed in the second quantum gate basis, into a sequence of quaternion factors. The sequence of quaternion factors may be mapped into a sequence of quantum gates of the second quantum gate basis, where the sequence of sequence of quantum gates is the corresponding quantum circuit. | 09-18-2014 |
20140297708 | Fast Quantum and Classical Phase Estimation - A quantum phase estimator may include at least one phase gate, at least one controlled unitary gate, and at least one measurement device. The quantum phase estimator receives at least one ancillary qubit and a calculational state comprised of multiple qubits. The phase gate may apply random phases to the ancillary qubit, which is used as a control to the controlled unitary gate. The controlled unitary gate applies a second random phase to the calculational state. The measurement device may measure a state of the ancillary qubit from which a phase of the calculational state may be determined. | 10-02-2014 |