Machine Learning assisted noise classification with Quantum Key Distribution protocols
- URL: http://arxiv.org/abs/2504.00718v1
- Date: Tue, 01 Apr 2025 12:30:47 GMT
- Title: Machine Learning assisted noise classification with Quantum Key Distribution protocols
- Authors: Shreya Banerjee, Ashmi A., Prasanta K. Panigrahi,
- Abstract summary: We consider the quantum bit error rates (QBERs) generated in quantum key distribution schemes under consideration of different noises.<n>Our protocol classifies quantum noises with high accuracy under the assumption of two different scenarios.<n>Our method is based on classical post processing of data generated from very simplistic quantum protocols.
- Score: 0.7373617024876725
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We propose a hybrid protocol to classify quantum noises using supervised classical machine learning models and simple quantum key distribution protocols. We consider the quantum bit error rates (QBERs) generated in QKD schemes under consideration of different noises, and identify the noise channels with high accuracy for both training and test data. Our protocol classifies quantum noises with high accuracy under the assumption of two different scenarios; in one case we assume two remotely located parties share keys through noisy quantum channels, whereas, in the second case, we simulate the QKD protocols on a gate-based quantum computer, where the gates are afflicted with noise. Alongside efficient classification, our work also throws light on the difference in distribution characteristics of QBERs generated in these two scenarios. Finally, our method is based on classical post processing of data generated from very simplistic quantum protocols, making it readily implementable in the current era of noisy quantum computing with low number of qubits.
Related papers
- Controlled-Quantum secure remote sensing [0.6749750044497732]
decoherence in the quantum communication channel and during the evolution of quantum states can erode quantum sensing advantages.
We introduce a modified protocol incorporating local quantum optimal control (QOC) operations to address noise in SQS.
The protocol actively mitigates noise, enhancing the achievable quantum Fisher information (QFI) and the classical Fisher information (CFI) based on the chosen measurement strategy.
arXiv Detail & Related papers (2025-04-25T06:10:58Z) - Resource Reduction in Multiparty Quantum Secret Sharing of both Classical and Quantum Information under Noisy Scenario [4.757470449749876]
Quantum secret sharing (QSS) enables secure distribution of information among multiple parties but remains vulnerable to noise.
We analyze the effects of bit-flip, phase-flip, and amplitude damping noise on the multiparty QSS for classical message (QSSCM) and secret sharing of quantum information (SSQI) protocols.
We introduce an efficient quantum error correction scheme based on a simplified version of Shor's code.
arXiv Detail & Related papers (2025-04-23T13:40:06Z) - Bayesian Quantum Amplitude Estimation [49.1574468325115]
We introduce BAE, a noise-aware Bayesian algorithm for quantum amplitude estimation.<n>We show that BAE achieves Heisenberg-limited estimation and benchmark it against other approaches.
arXiv Detail & Related papers (2024-12-05T18:09:41Z) - Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML)
At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
arXiv Detail & Related papers (2024-11-13T23:56:20Z) - Characterization of Noise using variants of Unitarity Randomized Benchmarking [6.376549579074444]
Unitarity randomized benchmarking (URB) protocol is a method to estimate the coherence of noise induced by the quantum gates.
We for the first time implement the URB protocol in a quantum simulator with all the parameters and noise model are used from a real quantum device.
arXiv Detail & Related papers (2024-10-27T17:46:51Z) - Twin-field-based multi-party quantum key agreement [0.0]
We study a method to extend the twin-field key distribution protocol to a scheme for multi-party quantum key agreement.<n>We study our protocol's security using a minimum error discrimination analysis and derive the key rate based on the entanglement-based source-replacement scheme.
arXiv Detail & Related papers (2024-09-06T11:51:10Z) - 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) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Mitigating crosstalk errors by randomized compiling: Simulation of the
BCS model on a superconducting quantum computer [41.94295877935867]
Crosstalk errors, stemming from CNOT two-qubit gates, are a crucial source of errors on numerous quantum computing platforms.
We develop and apply an extension of the randomized compiling protocol that includes a special treatment of neighboring qubits.
Our twirling of neighboring qubits is shown to dramatically improve the noise estimation protocol without the need to add new qubits or circuits.
arXiv Detail & Related papers (2023-05-03T18:00:02Z) - Testing quantum computers with the protocol of quantum state matching [0.0]
The presence of noise in quantum computers hinders their effective operation.
We suggest the application of the so-called quantum state matching protocol for testing purposes.
For systematically varied inputs we find that the device with the smaller quantum volume performs better on our tests than the one with larger quantum volume.
arXiv Detail & Related papers (2022-10-18T08:25:34Z) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - 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) - Efficient and robust certification of genuine multipartite entanglement
in noisy quantum error correction circuits [58.720142291102135]
We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME)
We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME.
We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
arXiv Detail & Related papers (2020-10-06T18:00:07Z)
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.