## Abstract

We report on the first real-time implementation of a quantum key distribution (QKD) system using entangled photon pairs that are sent over two free-space optical telescope links. The entangled photon pairs are produced with a type-II spontaneous parametric down-conversion source placed in a central, potentially untrusted, location. The two free-space links cover a distance of 435 m and 1,325 m respectively, producing a total separation of 1,575 m. The system relies on passive polarization analysis units, GPS timing receivers for synchronization, and custom written software to perform the complete QKD protocol including error correction and privacy amplification. Over 6.5 hours during the night, we observed an average raw key generation rate of 565 bits/s, an average quantum bit error rate (QBER) of 4.92%, and an average secure key generation rate of 85 bits/s.

© 2008 Optical Society of America

## 1. Introduction

Quantum key distribution (QKD) has become one of the first mature applications to develop out of the new field of quantum information processing. From the initial ideas of uncloneable quantum money byWiesner [1] in the 1970’s, to the first concrete QKD protocol (BB84) discovered by Bennett and Brassard [2] in 1984; QKD has rapidly become a very practical application of quantum information science. There are now a number of different QKD protocols which have been demonstrated using both optical fibers and free-space optical links as their quantum channel. Some of the more recent free-space experiments include the distribution of entanglement through intra-city free-space links by Resch *et al*. [3] and Peng *et al*. [4], the distribution of entanglement over 144 km and subsequent generation of a secure key by Ursin *et al*. [5], and the complete implementation of a free-space QKD system which included all key extraction routines by Marcikic *et al*. [6]. For a comprehensive overview of both the theory and different experimental implementations of QKD please refer to the recent review article by Scarani *et al*. [7].

While fiber implementations have produced some of the fastest systems to date, until reliable quantum repeaters are realized, fiber implementations seem to be limited to <200km. This has prompted increased attention on free-space implementations. Indeed, a number of studies have been performed to evaluate the possibility of performing quantum key distribution with an orbiting satellite such as the International Space Station [8, 9, 10]. Therefore, experience with free-space quantum key distribution in a variety of setups and experimental conditions is very valuable for future long distance experiments.

## 2. Security assumptions

Although the unconditional security of many QKD protocols has been shown [7], practical implementations are always different from the ideal theory and the possible presence of side channels require that great care is taken when claiming that one has implemented an unconditionally secure quantum key distribution system. Certain assumptions, which are required for the security proofs, are not always met in practice. To that end, we state fully here the assumptions going into the claim of security for our QKD system.

First, to prevent a man-in-the-middle attack, all classical communications between Alice and Bob must be authenticated using a short amount of initial secret key for the first few messages and by key generated by the system afterwards. The key generation process is still efficient because the number of bits needed for authentication is logarithmic in the size of the key [11]. We have not implemented authentication in our system yet, but it is under development.

Second, as will be shown in the discussion of our results, the detection efficiencies for each of Alice’s and Bob’s detectors are not equal. Attacks are known that can exploit a detector inefficiency mismatch [12] and perhaps leave our system vulnerable to an eavesdropper. The solution is to carefully equalize the efficiencies of all the detectors without exposing further security loopholes. We are currently investigating the methods to properly equalize the detector efficiencies.

Third, spatial filtering was not used in the polarization detector boxes described below. It is known that if different detectors see slightly different spatial modes, an eavesdropper could control their relative efficiencies by varying the spatial mode of the input signal [13]. However, a significant effort was expended to make the relevant dimensions in the detector box symmetric and identical in order to avoid precisely this kind of attack. Strictly speaking this attack might still be possible, but is assumed to be minimal for our system.

Fourth, double clicks, that is when two detectors register a photon at the same time, need to be kept track of and should be assigned a random bit value. For entanglement based QKD it is unclear whether double pair emissions from the source lead to the same drastic security loophole experienced by weak coherent pulse QKD; namely, the photon number splitting attack. Nevertheless, it is important to keep track of these events and assign a random measurement result when a double click is observed. In the current system, we do not explicitly deal with double clicks, but the system will choose whichever event it records first. This is similar to a random choice within the detector time jitter.

