Patenting Quantum Computing Innovations: Lessons from Four Core Quantum Algorithms – Part 1

This article discusses the patent eligibility of quantum computing inventions under U.S. law in the context of several concrete examples. As such, the article is intended for workers in the field and assumes elementary quantum computing knowledge. It will be published in the Quantum Computing Report over five consecutive weeks. By the end of the series, readers should have a better understanding of an important hurdle in obtaining patent protection for quantum computing inventions in the U.S. and approaches to overcoming it. The parts of the article are as follows: Part 1: Introduction, Quantum Computing Inventions, the U.S. Patent Eligibility Problem, and RecommendationsPart 2: Patent Eligibility of Quantum Computing Inventions and Example 1: Implementing a Pauli Z GatePart 3: Example 2: Implementing a Logical Qubit in a Surface CodePart 4: Example 3: Entanglement SwappingPart 5: Example 4: Shor’s Algorithm and Conclusions The field of quantum computing is poised to advance dramatically in the near future. If expected advances actually occur, many problems that classical computing technologies cannot feasibly solve may become tractable. Given that the field is on the verge of fast and important technological advancements in this field, it makes sense to consider the patenting strategies…