Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1508.05237 · Quantum Information Processing

Which verification qubits perform best for secure communication in noisy channel?

Rishi Dutt Sharma, Kishore Thapliyal, Anirban Pathak, A. K. Pan, Асок Де

Published Dec 19, 2015• 37 citations
arXivHTMLPDF
DOI
10.1007/s11128-015-1207-6

Related papers

A comparative study of protocols for secure quantum communication under noisy environment: single-qubit-based protocols versus entangled-state-based protocols

Vishal Sharma, Kishore Thapliyal, Anirban Pathak +1 more

arXiv:1603.00178•Quantum Information Processing•Jul 29, 2016•55 citations

Secure Quantum Handshakes: Quantum Network Verification Via Simon's Algorithm

Reece Robertson, Sejal Patil, Sebastian Deffner

Quantum networking represents the future of secure communication, enabling fundamentally new capabilities through quantum information exchange. However, these networks require secure, high-fidelity quantum communication channels, and they require every participating node to be a genuine quantum device. Currently, there is no reliable method to verify whether clients entering a quantum network truly possess quantum computational capability and are connecting over robust channels. In this work, we introduce a client-validation protocol that functions as a proof-of-quantum-capability handshake. Our protocol secures a quantum network against classical spoofers, noisy quantum computers, and genuine quantum devices connecting with the network over noisy or insecure channels. We validate the efficacy of this protocol through numerical simulations under erasure, dephasing, and depolarizing noise models.

quant-pharXiv:2610.12209•Oct 9, 2026•0 citations

Quantum Location Verification in Noisy Channels

Robert Malaney

Recently it has been shown how the use of quantum entanglement can lead to the creation of real-time communication channels whose viability can be made location dependent. Such functionality leads to new security paradigms that are not possible in classical communication networks. Key to these new security paradigms are quantum protocols that can unconditionally determine that a receiver is in fact at an a priori assigned location. A limiting factor of such quantum protocols will be the decoherence of states held in quantum memory. Here we investigate the performance of quantum location verification protocols under decoherence effects. More specifically, we address the issue of how decoherence impacts the verification using N = 2 qubits entangled as Bell states, as compared to N >; 2 qubits entangled as GHZ states. We study the original quantum location verification protocol, as well as a variant protocol, introduced here, which utilizes teleportation. We find that the performance of quantum location verification is in fact similar for Bell states and some N >; 2 GHZ states, even though quantum decoherence degrades larger-qubit entanglements faster. Our results are important for the design and implementation of location-dependent communications in emerging quantum networks.

arXiv:1004.4689•Globecom•Dec 1, 2010•19 citations

How many bits are needed to transmit a qubit reliably?

P. K. Aravind

Physics Letters A•May 1, 1998•2 citations

Optimal 2N qubit entangled channels for quantum communication

Sreraman Muralidharan, Siddharth Karumanchi, Prasanta Kumar Panigrahi

arXiv:0804.4206•Apr 26, 2008•0 citations

Secure and Efficient Verification Protocol for Quantum Key Distribution

Ching‐Nung Yang, Chih-Yueh Tseng, Po-Cheng Yu +1 more

Quantum key distribution (QKD) is a secure communication protocol that uses quantum bits (qubits) to ensure the security of key exchange between two entities (Alice and Bob). Their shared qubits may suffer from errors due to noise and eavesdropping in the quantum channels. After the QKD key agreement phase, Alice's key may not be different from Bob's key. Therefore, we need key verification to deal with the inconsistent qubits (i.e. the wrong qubits at receiver end). This key verification process is also known as information reconciliation. Recently, Kurt et al. proposed a reconciliation in QKD (RQKD) by using the polynomial consistency property. In this paper, we propose an enhanced RQKD (ERQKD) to improve key verification. Our method is still based on polynomial consistency, but uses the properties of consistency in a different way to obtain better key verification efficiency.

International Conference on Communications, Circuits and Systems•May 23, 2025•1 citation
Quantum networking represents the future of secure communication, enabling fundamentally new capabilities through quantum information exchange. However, these networks require secure, high-fidelity quantum communication channels, and they require every participating node to be a genuine quantum device. Currently, there is no reliable method to verify whether clients entering a quantum network truly possess quantum computational capability and are connecting over robust channels. In this work, we introduce a client-validation protocol that functions as a proof-of-quantum-capability handshake. Our protocol secures a quantum network against classical spoofers, noisy quantum computers, and genuine quantum devices connecting with the network over noisy or insecure channels. We validate the efficacy of this protocol through numerical simulations under erasure, dephasing, and depolarizing noise models.
Recently it has been shown how the use of quantum entanglement can lead to the creation of real-time communication channels whose viability can be made location dependent. Such functionality leads to new security paradigms that are not possible in classical communication networks. Key to these new security paradigms are quantum protocols that can unconditionally determine that a receiver is in fact at an a priori assigned location. A limiting factor of such quantum protocols will be the decoherence of states held in quantum memory. Here we investigate the performance of quantum location verification protocols under decoherence effects. More specifically, we address the issue of how decoherence impacts the verification using N = 2 qubits entangled as Bell states, as compared to N >; 2 qubits entangled as GHZ states. We study the original quantum location verification protocol, as well as a variant protocol, introduced here, which utilizes teleportation. We find that the performance of quantum location verification is in fact similar for Bell states and some N >; 2 GHZ states, even though quantum decoherence degrades larger-qubit entanglements faster. Our results are important for the design and implementation of location-dependent communications in emerging quantum networks.
Quantum key distribution (QKD) is a secure communication protocol that uses quantum bits (qubits) to ensure the security of key exchange between two entities (Alice and Bob). Their shared qubits may suffer from errors due to noise and eavesdropping in the quantum channels. After the QKD key agreement phase, Alice's key may not be different from Bob's key. Therefore, we need key verification to deal with the inconsistent qubits (i.e. the wrong qubits at receiver end). This key verification process is also known as information reconciliation. Recently, Kurt et al. proposed a reconciliation in QKD (RQKD) by using the polynomial consistency property. In this paper, we propose an enhanced RQKD (ERQKD) to improve key verification. Our method is still based on polynomial consistency, but uses the properties of consistency in a different way to obtain better key verification efficiency.