Fifth, we make certain assumptions about our detectors, namely that each of the four channels in our detectors are independent and that the dead-time of the detectors is a negligible security concern. The assumption that each of the four channels in our detectors are independent means that the probability of detecting a photon on any channel is independent of whether a photon was previously detected on any other channel. While this is a natural assumption to make, it is not always found in practice and depends on the electrical design and physics of the detectors. Additionally, each channel has a certain dead-time after a detection event, in our case 50 ns, where the channel cannot detect another photon until it has been reset. To ensure security, it is important to reject multiple detection events that fall within the dead-time of the detectors. While these loopholes were not pointed out to us until after the experiment was performed, we assume that their influence on the security of our system is negligible since the rate of detected photons is low enough that any lingering effects of one channel firing should have dissipated before the next channel detection event and the probability of having two detection events in the dead-time window was extremely small. A data rejection algorithm for multiple events being registered within the dead-time window will be added to future versions of the system.

Finally, we assume that the security proof by Ma *et al*. [14] applies to our system, since it is the closest proof to our experimental implementation. However, it does not precisely encompass our implementation on its own since it assumes the validity of the squashing model of detection and that active basis switching is performed. However, we can make it apply to our system since the validity of the squashing model for the active basis switching detection scheme has recently been shown [16, 17, 18]. Additionally, it has also recently been shown that the requirement for active basis switching can be relaxed to include the passive scheme, which is used in this experiment [19]. We thus inherit the same two assumptions used in their proof when claiming security for our system. The assumptions are that we are operating in the long key limit, and that the bit and phase error rates can be assumed to be equal. Preliminary results [15] suggest that the overhead is indeed dramatic for finite key statistics and many more bits are needed than the formulas in many security proofs suggest. Nevertheless, secure key generation with the rates observed with our system should still be within the realm of possibility. The proof also makes the simplification that the bit and phase error rates are equal which needs to be carefully examined for our system.

## 3. Experimental implementation

We have built the first real-time implementation of a two free-space link entanglement based quantum key distribution system using the BBM92 protocol invented by Bennett *et al*. [20]. Our system is comprised of a compact spontaneous parametric down-conversion (SPDC) source, two free-space telescope links, two compact passive polarization analysis modules, avalanche photodiode (APD) single photon detectors, time-stampers, GPS time receivers, two laptop computers, and custom written software [21].

Entangled photon pairs are generated via a compact type-II spontaneous parametric down-conversion (SPDC) source [24], which was built on an optical breadboard measuring 61 cm by 46 cm. A schematic of the source is shown in Fig. 1. The source is pumped by a 50 mW, 407.5nm cw violet diode laser from Blue Sky Research that is focused to an approximate radius of 25 *µ*m in a 1 mm thick *β* -BBO crystal. The down-converted photon pairs at a degenerate wavelength of 815 nm are split off via two small prism mirrors. An achromatic doublet lens (f=150 mm) collimates the down-converted photons and a half waveplate oriented at 45 ° plus a 0.5mm*β* -BBO crystal in each arm compensate for longitudinal and transverse walk-off effects. The angle of one of the compensator crystals is also used to set the relative phase between horizontal and vertical polarizations in order to produce the singlet Bell state. After compensation, the photons are coupled into short singlemode optical fibers using aspheric lenses (f=11 mm), which can then be coupled either to long singlemode fibers which will carry the photons to the sending telescopes or to local detectors. The fibers pass through manual polarization controllers which are used to undo the polarization rotation induced by the singlemode fibers.

For local alignment, the short singlemode fiber is connected to a singlemode fiber - air - multimode fiber bridge which contains a narrowband spectral filter, centred at 815 nm with a 10 nm bandwidth (FWHM), in order to get rid of any residual laser light and background light before connecting the fibers to APD single photon detectors (PerkinElmer). These are the same filters which are used in the polarization analysis modules. Connecting the fibers to the detectors with this method and inserting the optional polarizers (see Fig. 1) mounted on flip mounts allows us to measure the local quality of the entangled photon source. Typically, we measure a pair rate of 12,000 s^{-1} and total single photon count rates on each side of 100,000 s ^{-1}. The local entanglement quality is ascertained by measuring the visibility of the source in the rectilinear (H/V) basis and the diagonal (+45°/-45°) basis. For the experimental run detailed in this article we measured visibilities of 99.6% and 91% respectively shortly before the start of the experiment. This corresponds to a local QBER of 2.35%. The limited visibility in the diagonal basis is likely due to the broad spectral filtering (10 nm) and uncompensated transverse walk-off in the *β* -BBO crystal which is aggravated by the narrow pump beam spot.

