Eureka on the web
When you want the answer in the next five minutes.
The agent works the prompt against patents and technical literature, citing every source.
Run your analysis now →One family covers quantum-accelerated sparse matrix solving, filed by Origin Quantum in China and published in 2026.
1 published records collapse into 1 simple (DOCDB) families; the difference is the same invention filed in more than one country.
This page tracks a search string built around "sparse matrix" or "matrix multiplication" combined with "quantum algorithm" or "quantum computer" and the term acceleration, applied to titles, abstracts and claims. The result set it returns is a single simple patent family, represented by one published record, filed through China's receiving office.
With only one family in scope, this page is a starting point for a further search rather than a map of a field. A pool this small cannot support any claim about concentration, trend or white space; the figures below describe exactly what the string matched, nothing more.
Ordered by volume only, not by importance or claim strength. Counted in simple (DOCDB) patent families, so one invention filed in several countries counts once. Names come from Patsnap's standardised assignee field as recorded on each document; subsidiaries and group companies are not merged. The icon before each name is read from the name itself (words such as University, Institute or Ltd); the data carries no organisation-type field, so treat it as a reading aid rather than a classification. Filings held by named individuals rather than organisations are removed where they can be identified; that identification is not exhaustive, so an individually held filing can still appear below. Either way those filings stay inside the totals above. This table shows the top 1 of the 1 filers returned for this search; the data endpoint returns at most 100 entities, so even that 1 is not the complete set of filers. A single family can name more than one filer, so these counts overlap and do not add up to the total.
Pick a task. Every answer cites the patents behind it.
The figures below are drawn directly from the matched records: a filing-trend count by earliest filing year, and an IPC subclass breakdown for the single family in scope.
The filing trend shows one published record filed in 2024, with the 2026 slot showing zero. 2022 onward is still filling in as later filings publish, so recent years understate the eventual count; with only one record total, no direction can be read from this chart.
Counted in published records by earliest filing year, not de-duplicated into families. A filing is counted in the year it was filed, but it only becomes visible after it publishes: roughly 18 months for most routes, and up to 30 months where a PCT application enters national phase. 2022 onwards are therefore still filling in and are shaded; no growth figure on this page uses them. Because this series counts documents rather than inventions, a rise can mean more inventions or the same inventions filed in more countries; this dataset cannot separate the two.
The single family in scope carries two IPC subclasses: G06F (Electric digital data processing) and G06N (Computing based on AI models), each at 100.0% of the 1 family in scope. Because one family can carry more than one subclass, these two shares add to more than 100%.
Shares are the percentage of the 1 patent families in scope. One patent family can carry several IPC classes, so the shares add up to more than 100%.
This page is one run against one query. Ask Eureka your own question about quantum sparse matrix multiplication acceleration algorithm patent landscape and every answer comes back with the patent numbers behind it.
Try EurekaThe abstract describes a method for accelerated solving of linear systems on a quantum computer, together with a weather-prediction application and related apparatus. It describes iteratively computing a tridiagonal matrix from two classes of target vectors on a quantum computer, then solving a reduced subspace linear system with that tridiagonal matrix to determine the unknown vector of the original system. The stated aim is faster solving and lower memory use when processing large sparse matrices.This is the first record the search returns under the database's default order, not a ranking by citations, novelty or breadth. Nothing about the field in general should be read from one record.


