Quantum Key Distribution over

a wireless fading channel with

diversity

Project report submitted for the partial fulfillment

of the requirements for the degree of

Bachelor of Technology
in
Communication and Computer Engineering

by

Pravar Garg - 23ucc586

Myukh Saraswat - 23ucc573

Course Coordinator
Dr. Nishant Gupta

Department of Communication and Computer Engineering

The LNM Institute of Information Technology, Jaipur
Copyright © The LNMIIT 2025
All Rights Reserved
Contents
1 Introduction 3
1.1 Problem Statement . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.2 Objectives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3

2 Literature Review 3

3 Methodology 4
3.1 Security Aspect of BB84 Quantum Key Distribution . . . . . . . 5
3.2 Block Diagram for MATLAB Simulation of BB84 QKD . . . . . 6
3.3 Incorporating Diversity Schemes . . . . . . . . . . . . . . . . . . 6

4 Results 8
4.1 Results of Simple BB84 QKD Scheme with AWGN Noise,Rayleigh
Fading and Pathloss . . . . . . . . . . . . . . . . . . . . . . . . . 8
4.2 Results of Simple BB84 QKD Scheme under diversity schemes . 10

5 Conclusion 11

2
1 Introduction
1.1 Problem Statement
In this age of digitization, the need for confidential communication and to main-
tain data integrity and trust is severe. Secure Communication is essential for
private files, banking systems, government and defense systems, to protect one’s
intellectual property. In quantum communication, the most basic and trusted
solution comes in the form of the BB84: Barret and Brassard Quantum Key
Distribution Scheme. The specialty of this quantum key distribution comes
from its application of quantum mechanics and physics in order to effectively
prevent intruder attacks. It is completely safe against the modern age threat
of quantum computers as well. However, since the realm of quantum communi-
cation is a new one, there leaves a research gap in applying this quantum key
distribution scheme over classical wireless communication scenarios and testing
its actual practicality in real life. Via this project, we have tried to achieve this
and apply classroom knowledge to the field of quantum communication.

1.2 Objectives
1. To successfully simulate a BB84 quantum key distribution under ideal
conditions: assuming communication in a perfect optical fiber. To analyse
the QBER (quantum bit error rate) with the help of MATLAB plots.
2. To incorporate classical wireless communication concepts such as Rayleigh
Fading, AWGN noise, Friis Free Space Model, etc. To replicate a pratical
life wireless scenario.
3. To compute and analyze key performance metrics, including Bit Error
Rate (BER), Quantum Bit Error Rate (QBER), and achievable secret key
rate, under varying SNR and channel conditions.
4. To study the effects of diversity - selection combining, equal gain com-
bining and maximal ratio combining on this quantum key distribution
scheme. The objective is to enhance the performance of this scheme while
supressing the QBER.
5. To compare the performance of this scheme under: (1) ideal conditions,
(2) practical wireless conditions and (3) practical wireless conditions +
diversity.
6. To assess the feasibility of integrating this scheme into real world applica-
tions, weighing against its drawbacks

2 Literature Review
1. Chankyun Lee,Ilkwon Sohn,Wonhyuk Lee: Eavesdropping Detection in
BB84 Quantum Key Distribution Protocols (IEEE Published) - Analysed

3
 the False Positive and False Negative Rate in BB84 Scheme
2. Patrick Bellot,Minh-Dung Dang: BB84 Implementation and Computer
Reality (IEEE Pubished) - Analysis of the CASCADE algorithm applied
in BB84 and its compactibility with Von-Neumman computer architecture
3. Song-Kong Chong,Tzonelih Hwang: Quantum key agreement protocol
based on BB84 (Optics Communication Research Journal Published) -
Modifying the BB84 scheme to delay its measurement at the reciver to
increase security
4. Nur Hanani Kamarul Aizan,Zuriati Ahmad Zukarnain,Hishamuddin Zain-
uddin: Implementation of BB84 Protocol on 802.11i - implements BB84
on WLAN network and analyses the effect of practical wireless conditions
5. Y. Begimbayeva,T. Zhaxalykov:RESEARCH OF QUANTUM KEY DIS-
TRIBUTION PROTOCOLS: BB84, B92, E91 (Scientific Journal of As-
tana IT University) - Comparison of different quantum key distributions
on the basis of performance and QBER
6. Sharifi Mohsen,Azizi Hooshang: A Simulative Comparison of BB84 Pro-
tocol with its Improved Version (Spanish Government branch of cryptog-
raphy)
7. Akwasi Adu-Kyere,Ethiopia Nigussie and Jouni Isoaho: Quantum Key
Distribution: Modeling and Simulation through BB84 Protocol Using
Python3 (sensors journal) - Implementation of BB84 and full commu-
nication pipeline using Python