For an experimental run, the short singlemode fibers are connected to longer 30msinglemode fibers which transport the photons to two telescopes situated in telescope enclosures on top of the CEIT building shown in Fig. 2. The sender telescopes consist of a fiber adapter, which holds the end of the singlemode fiber along the optic axis and allows the light to expand and be collimated by an achromatic doublet lens (f=250 mm, d=75 mm) into an approximately 50 mm beam. The fiber adapter is mounted onto a translation stage driven by a high-resolution stepper motor which can adjust the focusing of the telescope. The same motors are used in the mount which holds the sender telescope to adjust its azimuthal and elevation angles. All the motors can be controlled remotely from an operator at Alice’s or Bob’s location in order to align the sender telescope with the receiver system.

The source location is a potentially untrusted location with the receivers situated at two distant locations with no direct line of sight between them (see Fig. 2). Alice’s receiver sits in an office at BFG a free-space distance of 435 m away from the source. Bob, on the other hand, sits in an office at PI 1,325m away from the source. This produces a total separation of 1,575m between Alice and Bob.

The receiver system consists of a receiver telescope with a passive polarization detector box, that is mounted onto a homemade precision tip/tilt stage for fine adjustment of the receiver’s pointing. The receiver telescope consists of an achromatic doublet lens (f=200mm, d=75mm) and a second small lens (f=10 mm, d=5 mm) which collimates the photons down into a beam approximately 3 mm in diameter. The beam then passes through a narrowband spectral filter (described above) to remove as much background light as possible and into the passive polarization analysis box shown in the bottom portion of Fig. 1. A 50/50 nonpolarizing beamsplitter performs the basis choice by randomly reflecting or transmitting an incoming photon. Measurement of the photons in the diagonal basis is performed by a half waveplate and a polarizing beamsplitter in the transmitted arm; while measurement of the photons in the rectilinear basis is performed in the reflected arm with only a polarizing beamsplitter. The photons are then collected into four multimode fibers with permanently mounted aspheric lenses (f=11 mm).

Tests of the polarization detector boxes revealed the typical leakage of some horizontally polarized photons into the vertical channel at the polarizing beamsplitters which would lead to an increase in the QBER rate of up to 1.5%. The average local QBER rate for our source combined with this error in the polarization analysis boxes yields a baseline average QBER of 3.85%.

Finally, the photons delivered through the four multimode fibers are detected by a quad single photon counting module from PerkinElmer which has an approximate detection efficiency of 50% at our wavelength. In order to make the system simpler and remove the need for a separate timing channel to identify pairs of entangled photons, each photon detection event is time-stamped by units developed by Dotfast Consulting which have a time resolution of 156.25 ps. Since the photon pairs are created at the same time in the *β* -BBO crystal, entangled photon pairs correspond to simultaneous detection events after path length differences are taken into account. Accepting only simultaneous detections reduces the background almost to zero. However, this requirement currently forces us to experiment at night, since the background detection rates experienced during the day both overload our photon detectors and make entangled photon identification with this method infeasible.

At each location, GPS timing units from Spectrum Instruments provide a highly accurate 10 MHz reference signal to the time-stamping units. A one pulse per second (1PPS) signal provides a means to continually re-synchronize the electronics at Alice’s and Bob’s locations automatically, allowing indefinite stable timing operation of the whole system. Detection data is then passed via a USB connection to a laptop computer at Alice’s or Bob’s location, which then performs the classical parts of the BBM92 protocol.

At the beginning of an experiment, Alice’s and Bob’s computer clocks are first synchronized to <100 ms using a NIST timing application [25] in order to give them a relatively accurate common start time. A measurement program thread is responsible for continually processing detection events and sending data on to a coincidence thread. The coincidence thread then exchanges timing information for Alice’s and Bob’s detection events in order to identify entangled photon pairs. A coincidence histogram is calculated to determine the timing offset between Alice’s and Bob’s measurements and then coincident detection is performed using a coincidence window of 2 ns in order to identify entangled photon pairs. At this point, Alice and Bob now have raw key data corresponding to entangled photon detection events. Along with the timing information, Alice and Bob also exchange measurement basis information for each detection event. This allows the coincidence thread to sift the raw key data down to only those detection events where Alice and Bob measured in the same basis yielding the sifted key. All of the classical communication is performed over an ordinary classical internet connection.

