{ "ts": "2026-05-28T18:00:40.514Z", "source": "epo-ops", "queries": [ "pa all \"Indian Institute of Technology\" AND txt all \"quantum\"", "pa all \"Indian Institute of Science\" AND txt all \"quantum\"", "pa all \"Tata Consultancy\" AND txt all \"quantum\"", "pa all \"Wipro\" AND txt all \"quantum\"", "pa all \"Infosys\" AND txt all \"quantum\"", "pa all \"Indian Space Research\" AND txt all \"quantum\"", "pa all \"Centre for Development of Advanced Computing\" AND txt all \"quantum\"", "pa all \"Bharti\" AND txt all \"quantum\"", "pa all \"Reliance\" AND txt all \"quantum\"", "pa all \"Mahindra\" AND txt all \"quantum\"", "pa all \"TIFR\" AND txt all \"quantum\"", "pa all \"Raman Research\" AND txt all \"quantum\"", "pa all \"Defence Research\" AND txt all \"quantum\"", "pn all \"IN\" AND txt all \"quantum computing\"", "pn all \"IN\" AND txt all \"quantum key distribution\"", "pn all \"IN\" AND txt all \"post-quantum\"" ], "post_filter": "Kept only records whose title or abstract names a quantum-technology term: qubit, QKD, entanglement, post-quantum or quantum-safe cryptography, or quantum computing, processors, circuits, gates, algorithms, solvers, annealing, hybrid quantum-classical methods, communication, cryptography, key distribution, random numbers, networks, memory, sensing, metrology, imaging, information, machine learning or simulation. The word quantum alone, as in quantum dots, wells, clusters, yield or cascade lasers, is not enough. Records must also list at least one applicant with country code IN.", "count_before_filter": 250, "count": 30, "india_only": true, "license_note": "EPO OPS data, reuse subject to EPO Terms (https://www.epo.org/en/legal/terms-conditions).", "snapshot_on": "2026-05-28", "filtered_on": "2026-09-17", "rows": [ { "publication_number": "WO2025224767A1", "country": "WO", "doc_number": "2025224767", "kind": "A1", "date": null, "title": "QUANTUM SOURCE OF TELECOM ENTANGLED PHOTONS FOR MULTI-USER QUANTUM COMMUNICATION", "applicants": [ "INDIAN INSTITUTE TECH DELHI [IN]", "INDIAN INSTITUTE OF TECHNOLOGY DELHI" ], "inventors": [ "GHOSH JOYEE [IN]", "YADAV VIKASH KUMAR [IN]", "GHOSH, Joyee", "YADAV, Vikash Kumar" ], "ipc": [ "G02F", "H04B", "H04L" ], "abstract": "The present disclosure relates to a system (100) for generation of entangled photon pairs for quantum communication. The system (100) includes a continuous wave (CW) tunable pump laser (102) to pump a Zinc-indiffused Magnesium-doped Periodically Poled Lithium Niobat (MgO:PPLN) ridge waveguide, an inline variable optical attenuator (VOA) (104) to control 5 the power of the CW tunable pump laser (102), and an input fiber polarization beam splitter (FPBS) (106) with a horizontal polarization (H-pol) arm and a vertical polarization (V-pol) arm, the H-pol arm is automatically rotated to V-pol by a 90 degree fiber twist before a waveguide facet, a first C-L band splitter (108) to separate one or more signal and idler photons into distinct spectral bands, with the signal photons falling within a C-arm and the 0 idler photons falling a L-arm, one or more fiber polarization controllers (110) in both C-arm and L-arm to control polarization of one or more output photons and introduce a desired phase in both C-arm and L-arm and a second C-L band splitter (112) to combine the one or more entangled photon pairs into a single fiber.", "url": "https://worldwide.espacenet.com/patent/search/publication/WO2025224767A1", "source": "epo-ops" }, { "publication_number": "WO2025083704A1", "country": "WO", "doc_number": "2025083704", "kind": "A1", "date": null, "title": "QUANTUM SENSING BASED ON OPTICAL FIBER BRAGG GRATING DEVICE", "applicants": [ "INDIAN INST TECH MADRAS [IN]", "INDIAN INSTITUTE OF TECHNOLOGY MADRAS (IIT MADRAS)" ], "inventors": [ "B N DR SHIVANANJU [IN]", "RATH SWETA [IN]", "SSSD KOUSHIK [IN]", "B.N, Dr. Shivananju", "RATH, Sweta", "SSSD, Koushik" ], "ipc": [ "C03C", "G02B", "G03F" ], "abstract": "The present invention relates to a novel quantum sensing system based on an optical Fiber Bragg Grating (FBG) device for various photonics applications. The system is developed by depositing a fluorescent dye, such as Rhodamine B (RhB), on the grating region of the FBG. Upon external illumination with specific wavelengths, the FBG experiences a Bragg wavelength shift, which correlates with photon (quantum) absorption and emission as well as the intensity of fluorescence. This unique technology offers significant advantages over conventional intensity-based sensing, providing high sensitivity, linearity, and long-term stability. The system can be used as a highly sensitive fluorescence detector even at very low excitation power and also as a temperature monitoring system due to temperature dependence of fluorescence. Additionally, it can be used as spectroscopic device, and also has potential to use as fluorescence sensor in bio-engineering applications.", "url": "https://worldwide.espacenet.com/patent/search/publication/WO2025083704A1", "source": "epo-ops" }, { "publication_number": "US2024095562A1", "country": "US", "doc_number": "2024095562", "kind": "A1", "date": null, "title": "COMPOSITE QUANTUM ARCHITECTURE FOR QUANTUM REALIZATION OF JORDAN-FORM BASED SYSTEMS", "applicants": [ "THE INDIAN INSTITUTE OF TECH [IN]", "THE INDIAN INSTITUTE OF TECHNOLOGY" ], "inventors": [ "LASKAR MOSTAFIZUR RAHAMAN [IN]", "DUTTA AMIT KUMAR [IN]", "Laskar, Mostafizur Rahaman", "Dutta, Amit Kumar" ], "ipc": [ "G06N" ], "abstract": "[0000] The invention provides a quantum elementary gate-based composite system comprising elementary quantum gates including Pauli operators and Singleton ladder operators. The Pauli operators and said Singleton ladder operators are operatively combined to form a Jordan Canonical form-based representation suitable for simulating large quantum matrices, specially structured matrices such as symmetric, and Toeplitz matrix.", "url": "https://worldwide.espacenet.com/patent/search/publication/US2024095562A1", "source": "epo-ops" }, { "publication_number": "WO2022123594A1", "country": "WO", "doc_number": "2022123594", "kind": "A1", "date": null, "title": "SYSTEM AND METHOD FOR PLUG-AND-PLAY DIFFERENTIAL PHASE ENCODED MEASUREMENT-DEVICE-INDEPENDENT QUANTUM KEY DISTRIBUTION", "applicants": [ "INDIAN INST TECH MADRAS [IN]", "INDIAN INSTITUTE OF TECHNOLOGY MADRAS (IIT MADRAS)" ], "inventors": [ "RANU SHASHANK KUMAR [IN]", "MANDAYAM PRABHA [IN]", "PRABHAKAR DR ANIL [IN]", "RANU, Shashank Kumar", "MANDAYAM, Prabha", "PRABHAKAR, Dr. Anil" ], "ipc": [ "H04L" ], "abstract": "Disclosed herein is a plug-and-play differential phase-encoded measurement device independent (DPS MDI) quantum key distribution (QKD) system that uses single photons in a linear superposition of three orthogonal time-bin states. The system shown in FIG. 1 comprises a transmitter (Tx), a pair of receiver sub-systems (Rx1, Rx2) and a measurement unit. The method comprises the steps of: generating a high-powered optical signal, polarizing the generated signal to 45o and obtaining pulsed signal, obtaining three time-bins from the pulsed signal, splitting the pulsed signal into horizontally polarized and vertically polarized signals, transmitting the horizontally polarized signal to the first receiver sub-system (Rx1) and reflecting the vertically polarized signal to transmitter (Tx), horizontally polarising the vertically polarized signal and transmitting it to second receiver sub-system (Rx2). The receiver sub-systems (Rx1, Rx2) convert horizontally polarized signals into phase encoded key. The keys from receiver sub-systems are transmitted to measurement unit for photon detection.", "url": "https://worldwide.espacenet.com/patent/search/publication/WO2022123594A1", "source": "epo-ops" }, { "publication_number": "WO2022038640A1", "country": "WO", "doc_number": "2022038640", "kind": "A1", "date": null, "title": "SYSTEM AND METHOD FOR GENERATING QUANTUM RANDOM NUMBERS USING RESIDUAL TIME-BINS IN DPS QKD SYSTEM", "applicants": [ "INDIAN INST TECH MADRAS [IN]", "INDIAN INSTITUTE OF TECHNOLOGY MADRAS (IIT MADRAS)" ], "inventors": [ "RANU SHASHANK KUMAR [IN]", "MANDAYAM PRABHA [IN]", "PRABHAKAR ANIL [IN]", "RANU, Shashank Kumar", "MANDAYAM, Prabha", "PRABHAKAR, Anil" ], "ipc": [ "G06F", "H04B", "H04L" ], "abstract": "Disclosed herein is a system and method for generation of quantum random numbers using residual time-bins in a DPS QKD system. The DPS QKD system transmits photons over an optical fiber (2) to receiver. The phase modulation at the transmitter (1) puts photon into quantum superposition of N orthogonal states via first quantum link. At receiver (3), there is a delay line interferometer that collapses quantum state into one of N+l time-bins. The discarded photons are detected by detectors (7a, 7b) as shown in FIG.1. The discarded photons are used for generating new random numbers which acts as a QRNG at receiver end (3) and the generated quantum random numbers are used for deriving quantum key over secondary quantum link. This system effectively utilizes all received photons by generating quantum random numbers in the residual bins and builds a series of quantum link that together act as quantum network.", "url": "https://worldwide.espacenet.com/patent/search/publication/WO2022038640A1", "source": "epo-ops" }, { "publication_number": "WO2022259078A1", "country": "WO", "doc_number": "2022259078", "kind": "A1", "date": null, "title": "EXCITONIC BOSE-EINSTEIN CONDENSATE (BEC) AS QUBITS USING SEMICONDUCTOR NANOSTRUCTURES FOR QUANTUM TECHNOLOGIES", "applicants": [ "INDIAN INSTITUTE OF SCIENCE EDUCATION AND RES [IN]", "INDIAN INSTITUTE OF SCIENCE EDUCATION AND RESEARCH" ], "inventors": [ "DATTA SHOUVIK [IN]", "BHUNIA AMIT [IN]", "SINGH MOHIT KUMAR [IN]", "HENINI MOHAMED [GB]", "HUWAYZ MARYAM AL [GB]", "DATTA, Shouvik", "BHUNIA, Amit", "SINGH, Mohit Kumar" ], "ipc": [ "G06N", "H01L" ], "abstract": "The present disclosure provides method and system, which use multiple of excitonic BEC(s) and/or excitonic matter-wave(s) and/or excitonic superfluid(s) as a platform to generate multiple (from a few to even millions or more) long-lived Qubits in any conceivable multi-dimensional hybrid nanostructure(s), mostly using semiconductor material(s) and/or device structure(s) at any temperature in between 0-500K, and that can sustain any quantum coherence for a much longer time scales of microseconds or milliseconds or even more, but not limited to these time scales for any conceivable faster device operation(s) as well. The macroscopic quantum states of the generated Qubits are easily controllable with applied voltage(s) (dc and/or ac) and/or electrical power, and/or light beam(s), and are easily integrated with semiconductor fabrication techniques for quicker and wider adaptation of Quantum technologies.", "url": "https://worldwide.espacenet.com/patent/search/publication/WO2022259078A1", "source": "epo-ops" }, { "publication_number": "US2021310949A1", "country": "US", "doc_number": "2021310949", "kind": "A1", "date": null, "title": "SYSTEM AND METHOD OF TRANSFORMING A PROTEIN TO EXHIBIT QUANTUM PROPERTIES AND APPLICATIONS THEREOF", "applicants": [ "INDIAN INSTITUTE OF SCIENCE EDUCATION AND RES [IN]", "INDIAN INSTITUTE OF SCIENCE EDUCATION AND RESEARCH" ], "inventors": [ "SINGH KAMAL PRIYA [IN]", "SIDHU MEHRA SINGH [IN]", "PANDA BISWAJIT [IN]", "SINGH, Kamal Priya", "SIDHU, Mehra Singh", "PANDA, Biswajit" ], "ipc": [ "C07K", "C09K", "G01N" ], "abstract": "Disclosed herein is a novel phenomenon to create a nano-confined, dopant-free, electron spin-dependent fluorescence (SDF) in spider silk by fundamentally transforming its local molecular structure with femtosecond-pulses (206), having fluence below an ablation threshold. Electron-spin dependence of the fluorescent patterns created on the silk sample are confirmed by measuring the fluorescence intensity at different microwave frequencies. The fluorescent intensity exhibits microwave magnetic resonances at 2.88 GHz and 1.44 GHz at room-temperature. The SDF in laser-transformed silk can thereby enable a new-class of tough yet elastic silk-based quantum sensor and hybrid nano-mechanical ultrasensitive cantilevers on a micro-chip. X-ray diffraction (XRD), Raman-spectroscopy, direct atomistic imaging with high-resolution transmission electron microscopy (HR-TEM) and model-building studies are carried out to exhibit the change in the molecular structure and unveil creation of crown-ring like structure in nanocrystals of fluorescent silk with localized electrons possessing mid-gap states.", "url": "https://worldwide.espacenet.com/patent/search/publication/US2021310949A1", "source": "epo-ops" }, { "publication_number": "US20260111785A1", "country": "US", "doc_number": "20260111785", "kind": "A1", "date": null, "title": "METHOD AND SYSTEM FOR CONSTRUCTING CLASSICAL EQUIVALENT MODEL OF TRAINED QUANTUM MACHINE LEARNING MODEL", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "KHANDELWAL ANKIT [IN]", "PRAMANIK SAYANTAN [IN]", "CHANDRA MARISWAMY GIRISH [IN]", "KHANDELWAL, Ankit", "PRAMANIK, Sayantan", "CHANDRA, Mariswamy Girish" ], "ipc": [ "G06N" ], "abstract": "[0000] Existing techniques of constructing classical equivalents of QML models expand measurements from QML model as truncated Fourier series and find Fourier coefficients by solving an optimization problem. However, this is computationally expensive and since approximate Fourier coefficients are determined, the resulting classical surrogate does not necessarily give exactly same predictions as that of the QML model. Embodiments of the present disclosure provide a method and system for constructing classical equivalent of trained Quantum Machine Learning (QML) model by distilling knowledge from the QML model to a classical model. The method includes training QML model using a first dataset, creating a second dataset using measurements from the QML model, training classical model using the second dataset and learning a processing function using predictions of the classical model and target outputs. The trained classical model combined with the learned processing function serve as classical equivalent of the QML model.", "url": "https://worldwide.espacenet.com/patent/search/publication/US20260111785A1", "source": "epo-ops" }, { "publication_number": "EP4693118A1", "country": "EP", "doc_number": "4693118", "kind": "A1", "date": null, "title": "METHOD AND SYSTEM FOR A FULLY QUANTUM U-NET FOR IMAGE SEGMENTATION", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "BANERJEE ASMITA [IN]", "PRAMANIK SAYANTAN [IN]", "CHANDRA MARISWAMY GIRISH [IN]", "CHAKRABORTY RIVU [IN]", "SRIDHAR CHUNDI VENKATA [IN]", "MATHAIS GODFREY CLAUDIN SYLVESTER [IN]", "BANERJEE, Asmita", "PRAMANIK, Sayantan" ], "ipc": [ "G06N" ], "abstract": "This disclosure relates generally to method and system for a fully quantum U-Net for image segmentation. Currently in image segmentation methods using quantum classical deep learning hybrid models, quantum operations are either scarce or limited to quantum feature maps or parametrized circuits. The disclosed quantum U-Net contains quantum versions of operations required for segmentation task, namely convolution and concatenation. The quantum U-Net is able to reproduce the predicted output mask having nearly the same size as its input image. In the disclosed architecture, the quantum convolution takes the form of a series of parametrized unitary gates as convolution layers which act locally on the input image data embedded into a quantum circuit to learn its features. The disclosed method is used for medical image segmentation, in food industry and so on.", "url": "https://worldwide.espacenet.com/patent/search/publication/EP4693118A1", "source": "epo-ops" }, { "publication_number": "EP4668161A1", "country": "EP", "doc_number": "4668161", "kind": "A1", "date": null, "title": "COUNT PREDICTION USING QUANTUM-ENHANCED-LSTM (QELSTM) WITH FEATURE DIMENSIONALITY REDUCTION VIA LINEAR COMBINATIONS OF CORRELATED FEATURES", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "RANA RAHUL [IN]", "KAUSHIK SAKSHI [IN]", "ADAK KUNTAL [IN]", "ROY SUMAN KUMAR [IN]", "POOJARY SUDHAKARA DEVA [IN]", "RANA, Rahul", "KAUSHIK, Sakshi", "ADAK, Kuntal" ], "ipc": [ "G06N" ], "abstract": "Managing circuit depth with increasing n qubits is a technical problem to be solved. A method and system for an object count prediction by analyzing time series using Quantum Enhanced LSTM with feature dimensionality reduction via linear combinations of correlated features. Optimal CNOT gate design that follows qubit entanglement structure by alternating between odd and even qubit indices, with each qubit connected to two other adjacent or non-adjacent qubits is disclosed, which. creates constant circuit depth that can limit to predefined number of quantum operations independent of number of the set of qubits in the QELSTM model. Further, the linear combination generates a set of transformed features that are mapped to the qubits of the QELSTM via a mapping technique that enables entanglement of the qubits based on correlation of the transformed features and in accordance with the optimal CNOT gate design so as to maintain the constant circuit depth.", "url": "https://worldwide.espacenet.com/patent/search/publication/EP4668161A1", "source": "epo-ops" }, { "publication_number": "EP4621621A1", "country": "EP", "doc_number": "4621621", "kind": "A1", "date": null, "title": "METHOD AND SYSTEM FOR RECOMMENDING QUANTUM SAFE CRYPTOGRAPHIC OPERATIONS IN APPLICATIONS", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "SINGH DILIP THAKUR MEENA [IN]", "ROY SHUBHRO SHOVAN [IN]", "ALASINGARA BHATTACHAR RAJAN MINDIGAL [IN]", "GHAROTE MANGESH SHARAD [IN]", "SAHU PANKAJ KUMAR [IN]", "VIDHANI KUMAR MANSUKHLAL [IN]", "SYED HABEEB BASHA [IN]", "LODHA SACHIN PREMSUKH [IN]" ], "ipc": [ "G06F", "H04L" ], "abstract": "The present disclosure paves way for transferring of application from classical cryptographic algorithms to post quantum cryptographic algorithms code, due to increased vulnerability to risks in classical cryptographic algorithm. Since Post Quantum Cryptographic (PQC) algorithms are more secure, they result in more execution time and resource requirements. Hence, it becomes necessary to select those PQC algorithms that satisfy enterprise constraints on time, computation cost and memory. Due to presence of various PQC algorithms and security levels with different key size and operations there is a requirement for recommender that can ensure optimal conversion from classical cryptographic schemes to PQC schemes at appropriate security levels. This lowers the risk and the selected PQC algorithms also satisfies the enterprise security requirements.", "url": "https://worldwide.espacenet.com/patent/search/publication/EP4621621A1", "source": "epo-ops" }, { "publication_number": "EP4617917A1", "country": "EP", "doc_number": "4617917", "kind": "A1", "date": null, "title": "METHOD AND SYSTEM FOR OPTIMIZATION OF NON-CONVEX PROBLEMS USING QUANTUM SOLVERS", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "SALUNKE SUSHMITHA SHANKAR RAO [IN]", "THINGBAIJAM ROHIT [IN]", "TRIPATHY SASWATI SOUMYA [IN]", "RANA RAHUL [IN]", "SAHU ADITYA [IN]", "LOKHANDE SMITA SANJAY [IN]", "POOJARY SUDHAKARA DEVA [IN]", "BICHPURIYA YOGESH KUMAR [IN]" ], "ipc": [ "G06F", "G06N" ], "abstract": "[0001] Optimization problem aims to find a best optimal solution from feasible solutions The present disclosure provides optimization of non-convex problems using quantum solvers. Initially, the entire curve is considered as a single segment and the vertical distance of all points of the cure is determined. Then a point with maximum vertical distance is identified and the entire curve is segmented into two at this point. This step is repeated to get more such segments point until the maximum error distance in each segment falls below the threshold value. Now the objective function is broken down into its constituent parts, wherein each constituent part represents a separate segment. Each of these objective function segments are then assigned with a binary variable such that the binary variable allows to activate or deactivate the segments. Further, the objective function segments are fed to a quantum solver to get the optimal solution.", "url": "https://worldwide.espacenet.com/patent/search/publication/EP4617917A1", "source": "epo-ops" }, { "publication_number": "EP4618473A1", "country": "EP", "doc_number": "4618473", "kind": "A1", "date": null, "title": "METHOD AND SYSTEM FOR GENERATING AND VERIFYING DIGITAL SIGNATURE USING POLYNOMIAL MATRICES", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "SYED HABEEB BASHA [IN]", "SINGH DILIP THAKUR MEENA [IN]", "BHATTACHAR RAJAN MINDIGAL [IN]", "SINGHA SUBHADIP [IN]", "SYED, Habeeb Basha", "SINGH DILIP THAKUR, Meena", "BHATTACHAR, Rajan Mindigal", "SINGHA, Subhadip" ], "ipc": [ "H04L" ], "abstract": "This disclosure relates generally to cryptography and more particularly to a method and system for generating and verifying digital signature using polynomial matrices. Already available techniques for generating digital signature are easy to solve on a quantum computer. The disclosed method for digital signature generation is based on multivariate quadratic systems over finite fields and generates digital signatures with small size and computations are very lightweight which may be performed in all hardware platforms. The disclosed method uses matrix consisting of linear multivariate polynomial to define a private key and further uses the square of the private key matrix to define a public key polynomials. Further, the method uses matrices consisting of constants chosen randomly from finite field and uses a random matrix for digital signature generation. The digital signatures created are very small in size approximately in 100 bytes.", "url": "https://worldwide.espacenet.com/patent/search/publication/EP4618473A1", "source": "epo-ops" }, { "publication_number": "EP4607420A1", "country": "EP", "doc_number": "4607420", "kind": "A1", "date": null, "title": "OPTIMAL ROUTE PLANNING AND VEHICLE CAPACITY UTILIZATION WITH MANAGEMENT OF INCOMPATIBLE COMMODITIES IN LOGISTICS", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "RANA RAHUL [IN]", "POOJARY SUDHAKARA DEVA [IN]", "SINHA ANIKET SANJAY [IN]", "THINGBAIJAM ROHIT [IN]", "RANA, Rahul", "POOJARY, Sudhakara Deva", "SINHA, Aniket Sanjay", "THINGBAIJAM, Rohit" ], "ipc": [ "G06N", "G06Q" ], "abstract": "[0001] Logistics planning with optimal route planning and optimal vehicle capacity utilization, while addressing incompatible commodities is NP-hard problem. A method and system for optimal route planning and vehicle capacity utilization with management of incompatible commodities in logistics is disclosed. For high volume of commodities exceeding vehicle capacity at a given pickup location and need of separating incompatible commodities present at same pickup location across vehicles, the locations are split into nodes. Further, the multiple nodes are clustered using a customized clustering technique and a first level vehicle assignment is performed per cluster. Furthermore, with the created nodes and assigned vehicles per cluster an optimization model defined by an object value (O) is created for each cluster. It is solved using a quantum hybrid solver that minimizes the object value under defined constraints. The solution obtained provides an optimal route with optimal capacity utilization for each vehicle for each cluster.", "url": "https://worldwide.espacenet.com/patent/search/publication/EP4607420A1", "source": "epo-ops" }, { "publication_number": "EP4579442A1", "country": "EP", "doc_number": "4579442", "kind": "A1", "date": null, "title": "METHOD AND SYSTEM FOR A DYNAMIC GENERATION OF RULES", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "VIDHANI KUMAR MANSUKHLAL [IN]", "ALASINGARA BHATTACHAR RAJAN MINDIGAL [IN]", "SINGH DILIP THAKUR MEENA [IN]", "SYED HABEEB BASHA [IN]", "SINHA SANKET ACHAL [IN]", "LODHA SACHIN PREMSUKH [IN]", "VIDHANI, KUMAR MANSUKHLAL", "Alasingara Bhattachar, RAJAN Mindigal" ], "ipc": [ "G06F" ], "abstract": "[0001] Quantum computers pose significant threat to modern day cryptography. To mitigate this risk, migration of enterprise applications to a quantum safe state is needed. Crypto inventory, an automatic process to discover all crypto application programming interfaces usage in an enterprise application, is a first problem to be addressed in the migration journey. Embodiments of the present disclosure provide a method and system for a dynamic generation of rules. An input program statement includes an unseen crypto application programming interface (API) is received which represents a method invocation. The invoked method is mapped by the input program statement with a rules database to infer and generate new rules for an unseen crypto application programming interface (API) belonging to (a) a same library by a weighted distance approach, (b) a library implementing known contracts by a graph traversal approach, and (c) a library implementing unknown contracts by a pattern matching approach respectively.", "url": "https://worldwide.espacenet.com/patent/search/publication/EP4579442A1", "source": "epo-ops" }, { "publication_number": "EP4575921A1", "country": "EP", "doc_number": "4575921", "kind": "A1", "date": null, "title": "METHOD AND SYSTEM FOR QUANTUM COMPUTING BASED PRE-TRAINING OF ARTIFICIAL INTELLIGENCE (AI) DATA MODELS", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "SIVAKUMAR NARENDRAN [GB]", "VISWANATHAN SANKARANARAYANAN [IN]", "KANNAN RADHIKA [IN]", "RAMASAMY VENKADA SUBRAMANIAN [IN]", "SIVAKUMAR, Narendran", "VISWANATHAN, Sankaranarayanan", "KANNAN, Radhika", "RAMASAMY VENKADA, Subramanian" ], "ipc": [ "G06N" ], "abstract": "Training of Artificial Intelligence (AI) data models requires huge amount of data to be processed, which requires a huge amount of resources to be allocated for the data processing. For the same reason, time involved in training of the AI data model also substantially increases, which is a challenge existing AI data model training approaches fail to address. Embodiments disclosed herein provide a method and system for quantum computing based pre-training of AI data models. In this quantum computing based approach, the system, by means of achieving synchronization across various quantum states and further by optimizing activation functions being used, pre-trains the AI data model in iterations, till convergence with a determined global minima is achieved.", "url": "https://worldwide.espacenet.com/patent/search/publication/EP4575921A1", "source": "epo-ops" }, { "publication_number": "EP4575930A1", "country": "EP", "doc_number": "4575930", "kind": "A1", "date": null, "title": "IMPLEMENTATION OF DENSITY FUNCTIONAL THEORY ON QUANTUM COMPUTING THROUGH META GENERALIZED GRADIENT APPROXIMATION", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "MUKHERJEE ANIRBAN [IN]", "GOPAL ANANTHAKRISHNA [IN]", "BANERJEE RITAM [IN]", "MUKHERJEE, ANIRBAN", "GOPAL, ANANTHAKRISHNA", "BANERJEE, RITAM" ], "ipc": [ "G06N" ], "abstract": "[0001] The disclosure relates generally to methods and systems for implementation of density functional theory on quantum computing through meta generalized gradient approximation (meta GGA). Conventional methods implement DFT simulations on classical processors which is time consuming. The present disclosure provides a quantum circuit for computing the direct matrix efficiently on a quantum processor. Initially, a plurality of atomic coordinates of each atom of a chemical compound whose one or more properties are to be extracted, are obtained. Electron integrals, a core Hamiltonian, and a collocation matrix are computed from the plurality of atomic coordinates. The core Hamiltonian is diagonalized to obtain an initial density matrix of the chemical compound. The initial density matrix is further updated iteratively until a convergence criteria is satisfied using the meta GGA to obtain a final density matrix. The final density matrix is used to extract the one or more properties of the chemical compound.", "url": "https://worldwide.espacenet.com/patent/search/publication/EP4575930A1", "source": "epo-ops" }, { "publication_number": "EP4575929A1", "country": "EP", "doc_number": "4575929", "kind": "A1", "date": null, "title": "IMPLEMENTING DENSITY FUNCTIONAL THEORY ON QUANTUM PROCESSORS THROUGH GENERALIZED GRADIENT APPROXIMATION", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "MUKHERJEE ANIRBAN [IN]", "GOPAL ANANTHAKRISHNA [IN]", "BANERJEE RITAM [IN]", "MUKHERJEE, ANIRBAN", "GOPAL, ANANTHAKRISHNA", "BANERJEE, RITAM" ], "ipc": [ "G06N" ], "abstract": "This disclosure relates generally to a method and system for implementing density functional theory (DFT) on quantum processors through generalized gradient approximation (GGA). Conventional methods implement DFT simulations on classical processors and state of the art methods implement DFT on a combination of classical and quantum processors. The embodiments of the present disclosure perform complex calculations of the DFT through GGA on quantum processors such as iteratively updating a density matrix by computing a direct matrix, a correlation exchange matrix, a gradient of the collocation matrix, an electronic density, an electronic density gradient, a derivative of the electronic density gradient and finally a Fock matrix at each iteration. A final density matrix is determined based on a convergence criteria for the iterative updating. These computations are performed using several quantum circuit components.", "url": "https://worldwide.espacenet.com/patent/search/publication/EP4575929A1", "source": "epo-ops" }, { "publication_number": "EP4575931A1", "country": "EP", "doc_number": "4575931", "kind": "A1", "date": null, "title": "IMPLEMENTATION OF HYBRID DENSITY FUNCTIONAL THEORY ON QUANTUM PROCESSORS WITH MOLLER-PLESSET PERTURBATION FOR CHEMICAL-COMPOUND SIMULATION", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "MUKHERJEE ANIRBAN [IN]", "GOPAL ANANTHAKRISHNA [IN]", "BANERJEE RITAM [IN]", "MUKHERJEE, ANIRBAN", "GOPAL, ANANTHAKRISHNA", "BANERJEE, RITAM" ], "ipc": [ "G06N" ], "abstract": "[0001] Existing approaches provide limitations to scale Hybrid DFT calculations to large systems and there is no such scalable technique to correct errors during Hybrid DFT computation with tensors. This disclosure relates generally to implementation of Hybrid Density Functional Theory on Quantum Processors with Moller-Plesset Perturbation (MP2) corrected simulation. The system receives a plurality of inputs from a classical computer component to transmit to a quantum computer component. Initially, a density matrix is computed from a core Hamilton. Further, the quantum processor computes a direct (J) matrix, a Hybrid matrix, and a correlation exchange potentials to compute a Fock matrix. Further, the density matrix is iteratively performed for a criteria where difference between the density matrix and an updated density matrix converges to a value below a threshold convergence error. MP2 energy corrections are performed for extracting the plurality of properties associated with the chemical compound.", "url": "https://worldwide.espacenet.com/patent/search/publication/EP4575931A1", "source": "epo-ops" }, { "publication_number": "EP4575928A1", "country": "EP", "doc_number": "4575928", "kind": "A1", "date": null, "title": "IMPLEMENTING DENSITY FUNCTIONAL THEORY ON QUANTUM PROCESSORS THROUGH LOCAL DENSITY APPROXIMATION FOR SIMULATING CHEMICAL COMPOUNDS", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "MUKHERJEE ANIRBAN [IN]", "GOPAL ANANTHAKRISHNA [IN]", "BANERJEE RITAM [IN]", "MUKHERJEE, Anirban", "GOPAL, Ananthakrishna", "BANERJEE, Ritam" ], "ipc": [ "G06N" ], "abstract": "The disclosure relates generally to methods and systems for implementing density functional theory on quantum processors through local density approximation for simulating chemical compounds. Conventional methods implement the DFT simulations on classical processors which is time consuming. According to the present disclosure, initially a plurality of atomic coordinates of each atom of a given chemical compound whose one or more properties to be extracted, are obtained. Electron integrals, a core Hamiltonian, and a collocation matrix are computed from the plurality of atomic coordinates. The core Hamiltonian is diagonalized to obtain an initial density matrix of the chemical compound. The initial density matrix is further updated iteratively until a convergence criteria is satisfied using a local density approximation (LDA) to obtain a final density matrix. The final density matrix is used to extract the one or more properties of the chemical compound.", "url": "https://worldwide.espacenet.com/patent/search/publication/EP4575928A1", "source": "epo-ops" }, { "publication_number": "EP4575927A1", "country": "EP", "doc_number": "4575927", "kind": "A1", "date": null, "title": "METHOD AND SYSTEM FOR IMPLEMENTING DENSITY FUNCTIONAL THEORY USING QUANTUM PROCESSORS", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "MUKHERJEE ANIRBAN [IN]", "GOPAL ANANTHAKRISHNA [IN]", "BANERJEE RITAM [IN]", "MUKHERJEE, Anirban", "GOPAL, Ananthakrishna", "BANERJEE, Ritam" ], "ipc": [ "G06N" ], "abstract": "Conventional methods implement Density Functional Theory (DFT) simulations on classical processors which is time consuming. The disclosure relates to method and system for implementing DFT on quantum processors. Initially, atomic coordinates of each atom of a chemical compound whose properties are to be extracted is received. Electron integrals, a core Hamiltonian, and a collocation matrix are computed from the atomic coordinates. The core Hamiltonian is diagonalized to obtain a density matrix of the chemical compound which is further updated iteratively until a convergence criteria is satisfied. At each iteration, a direct matrix is computed from which correlation exchange matrix is obtained using one or more DFT protocols. Further, the direct and correlation exchange matrix are added to get a Fock matrix which is diagonalized to obtain updated density matrix. Once the convergence criteria is satisfied, a final density matrix is obtained which is used to extract the properties.", "url": "https://worldwide.espacenet.com/patent/search/publication/EP4575927A1", "source": "epo-ops" }, { "publication_number": "EP4535208A1", "country": "EP", "doc_number": "4535208", "kind": "A1", "date": null, "title": "METHODS AND SYSTEMS FOR ESTIMATING RISK OF ENTERPRISE APPLICATION FOR QUANTUM CRYPTOGRAPHY MIGRATION", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "SINGH DILIP THAKUR MEENA [IN]", "SYED HABEEB BASHA [IN]", "VIDHANI KUMAR MANSUKHLAL [IN]", "ALASINGARA BHATTACHAR RAJAN MINDIGAL [IN]", "LODHA SACHIN PREMSUKH [IN]", "SINGH DILIP THAKUR, MEENA", "SYED, HABEEB BASHA", "VIDHANI, KUMAR MANSUKHLAL" ], "ipc": [ "G06F" ], "abstract": "[0001] The disclosure generally relates to methods and systems for estimating risk of enterprise application for quantum cryptography migration. Conventional software risk assessment tools that assess the quantum computer related security attacks are limited. The present disclosure solves the technical problems in the art for estimating risk of enterprise application for quantum cryptography migration. The methods and systems of the present disclosure formulated the problem based on a survival function in the probability theory, where possible chances of the enterprise application crypto surviving the quantum computer are calculated, and an estimated risk value is assigned to the enterprise software application. The methods and systems of the present disclosure discloses a risk estimator which take enterprise application specific metadata as the inputs and produces the risk score associated to the enterprise application against the quantum threats using a modified cox model and a modified rule of Mosca.", "url": "https://worldwide.espacenet.com/patent/search/publication/EP4535208A1", "source": "epo-ops" }, { "publication_number": "US2025087307A1", "country": "US", "doc_number": "2025087307", "kind": "A1", "date": null, "title": "METHOD AND SYSTEM FOR REDUCING TIME COMPLEXITY OF DENSITY FUNCTIONAL THEORY CALCULATIONS WITH QUBITIZED DIAGONALIZATION", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "MUKHERJEE ANIRBAN [IN]", "GUPTA ELEENA [IN]", "GOPAL ANANTHAKRISHNA [IN]", "BANERJEE RITAM [IN]", "MUKHERJEE, ANIRBAN", "GUPTA, ELEENA", "GOPAL, ANANTHAKRISHNA", "BANERJEE, RITAM" ], "ipc": [ "G06F", "G16C" ], "abstract": "Though Density functional theory (DFT) based approaches such as Kohn-Sham DFT (KS-DFT) are useful for calculating energetics and other physical properties of physical/chemical systems, computational time complexity bottleneck of the DFT approach has remained a cubic function of the number of electronic orbitals, hence adversely affects efficiency of calculation of the energy estimation and other parameter calculations. Method and system disclosed herein computes a computational complexity for an electron density value as received as input, by performing a Kohn-Sham Hamilton simulation of the input. Further, one or more eigen states of the input are determined, via the one or more hardware processors. Further, the one or more eigen states of the input are mapped to a recursive sequence of nonlinear least squares problem solved by executing a Quantum linear system algorithm at every step, wherein the mapping causes reduction in the computational complexity of the input.", "url": "https://worldwide.espacenet.com/patent/search/publication/US2025087307A1", "source": "epo-ops" }, { "publication_number": "EP4481606A1", "country": "EP", "doc_number": "4481606", "kind": "A1", "date": null, "title": "METHODS AND SYSTEMS FOR THE AUTOMATIC CREATION OF A HYBRID ARCHITECTURE THAT SUPPORTS A NEW AND AN EXISTING LIBRARY IN AN ENTERPRISE APPLICATION", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "VIDHANI KUMAR MANSUKHLAL [IN]", "BHATTACHAR RAJAN MINDIGALALASINGARA [IN]", "LODHA SACHIN PREMSUKH [IN]", "SYED HABEEB BASHA [IN]", "SINGH DILIP THAKUR MEENA [IN]", "VIDHANI, KUMAR MANSUKHLAL", "BHATTACHAR, RAJAN MINDIGALALASINGARA", "LODHA, SACHIN PREMSUKH" ], "ipc": [ "G06F" ], "abstract": "[0001] This disclosure provides methods and systems for enabling a hybrid architecture in an enterprise application. The present disclosure addresses problems of conventional approaches which falls back on a common representation or pluggable framework to handle challenges of composing multiple libraries. Conventional approaches work for the problem of maintaining performance while handling diversity of libraries which cannot be reused either in as-is form or with a slight modification. The present disclosure provide a method and system that enable hybrid architecture in an enterprise application to mitigate quantum attacks. The method of the present disclosure changes codebase of the enterprise application to enable hybrid architecture. New paths are created within the enterprise application to support execution of a new library code that enables double encryption of data being processed by the application. Code that transforms program variables is injected to address the compatibility challenges between existing and new libraries.", "url": "https://worldwide.espacenet.com/patent/search/publication/EP4481606A1", "source": "epo-ops" }, { "publication_number": "US2024202561A1", "country": "US", "doc_number": "2024202561", "kind": "A1", "date": null, "title": "METHOD AND SYSTEM FOR DOWNFOLDING ELECTRONIC HAMILTONIANS USING A HYBRID QUANTUM-CLASSICAL ARCHITECTURE", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "MUKHERJEE ANIRBAN [IN]", "KARIYA ANEKAIT HITESH [IN]", "MUKHERJEE, ANIRBAN", "KARIYA, ANEKAIT HITESH" ], "ipc": [ "G06N" ], "abstract": "Conventional Hamiltonian downfolding methods involve approximating exponential within the double unitary coupled cluster transformation which effects accuracy of the resultant Hamiltonian. Thus, the present disclosure provides a method for downfolding electronic Hamiltonians using a hybrid quantum-classical architecture wherein similarity transformation in such a way that the exponential terminates at linear order. In addition, a many body Bloch equation is defined which embodies every similarity downfolding transformation step. From the Bloch equation, a system of polynomial equations is derived for downfolding one molecular orbital. Quantum Circuits are used to facilitate solving the polynomial equations, which helps in constructing a lower dimensional Hamiltonian with one less molecular orbital at every downfolding step/iteration. The entire process gets repeated for every orbital downfolding, leading to a smaller dimensional effective Hamiltonian.", "url": "https://worldwide.espacenet.com/patent/search/publication/US2024202561A1", "source": "epo-ops" }, { "publication_number": "US2024013081A1", "country": "US", "doc_number": "2024013081", "kind": "A1", "date": null, "title": "METHOD AND SYSTEM FOR RECOMMENDING OPTIMUM COMBINATION OF QUANTUM CIRCUITS", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "KULKARNI ANIKET NANDKISHOR [IN]", "RANJAN SUKESH KUMAR [IN]", "VENKATESWARAN PATHAI VISWANATHAN [IN]", "CHANDRA MARISWAMY GIRISH [IN]", "SHAH PRANAV CHAMPAKLAL [IN]", "PRAMANIK SAYANTAN [IN]", "SRIDHAR CHUNDI VENKATA [IN]", "VAIDYA VISHNU [IN]" ], "ipc": [ "G06N" ], "abstract": "[0000] Traditional approaches for recommending optimum combination of quantum circuits are experimentation based approaches, and require manual efforts or are cumbersome, effort intensive and iterative processes. Method and system disclosed herein generally relates to quantum experimentation, and, more particularly, for recommending optimum combination of quantum circuits. In this approach, a high-level combination of experiments are initially generated, which are further prioritized using a graph based approach, which then forms a training data. The training data is then used for generating a GNN data model, which is further used for recommending optimum combination of quantum circuits.", "url": "https://worldwide.espacenet.com/patent/search/publication/US2024013081A1", "source": "epo-ops" }, { "publication_number": "US2022269961A1", "country": "US", "doc_number": "2022269961", "kind": "A1", "date": null, "title": "SYSTEMS AND METHOD FOR SOLVING QUADRATIC UNCONSTRAINED D-ARY OPTIMIZATION (QUDO) PROBLEMS BY QUANTUM COMPUTING", "applicants": [ "TATA CONSULTANCY SERVICES LTD [IN]", "Tata Consultancy Services Limited" ], "inventors": [ "PRAMANIK SAYANTAN [IN]", "CHANDRA MARISWAMY GIRISH [IN]", "PRAMANIK, Sayantan", "CHANDRA, Mariswamy Girish", "Pramanik, Sayantan", "Chandra, Mariswamy Girish" ], "ipc": [ "G06F", "G06N" ], "abstract": "[0001] Quantum Information Processing (QIP) with the availability of Noisy Intermediate-Scale Quantum (NISQ) device(s) are available to work on quantum algorithms. Different problems, which are hard to solve by classical computation, but can be sped up (significantly in some cases) are also being populated. However, current approaches solve only two cluster max-cut problems. Mining the two cluster Max-Cut problem within the framework of quantum Ising model, embodiments of the present disclosure solve Quadratic Unconstrained D-ary Optimization (QUDO) problems by quantum computing with the identification of an appropriate Hamiltonian. More specifically, the problem is mapped to an Ising model to obtain a d-ray Quantum Ising Hamiltonian. The d-ray Quantum Ising Hamiltonian is then executed on one or more qudit processors, to obtain one or more resultant quantum states which are measured in a qudit computational basis to obtain at least one solution.", "url": "https://worldwide.espacenet.com/patent/search/publication/US2022269961A1", "source": "epo-ops" }, { "publication_number": "US2021256411A1", "country": "US", "doc_number": "2021256411", "kind": "A1", "date": null, "title": "Method and System for Predicting Failures in Interconnected Systems Based on Quantum Computing", "applicants": [ "WIPRO LTD [IN]", "Wipro Limited" ], "inventors": [ "JAYARAMAN VENKATA SUBRAMANIAN [IN]", "SUNDARESAN SUMITHRA [IN]", "JAYARAMAN, Venkata Subramanian", "SUNDARESAN, Sumithra", "Jayaraman, Venkata Subramanian", "Sundaresan, Sumithra" ], "ipc": [ "G06K", "G06F", "G06N" ], "abstract": "Method and system for predicting failures in interconnected systems based on quantum computing is disclosed. The method may include identifying a set of unique patterns from input data received from a plurality of input data sources, determining a correlation between at least two input data sources, creating a plurality of sets of clusters corresponding to the plurality of input data sources based on the correlation, extracting data associated with each of the set of unique patterns based on the plurality of sets of clusters, predicting, based on the extracted data, a failure of at least one interconnected system using a trained ML model, processing the extracted data associated with each of the set of unique patterns and information associated with the predicted failure through a quantum computing layer, and generating, through the quantum computing layer, at least one corrective action for the at least one interconnected system.", "url": "https://worldwide.espacenet.com/patent/search/publication/US2021256411A1", "source": "epo-ops" }, { "publication_number": "EP4242935A1", "country": "EP", "doc_number": "4242935", "kind": "A1", "date": null, "title": "METHOD AND SYSTEM OF ENHANCED HYBRID QUANTUM-CLASSICAL COMPUTING MECHANISM FOR SOLVING OPTIMIZATION PROBLEMS", "applicants": [ "INFOSYS LTD [IN]", "Infosys Limited" ], "inventors": [ "JAIN VIPUL [IN]", "BOTHRA ADITYA [IN]", "VARADHARAJAN VIJAYARAGHAVAN [IN]", "BORSO UMBERTO [GB]", "JAIN, Vipul", "BOTHRA, Aditya", "VARADHARAJAN, Vijayaraghavan", "BORSO, Umberto" ], "ipc": [ "G06N", "G06Q" ], "abstract": "A method of enhanced hybrid quantum-classical computing mechanism for solving optimization problems is disclosed comprising altering a value of a configuration chromosome by storing an angle memory on a shared classical memory. The angle memory corresponds to a predefined configuration chromosome. The method then generates a state vector based on the angle memory and reinitializes a quantum circuit from the state vector. Subsequently, generating at least two most probable configuration chromosome from the reinitialized quantum circuit corresponding to a superposition of qubits in a position chromosome. Subsequently selecting one of the at least two most probable configuration chromosomes for each position chromosome after evaluation by a fitness function.", "url": "https://worldwide.espacenet.com/patent/search/publication/EP4242935A1", "source": "epo-ops" }, { "publication_number": "US2024388425A1", "country": "US", "doc_number": "2024388425", "kind": "A1", "date": null, "title": "METHOD AND APPARATUS FOR OPTIMIZING PERFORMANCE OF A QUANTUM KEY DISTRIBUTION (QKD) PROTOCOL", "applicants": [ "RAMAN RES INSTITUTE [IN]", "Raman Research Institute" ], "inventors": [ "SINHA URBASI [IN]", "CHATTERJEE SOURAV [IN]", "SINHA, Urbasi", "CHATTERJEE, Sourav", "Sinha, Urbasi", "Chatterjee, Sourav" ], "ipc": [ "H04L" ], "abstract": "[0000] The present disclosure relates to field of quantum cryptography that discloses method of optimizing performance of Quantum Key Distribution (QKD) protocol. Computing system (101) extracts one or more coincidence distribution sets generated from one or more timestamps detected during communication by one or more detector pairs associated with sender and receiver of communication. Further, computing system identifies one or more reference lines indicating signal value and noise value in each of one or more coincidence distribution sets. Thereafter, computing system determines time window in one or more coincidence distribution sets by iteratively adjusting one or more reference lines in incremental steps until at least one of, performance parameters, signal value and noise value within time window complies with predefined requirements. Finally, computing system optimizes performance of QKD protocol based on determined time window. present disclosure provides an advantage of optimizing individual Signal-to-Noise Ratio (SNR) while restricting QBER to predefined limit.", "url": "https://worldwide.espacenet.com/patent/search/publication/US2024388425A1", "source": "epo-ops" } ] }