DescriptionTime entanglement quantum key distribution (QKD) shows promise in improving key rate and distribution distance when compared to other entanglement-based QKD implementations. In this paradigm, two parties (Alice and Bob) generate encryption keys by mapping the arrival times of entangled photons into bits through a time binning process called Pulse Position Modulation (PPM). Time entanglement theoretically guarantees agreement in the photon arrival times and thus the bits generated through PPM. Higher precision timing discretization, via smaller time bins, leads to a higher raw key rate, while detector accuracy ensures the two communicating parties maintain key agreement. However, inaccuracies in detection time (jitter) because of imperfect detectors causes disagreement between the keys observed by either party. In reconciling these jitter errors, Alice and Bob must publicly communicate proportionally to the error rate. This process leaks information to potential attackers and reduces the entropy of the keys. To regain the lost entropy, Alice and Bob compress the keys, which reduces the key length. Thus, the reconciliation process costs us secret key rate. This thesis quantifies the cost of observed timing jitter errors on secret key rates and proposes methods to mitigate the severity of such effects. First, we model the observed jitter errors that occur in the key distribution process and achieve a more accurate error characterization than made before. Using this, we can describe the relation between Alice's key and Bob's key as an information theoretic channel. By reducing the result of the quantum channel to a classical channel, we can bound the achievable secret key rates. We use this channel model to compare key reconciliation methods and determine the optimal binning parameters for PPM to maximize the secret key rate for different detector specifications.