Ideally, Alice and Bob would now share identical keys which they could use to encrypt data; however, due to imperfect state production, transmission, and polarization analysis, not to mention any intervention by an eavesdropper, we expect to see errors in the sifted key. Errors are removed by performing a modified cascade error correction algorithm [26] on the sifted key. Cascade uses public discussion to compare the parities of randomly chosen blocks from the sifted key and then performs a binary search on any blocks where the parities differ in order to identify and correct the error. It uses a multi-pass strategy in order to correct all errors with a high probability. During error correction, each parity communicated essentially leaks one bit of information to any eavesdropper monitoring the classical communication channel. The number of bits revealed during error correction is noted so that it can be taken care of in the privacy amplification stage.

The last step is for Alice and Bob to perform privacy amplification to reduce the amount of information an eavesdropper might possibly know about the key to an exponentially small amount at the cost of reducing the size of their key somewhat. First, Alice and Bob must calculate the fraction of their raw, error free key which they will be able to keep after privacy amplification. The calculation for this comes from the proof of security which most closely matches our physical implementation [14]. It bounds an eavesdropper’s information as a function of the QBER and estimates the necessary key reduction factor using Eq. 1

where *N*
_{secure} is the final number of secure bits which Alice and Bob will have after privacy amplification, *N*
_{raw} is the number of bits after error correction, *h*
_{2}(*x*)=-*x*log*x*-(1-*x*)log(1-*x*) is the binary entropy function, *N*
_{leakage} is the number of bits revealed during error correction, and *N*
_{safety} is an additional safety parameter, which we set to 30 bits in our experiments. Using this reduction ensures that our system is secure both against symmetric individual attacks (QBER <14.6%) and coherent attacks (QBER <11%); generating no key if the QBER rises above 11%. Note that it is possible to achieve secure key distribution with QBER’s above 11% but it requires the use of two-way classical post-processing which we do not perform in our system. Thus, the upper limit of secure key generation for our system is a QBER of 11%.

Alice and Bob then perform privacy amplification by applying the 2-universal hash function [27] shown in Eq. 2

to the raw error corrected key and keeping the last *N*
_{secure} number of bits from the end. Here *k*
_{secure} is the final secure key, *k*
_{corrected} is the error corrected key, *m* and *n* are large random numbers (smaller than *p*) generated by a random seed shared by Alice and Bob, and *p* is a large prime number. Alice and Bob can verify that they have obtained the same key after these information reconciliation steps by checking the random hash values of their strings many times.

## 4. Results

The experiment detailed below was performed on April 28, 2008. At the beginning of the experiment, the two free-space links were initially aligned with a red laser diode (658 nm) coupled into a singlemode fiber, connected to the sending telescope, and sent over the free-space link. After the shorter 435m BFG link, this produced a spot at the receiver approximately 30 mm in diameter that typically wandered less than 10 mm from its centre. Airy rings were clearly visible in the spot over this shorter distance. The spot produced after the 1325m PI link was significantly worse, with a diameter of approximately 100 mm and a typical wander of 50 to 100 mm from its centre. Additionally, Airy rings were rarely visible in the spot indicating a significant amount of scintillation in the beam. A significant amount of the drastic degradation over the longer link can be attributed to the fact that the beam passes over an exhaust vent shortly after leaving the sender telescope.

Across the shorter BFG free-space link we received about 29,000 photons/s from the source, while we received about 10,000 photons/s from the source across the PI link. Taking into account the detection efficiency of 64% for Alice’s polarization detector box and 60% for Bob’s polarization detector box [22], this yields a link transmission efficiency of approximately 45.3% for Alice and 16.7% for Bob. The average detection rates for each of Alice’s and Bob’s detectors are shown in Table 1 including an estimate of the counts due to background light, dark counts, and photons received from the source.

