https://eureka.patsnap.com/resources/blog/rd-blog/quantum-sparse-matrix-multiplication-acceleration-algorithm-patent-landscape/ · Patsnap · data cut-off 2026-10-20 · downloaded from the live page
Patent Landscape · Quantum computing

Quantum Sparse Matrix Multiplication Acceleration Algorithm Patents

One family covers quantum-accelerated sparse matrix solving, filed by Origin Quantum in China and published in 2026.

1
Published Records
1
Simple Patent Families
CN
Leading Jurisdiction
2024
Peak Filing Year

1 published records collapse into 1 simple (DOCDB) families; the difference is the same invention filed in more than one country.

  • One simple patent family matches this search string across the full dataset retrieved on 2026-10-20.
  • Origin Quantum Computing Tech (Hefei) Co Ltd is named on that single family, a 100.0% share of the 1 family in scope.
  • The one published record was filed through China's receiving office, the only office this search returned.
Check your own idea
Published byPatsnap Research··5 min readSourced from Patsnap Eureka
Overview

What this search returns

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.

Scope of the matched dataset
  1. ORIGIN QUANTUM COMPUTING TECH (HEFEI) CO LTD1

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.

Source: Patsnap Eureka. Assignee ranking and totals. Derived from one Patsnap search for Quantum Sparse Matrix Multiplication Acceleration Algorithm Patent Landscape, covering all matching records regardless of filing date (the search string sets no date limit), retrieved 2026-10-20. Counts cover published records only and move as new filings publish.Run this in Eureka MCP

Let an AI agent run this analysis on your own technology

Pick a task. Every answer cites the patents behind it.

10,000 free credits to start
Data

Filing trend and technology composition

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.

Filing trend (published records)

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.

Filing trend (published records)00111120242025020262022 onwards are shaded as still filling in: a filing is only visible once it publishes, up to 30 months after filing.

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.

IPC subclass composition

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%.

IPC subclass compositionG06F · Electric digital data processi…1100.0%G06N · Computing based on AI models1100.0%

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%.

Source: Patsnap Eureka. Filing trend and technology composition. Derived from one Patsnap search for Quantum Sparse Matrix Multiplication Acceleration Algorithm Patent Landscape, covering all matching records regardless of filing date (the search string sets no date limit), retrieved 2026-10-20. Counts cover published records only and move as new filings publish.

Go deeper on Quantum Sparse Matrix Multiplication Acceleration Algorithm Patent Landscape with Eureka

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 Eureka
Record on file

The one matched record

Full record
CN121681993A2026-03-17

CN121681993A

Origin Quantum Computing Technology (Hefei) Co., Ltd.

The 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.

CN121681993A, patent drawing 1CN121681993A, patent drawing 2
View 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.

Source: Patsnap Eureka. The first record the search returned, shown in full. Derived from one Patsnap search for Quantum Sparse Matrix Multiplication Acceleration Algorithm Patent Landscape, covering all matching records regardless of filing date (the search string sets no date limit), retrieved 2026-10-20. Counts cover published records only and move as new filings publish.Run this in Eureka MCP
Run it yourself

Put your own technology through the same analysis


  
Where to run it
Fastest

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 →
For builders

MCP server & REST API

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 →
Key figures

What the numbers show

Three figures summarise the scope of this search. Each is reported as counted in the evidence; none should be read beyond what it states.

Scope
1 family / 1 record
simple patent families / published records

One family, one record

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.

Counted as of retrieval on 2026-10-20
Filer
100.0%
share of 1 family held by the top-named filer

Single filer named

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.

Filer rows are not summed across the list
Technology
G06F & G06N
IPC subclasses on the 1 family, each at 100.0%

Two IPC subclasses recorded

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.

Shares taken against the 1-family denominator
Geography
China · 1 of 1
receiving offices returned by this search

One receiving office on file

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.

Office counts sum to the record total, not the family total
Eureka AI Agent
Looking for what nobody has claimed yet?

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.

Find the white space →
Source: Patsnap Eureka. Derived observations on the same dataset. Derived from one Patsnap search for Quantum Sparse Matrix Multiplication Acceleration Algorithm Patent Landscape, covering all matching records regardless of filing date (the search string sets no date limit), retrieved 2026-10-20. Counts cover published records only and move as new filings publish.Run this in Eureka MCP
Next steps

Where to take this from here

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.

Broaden the search terms

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 →

Pull the granted claims

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 →

Track future publications

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 →
Source: Patsnap Eureka. Suggested next steps. No new data: every figure named here is one of those above. Derived from one Patsnap search for Quantum Sparse Matrix Multiplication Acceleration Algorithm Patent Landscape, covering all matching records regardless of filing date (the search string sets no date limit), retrieved 2026-10-20. Counts cover published records only and move as new filings publish.Run this in Eureka MCP
FAQ

Questions practitioners ask about this search

Answers are grounded in the same dataset. Derived from one Patsnap search for Quantum Sparse Matrix Multiplication Acceleration Algorithm Patent Landscape, covering all matching records regardless of filing date (the search string sets no date limit), retrieved 2026-10-20. Counts cover published records only and move as new filings publish.Run this in Eureka MCP

Research Quantum Sparse Matrix Multiplication Acceleration Algorithm Patent Landscape in depth with Eureka

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.

Try Eureka
How this page was built, and what the numbers do and do not mean

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.