Enhanced Simultaneous Quantum-Classical Communications Under Composable Security

• URL: http://arxiv.org/abs/2505.03145v1
• Date: Tue, 06 May 2025 03:40:48 GMT
• Title: Enhanced Simultaneous Quantum-Classical Communications Under Composable Security
• Authors: Nicholas Zaunders, Ziqing Wang, Robert Malaney, Ryan Aguinaldo, Timothy C. Ralph,
• Abstract summary: Simultaneous quantum-classical communications (SQCC) protocols allow for quantum and classical symbols to be integrated concurrently on the same optical pulse and mode.<n>We address security concerns inherently associated with SQCC schemes and provide an updated model of the coupling between the classical and quantum channels.
• Score: 0.2982610402087727
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Simultaneous quantum-classical communications (SQCC) protocols are a family of continuous-variable quantum key distribution (CV-QKD) protocols which allow for quantum and classical symbols to be integrated concurrently on the same optical pulse and mode. In this work, we present a revised analysis of simultaneous quantum-classical communications in Gaussian-modulated coherent-state CV-QKD protocols. We address security concerns inherently associated with SQCC schemes and provide an updated model of the coupling between the classical and quantum channels. We provide evidence for our model via Monte Carlo simulation. We compute the performance of our revised SQCC protocol in terms of the secret-key generation rate optimised over free parameters and demonstrate improved quantum efficiency for a given classical bit-error rate. Lastly, we extend our analysis into the finite-key regime, where we propose a scheme for composably-secure SQCC under realistic operating conditions and demonstrate that our scheme retains the advantage in quantum performance over previous models.

Related papers

• Toward Large-Scale Distributed Quantum Long Short-Term Memory with Modular Quantum Computers [5.673361333697935]
  We introduce a Distributed Quantum Long Short-Term Memory (QLSTM) framework to address scalability challenges on Noisy Intermediate-Scale Quantum (NISQ) devices.<n>QLSTM captures long-range temporal dependencies, while a distributed architecture partitions the underlying Variational Quantum Circuits into smaller, manageable subcircuits.<n>We demonstrate that the distributed QLSTM achieves stable convergence and improved training dynamics compared to classical approaches.
  arXiv  Detail & Related papers  (2025-03-18T10:07:34Z)
• Asymmetric protocols for mode pairing quantum key distribution with finite-key analysis [5.323964523588455]
  We conduct a security analysis of asymmetric MP-QKD protocol with the finite-key analysis.<n>Our work can achieve significantly enhanced secure key rates and transmission distances compared to the original strategy.
  arXiv  Detail & Related papers  (2024-12-17T06:50:15Z)
• 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)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• High-rate discretely-modulated continuous-variable quantum key distribution using quantum machine learning [4.236937886028215]
  We propose a high-rate scheme for discretely-modulated continuous-variable quantum key distribution (DM CVQKD) using quantum machine learning technologies. A low-complexity quantum k-nearest neighbor (QkNN) is designed for predicting the lossy discretely-modulated coherent states (DMCSs) at Bob's side. Numerical simulation shows that the secret key rate of our proposed scheme is explicitly superior to the existing DM CVQKD protocols.
  arXiv  Detail & Related papers  (2023-08-07T04:00:13Z)
• Practical quantum secure direct communication with squeezed states [55.41644538483948]
  We report the first table-top experimental demonstration of a CV-QSDC system and assess its security. This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
  arXiv  Detail & Related papers  (2023-06-25T19:23:42Z)
• Pre-training Tensor-Train Networks Facilitates Machine Learning with Variational Quantum Circuits [70.97518416003358]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning on noisy intermediate-scale quantum (NISQ) devices. While tensor-train networks (TTNs) can enhance VQC representation and generalization, the resulting hybrid model, TTN-VQC, faces optimization challenges due to the Polyak-Lojasiewicz (PL) condition. To mitigate this challenge, we introduce Pre+TTN-VQC, a pre-trained TTN model combined with a VQC.
  arXiv  Detail & Related papers  (2023-05-18T03:08:18Z)
• A Feasible Semi-quantum Private Comparison Based on Entanglement Swapping of Bell States [5.548873288570182]
  We propose a feasible semi-quantum private comparison protocol based on entanglement swapping of Bell states. Security analysis shows that our protocol is resilient to both external and internal attacks. Our proposed approach showcases the potential applications of entanglement swapping in the field of semi-quantum cryptography.
  arXiv  Detail & Related papers  (2023-05-12T13:28:44Z)
• A Framework for Demonstrating Practical Quantum Advantage: Racing Quantum against Classical Generative Models [62.997667081978825]
  We build over a proposed framework for evaluating the generalization performance of generative models. We establish the first comparative race towards practical quantum advantage (PQA) between classical and quantum generative models. Our results suggest that QCBMs are more efficient in the data-limited regime than the other state-of-the-art classical generative models.
  arXiv  Detail & Related papers  (2023-03-27T22:48:28Z)
• Improved composable key rates for CV-QKD [0.0]
  In this paper, we refine and advance the previous theory in this area. We provide a more rigorous formulation for the composable key rate of a generic CV-QKD protocol.
  arXiv  Detail & Related papers  (2023-01-24T19:04:39Z)
• When BERT Meets Quantum Temporal Convolution Learning for Text Classification in Heterogeneous Computing [75.75419308975746]
  This work proposes a vertical federated learning architecture based on variational quantum circuits to demonstrate the competitive performance of a quantum-enhanced pre-trained BERT model for text classification. Our experiments on intent classification show that our proposed BERT-QTC model attains competitive experimental results in the Snips and ATIS spoken language datasets.
  arXiv  Detail & Related papers  (2022-02-17T09:55:21Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.