During the experiment we observed an average coincidence rate of 565 s ^{-1} which varied wildly due to the beam fluctuation over the PI link. Figure 3 shows the quantum bit error rate (QBER) observed over the course of the experiment from 11:55 pm until 6:15 am at which point the rising sun saturated our detectors and made correct coincidence detection impossible due to the high background. This caused the QBER to skyrocket and prevented further secure key generation. The contributions to the total QBER from both X and Z errors are also shown. The total average QBER during the experiment was observed to be 4.92% of which 2.11% and 2.81% were X and Z errors respectively. The increase in the QBER from the baseline 3.85% expected to the observed 4.92% is due to residual uncompensated birefringence in the singlemode fiber used to transport the photons from the source to the sender telescopes and to accidental coincidences.

Figure 4 shows the key rates observed during the experiment with the raw key rate shown in blue, the sifted key rate in red, the theoretical maximum possible final key rate secure against coherent attacks (QBER <11%) in the model from [14] with an error correction algorithm operating at the Shannon limit in green, and the actual observed final key rate shown in magenta. The jump in raw key rate around 12:30 am is due to changing the collection time from one second to two seconds for each data point which was necessary due to the low count rates in order to maintain a software coincidence lock. Further drops in key rates though were due to the system slowly becoming misaligned during the night.

We observed an average raw key rate of 565 bits/s, an average sifted key rate of 284 bits/s, an average optimal final key rate of 124 bits/s, and an average actual final key rate of 85 bits/s. As can be seen in Fig. 4, the final key rate for our system was below the theoretical limit due to the fact that our classical post-processing does not operate at the Shannon limit. The experiment generated a total raw key of 10,806,880 bits, a total sifted key of 5,422,762 bits, a maximum possible optimal final key of 2,374,384 bits, and an actual final key of 1,612,239 bits. In other words, the experiment was able to generate over 200 kB of secure key during the night.

Table 2 shows the reconstructed coincidence matrix from Alice’s and Bob’s measurement data recorded during the experiment. The detection totals for Alice’s and Bob’s measurements of H, V, +, and - are also displayed and show an obvious variation in the detection efficiencies for each channel. As was discussed earlier, detector efficiency mismatches open a loophole, which an eavesdropper can exploit. Work to properly equalize the detector efficiencies is currently underway.

As an intermediate step, we performed a first estimate of the extra privacy amplification needed to take care of the unequal *a priori* probabilities of having a 0 or 1 in the raw key. We treat Alice’s raw key as the correct one and assume that Bob is correcting his raw key during the error correction step to match Alice’s. Thus, it is the *a priori* probabilities of Alice ending up with a 0 or 1 in her rawkey that we are interested in. We calculated Alice’s *a priori* probabilities of getting a 0 or 1 according to Eq. 3, where *N*
_{0}/1 is the number of 0’s/1’s measured over the course of the experiment which can be computed from the last line in Table 2.

Calculating these, we found *p*
_{0}=0.4725 and *p*
_{1}=0.5275. In order to take care of this imbalance during privacy amplification, we would then have to add a term to Eq. 1 so that it becomes Eq. 4, where the *h*
_{2}(*p*
_{0}) term is the extra information leaked by the unequal *a priori* probabilities of Alice getting a 0 or 1.

Note that the binary entropy function is symmetric so that it does not matter if we use *h*
_{2}(*p*
_{0}) or *h*
_{2}(*p*
_{1}) in Eq. 4. Computing the extra term for our experiment we find that as a first estimate we would have to shrink the final key size by an additional 0.22% to compensate for the unequal *a*
*priori* probabilities.

Table 2 also allows one to calculate an average observed visibility of 88.6% in the H/V basis and 91.7% in the +/- basis during the experiment. Normally one sees a higher visibility in the H/V basis, not the +/- basis. This is because for the data presented here we had the fiber polarization correction set to map H/V to +/- and vice versa in this experimental run. Nevertheless, this makes no difference to the generation and security of the final key. Figure 5 tracks the visibilities in the two bases throughout the experiment.

