https://eureka.patsnap.com/resources/blog/rd-blog/quantum-algorithm-for-tensor-network-contraction-optimization-patent-landscape/ · Patsnap · data cut-off 2026-10-20 · downloaded from the live page
Patent Landscape · Quantum Technologies · Patent Snapshot

Quantum Algorithm for Tensor Network Contraction Optimization Patents

A single-family dataset on quantum tensor network contraction patents, anchored by one NVIDIA filing on quantum oracle decomposition.

1
Published Records
1
Simple Patent Families
US
Leading Jurisdiction
2023
Peak Filing Year

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

  • The search returns one simple patent family and one published record in total. Covering a single invention with no date range to report.
  • NVIDIA Corp is named on the one family in scope. A 100.0% share of a single-row result, not a measure of the field.
  • Every family here carries the G06N IPC subclass. Computing based on AI models, at 100.0% of the one family in scope.
Check your own idea
Published byPatsnap Research··5 min readSourced from Patsnap Eureka
Overview

What this search returns

This search string combines tensor network contraction terminology with quantum algorithm and quantum simulation language, intended to isolate patent filings at the intersection of tensor-network methods and quantum computation. Against that string, the dataset returns exactly one simple patent family and one published record: a single NVIDIA filing on quantum oracle decomposition for simulating quantum computing systems, filed through the United States receiving office.

With only one family in scope, this page is a starting point for a search rather than a map of the field: it tells you what one specific search string surfaces today, not how many inventions actually exist in this space. Broader or adjacent search terms would likely surface more records; treat this result as a probe, not a census.

Records in scope
  1. NVIDIA CORP1

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 Algorithm for Tensor Network Contraction Optimization 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
Data

Filing trend and classification

The figures below describe the one published record and one simple patent family returned by this search string; they are not sized to represent a technology field.

Filing trend (published records by earliest filing year)

The trend series shows a single published record in 2023, with 2024 through 2026 at zero. The window from 2022 onward is still filling in as later filings publish, so a flat or empty recent year reflects publication lag as much as filing activity; no trend judgement can be drawn from one data point.

Filing trend (published records by earliest filing year)001111202320242025020262022 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 one family in scope carries the G06N subclass (Computing based on AI models), at 100.0% of the one simple patent family. No other subclass is discussed here because the dataset is too thin to separate a genuine secondary branch from search-string noise.

IPC subclass compositionG06N · 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 Algorithm for Tensor Network Contraction Optimization 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 Algorithm for Tensor Network Contraction Optimization Patent Landscape with Eureka

This page is one run against one query. Ask Eureka your own question about quantum algorithm for tensor network contraction optimization patent landscape and every answer comes back with the patent numbers behind it.

Try Eureka
Patent in Focus

The record returned by this search

Record returned by this search
US20250061360A12025-02-20

Quantum oracle decomposition for simulating quantum computing systems and applications

NVIDIA CORPORATION

The abstract describes systems and methods for decomposing quantum oracles for simulating quantum circuits. A simulation platform takes in a representation of a quantum circuit containing decomposable Boolean functions that define a quantum oracle, converts that Boolean representation into a set of Boolean functions, and uses them to build an oracle tensor network (described as an MPO sub-tensor network) that exactly represents the Boolean quantum oracle. That oracle tensor network is then incorporated into a larger tensor network representation of the quantum circuit for further processing.This is the first record returned by the database's default ordering, not a ranking by citations, breadth or significance.

US20250061360A1, patent drawing 1US20250061360A1, patent drawing 2
View record US20250061360A1

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 Algorithm for Tensor Network Contraction Optimization 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 →
Dataset Snapshot

What the numbers show

Three figures summarise the full result set: there is no ranking, no trend and no concentration to read beyond what is stated here.

Scope
1 family / 1 record
Total in scope

A single-invention result set

This search string returns one simple patent family and one published record. The two counts are equal here because the invention was filed through a single receiving office, not because records and families are interchangeable in general.

Counted across the full, unrestricted date range of the search string.
Filer
100.0%
Share of the one family

NVIDIA Corp named on the one family

NVIDIA Corp is named on 1 of the 1 simple patent families in scope, a 100.0% share. This is a single-row figure describing one family, not a statement about filing activity across any broader field.

The filer list is not rolled up to corporate group and may omit filings held by named individuals.
Classification
100.0%
Share carrying G06N

G06N present on the one family

The single family in scope carries IPC subclass G06N (Computing based on AI models), covering 100.0% of the one simple patent family. A record can carry more than one IPC class, so this figure is read against the family total, not summed with other classes.

No other subclass is reported here; this dataset cannot separate a minor branch from search noise.
Filing year
2023
Peak year so far

One published record, filed in 2023

The filing-trend series shows one published record with an earliest filing year of 2023, and zero in each year from 2024 through 2026 so far. Years from 2022 onward are still filling in as later-filed applications publish, so the zero years are not evidence of a slowdown.

Counted in published records by earliest filing year, not simple families.
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 algorithm for tensor network contraction optimization 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 Algorithm for Tensor Network Contraction Optimization 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 signal to widen the search, not a conclusion about the technology.

Broaden the search string

Tensor network contraction and quantum simulation are described with varied terminology across filings. Testing adjacent phrasing and related IPC codes in Eureka can surface records this exact string misses.

Explore related search terms →

Read the granted claims directly

The one record here is described only by its abstract on this page. Anyone assessing freedom to operate or claim scope needs to pull the full claim set and file history for US20250061360A1 directly.

Open the full record →
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 Algorithm for Tensor Network Contraction Optimization 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

Common questions about this dataset

Answers are grounded in the same dataset. Derived from one Patsnap search for Quantum Algorithm for Tensor Network Contraction Optimization 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 Algorithm for Tensor Network Contraction Optimization Patent Landscape in depth with Eureka

Go past this page: query the whole quantum algorithm for tensor network contraction optimization 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:(("tensor network contraction" OR "tensor network algorithm") AND ("quantum algorithm" OR "quantum simulation") AND contraction)

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 (G06N) 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.

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.