In India, a quantum principle, formula or algorithm claimed in the abstract is not patentable. The Patent Office’s 2025 examination guidelines say that a quantum computing invention may become patentable when it is a practical implementation, such as a specific hardware configuration for qubit control, that shows a concrete technical effect.
Quantum computing patents in India are governed by the Patents Act, 1970, whose section 3(k) excludes a mathematical or business method, a computer programme per se (that is, by itself) and algorithms. This article explains how that exclusion applies to quantum inventions, what the Indian Patent Office’s guidelines add, and what an application has to disclose.
| Quick answer: |
| A quantum computing invention may become patentable in India when it is claimed as a practical implementation with a concrete technical effect, such as qubit-control hardware, and not as an abstract principle or algorithm. It must also satisfy novelty, inventive step, industrial applicability and the disclosure requirements. The Patent Office’s 2025 guidelines give two illustrative examples and list the disclosure for each. |
What Quantum Computing Patents in India Require
An Indian patent requires a new product or process with an inventive step that is capable of industrial application (s.2(1)(j)). Section 3(k) then excludes a mathematical or business method, a computer programme per se and algorithms. A quantum invention needs more than its mathematics or code to clear it.
The Act defines an inventive step as a feature that involves technical advance over existing knowledge, or economic significance, or both, and that makes the invention not obvious to a person skilled in the art (s.2(1)(ja)). The full text is in the Patents Act, 1970 on India Code.
The Patent Office has also issued Guidelines for Examination of Computer Related Inventions (CRIs), referred to below as the Guidelines. They describe quantum computing as using superposition, entanglement and quantum tunnelling to process information (s.5.3). Those are the physical principles a quantum invention is built on; the question for the patent examiner is what the claimed invention does with them (s.5.1).
Why a Quantum Algorithm Alone Is Not Enough
The Patent Office treats a quantum principle or a mathematical formula as an abstract idea that lacks practical application (CRI Guidelines 2025, s.5.3). A claim must therefore show how the quantum steps are realised in a technical system, not only state the principle.
The Guidelines state that algorithms in all forms are excluded from patentability, and that a claim is typically abstract if it only presents a sequence of procedural steps without sufficient technical implementation detail (s.4.5.3). Their own illustration is a sorting algorithm, which stays abstract unless the application shows how the steps are applied in a specific technical context.
A formula in a claim does not necessarily make it a mathematical method claim: the Guidelines say that the mere presence of a formula used to specify the scope of protection may not do so (s.4.5.1). The test is the substance of the claim taken as a whole, whatever form it takes, whether method, system or computer program product (s.4.5). For the wider rules on software-related claims, see the guide to protection of computer-related inventions in India.
Where Quantum Claims Have a Path: Hardware and Specific Applications
The Guidelines say a quantum innovation may become patentable when it turns the principle into a tangible application, such as a method for optimising logistics with quantum algorithms or a specific hardware configuration for qubit control. The key is a concrete technical effect or an improvement in a technological process (CRI Guidelines 2025, s.5.3).
The Guidelines describe developing the physical hardware needed to build operational quantum systems as one of the primary challenges in quantum computing, because the hardware is specialised and often experimental, and must manipulate qubits on platforms such as ion traps, superconducting circuits or photonic technologies (s.5.3). A specific hardware configuration for qubit control is one of the two illustrations the Guidelines give of an application that may become patentable. The Guidelines give no worked example for the logistics route, so both examples below concern hardware.
The Guidelines then work through two examples. Example 17 is a hybrid quantum-classical system on a superconducting qubit processor. Example 18 is a chip-based photonic quantum computing device. The table sets out what each claims, what the Guidelines say may take it outside section 3(k), and the disclosure the Guidelines list for it (s.5.3.1).
| Example 17: hybrid quantum-classical system | Example 18: photonic quantum chip | |
| Key claimed features | A processor built from superconducting transmon qubits, a classical control unit using a machine learning algorithm for real-time feedback and calibration, a compiler that translates programs into pulse sequences, a cooling and shielding system, and a synchronisation module | A silicon photonic chip with waveguides, beam splitters and phase shifters, single-photon sources, thermo-optic tuning elements, superconducting nanowire detectors, and optical delay lines for linear optical quantum computing protocols |
| What may take it outside section 3(k) | Adaptive gate-level adjustments using machine learning during execution, which raise fidelity and reduce incoherence | A reconfigurable, CMOS-compatible platform with high-speed, low-noise operation, enhanced gate fidelity and scalability |
| Illustrative disclosure listed by the Guidelines | Qubit materials, dimensions and design; the control unit’s architecture; a flow diagram from compiler to pulse; cryogenic and shielding specifications; block-level diagrams of the integrated modules | Chip layout with waveguide geometry, materials and fabrication steps; control logic for single- and two-qubit gates; test data on insertion loss, extinction ratios and phase tuning; a sample execution of the protocol with timing diagrams and expected output distributions |
Both examples claim a combination of components, not an algorithm in isolation. The aspects the Guidelines single out are features of the system, such as adaptive gate adjustment in Example 17 and a reconfigurable platform in Example 18, together with gains in fidelity, noise and scalability.
What a Quantum Patent Application Must Disclose
A complete specification must fully describe the invention, its operation or use and how to perform it, and disclose the best method known to the applicant for which the applicant is entitled to claim protection (s.10(4)(a) and (b)). The Guidelines add a test: could a skilled person reproduce it without undue experimentation (s.5.1)?
For the hardware illustrations in Examples 17 and 18, the disclosure listed includes implementation details such as qubit or chip design, control architecture, timing or flow information, fabrication details and, where relevant, test data. What is required depends on the claimed invention.
The Guidelines note that technologies such as quantum computing are built on mathematical models and abstract principles. They identify sufficiency of disclosure and the section 3(k) exclusion as the areas where these technologies pose unique challenges for examination (s.5.1). The aim of examination is to separate a theoretical construct from an implementable technical solution.
Applicants can read the disclosure lists under Examples 17 and 18 as the Patent Office’s own statement of the detail expected for those system types. They are illustrations and not a checklist for every quantum invention, and the Guidelines head the examples as non-exhaustive illustrations (s.5.3.1). An applicant may instruct a registered patent agent for patent drafting, to structure the specification and claims around the disclosure requirements, although the Act also lets an applicant draft their own specification (s.132).
How Long a Quantum Patent Lasts
Subject to the Act, a granted Indian patent lasts twenty years from the date of filing (s.53). For an international (PCT) application designating India, the term runs from the international filing date. It ceases earlier if a renewal fee is not paid in time (s.53).
A lapsed patent can be restored only on an application made within eighteen months of lapse, and only if the failure to pay was unintentional and there was no undue delay (ss.60 and 61).
Section 53 does not give quantum inventions a separate term.
Quantum Software: When Code Is Excluded and When It Is Not
Section 3(k) excludes a computer programme per se, not every invention that uses software. A claim that involves software is not excluded merely for that reason if, in substance and taken as a whole, it falls outside the excluded categories (CRI Guidelines 2025, ss.4.5 and 4.5.4).
The Guidelines reproduce the view of the Joint Parliamentary Committee, expressed when it examined the Patents (Amendment) Bill, 2002, on the words per se in clause (k): a computer programme may include things ancillary to it or developed on it, that the intention was not to reject those where they are inventions, and that programmes as such are not intended to be granted a patent (s.3.3).
The code itself raises a separate question. The Guidelines reproduce the definition of a computer programme in section 2(ffc) of the Copyright Act, 1957, as a set of instructions capable of causing a computer to perform a particular task or achieve a particular result (s.2.4). They also quote the Madras High Court as describing the devising of an algorithm as an intellectual exercise whose protection is limited to copyright, subject to originality, in its form of expression (s.2.1). The separate assessment of a claim that uses an algorithm is set out in the Guidelines’ algorithm test (s.4.5.3). The guide to patent or copyright for software inventions covers that choice in more detail.
What to Settle Before You File a Quantum Invention
Settle three things before filing: the technical effect the invention delivers, the specific configuration or application that delivers it, and the detail the specification will disclose about it. A claim to the quantum principle alone is the kind the Guidelines treat as abstract (s.5.3), and a bare algorithm is treated in the same way (s.4.5.3).
- Name the technical effect. The Guidelines look for a concrete technical effect or an improvement in a technological process (s.5.3), and their examples tie it to features of the system, such as adaptive gate adjustment or a reconfigurable platform, and not to the benefit alone.
- Claim the technical implementation, not the algorithm or the principle. The Guidelines illustrate subject matter that may qualify through a specific hardware configuration for qubit control and through a tangible application that uses quantum algorithms (s.5.3).
- Plan the disclosure early. Compare the invention with the lists under Examples 17 and 18 (s.5.3.1) and gather the implementation detail that fits your own invention, such as design, control architecture and test data where relevant.
- Treat the Guidelines as guidance. They do not constitute rule making, and the Act and the Rules prevail if they conflict (s.1.4).
A patentability search before filing can identify relevant prior art and help assess how the proposed claims compare with the known technical landscape. The claims can then be mapped to the tests above with a registered patent agent.
Frequently Asked Questions About Quantum Computing Patents in India
Section 3(k) excludes algorithms, and the Guidelines say algorithms in all forms are excluded (s.4.5.3). An invention that uses a quantum algorithm may fall outside the exclusion if, taken as a whole, it is a technical implementation with a concrete technical effect (s.5.3) and enough technical detail (s.4.5.3). The other requirements of the Act still apply.
The Guidelines give a specific hardware configuration for qubit control as an example of an application that may become patentable (s.5.3), and Examples 17 and 18 describe a superconducting hybrid system and a photonic chip (s.5.3.1). Patentability still depends on the claims filed meeting the Act’s requirements for an invention and a sufficient disclosure.
No. The Guidelines state that they do not constitute rule making, and that the Patents Act and the Patents Rules prevail where they conflict (s.1.4). They aim to make examination of computer related inventions consistent (s.1.3), so they shape how an application is examined without replacing the statute.
A computer programme per se is excluded by section 3(k). A claim that involves software is not excluded merely for that reason if, in substance and taken as a whole, it falls outside the excluded categories (ss.4.5 and 4.5.4). A claim that only sets out steps without technical implementation detail is typically deemed abstract (s.4.5.3).
For a Patent Cooperation Treaty application designating India, the twenty-year term runs from the international filing date accorded under the treaty, not from the date the application enters India (s.53(1), Explanation). For other applications, the term runs from the date of filing the application for the patent.
Not necessarily. The Guidelines say the mere presence of a mathematical formula in a claim, used to specify the scope of protection, may not make it a mathematical method claim (s.4.5.1). The question is whether the solution lies in abstract mathematical processing, or the mathematics is part of a larger technical process (s.4.5.1.1).
This article explains the law on patenting quantum computing inventions in India as at October 2026 and is for general information only. It is not legal advice. Government fees, forms, and procedures change; confirm current figures with the Indian Patent Office before you file. For advice on your specific invention, consult a registered patent agent.
Sources
- The Patents Act, 1970, consolidated text, India Code, Government of India. Pinpoints used: ss.2(1)(j), 2(1)(ja), 3(k), 10(4)(a) and (b), 53(1) and its Explanation, 53(2), 60, 61 and 132(a).
- Guidelines for Examination of Computer Related Inventions (CRIs), 2025, Office of the Controller General of Patents, Designs and Trade Marks. Pinpoints used: ss.1.3, 1.4, 2.1, 2.4, 3.3, 4.5, 4.5.1, 4.5.1.1, 4.5.3, 4.5.4, 5.1, 5.3 and 5.3.1.