During the experiment, our modified implementation of the cascade algorithm used average block sizes of 16, 33, 67, 138, and 314 bits for the 5 passes it made over the sifted key data; revealing an average of 174 bits/s. After error correction, the error corrected key had an average of 1.92×10^{-3} residual errors per bit with 8,150 errorless blocks from a total of 9,564 blocks. The somewhat high residual error rate was due to a number of reasons. Simplifications were made in our implementation of the cascade error correction algorithm; namely, rather than going back through all previous passes of cascade the algorithm instead only went back to the first pass. This reduced the effectiveness of our error correction algorithm; however, this was not the dominant source of error since it has been shown that two passes of cascade are usually enough to remove the majority of errors between two bit strings [28]. The dominant source of residual error was due to using the error rate estimate, performed by publically revealing 10% of the sifted key, in order to determine the proper block size for the cascade algorithm. The relatively small sample sizes caused large statistical fluctuations in the error rate estimate leading to a poor choice of the block sizes used in cascade. Improper block sizes in cascade can strongly reduce its effectiveness and were the major source of error in our error correction algorithm. Also, cascade is optimized to work on blocks with errors spread uniformly throughout, in order to accomplish this the sifted key should be randomized before performing cascade on it. Once cascade is properly implemented with efficient block sizes and sifted key randomization the residual error rate can be set to any desired level dependent upon the number of passes performed with cascade.

To test the impact of the block size on the residual error rate we have performed off-line tests by running the saved sifted key data through cascade only this time using either the error rate observed during error correction on the previous block of data or a running average error rate from the last few blocks of data. Already we have seen a significant improvement in the observed residual error rates for the same sifted key data sets. Further work to optimize our implementation of cascade following the analysis of Sugimoto and Yamazaki [28] has already begun. Note the fact that the error rate estimation was useless to optimize the block sizes for cascade removes any lingering reasons to even estimate the error rate in the first place and waste 10% of the key. Theoretical protocols usually describe doing this in order to detect an eavesdropper; however, the error correction algorithm already yields the true error rate which can be used to test the security of the key. So, unless one needs it to optimize the error correction algorithm, there is no reason to do an error rate estimation.

Table 3 shows the average classical communication load in bytes per second during the experiment for coincidence information (Coin Sent and Rec), error rate estimation (ERE Sent and Rec), and error correction (EC Sent and Rec) from Alice’s side. In this first implmentation we only made a minimal attempt at optimizing the classical communication load; for example, we sent individual parity bits as a full byte of data. The majority of the communication load was due to sending the timetag information necessary to identify coincident detection events corresponding to the detection of entangled photon pairs. Efforts can be made to ensure that the observer with the lowest detection rates is the one to send the timetag data across; however, beyond that there is not much that can be done to lower the communication load for coincident detection and it should remain the dominant classical communication load in any system that uses timing information to identify entangled photons.

Besides the experiment detailed above, experiments were performed with the following combinations of free-space links: a system with completely local detection (used as a baseline), one 435 m link and local detection, two 435 m links to adjacent offices in the IQC building, one 1.325 km link to PI and local detection, a second night’s worth of data for the full two link

system with one 435m and one 1.325 km free-space link, and the two link experiment detailed above. The data for each experiment including the one detailed above is summarized in Table 4. From the table it is clear that the wildly varying free-space link to PI cuts down the raw detection rates significantly, whereas the more stable BFG link shows higher rates. The QBER varied from experiment to experiment depending on how well we were able to compensate for the random polarization rotation induced by the long singlemode fibers which carried the photons to the sender telescopes.

Lastly, a proof-of-principle Bell inequality violation experiment was performed just before the QKD experiment explained in detail above. Over the course of half an hour of data collection we were able to measure an average Bell parameter of 2.51 ± 0.11, almost 5 standard deviations above the classical limit of 2.

## 5. Conclusion

In conclusion, we have implemented the first real-time two free-space link entangled quantum key distribution system including all error correction and privacy amplification algorithms. The system spans a distance of 1,525 m with no direct line of sight between Alice and Bob. The source is placed between Alice and Bob with line of sight to each one and takes advantage of the fact that in an entanglement based scheme the source need not be in a trusted location. The system implements the BBM92 protocol and sends pairs of entangled photons over two separate free-space optical links to be detected by Alice and Bob and turned into a secure key. Custom software was written to extract entangled photon detection events using a coincidence detection algorithm rather than relying on timing information from a separate classical channel. Over the course of more than six hours of continuous night time operation the system generated an average raw key rate of 565 bits/s, sifted key rate of 284 bits/s, and final secure key rate of 85 bits/s with an average QBER of 4.92%.

