TrojanNet: Detecting Trojans in Quantum Circuits using Machine Learning
Subrata Das, Swaroop Ghosh

TL;DR
TrojanNet is a machine learning-based method that accurately detects Trojan-inserted quantum circuits, specifically QAOA circuits, achieving over 98% accuracy, thereby enhancing quantum circuit security against malicious tampering.
Contribution
This paper introduces TrojanNet, a CNN-based approach tailored for quantum circuits, marking a novel application of ML for Trojan detection in quantum computing.
Findings
Achieved 98.80% accuracy in Trojan detection
Created diverse datasets with various Trojan insertions
Outperformed existing Trojan detection methods for netlists
Abstract
Quantum computing holds tremendous potential for various applications, but its security remains a crucial concern. Quantum circuits need high-quality compilers to optimize the depth and gate count to boost the success probability on current noisy quantum computers. There is a rise of efficient but unreliable/untrusted compilers; however, they present a risk of tampering such as Trojan insertion. We propose TrojanNet, a novel approach to enhance the security of quantum circuits by detecting and classifying Trojan-inserted circuits. In particular, we focus on the Quantum Approximate Optimization Algorithm (QAOA) circuit that is popular in solving a wide range of optimization problems. We investigate the impact of Trojan insertion on QAOA circuits and develop a Convolutional Neural Network (CNN) model, referred to as TrojanNet, to identify their presence accurately. Using the Qiskit…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Adversarial Robustness in Machine Learning · Advancements in Semiconductor Devices and Circuit Design