3 Methodology
di(t) dθ
v(t) = R i(t) + L +K (1)
dt dt
d2 θ dθ
J +b + Tload = K i(t) (2)
dt2 dt
Θ(s) K
= (3)
V (s) (Js2 + bs)(Ls + R) + K 2
BB84 Quantum Key Scheme is the simplest and most famous Quantum key
distribution scheme by way of which two parties can secretly and securely share
a key. It is named after the two scientists who proposed it - Charles Ben-
net and Giles Brassard. It is based on the encrypted communication between
two parties Alice (Transmitter) and Bob (Reciever) with an eavesdropper Eve
(Hacker) trying to intrude on the channel communication between Alice and
Bob. Theoretically the following steps are followed in order to implement the
BB84 Quantum Key Distribution scheme - (For the sakes of the original re-
search by Bennet and Brassard, we will follow the terminology as Alice being
the transmitter and Bob being the reciever)

4
 1. Alice generates a sequence of random bits, example, BitsAlice = [0,1,1,0,0,1,0....]
2. Alice also generates a series of random basis where each basis varies
from either rectangular(+) or diagnol(*). This basis scheme is used to
map these random bits into quantum states. example, BasisAlice =
[+,+,*,+,*,+....]

3. According to these random bits and basis generated by alice, 4 quantum

states are defined using photons
(a) quantum state 1 - random bit = 0 and basis = + The photon
would be projected vertically at 0 degree angle
(b) quantum state 2 - random bit = 0 and basis = * The photon
would be projected horizontally at a 90 degree angle
(c) quantum state 3 - random bit = 1 and basis = + The photon
would be projected at an angle of 45 degrees
(d) quantum state 4 - random bit = 1 and basis = * The photon
would be projected at an angle of 135 degrees
4. To measure these quantum states, Bob generates random basis as well
example, BasisBob = [*,+,*,+,+,+....].
5. For basis which are common to both Alice and Bob for a particular bit,
the measured bit is the same as the transmitted bit otherwise for bits for
which the basis differs, the measured bit is taken at random.
6. Now from the measured bits and the transmitted bits, only the common
bits are considered and they form the raw key.
7. For security purposes, this raw key is made shorter by a hashing function
to not to reveal the key to the eavesdropper Eve. Hence, by matching both
the final keys of Alice and Bob - The Secret Key is securely transmitted

3.1 Security Aspect of BB84 Quantum Key Distribution

The BB84 Quantum Key Distribution scheme is proven to be secure because
of its application of quantum mechanics. The reason is that - Since each bit is
encoded as a non-orthogonal photon state and the cloning of quantum states
is not possible, the intruder does not know the basis. Hence, the intruder
cannot measure the quantum state without introducing errors. This is an effec-
tive quantum mechanics principle: Measurement disturbs the state. A hashing
function is also applied for extra privacy authentication even if the intruder
gets hold of some partial information due to noise. The BB84 QKD Scheme is
proven mathematically against all quantum attacks, that is, optimum quantum
measurement strategies, coherent attacks, collective attacks, photon splitting
attacks with decoy states, etc.

5
3.2 Block Diagram for MATLAB Simulation of BB84 QKD
Below is a block diagram of the generation of BB84 QKD which was followed
to implement simple BB84 QKD scheme in MATLAB -

Figure 1: Block diagram for the generation of BB84

Note: Hashing is implemented using MATLAB’s built in function SHA-

256, other than this all functions shown in the block diagram are manually
implemented.

3.3 Incorporating Diversity Schemes

To evaluate the impact of wireless channel impairments and diversity techniques
on BB84 Quantum Key Distribution, the classical post-measurement bit stream
was modeled over a realistic fading communication link. A free-space path loss
model was first applied to relate transmission distance to received power, after
which Additive White Gaussian Noise (AWGN) was introduced to represent
thermal and electronic receiver noise. Rayleigh fading coefficients were then
generated to emulate multipath propagation in a non-line-of-sight wireless envi-
ronment, where each coefficient corresponds to an independent diversity branch.
For every simulated distance, the BB84 algorithm was executed to obtain
the sifted transmitter and receiver keys. Independent Rayleigh fading gains
were generated for L antenna branches, and the resulting instantaneous signal-
to-noise ratios (SNRs) were computed. Three diversity combining schemes were
then implemented:
Selection Combining (SC): The SNRs across all branches were compared,
and the branch with the maximum instantaneous SNR was selected for key

6
recovery. This provides the simplest form of diversity with minimal processing
complexity.
Equal Gain Combining (EGC): All diversity branches were co-phased and
summed with equal weights. The effective SNR was estimated by combining
the magnitudes of all faded branches, reflecting phase alignment without power-
based weighting.
Maximal Ratio Combining (MRC): Each branch was phase-aligned and weighted
proportional to its SNR, yielding the maximum achievable output SNR. The ef-
fective SNR was obtained by summing individual SNRs across all branches.
The effective SNR produced by each combining scheme was mapped to a
bit-flip probability, which was applied to the sifted receiver key to produce a
noisy key. The Quantum Bit Error Rate (QBER) was computed as the fraction
of mismatched bits, and the Secure Key Rate (SKR) was estimated using a
QBER-dependent secrecy penalty. To account for channel randomness, each
configuration was averaged over multiple independent Monte-Carlo trials.
Finally, QBER and SKR were plotted as functions of distance for SC, EGC,
and MRC, enabling direct performance comparison. This methodology allowed
assessment of how diversity improves resilience against fading, extends secure
communication distance, and enhances practical wireless BB84 performance.