## Acknowledgments

Support for this work by NSERC, QuantumWorks, CIFAR, CFI, CIPI, ORF, ORDCF, ERA, and the Bell family fund is gratefully acknowledged. The authors would like to thank: P. Forbes, I. Soellner, N. Ilic, and E. Bocquillon for all of their help with late night data collection and system testing; B. Schmidt for his initial programming of the error correction and privacy amplification routines; M. Peloso for his design of the detector box and of the initial free-space optics; R. Horn, D. Smith, M. Laforest, and R. Kaltenbaek for their construction help, optics advice, and testing help; R. Irwin, T. Gerhardt, J. Thompson, and P. McGrath; N. Lütkenhaus, H.K. Lo, and K. Resch for their comments on early drafts of this paper and their help, encouragement, and enlightening discussions about the project; the anonymous referees for their many comments, which were very useful in improving the quality of this paper; and Herb Epp and the Environment and Parks Department of the City ofWaterloo for removing a particularly annoying arboreal eavesdropper that was performing a denial-of-service attack on our system.

## References and links

**1. **S. Wiesner, “Conjugate Coding,” Sigact News **15**, 78–88 (1983). [CrossRef]

**2. **C. H. Bennett and G. Brassard, in *Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing* , (New York, 1984) p. 175. [PubMed]

**3. **K. Resch, M. Lindenthal, B. Blauensteiner, H. Bohm, A. Fedrizzi, C. Kurtsiefer, A. Poppe, T. Schmitt-Manderback, M. Taraba, R. Ursin, P. Walther, H. Weier, H. Weinfurter, and A. Zeilinger, “Distributing Entanglement and Single Photons Through an Intra-City Free-Space Quantum Channel,” Opt. Exp. **13**, 202 (2005). [CrossRef]

**4. **C. Peng, T. Yang, X. Bao, J. Zhang, X. Jin, F. Feng, B. Yang, J. Yang, J. Yin, Q. Zhiang, N. Li, B. Tian, and J.W. Pan, “Experimental Free-Space Distribution of Entangled Photon pairs Over 13km: Towards Satellite-Based Global Quantum Communication,” Phys. Rev. Lett. **94**, 150501 (2005) [CrossRef] [PubMed]

**5. **R. Ursin, F. Tiefenbacher, T. Schmitt-Manderbach, H. Weier, T. Scheidl, M. Lindenthal, B. Blauensteiner, T. Jennewein, J. Perdigues, P. Trojek, B. Ömer, M. Fürst, M. Meyenburg, J. Rarity, Z. Sodnik, C. Barbieri, H. Weinfurter, and A. Zeilinger, “Entanglement-Based Quantum Communication Over 144km,” Nat. Phys. **3**, 481–486 (2007). [CrossRef]

**6. **I. Marcikic, A. Lamas-Linares, and C. Kurtsiefer, “Free-Space Quantum Key Distribution with Entangled Photons,” Appl. Phys. Lett. **89**, 101122 (2006). [CrossRef]

**7. **V. Scarani, H. Bechmann-Pasquinucci, N. J. Cerf, M. Dušek, N. Lütkenhaus, and M. Peev, “A Framework for Practical Quantum Cryptography,” http://arxiv.org/abs/0802.4155 (2008).

**8. **J. G. Rarity, P. R. Tapster, P. M. Gorman, and P. Knight, “Ground to Satellite Secure Key Exchange Using Quantum Cryptography,” New J. Phys. **4**, 82 (2002). [CrossRef]

**9. **M. Aspelmeyer, T. Jennewein, M. Pfennigbauer, W. Leeb, and A. Zeilinger, “Long-Distance Quantum Communication With Entangled Photons Using Satellites,” IEEE J. Sel. Top. Quantum Electron **9**, 1541 (2003). [CrossRef]