Selected as the first record the search returns under the database default order, then shown in full. It is not ranked by citations, claim breadth or commercial importance, and it is not a judgement about which filing in this space matters most.
When you want the answer in the next five minutes.
The agent works the prompt against patents and technical literature, citing every source.
Run your analysis now →When it has to run inside your own pipeline.
Patent search, landscape analysis and assignee resolution as MCP tools. Drop them into any agent framework, or call REST directly.
Browse MCP servers →Three figures summarise the scope of this search. Each is reported as counted in the evidence; none should be read beyond what it states.
The search returns one simple patent family, represented by one published record. Family counts and record counts are different units; here they happen to coincide because the family has not yet been published in more than one jurisdiction.
Origin Quantum Computing Tech (Hefei) Co Ltd is named on 1 of the 1 simple patent families in scope, a 100.0% share of that single row. The filer list returned by this search contains organisations only; individually named inventors are excluded from the list but remain inside the total.
The one family in scope carries both G06F (electric digital data processing) and G06N (computing based on AI models), each covering 100.0% of the 1 family. These shares add to more than 100% because a single family can carry more than one subclass.
The search returned exactly one receiving office, China, holding the single published record in scope. This describes where the application was filed, not where any filer is based.
Eureka can read the same corpus for gaps instead of for coverage: under-claimed branches adjacent to quantum sparse matrix multiplication acceleration algorithm patent landscape, with the prior art for and against each one.
A one-family result is a narrow slice of a search string, not a finished landscape. These paths help widen or verify the picture before drawing conclusions.
Try adjacent phrasing such as "quantum linear solver" or "quantum speedup matrix inversion" to see whether related filings sit just outside this string's wording.
Run a broader search in Patsnap Eureka →An abstract cannot establish what CN121681993A's claims actually require. Read the granted claim set directly before drawing any conclusion about scope.
Open the full record in Patsnap Eureka →Filings from 2022 onward are still publishing. Revisit this search periodically to see whether additional records surface in this window.
Set up monitoring in Patsnap Eureka →This specific search string returns one simple patent family, represented by one published record as of the 2026-10-20 retrieval. That reflects only the terms used in this query, "sparse matrix" or "matrix multiplication" combined with "quantum algorithm" or "quantum computer" and the word "acceleration", applied to titles, abstracts and claims. A differently worded search, for example using "quantum linear solver" instead of "matrix multiplication", could return a different set of records, so this count should not be read as the total activity in the broader area.
Origin Quantum Computing Tech (Hefei) Co Ltd is named on the one simple patent family that this search returns, a 100.0% share of that single row. The filer list behind this page excludes individually named inventors, though any such inventors remain inside the total family and record counts. No nationality or country of origin for this filer is available from this dataset; the only location data here is the receiving office, which records where the application was filed.
Its abstract describes a method for accelerated solving of linear systems on a quantum computer, including a tridiagonal-matrix reduction technique and an application to weather prediction, aimed at processing large sparse matrices with faster solving and lower memory use. An abstract and a family count cannot establish what the granted claims actually require or how far they reach; that depends on the claim set and prosecution history, which are not summarised here. Anyone assessing freedom to operate against this filing needs to pull and read the granted claims directly.
This dataset cannot answer that. It contains a single family with one published record, filed in 2024, which is too thin a pool to read any trend, acceleration or slowdown from. Filings from 2022 onward are also still in their publication window, so even a larger pool from this period would understate its eventual count; a one-record series offers no basis for a growth or decline statement at all.
The one published record in this search was filed through China's receiving office, the only office returned by this query. A receiving office records where an application was filed, not where the filing organisation is based, so this detail should not be used to infer any nationality or location for Origin Quantum Computing Tech (Hefei) Co Ltd beyond what the record itself states.
Go past this page: query the whole quantum sparse matrix multiplication acceleration algorithm patent landscape corpus yourself, in your own scope.
Every answer comes back with patent numbers you can open.
Search. Every figure on this page comes from one Patsnap search, run once and not edited afterwards. This is the exact search string:
TAC:(("sparse matrix" OR "matrix multiplication") AND ("quantum algorithm" OR "quantum computer") AND acceleration)
Reading the field codes: TAC searches the title, abstract and claims of each record, not the full description. The search string sets no date limit, so the scope is every matching record in the database regardless of when it was filed. It is not restricted to recent years. How this string was built matters for how far the counts can be pushed. It was generated in batch from a topic list rather than hand-crafted for this page, and the result set is not manually screened. A keyword search over title, abstract and claims both over-captures (unrelated filings that happen to use the same words) and under-captures (the same invention written in different words). This page cannot measure either effect, so read every figure here as what this particular string returned, not as what exists in the field. One subclass (G06F) carries 100.0% of the patent families, so this search returned a classification-tight set.
What is being counted. Two different units appear on this page and they are not interchangeable. The filer list and the technology split are counted in simple (DOCDB) patent families: one invention counts once however many countries it was filed in. The total, the jurisdiction split and the filing-year chart are counted in published records: the same invention counts once per publication. For this search that is 1 records and 1 families. Record counts reward filing in many jurisdictions; family counts do not. Shares are only ever taken against a denominator in the same unit, and each one names it.
Who the filers are. Names come from Patsnap's standardised assignee field, as recorded on the documents themselves. They are not rolled up to corporate group: a parent and its subsidiaries appear as separate entries, and a portfolio acquired from another company stays under the name on the document unless the assignment is reflected there. This list is meant to carry organisations, not people. Filings held by a named individual are identified by matching the assignee against the inventors on the same search, and, for names written in Chinese, Japanese or Korean characters, by the name carrying no organisational suffix; those are removed from the list. Neither test is exhaustive: the inventor list it matches against is itself capped, and a personal name written in Latin script with no organisational wording in it cannot be told apart from a short company name by rule. So an individually held filing can still appear in the list. Those filings stay inside every total and share on this page either way, so the listed entries can add up to less than the total. A record shown in full further down still names its assignee exactly as the patent office records it, including where that is a person: that name is how the record is identified and checked. What is left out of the ranking is people as ranked entries, not people as cited sources. The table shows the top 1 of the 1 filers returned, ordered by count alone; the data endpoint returns at most 100 entities, so even that 1 is not every filer. One patent family can name several filers and each is counted separately, so these rows are not slices of a divided whole: adding them together over-counts, and this page deliberately publishes no combined "top five" share for that reason. See every filer, individuals included
Dates. The year chart counts by earliest filing year, not publication year. A filing only becomes visible once it publishes: roughly 18 months for most routes, and up to 30 months where a PCT application enters national phase. Measured across these pages, the year four back from today still holds only about 89% of its eventual count. 2022 onwards are therefore shaded on the chart as still filling in. The data behind this page was retrieved on 2026-10-20.
Legal status. Legal status was not available for this search, so no in-force figure is shown. Get the status breakdown in Eureka
Classification. The technology split uses IPC subclasses (four characters, for example H01M). A single record usually carries several, so the shares add up to more than 100% and a record can appear in more than one bar. Subclass is a coarse grouping; it describes the field a record was classified into, not what the claims cover. Break the classes down to subgroup level
Who wrote the words. The tables, charts, counts, shares and patent numbers on this page are produced directly from the search result by a program; none of them are written or estimated by a language model. The surrounding prose, headings, FAQ answers and the answers in the question panel are drafted by a language model that is given those same figures and is not permitted to introduce others. Prose can still mis-describe a correct figure, so where the two disagree, the tables and charts are the record.
Disclaimer. This page is generated from Patsnap Eureka data drawn from a limited snapshot of global patent and scientific-literature records, and is provided for general information and reference only.
Patent data carries limitations that apply to every figure above. Recent filings are under-counted, because an application is not public until roughly 18 months after filing and database loading adds further delay. The search string defines and constrains everything shown: records that use different terminology, or that sit outside the fields searched, are absent and cannot be counted. Applicant names, classification codes, legal-status codes and citation records are taken as recorded and may contain errors, duplicates, omissions or stale entries. Ordering by volume is not a measure of quality, scope, enforceability or commercial value, and a larger portfolio is not a stronger one. As a result, the analysis may be incomplete or inaccurate and may not reflect the full technology landscape.
Nothing on this page constitutes an exhaustive prior-art, novelty, freedom-to-operate, validity or infringement search, nor does it constitute legal, financial, investment, or professional advice, and it should not be relied upon as such. No attorney-client relationship is created by it. Any patent, commercial, or strategic decision should be verified independently against the primary records and reviewed with qualified patent, legal, and domain professionals. Patsnap makes no warranties, express or implied, as to the accuracy, completeness, or fitness for any particular purpose of the information presented.
The question panel. The answers behind the suggested questions on this page were written when the page was generated, not in response to your click. The progress steps that play before an answer appears are an animation of how that analysis was done; nothing is being searched or computed at that moment. Typing your own question instead opens Patsnap Eureka, which does run it live.
Machine translation. Assignee and organisation names originally recorded in Chinese, Japanese or Korean have been rendered into English by an AI translation step so that the tables stay readable. These renderings are best-effort and may not match a company's registered English name; the original name is what the underlying patent record carries, and it is what any Eureka query launched from this page uses.
Help us improve
Something wrong, out of date, or missing on this page? Tell us and it goes straight to the team that maintains it.
This page