7
4 Results
4.1 Results of Simple BB84 QKD Scheme with AWGN
Noise,Rayleigh Fading and Pathloss
Analysis of the simple BB84 Quantum Key Distribution scheme was first per-
formed using a MATLAB simulation. These results are obtained under ideal
conditions—without fading, noise, path loss, or diversity models.

Figure 2: QBER vs Distance (Averaged)

From the plot, we observe that the quantum bit error rate increases with
distance. At shorter distances, QBER remains low because both received power
and SNR are high, making bit flips less probable. As the distance increases, free-
space path loss increases logarithmically—according to FSPL ∝ 20 log10 (d)—leading
to higher noise susceptibility and therefore higher QBER. The curve is not per-
fectly smooth due to the randomness of bases and bit generation inherent in the
BB84 protocol.

8
 Figure 3: Secret Key Rate (SKR) vs Distance

The Secret Key Rate (SKR) represents the number of usable, information-
theoretically secure key bits generated per transmission (or per second). As
expected, SKR decreases with distance because increasing QBER reduces the
amount of extractable secure key material.

Figure 4: Quantum Bit Error Rate (QBER) vs SNR (Averaged)

The QBER vs average SNR plot shows a monotonically decreasing curve,

where QBER is high at low SNR and gradually drops as SNR increases. This
happens because poor SNR implies stronger noise and fading effects, leading

9
to more incorrect bit detections at the receiver. As SNR improves, the signal
becomes more distinguishable from noise, reducing bit-flip probability and mea-
surement errors. Therefore, higher SNR directly enhances BB84 key accuracy
and quantum channel reliability.

4.2 Results of Simple BB84 QKD Scheme under diversity

schemes

Figure 5: Quantum Bit Error Rate (QBER) vs Distance for SC, ECG, MRC

In SC, the receiver selects the branch with the highest instantaneous SNR. This
provides basic diversity gain, so QBER increases more slowly with distance
compared to no diversity, but once fading affects all branches, performance
degrades. Therefore, the SC curve sits highest among the three and reaches the
QBER security limit sooner.
EGC co-phases all branches and adds them with equal weights. It uses all
spatial paths, giving better fading mitigation than SC. Its QBER vs distance
curve lies between SC and MRC, showing smoother growth in QBER and ex-
tending secure communication distance further than SC, but not optimally.
MRC weights each branch proportional to its SNR and phase-aligns them,
maximizing output SNR. It provides the best diversity advantage, so QBER
rises the slowest with distance. The MRC curve remains lowest, meaning the
system stays secure over the longest distance.

10
 Figure 6: Secret Key Rate (SKR) vs Distance for SC, ECG, MRC

Since SC only uses the branch with the highest instantaneous SNR, it pro-
vides limited diversity gain. As distance increases, fading and noise reduce the
effective SNR quickly, so the SKR decreases earlier and more sharply. Thus,
the SC curve lies lowest and reaches zero secure key rate at the shortest range.
EGC coherently combines all branches with equal weights, improving SNR
more consistently than SC. This results in moderately higher SKR, and the curve
declines more gradually with distance. EGC extends the secure transmission
range but still remains below MRC.
MRC optimally weights each branch based on SNR, maximizing the com-
bined signal quality. Therefore, its SKR remains highest at all distances, drop-
ping the slowest. MRC maintains a positive secure key rate over the longest
communication distance, demonstrating strongest fading resilience.

5 Conclusion
This project successfully simulated the BB84 Quantum Key Distribution pro-
tocol over a realistic wireless communication channel incorporating free-space
path loss, AWGN, and Rayleigh fading. The results demonstrated that channel
impairments significantly influence QKD performance, with QBER increasing
and Secure Key Rate decreasing as transmission distance grows. Implementing
diversity combining techniques—Selection Combining, Equal Gain Combining,
and Maximal Ratio Combining—proved effective in mitigating fading. Among
them, MRC consistently provided the lowest QBER and highest SKR, followed
by EGC and then SC, thereby extending the maximum secure communication
range.
Overall, the study highlights the importance of physical-layer reliability in

11
practical quantum communication systems and shows that classical antenna
diversity can meaningfully enhance wireless QKD performance. These insights
support future work focused on optimizing diversity order, exploring advanced
combining methods, and integrating more realistic quantum channel models to
further improve secure key distribution in real-world environments.

12