QKD as a Quantum Machine Learning task

• URL: http://arxiv.org/abs/2410.01904v1
• Date: Wed, 2 Oct 2024 18:03:38 GMT
• Title: QKD as a Quantum Machine Learning task
• Authors: T. Decker, M. Gallezot, S. F. Kerstan, A. Paesano, A. Ginter, W. Wormsbecher,
• Abstract summary: We propose considering Quantum Key Distribution (QKD) protocols as a use case for Quantum Machine Learning (QML) algorithms. We define and investigate the QML task of optimizing eavesdropping attacks on the quantum circuit implementation of the BB84 protocol. We present a QML construction of a collective attack by using classical information from QKD post-processing within the QML algorithm.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose considering Quantum Key Distribution (QKD) protocols as a use case for Quantum Machine Learning (QML) algorithms. We define and investigate the QML task of optimizing eavesdropping attacks on the quantum circuit implementation of the BB84 protocol. QKD protocols are well understood and solid security proofs exist enabling an easy evaluation of the QML model performance. The power of easy-to-implement QML techniques is shown by finding the explicit circuit for optimal individual attacks in a noise-free setting. For the noisy setting we find, to the best of our knowledge, a new cloning algorithm, which can outperform known cloning methods. Finally, we present a QML construction of a collective attack by using classical information from QKD post-processing within the QML algorithm.

Related papers

• Variational Quantum Machine Learning with Quantum Error Detection [0.6435156676256051]
  Quantum machine learning (QML) is an emerging field that promises advantages such as faster training, improved reliability and superior extraction over classical counterparts. Its implementation on quantum hardware is challenging due to the noise inherent in these systems, necessitating the use of quantum error correction (QEC) codes. Current QML research remains primarily theoretical, often assuming noise-free environments and offering little insight into the integration of QEC with QML.
  arXiv  Detail & Related papers  (2025-04-09T10:56:21Z)
• QNN-QRL: Quantum Neural Network Integrated with Quantum Reinforcement Learning for Quantum Key Distribution [3.057222561438637]
  We present two novel QRL-based algorithms, QRL-V.1 and QRL-V.2, and propose the standard BB84 and B92 protocols. We combine QNN with the above QRL-based algorithms to produce QNN-BB84 and QNN-B92. The results from the QNN-based proposed algorithms show considerable improvements in key generation quality.
  arXiv  Detail & Related papers  (2025-01-30T07:42:27Z)
• Learning to Measure Quantum Neural Networks [10.617463958884528]
  We introduce a novel approach that makes the observable of the quantum system-specifically, the Hermitian matrix-learnable. Our method features an end-to-end differentiable learning framework, where the parameterized observable is trained alongside the ordinary quantum circuit parameters. Using numerical simulations, we show that the proposed method can identify observables for variational quantum circuits that lead to improved outcomes.
  arXiv  Detail & Related papers  (2025-01-10T02:28:19Z)
• Leveraging Pre-Trained Neural Networks to Enhance Machine Learning with Variational Quantum Circuits [48.33631905972908]
  We introduce an innovative approach that utilizes pre-trained neural networks to enhance Variational Quantum Circuits (VQC) This technique effectively separates approximation error from qubit count and removes the need for restrictive conditions. Our results extend to applications such as human genome analysis, demonstrating the broad applicability of our approach.
  arXiv  Detail & Related papers  (2024-11-13T12:03:39Z)
• Practical hybrid PQC-QKD protocols with enhanced security and performance [44.8840598334124]
  We develop hybrid protocols by which QKD and PQC inter-operate within a joint quantum-classical network. In particular, we consider different hybrid designs that may offer enhanced speed and/or security over the individual performance of either approach.
  arXiv  Detail & Related papers  (2024-11-02T00:02:01Z)
• Circumventing Traps in Analog Quantum Machine Learning Algorithms Through Co-Design [0.0]
  We show how to co-design AQML algorithms for unitary evolution simulation using the ansatz's Magnus expansion. We conclude that such co-design is necessary to ensure the applicability of AQML algorithms.
  arXiv  Detail & Related papers  (2024-08-26T23:52:20Z)
• Discrete Randomized Smoothing Meets Quantum Computing [40.54768963869454]
  We show how to encode all the perturbations of the input binary data in superposition and use Quantum Amplitude Estimation (QAE) to obtain a quadratic reduction in the number of calls to the model. In addition, we propose a new binary threat model to allow for an extensive evaluation of our approach on images, graphs, and text.
  arXiv  Detail & Related papers  (2024-08-01T20:21:52Z)
• Quantum Machine Learning Architecture Search via Deep Reinforcement Learning [8.546707309430593]
  We introduce deep reinforcement learning to explore proficient QML model architectures tailored for supervised learning tasks. Our methodology involves training an RL agent to devise policies that facilitate the discovery of QML models without predetermined ansatz. Our proposed method successfully identifies VQC architectures capable of achieving high classification accuracy while minimizing gate depth.
  arXiv  Detail & Related papers  (2024-07-29T16:20:51Z)
• Challenges for Reinforcement Learning in Quantum Circuit Design [8.894627352356302]
  Hybrid quantum machine learning (QML) comprises both the application of QC to improve machine learning (ML) and ML to improve QC architectures. We propose qcd-gym, a concrete framework formalized as a Markov decision process, to enable learning policies capable of controlling a universal set of continuously parameterized quantum gates.
  arXiv  Detail & Related papers  (2023-12-18T16:41:30Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• Drastic Circuit Depth Reductions with Preserved Adversarial Robustness by Approximate Encoding for Quantum Machine Learning [0.5181797490530444]
  We implement methods for the efficient preparation of quantum states representing encoded image data using variational, genetic and matrix product state based algorithms. Results show that these methods can approximately prepare states to a level suitable for QML using circuits two orders of magnitude shallower than a standard state preparation implementation.
  arXiv  Detail & Related papers  (2023-09-18T01:49:36Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• Potential and limitations of quantum extreme learning machines [55.41644538483948]
  We present a framework to model QRCs and QELMs, showing that they can be concisely described via single effective measurements. Our analysis paves the way to a more thorough understanding of the capabilities and limitations of both QELMs and QRCs.
  arXiv  Detail & Related papers  (2022-10-03T09:32:28Z)
• Quantum Machine Learning for Software Supply Chain Attacks: How Far Can We Go? [5.655023007686363]
  This paper analyzes speed up performance of QC when applied to machine learning algorithms, known as Quantum Machine Learning (QML) Due to limitations of real quantum computers, the QML methods were implemented on open-source quantum simulators such as Qiskit and IBM Quantum. Interestingly, the experimental results differ to the speed up promises of QC by demonstrating higher computational time and lower accuracy in comparison to the classical approaches for SSC attacks.
  arXiv  Detail & Related papers  (2022-04-04T21:16:06Z)
• Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection [80.28858481461418]
  Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices. Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2021-07-11T10:56:24Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.