**10. **J. Perdigues, B. Furch, C. de Matos, O. Minster, L. Cacciapuoti, M. Pfennigbauer, M. Aspelmeyer, T. Jennewein, R. Ursin, T. Schmitt-Manderbach, G. Baister, J. Rarity, W. Leeb, C. Barbieri, H. Weinfurter, and A. Zeilinger, “Quantum Communications at ESA - Towards a Space Experiment on the ISS,” in *58th International Astronautical Congress* (Hyderabad, India, 2007).

**11. **R. Alléaume, J. Bouda, C. Branciard, T. Debuisschert, M. Dianati, N. Gisin, M. Godfrey, P. Grangier, T. Länger, A. Leverrier, N. Lütkenhaus, P. Painchault, M. Peev, A. Poppe, T. Pornin, J. Rarity, R. Renner, G. Ribordy, M. Riguidel, L. Salvail, A. Shields, H. Weinfurter, and A. Zeilinger, “SECOQC White Paper on Quantum Key Distribution and Cryptography,” http://arxiv.org/abs/quant-ph/0701168 (2007).

**12. **B. Qi, C. H. Fung, H. K. Lo, and X. Ma, “Time-Shift Attack in Practical Quantum Cryptosystems,” Quant. Info. Comput. **7**, 73 (2007).

**13. **X. Ma and H. K. Lo, Centre for Quantum Information and Quantum Control, University of Toronto, 10 King’s College Road, Toronto, ON, M5S 3G4, Canada, (personal communication, 2008).

**14. **X. Ma, C. H. Fung, and H. K. Lo, “Quantum Key Distribution With Entangled Photon Sources,” http://arxiv.org/abs/quant-ph/0703122 (2007).

**15. **J. Hasegawa, M. Hayashi, T. Hiroshima, A. Tanaka, and A. Tomita, “Experimental Decoy State Quantum Key Distribution with Unconditional Security Incorporating Finite Statistics,” http://arxiv.org/abs/0705.3081 (2007).

**16. **N. J. Beaudry, T. Moroder, and N. Lütkenhaus, “Squashing Models for Optical Measurements in Quantum Communication,” http://arxiv.org/abs/0804.3082 (2008).

**17. **T. Tsurumaru and K. Tamaki, “Security Proof for QKD Systems with Threshold Detectors,” http://arxiv.org/abs/0803.4226 (2008).

**18. **M. Koashi, Y. Adachi, T. Yamamoto, and N. Imoto, “Security of Entanglement-Based Quantum Key Distribution with Practical Detectors,” http://arxiv.org/abs/0804.0891 (2008).

**19. **N. Lütkenhaus, Institute for Quantum Computing, University of Waterloo, 200 University Avenue West, Waterloo, ON, N2L 3G1, Canada, (personal communication, 2008).

**20. **C. H. Bennett, G. Brassard, and N. D. Mermin, “Quantum Cryptography without Bell’s Theorem,” Phys. Rev. Lett. **68**, 557 (1992). [CrossRef] [PubMed]

**21. **
For more complete details about the system please refer to [22] and [23].

**22. **C. Erven, “On Free Space Quantum Key Distribution and its Implementation with a Polarization-Entangled Parametric Down Conversion Source,” Master’s thesis, University of Waterloo (2007).

**23. **G. Weihs and C. Erven, “Entangled Free-Space Quantum Key Distribution,” Proc. SPIE **6780**, 1–9 (2007).

**24. **P. G. Kwiat, K. Mattle, H. Weinfurter, A. Zeilinger, A. Sergienko, and Y. Shih, “New High-Intensity Source of Polarization-Entangled Photon Pairs,” Phys. Rev. Lett. **75**, 4337 (1995). [CrossRef] [PubMed]

**25. **
NIST, “NIST Timing Software,” http://tf.nist.gov/service/its.htm (2008).

**26. **G. Brassard and L. Salvail, “Secret-Key Reconciliation by Public Discussion,” Lect. Notes Comput. Sci. **765**, 410 (1994). [CrossRef]

**27. **J. L. Carter and M. N. Wegman, “Universal Classes of Hash Functions,” J. Comput. Syst. Sci. **18**, 143 (1979). [CrossRef]

**28. **T. Sugimoto and K. Yamazaki, “A Study on Secret Key Reconciliation Protocol”Cascade,” IEICE Trans. Fundamentals **E83A No. 10**, 1987 (2000).