Nikolay Tcholtchev
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Nikolay Tcholtchev has a total of 62 co-authors. Here are the top co-authors by number of shared publications:
- Philipp Lämmel
Fraunhofer Institute for Open Communication Systems (FOKUS), 10589 Berlin, Germany
9 shared publications - Ina Schieferdecker
TU Berlin
8 shared publications - Michell Boerger
Fraunhofer Institute for Open Communication Systems FOKUS, Berlin, Germany
7 shared publications - Manfred Hauswirth
Fraunhofer FOKUS, Berlin, Germany
4 shared publications - Denis Rangelov
Fraunhofer Institute for Open Communication Systems (FOKUS), Berlin, Germany
3 shared publications - George Xilouris
Institute of Informatics and Telecommunications, National Centre for Scientific Research “Demokritos”, Agia Paraskevi, 15341 Athens, Greece
2 shared publications
Latest Publications
- Open Access
- 11 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 7 (3) , 1-32
Quantum Backtracking in Qrisp Applied to Sudoku Problems
The quantum backtracking algorithm proposed by Ashley Montanaro raised considerable interest, as it provides a quantum speed-up for a large class of classical optimization algorithms. It does not suffer from Barren-Plateaus, that affect variational quantum algorithms, and transfers well into the fault-tolerant era, as it requires only a limited number of arbitrary angle gates. Despite its potential, the algorithm has seen limited implementation efforts, presumably due to its abstract formulation. In this work, we provide a detailed instruction on implementing the quantum step operator for arbitrary backtracking instances. For a single controlled diffuser of a binary backtracking tree with depth n , our implementation requires only 6 n +14 CX gates. We detail the process of constructing accept and reject oracles for Sudoku problems using our interface to quantum backtracking. The presented code is written using Qrisp, a high-level quantum programming language, making it executable on most current physical backends and simulators. Subsequently, we perform several simulator based experiments and demonstrate solving 4× 4 Sudoku instances with up to nine empty fields. This is, to the best of our knowledge, the first instance of a compilable implementation of this generality, marking a significant and exciting step forward in quantum software engineering.
- 11 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 7 (3) , 1-32
Open AccessQuantum Backtracking in Qrisp Applied to Sudoku Problems
The quantum backtracking algorithm proposed by Ashley Montanaro raised considerable interest, as it provides a quantum speed-up for a large class of classical optimization algorithms. It does not suffer from Barren-Plateaus, that affect variational quantum algorithms, and transfers well into the fault-tolerant era, as it requires only a limited number of arbitrary angle gates. Despite its potential, the algorithm has seen limited implementation efforts, presumably due to its abstract formulation. In this work, we provide a detailed instruction on implementing the quantum step operator for arbitrary backtracking instances. For a single controlled diffuser of a binary backtracking tree with depth n , our implementation requires only 6 n +14 CX gates. We detail the process of constructing accept and reject oracles for Sudoku problems using our interface to quantum backtracking. The presented code is written using Qrisp, a high-level quantum programming language, making it executable on most current physical backends and simulators. Subsequently, we perform several simulator based experiments and demonstrate solving 4× 4 Sudoku instances with up to nine empty fields. This is, to the best of our knowledge, the first instance of a compilable implementation of this generality, marking a significant and exciting step forward in quantum software engineering.
- Open Access
- 29 May 2026
- Published by Elsevier in Internet of Things
- Vol. 38
Topology-aware quantization and pruning for FHE-based anomaly detection in smart city IoT
- 29 May 2026
- Published by Elsevier in Internet of Things
- Vol. 38
Open AccessTopology-aware quantization and pruning for FHE-based anomaly detection in smart city IoT
- 11 March 2025
- Published by Springer Nature
- p. 311-318
OASEES: Leveraging DAO-Based Programmable Swarms for Optimized Edge-to-Cloud Data Processing
- 11 March 2025
- Published by Springer Nature
- p. 311-318
OASEES: Leveraging DAO-Based Programmable Swarms for Optimized Edge-to-Cloud Data Processing
- Open Access
A parameter study for LLL and BKZ with application to shortest vector problems
In this work, we study the solution of shortest vector problems (SVPs) arising in terms of learning with error problems (LWEs). LWEs are linear systems of equations over a modular ring, where a perturbation vector is added to the right-hand side. This type of problem is of great interest, since LWEs have to be solved in order to be able to break lattice-based cryptosystems as the Module-Lattice-Based Key-Encapsulation Mechanism published by NIST in 2024. Due to this fact, several classical and quantum-based algorithms have been studied to solve SVPs. Two well-known algorithms that can be used to simplify a given SVP are the Lenstra-Lenstra-Lovász (LLL) algorithm and the Block Korkine-Zolotarev (BKZ) algorithm. LLL and BKZ construct bases that can be used to compute or approximate solutions of the SVP. We study the performance of both algorithms for SVPs with different sizes and modular rings. Thereby, application of LLL or BKZ to a given SVP is considered to be successful if they produce bases containing a solution vector of the SVP.
Open AccessA parameter study for LLL and BKZ with application to shortest vector problems
In this work, we study the solution of shortest vector problems (SVPs) arising in terms of learning with error problems (LWEs). LWEs are linear systems of equations over a modular ring, where a perturbation vector is added to the right-hand side. This type of problem is of great interest, since LWEs have to be solved in order to be able to break lattice-based cryptosystems as the Module-Lattice-Based Key-Encapsulation Mechanism published by NIST in 2024. Due to this fact, several classical and quantum-based algorithms have been studied to solve SVPs. Two well-known algorithms that can be used to simplify a given SVP are the Lenstra-Lenstra-Lovász (LLL) algorithm and the Block Korkine-Zolotarev (BKZ) algorithm. LLL and BKZ construct bases that can be used to compute or approximate solutions of the SVP. We study the performance of both algorithms for SVPs with different sizes and modular rings. Thereby, application of LLL or BKZ to a given SVP is considered to be successful if they produce bases containing a solution vector of the SVP.
- 15 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 57 (12) , 47-57
AI Robustness Against Attacks in City-Scale Autonomous Drone Deployments
We analyze the impact of poisoning attacks on autonomous drones and demonstrate how explainable artificial intelligence techniques can be employed to detect them. We then delve into the risks, opportunities, and research challenges, ultimately paving the way for city-scale deployments of autonomous drones.
- 15 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 57 (12) , 47-57
AI Robustness Against Attacks in City-Scale Autonomous Drone Deployments
We analyze the impact of poisoning attacks on autonomous drones and demonstrate how explainable artificial intelligence techniques can be employed to detect them. We then delve into the risks, opportunities, and research challenges, ultimately paving the way for city-scale deployments of autonomous drones.
- Open Access
- 30 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-7
PQ-REACT: Post Quantum Cryptography Framework for Energy Aware Contexts
Public key cryptography is nowadays a crucial component of global communications which are critical to our economy, security and way of life. The quantum computers are expected to be a threat and the widely used RSA, ECDSA, ECDH, and DSA cryptosystems will need to be replaced by quantum safe cryptography. The main objective of the HORIZON Europe PQ-REACT project is to design, develop and validate a framework for a faster and smoother transition from classical to quantum safe cryptography for a wide variety of contexts and usage domains that could have a potential interest for defence purposes. This framework will include Post Quantum Cryptography (PQC) migration paths and cryptographic agility methods and will develop a portfolio of tools for validation of post quantum cryptographic systems using Quantum Computing. A variety of real-world pilots using PQC and Quantum Cryptography, i.e., Smart Grids, 5G and Ledgers will be deployed to validate the defined framework.
- 30 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessPQ-REACT: Post Quantum Cryptography Framework for Energy Aware Contexts
Public key cryptography is nowadays a crucial component of global communications which are critical to our economy, security and way of life. The quantum computers are expected to be a threat and the widely used RSA, ECDSA, ECDH, and DSA cryptosystems will need to be replaced by quantum safe cryptography. The main objective of the HORIZON Europe PQ-REACT project is to design, develop and validate a framework for a faster and smoother transition from classical to quantum safe cryptography for a wide variety of contexts and usage domains that could have a potential interest for defence purposes. This framework will include Post Quantum Cryptography (PQC) migration paths and cryptographic agility methods and will develop a portfolio of tools for validation of post quantum cryptographic systems using Quantum Computing. A variety of real-world pilots using PQC and Quantum Cryptography, i.e., Smart Grids, 5G and Ledgers will be deployed to validate the defined framework.
- 10 July 2024
- Published by Springer Nature
- p. 169-190
Quantitative Evaluation of xAI Methods for Multivariate Time Series - A Case Study for a CNN-Based MI Detection Model
- 10 July 2024
- Published by Springer Nature
- p. 169-190
Quantitative Evaluation of xAI Methods for Multivariate Time Series - A Case Study for a CNN-Based MI Detection Model
- Open Access
- 27 March 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (1) , 013330
Extracting GHZ states from linear cluster states
Quantum information processing architectures typically only allow for nearest-neighbor entanglement creation. In many cases, this prevents the direct generation of states, which are commonly used for many communication and computation tasks. Here, we show how to obtain states between nodes in a network that are connected in a straight line, naturally allowing them to initially share linear cluster states. We prove a strict upper bound of on the size of the set of nodes sharing a state that can be obtained from a linear cluster state of qubits, using local Clifford unitaries, local Pauli measurements, and classical communication. Furthermore, we completely characterize all selections of nodes below this threshold that can share a state obtained within this setting. Finally, we demonstrate these transformations on the IBMQ Montreal quantum device for linear cluster states of up to qubits.- 27 March 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (1) , 013330
Open AccessExtracting GHZ states from linear cluster states
Quantum information processing architectures typically only allow for nearest-neighbor entanglement creation. In many cases, this prevents the direct generation of states, which are commonly used for many communication and computation tasks. Here, we show how to obtain states between nodes in a network that are connected in a straight line, naturally allowing them to initially share linear cluster states. We prove a strict upper bound of on the size of the set of nodes sharing a state that can be obtained from a linear cluster state of qubits, using local Clifford unitaries, local Pauli measurements, and classical communication. Furthermore, we completely characterize all selections of nodes below this threshold that can share a state obtained within this setting. Finally, we demonstrate these transformations on the IBMQ Montreal quantum device for linear cluster states of up to qubits. - Open Access
- 7 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 50-57
Exploring CNN and XAI-based Approaches for Accountable MI Detection in the Context of IoT-enabled Emergency Communication Systems
The ageing European population and the expected increasing number of medical emergencies put pressure on the medical sector and existing emergency infrastructures, which calls for new innovative digital solutions. In parallel, the increasing utilization of the Internet of Things (IoT) has enabled the collection of real-time data, allowing for the autonomous detection of acute medical emergencies. In this context, this paper presents two distinct machine learning (ML) models that leverage electrocardiogram (ECG) sensor data to autonomously detect Myocardial Infarctions (MI), a leading cause of emergencies. These models are intended to be integrated into an IoT-enabled next-generation emergency communications system (NG112) capable of detecting emergencies, initiating emergency calls (eCalls), and providing relevant information to emergency call takers, which reduces response time. To realize this, two disparate models working on fundamentally different data structures are proposed and compared: A one-dimensional convolutional neural network (CNN) operating on the raw ECG signals and a GoogLeNet-based model trained on ECG images. The PTB-XL dataset is used to evaluate the proposed models, and the results indicate the 1D CNN exhibits a favourable trade-off between precision and recall for the eCall use case. Finally, the paper also discusses applying eXplainable AI (XAI) methods to achieve explainability for the ML models, paving the way for an accountable and reliable implementation in safety-critical systems.
- 7 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 50-57
Open AccessExploring CNN and XAI-based Approaches for Accountable MI Detection in the Context of IoT-enabled Emergency Communication Systems
The ageing European population and the expected increasing number of medical emergencies put pressure on the medical sector and existing emergency infrastructures, which calls for new innovative digital solutions. In parallel, the increasing utilization of the Internet of Things (IoT) has enabled the collection of real-time data, allowing for the autonomous detection of acute medical emergencies. In this context, this paper presents two distinct machine learning (ML) models that leverage electrocardiogram (ECG) sensor data to autonomously detect Myocardial Infarctions (MI), a leading cause of emergencies. These models are intended to be integrated into an IoT-enabled next-generation emergency communications system (NG112) capable of detecting emergencies, initiating emergency calls (eCalls), and providing relevant information to emergency call takers, which reduces response time. To realize this, two disparate models working on fundamentally different data structures are proposed and compared: A one-dimensional convolutional neural network (CNN) operating on the raw ECG signals and a GoogLeNet-based model trained on ECG images. The PTB-XL dataset is used to evaluate the proposed models, and the results indicate the 1D CNN exhibits a favourable trade-off between precision and recall for the eCall use case. Finally, the paper also discusses applying eXplainable AI (XAI) methods to achieve explainability for the ML models, paving the way for an accountable and reliable implementation in safety-critical systems.
- 12 July 2023
- Published by Springer Nature
- p. 150-165
Uncomputation in the Qrisp High-Level Quantum Programming Framework
- 12 July 2023
- Published by Springer Nature
- p. 150-165
Uncomputation in the Qrisp High-Level Quantum Programming Framework