Quantum computing is an emerging field with increasing patent activity in the United States. The USPTO evaluates quantum computing inventions under the same general patent laws, with particular scrutiny on patent eligibility (35 U.S.C. § 101), novelty (§102), non-obviousness (§103), and written description/enablement (§112).

Due to the abstract mathematical nature of quantum algorithms, patent examiners often challenge quantum computing patents on the basis that they are “abstract ideas” unless a concrete technological improvement is claimed. Below are detailed cases and guidance.

1. Ex parte Yudong Cao (PTAB, 2025)

Facts:

The patent application was for a hybrid quantum-classical computing method for solving linear systems of equations.

The USPTO examiner rejected the claims as abstract mathematics, ineligible under §101.

PTAB Decision:

The Board reversed the rejection, stating that the invention improved the technological function of quantum computing systems, not just mathematical computation.

The claim was patentable because it integrated mathematical methods into a specific technological process that enhanced performance of quantum-classical hybrid computers.

Significance:

This case shows that quantum computing methods can be patentable if they demonstrate a practical technological improvement, not merely a mathematical algorithm.

2. Parker v. Flook (U.S. Supreme Court, 1978)

Facts:

The case involved a patent application for a mathematical formula for calculating alarm limits in catalytic conversion.

Decision:

The Supreme Court held that a mathematical algorithm alone is not patentable, unless it is applied in a practical technological process.

Impact on Quantum Computing:

Quantum computing patents cannot claim algorithms in isolation. They must describe how the algorithm improves a system or machine.

3. Alice Corp. v. CLS Bank (U.S. Supreme Court, 2014)

Facts:

This landmark case involved software for settling financial transactions via a computer.

Decision:

The Court introduced a two-step test for patent eligibility:

Determine if the claim is directed to an abstract idea.

If so, check whether there is an “inventive concept” that transforms it into a patent-eligible application.

Relevance to Quantum Computing:

USPTO uses this test for quantum computing applications.

Quantum algorithms must demonstrate an inventive application, such as improved qubit manipulation or error correction.

4. Enfish, LLC v. Microsoft Corp. (Federal Circuit, 2016)

Facts:

The patent claimed a self-referential database table that improved computer efficiency.

Decision:

The court ruled that claims improving computer functionality are patentable, even if they involve software.

Implication for Quantum Computing:

Hybrid systems combining classical and quantum components can be patented if the system improvement is clearly described.

5. Amdocs (Israel) Ltd. v. Openet Telecom, Inc. (Federal Circuit, 2016)

Facts:

Patent claims for network traffic monitoring and control systems were challenged for being abstract ideas.

Decision:

Court upheld the patent because it described a non-conventional technological solution, not just abstract ideas.

Quantum Computing Takeaway:

Claims for quantum error correction circuits or hybrid quantum algorithms can qualify if they provide specific technical improvements.

6. In re Huping Hu (Federal Circuit, 2021)

Facts:

The patent application involved quantum entanglement methods for computation.

USPTO rejected the claims due to lack of operability and insufficient description.

Decision:

Court affirmed that quantum computing inventions must be detailed enough for a skilled person to practice them.

Lesson:

Enablement and written description (§112) are critical in quantum patent applications.

7. Key Principles for Quantum Computing Patents

Patent Eligibility (35 U.S.C. §101)

Quantum methods must:

Show technological improvement beyond abstract math.

Integrate the idea into a practical machine or process (e.g., hybrid quantum-classical systems, error-corrected quantum processors).

Novelty and Non-Obviousness (§102 & §103)

The invention must be new and non-obvious over prior quantum algorithms and classical methods.

Written Description and Enablement (§112)

Claims must fully describe the method and apparatus, including enough detail for someone skilled in quantum computing to replicate it.

8. USPTO Trends in Quantum Computing Patents

There has been a rapid increase in filings related to:

Quantum error correction circuits

Hybrid quantum-classical computing methods

Quantum algorithms for specific computational tasks

Quantum hardware improvements

PTAB decisions like Ex parte Cao indicate that demonstrating a concrete technological improvement is essential for overcoming abstract idea rejections.

Summary Table of Key Cases Relevant to Quantum Computing Patents

Conclusion:

Quantum computing patents are challenging but feasible.

Success depends on:

Showing technological improvement (hardware/software/system).

Drafting claims with specific, practical implementation.

Providing sufficient enablement and written description.