Search

In this letter, we report on the advances toward the integration of our developed continuous variables (CV) quantum key distribution (QKD) system in existing optical infrastructure and wavelength division multiplexed (WDM) networks. First, we investigate the tolerance of the CV-QKD system to spontaneous Raman scattering (SRS) noise, the latter being the most dominant impairment in a WDM co-existence environment for QKD. In particular, we investigate by experiment the impact of a WDM 10 × 10 Gb/s ON-OFF-keying signal in terms of induced SRS noise in the QKD channel. The spontaneous SRS noise influence is assessed for different transmission scenarios, i.e., for various optical launch powers of the WDM signal, and for different transmission links of 20, 40, 60, and 80 km. Based on the experimental data and on the measured system's parameters, we estimate the key rates and reach capabilities of the proposed CV-QKD system. The scheme supports a key rate of 90 kbit/s over 20 km, for an ideal QKD system multiplexed with 2-mW optical power. A step further, we demonstrate for first time the use of the aforementioned CV-QKD system to encrypt a 10GE client service over deployable optical transport network legacy equipment over 20 km. Our results prove the feasibility of the integration of our proposed scheme with legacy telecom equipment in existing WDM optical networks.

A receiver setup capable of measuring optical power with an extremely high sensitivity of approximately −200 dBm/Hz at 1550 nm (40 dB below shot noise) is analyzed and demonstrated in a continuous-variable quantum-key-distribution prototype device.

We present a pilot-assisted coherent intradyne reception methodology for CV-QKD with true local oscillator. An optically phase-locked reference tone, prepared using carrier-suppressed optical single-sideband modulation, is multiplexed in polarisation and frequency to the 250 Mbaud quantum signal in order to provide optical frequency- and phase matching between quantum signal and local oscillator. Our concept allows for high symbol rates and can be operated at an extremely low excess-noise level, as validated by experimental measurements., 12 pages, 6 figures, 1 table

The dynamical origin of opinion polarization in the real world is an interesting topic physical scientists may help to understand. To properly model the dynamics, the theory must be fully compatible with findings by social psychologists on microscopic opinion change. Here we introduce a generic model of opinion formation with homogeneous agents based on the well-known social judgment theory in social psychology by extending a similar model proposed by Jager and Amblard. The agents' opinions will eventually cluster around extreme and/or moderate opinions forming three phases in a two-dimensional parameter space that describes the microscopic opinion response of the agents. The dynamics of this model can be qualitatively understood by mean-field analysis. More importantly, first-order phase transition in opinion distribution is observed by evolving the system under a slow change in the system parameters, showing that punctuated equilibria in public opinion can occur even in a fully connected social network., 9 pages, 5 figures together with an addition 24 videos available on request, extensively revised, to appear in Physica A

We present a pilot-disciplined coherent intradyne reception methodology for 250 Mbaud CV-QKD with frequency/phase-matched local oscillator. Experimental measurements indicate a secure key rate of 2.9 Mb/s over a link length of 12.8 km and >30 Mb/s for shorter-reach scenarios.

Various strategies exist in quantum metrology, such as with or without ancillary system, with a fixed or optimized measurement, with or without monitoring the environment, etc. Different set of tools are usually needed for different strategies. In this article, we provide a unified framework for these different settings, in particular we introduce a quantum metrology matrix and show that the precision limits of different settings can all be obtained from the trace or the trace norm of the quantum metrology matrix. Furthermore, the probe state enters into the quantum metrology matrix linearly, which makes the identification of the optimal probe states, one of the main quests in quantum metrology, much more efficient than conventional methods.

In quantum key distribution (QKD), a secret key is generated between two distant parties by transmitting quantum states. Experimental measurements on the quantum states are then transformed to a secret key by classical post-processing. Here, we propose a construction framework in which QKD classical post-processing can be custom made. Though seemingly obvious, the concept of concatenating classical blocks to form a whole procedure does not automatically apply to the formation of a quantum cryptographic procedure since the security of the entire QKD procedure rests on the laws of quantum mechanics and classical blocks are originally designed and characterized without regard to any properties of these laws. Nevertheless, we justify such concept of concatenating classical blocks in constructing QKD classical post-processing procedures, along with a relation to the universal-composability-security parameter. Consequently, effects arising from an actual QKD experiment, such as those due to the finiteness of the number of signals used, can be dealt with by employing suitable post-processing blocks. Lastly, we use our proposed customizable framework to build a comprehensive generic recipe for classical post-processing that one can follow to derive a secret key from the measurement outcomes in an actual experiment.

Quantum key distribution using weak coherent states and homodyne detection is a promising candidate for practical quantum-cryptographic implementations due to its compatibility with existing telecom equipment and high detection efficiencies. However, despite the actual simplicity of the protocol, the security analysis of this method is rather involved compared to discrete-variable QKD. In this article we review the theoretical foundations of continuous-variable quantum key distribution (CV-QKD) with Gaussian modulation and rederive the essential relations from scratch in a pedagogical way. The aim of this paper is to be as comprehensive and self-contained as possible in order to be well intelligible even for readers with little pre-knowledge on the subject. Although the present article is a theoretical discussion of CV-QKD, its focus lies on practical implementations, taking into account various kinds of hardware imperfections and suggesting practical methods to perform the security analysis subsequent to the key exchange. Apart from a review of well known results, this manuscript presents a set of new original noise models which are helpful to get an estimate of how well a given set of hardware will perform in practice., 71 pages, 9 figures, 1 table

Time is a valuable resource and it is expected that a longer time period should lead to better precision in Hamiltonian parameter estimation. However, recent studies in quantum metrology have shown that in certain cases more time may even lead to worse estimations, which puts this intuition into question. In this Letter we show that by including feedback controls this intuition can be restored. By deriving asymptotically optimal feedback controls we quantify the maximal improvement feedback controls can provide in Hamiltonian parameter estimation and show a universal time scaling for the precision limit under the optimal feedback scheme. Our study reveals an intriguing connection between noncommutativity in the dynamics and the gain of feedback controls in Hamiltonian parameter estimation.

One of the main quests in quantum metrology, and quantum parameter estimation in general, is to find out the highest achievable precision with given resources and design schemes that attain that precision. In this article we present a general framework for quantum parameter estimation which relates the ultimate precision limit directly to the underlying dynamics. With this framework we present systematical methods for computing the ultimate precision limit and optimal probe states. We further demonstrate the power of the framework by deriving a sufficient condition on when ancillary systems are not useful for improving the precision limit., Comment: 14 pages. Comments are particularly welcome

The fidelity function of quantum states have been widely used in quantum information science and frequently arises in the quantification of optimal performances for the estimation and distinguish of quantum states. A fidelity function on quantum channel is expected to have same wide applications in quantum information science. In this paper we propose a fidelity function on quantum channels and show that various distance measures on quantum channels can be obtained from this fidelity function, for example the Bures angle and the Bures distance can be extended to quantum channels via this fidelity function. We then show that the distances between quantum channels lead naturally to a new Fisher information which quantifies the ultimate precision limit in quantum metrology, the ultimate precision limit can thus be seen as a manifestation of the distances between quantum channels. We also show that the fidelity on quantum channels provides a unified framework for perfect quantum channel discrimination and quantum metrology, in particular we show that the minimum number of uses needed for perfect channel discrimination is exactly the counterpart of the precision limit in quantum metrology, and various useful lower bounds for the minimum number of uses needed for perfect channel discrimination can be obtained via this connection., 15 pages. Comments are particularly welcome

In the postprocessing of quantum key distribution, the raw key bits from the mismatched-basis measurements, where two parties use different bases, are normally discarded. Here, we propose a postprocessing method that exploits measurement statistics from mismatched-basis cases, and prove that incorporating these statistics enables uncharacterized qubit sources to be used in the measurement-device-independent quantum key distribution protocol and the Bennett-Brassard 1984 protocol, a case which is otherwise impossible., Part of this article contains a significant improvement over arXiv:1309.3819

A quantum system can be described and characterized by at least two different concepts, namely, its physical and informational properties. Here, we explicitly connect these two concepts, by equating the time-energy cost which is the product of the largest energy of a Hamiltonian of quantum dynamics and the evolution time, and the entanglement fidelity which is the informational difference between an input state and the corresponding output state produced by a quantum channel characterized by the Hamiltonian. Specifically, the worst-case entanglement fidelity between the input and output states is exactly the cosine of the channel's time-energy cost (except when the fidelity is zero). The exactness of our relation makes a strong statement about the intimate connection between information and physics. Our exact result may also be regarded as a time-energy uncertainty relation for the fastest state that achieves a certain fidelity.

We derive a formula for the time-energy costs of general quantum channels proposed in [Phys. Rev. A 88, 012307 (2013)]. This formula allows us to numerically find the time-energy cost of any quantum channel using positive semidefinite programming. We also derive a lower bound to the time-energy cost for any channels and the exact the time-energy cost for a class of channels which includes the qudit depolarizing channels and projector channels as special cases., Comment: 9 pages

Time and energy of quantum processes are a tradeoff against each other. We propose to ascribe to any given quantum process a time-energy cost to quantify how much computation it performs. Here, we analyze the time-energy costs for general quantum measurements, along a similar line as our previous work for quantum channels, and prove exact and lower bound formulae for the costs. We use these formulae to evaluate the efficiencies of actual measurement implementations. We find that one implementation for a Bell measurement is optimal in time-energy. We also analyze the time-energy cost for unambiguous state discrimination and find evidence that only a finite time-energy cost is needed to distinguish any number of states., Comment: 10 pages, 6 figures

Measurement-device-independent quantum key distribution (MDIQKD) is proposed to be secure against any possible detection attacks. The security of the original proposal relies on the assumption that the legitimate users can fully characterize the encoding systems including sources. Here, we propose a MDIQKD protocol where we allow uncharacterized encoding systems as long as qubit sources are used. A security proof of the MDIQKD protocol is presented that does not need the knowledge of the encoding states. Simulation results show that the scheme is practical.

Quantum mechanics sets limits on how fast quantum processes can run given some system energy through time-energy uncertainty relations, and they imply that time and energy are tradeoff against each other. Thus, we propose to measure the time-energy as a single unit for quantum channels. We consider a time-energy measure for quantum channels and compute lower and upper bounds of it using the channel Kraus operators. For a special class of channels (which includes the depolarizing channel), we can obtain the exact value of the time-energy measure. One consequence of our result is that erasing quantum information requires $\sqrt{(n+1)/n}$ times more time-energy resource than erasing classical information, where $n$ is the system dimension., 13 pages, 2 figures

We demonstrate the first proof of principle differential phase shift (DPS) quantum key distribution (QKD) using narrow-band heralded single photons with amplitude-phase modulations. In the 3-pulse case, we obtain a quantum bit error rate (QBER) as low as 3.06% which meets the unconditional security requirement. As we increase the pulse number up to 15, the key creation efficiency approaches 93.4%, but with a cost of increasing the QBER. Our result suggests that narrow-band single photons maybe a promising source for the DPS-QKD protocol.

In a two-way deterministic quantum key distribution (DQKD) protocol, Bob randomly prepares qubits in one of four states and sends them to Alice. To encode a bit, Alice performs an operation on each received qubit and returns it to Bob. Bob then measures the backward qubits to learn about Alice's operations and hence the key bits. Recently, we proved the unconditional security of the final key of this protocol in the ideal device setting. In this paper, we prove that two-way DQKD protocols are immune to all detector side channel attacks at Bob's side, while we assume ideal detectors at Alice's side for error testing. Our result represents a step forward in making DQKD protocols secure against general detector side channel attacks., Comment: Published version

Measurement-device-independent quantum key distribution with a finite number of decoy states is analyzed under finite-data-size assumption. By accounting for statistical fluctuations in parameter estimation, we investigate vacuum+weak- and vacuum+two-weak-decoy-state protocols. In each case, we find proper operation regimes, where the performance of our system is comparable to the asymptotic case for which the key size and the number of decoy states approach infinity. Our results show that practical implementations of this scheme can be both secure and efficient., Comment: 18 pages, 4 figures

We consider the reverse problem to the distinguishability of two quantum channels, which we call the disguising problem. Given two quantum channels, the goal here is to make the two channels identical by mixing with some other channels with minimal mixing probabilities. This quantifies how much one channel can disguise as the other. In addition, the possibility to trade off between the two mixing probabilities allows one channel to be more preserved (less mixed) at the expense of the other. We derive lower- and upper-bounds of the trade-off curve and apply them to a few example channels. Optimal trade-off is obtained in one example. We relate the disguising problem and the distinguishability problem by showing the the former can lower and upper bound the diamond norm. We also show that the disguising problem gives an upper bound on the key generation rate in quantum cryptography., Comment: 27 pages, 8 figures. Added new results for using the disguising problem to lower and upper bound the diamond norm and to upper bound the key generation rate in quantum cryptography

Alice and Bob are given an unknown initial state chosen from a set of pure quantum states. Their task is to transform the initial state to a corresponding final pure state using local operations only. We prove necessary and sufficient conditions on the existence of such a transformation. We also provide efficient algorithms that can quickly rule out the possibility of transforming a set of initial states to a set of final states., Comment: 19 pages, 1 figure, minor revision, to appear in J.Math.Phys

We investigate the necessary and sufficient condition for a convex cone of positive semidefinite operators to be fixed by a unital quantum operation $\phi$ acting on finite-dimensional quantum states. By reducing this problem to the problem of simultaneous diagonalization of the Kraus operators associated with $\phi$, we can completely characterize the kind of quantum states that are fixed by $\phi$. Our work has several applications. It gives a simple proof of the structural characterization of a unital quantum operation that acts on finite-dimensional quantum states --- a result not explicitly mentioned in earlier studies. It also provides a necessary and sufficient condition for what kind of measurement statistics is preserved by a unital quantum operation. Finally, our result clarifies and extends the work of St{\o}rmer by giving a proof of a reduction theorem on the unassisted and entanglement-assisted classical capacities, coherent information, and minimal output Renyi entropy of a unital channel acting on finite-dimensional quantum state., Comment: 9 pages in revtex 4.1, minor revision, to appear in J.Phys.A

The transmission of photons through open-air or an optical fiber is an important primitive in quantum information processing. Theoretical description of such a transmission process often considers only a single photon as the information carrier and thus fails to accurately describe experimental optical implementations where any number of photons may enter a detector. It is important to bridge this big gap between experimental implementations and the theoretical description. One powerful method that emerges from recent efforts to achieve this goal is to consider a squash model that conceptually converts multi-photon states to single-photon states, thereby justifying the equivalence between theory and experiments. However, up to now, only a limited number of protocols admit a squash model; furthermore, a no-go theorem has been proven which appears to rule out the existence of a universal squash model. Here, we observe that an apparently necessary condition demanded by all existing squash models to preserve measurement statistics is too stringent a requirement for many protocols. By chopping this requirement, we show that rather surprisingly, a universal squash model actually exists for a wide range of protocols including quantum key distribution protocols, quantum state tomography, the testing of Bell's inequalities, and entanglement verification, despite the standard no-go theorem., 14 pages

In this paper, we study the unconditional security of the so-called measurement device independent quantum key distribution (MDIQKD) with the basis-dependent flaw in the context of phase encoding schemes. We propose two schemes for the phase encoding, the first one employs a phase locking technique with the use of non-phase-randomized coherent pulses, and the second one uses conversion of standard BB84 phase encoding pulses into polarization modes. We prove the unconditional security of these schemes and we also simulate the key generation rate based on simple device models that accommodate imperfections. Our simulation results show the feasibility of these schemes with current technologies and highlight the importance of the state preparation with good fidelity between the density matrices in the two bases. Since the basis-dependent flaw is a problem not only for MDIQKD but also for standard QKD, our work highlights the importance of an accurate signal source in practical QKD systems. Note: We include the erratum of this paper in Appendix C. The correction does not affect the validity of the main conclusions reported in the paper, which is the importance of the state preparation in MDIQKD and the fact that our schemes can generate the key with the practical channel mode that we have assumed., Comment: We include the erratum of this paper in Appendix C. The correction does not affect the validity of the main conclusions reported in the paper

Privacy amplification (PA) is an essential post-processing step in quantum key distribution (QKD) for removing any information an eavesdropper may have on the final secret key. In this paper, we consider delaying PA of the final key after its use in one-time pad encryption and prove its security. We prove that the security and the key generation rate are not affected by delaying PA. Delaying PA has two applications: it serves as a tool for significantly simplifying the security proof of QKD with a two-way quantum channel, and also it is useful in QKD networks with trusted relays. To illustrate the power of the delayed PA idea, we use it to prove the security of a qubit-based two-way deterministic QKD protocol which uses four states and four encoding operations., Comment: 11 pages, 3 figures

In a deterministic quantum key distribution (DQKD) protocol with a two-way quantum channel, Bob sends a qubit to Alice who then encodes a key bit onto the qubit and sends it back to Bob. After measuring the returned qubit, Bob can obtain Alice's key bit immediately, without basis reconciliation. Since an eavesdropper may attack the qubits traveling on either the Bob-Alice channel or the Alice-Bob channel, the security analysis of DQKD with a two-way quantum channel is complicated and its unconditional security has been controversial. This paper presents a security proof of a single-photon four-state DQKD against general attacks., Comment: Publication version

Quantum key distribution (QKD) is a secure key generation method between two distant parties by wisely exploiting properties of quantum mechanics. In QKD, experimental measurement outcomes on quantum states are transformed by the two parties to a secret key. This transformation is composed of many logical steps (as guided by security proofs), which together will ultimately determine the length of the final secret key and its security. We detail the procedure for performing such classical post-processing taking into account practical concerns (including the finite-size effect and authentication and encryption for classical communications). This procedure is directly applicable to realistic QKD experiments, and thus serves as a recipe that specifies what post-processing operations are needed and what the security level is for certain lengths of the keys. Our result is applicable to the BB84 protocol with a single or entangled photon source., Comment: 17 pages, 5 figures

Given a composite quantum system in which the states of the subsystems are independently (but not necessarily identically) prepared, we construct separate measurements on the subsystems from any given joint measurement such that the former always give at least as much information as the latter. This construction offers insights into the understanding of measurements on this type of composite system. Moreover, this construction essentially proves the intuition that separate measurements on the subsystems are sufficient to extract the maximal information about the separately prepared subsystems, thus making a joint measurement unnecessary. Furthermore, our result implies that individual attacks are as powerful as collective attacks in obtaining information about the raw key in quantum key distribution.

Differential phase shift quantum key distribution systems have a high potential for achieving high speed key generation. However, its unconditional security proof is still missing, even though it has been proposed for many years. Here, we prove its security against collective attacks with a weak coherent light source in the noiseless case (i.e. no bit error). The only assumptions are that quantum theory is correct, the devices are perfect and trusted and the key size is infinite. Our proof works on threshold detectors. We compute the lower bound of the secret key generation rate using the information-theoretical security proof method. Our final result shows that the lower bound of the secret key generation rate per pulse is linearly proportional to the channel transmission probability if Bob's detection counts obey the binomial distribution., Published version, 13 pages, 4 figures, minor changes, references added, acknowledgement added

Quantum key distribution (QKD) can, in principle, provide unconditional security based on the fundamental laws of physics. Unfortunately, a practical QKD system may contain overlooked imperfections and violate some of the assumptions in a security proof. Here, we report two types of eavesdropping attacks against a practical QKD system. The first one is "time-shift" attack, which is applicable to QKD systems with gated single photon detectors (SPDs). In this attack, the eavesdropper, Eve, exploits the time mismatch between the open windows of the two SPDs. She can acquire a significant amount of information on the final key by simply shifting the quantum signals forwards or backwards in time domain. Our experimental results in [9] with a commercial QKD system demonstrate that, under this attack, the original QKD system is breakable. This is the first experimental demonstration of a feasible attack against a commercial QKD system. This is a surprising result. The second one is "phase-remapping" attack [10]. Here, Eve exploits the fact that a practical phase modulator has a finite response time. In principle, Eve could change the encoded phase value by time-shifting the signal pulse relative to the reference pulse.

In this paper, we show that decoy states are very simple to implement for quantum key distribution (QKD) with parametric down conversion (PDC) sources. Indeed, with no modification in the hardware at all, by using the AYKI scheme, one can achieve a key generation rate that is close to the theoretical limit of infinite decoy states. Therefore, we expect decoy state QKD to become a standard technique not only in the coherent state QKD, but also in QKD with PDC sources.

We study the role of discrete rotational symmetry in quantum key distribution by generalizing the well-known Bennett-Brassard 1984 (BB84) and Scarani-Acin-Ribordy-Gisin 2004 (SARG04) protocols. We observe that discrete rotational symmetry results in the protocol's invariance to continuous rotations, thus leading to a simplified relation between bit and phase error rates and consequently a straightforward security proof., 7 pages

Quantum key distribution (QKD) can be used to generate secret keys between two distant parties. Even though QKD has been proven unconditionally secure against eavesdroppers with unlimited computation power, practical implementations of QKD may contain loopholes that may lead to the generated secret keys being compromised. In this paper, we propose a phase-remapping attack targeting two practical bidirectional QKD systems (the "plug & play" system and the Sagnac system). We showed that if the users of the systems are unaware of our attack, the final key shared between them can be compromised in some situations. Specifically, we showed that, in the case of the Bennett-Brassard 1984 (BB84) protocol with ideal single-photon sources, when the quantum bit error rate (QBER) is between 14.6% and 20%, our attack renders the final key insecure, whereas the same range of QBER values has been proved secure if the two users are unaware of our attack; also, we demonstrated three situations with realistic devices where positive key rates are obtained without the consideration of Trojan horse attacks but in fact no key can be distilled. We remark that our attack is feasible with only current technology. Therefore, it is very important to be aware of our attack in order to ensure absolute security. In finding our attack, we minimize the QBER over individual measurements described by a general POVM, which has some similarity with the standard quantum state discrimination problem., 13 pages, 8 figures

Communications in secrecy are often required in many commercial and military applications. Unfortunately, many cryptographic schemes in use today such as public-key cryptography based on the RSA algorithm would be broken with either unanticipated advances in hardware and algorithm or the advent of quantum computers. Quantum cryptography, on the other hand, has been proven secure even against the most general attack allowed by the laws of physics and is a promising technology poised for widespread adoption in realistic cryptographic applications. Quantum cryptography allows two parties to expand on a secret key that they have previously shared. Various quantum cryptographic protocols have been proposed to perform this task. In this paper, we survey some popular quantum cryptographic protocols (including the famous Bennett-Brassard 1984 protocol) and discuss their security. Specifically, we consider their security in two cases: the ideal case where a perfect single-photon source is used and the practical case where a realistic laser source is used. We compare the protocols and find that the efficient six-state protocol outperforms the others both in the tolerable quantum bit error rate and in the key generation rate when a realistic laser source is used.

Quantum key distribution (QKD) systems can send signals over more than 100 km standard optical fiber and are widely believed to be secure. Here, we show experimentally for the first time a technologically feasible attack, namely the time-shift attack, against a commercial QKD system. Our result shows that, contrary to popular belief, an eavesdropper, Eve, has a non-negligible probability (~4%) to break the security of the system. Eve's success is due to the well-known detection efficiency loophole in the experimental testing of Bell inequalities. Therefore, the detection efficiency loophole plays a key role not only in fundamental physics, but also in technological applications such as QKD., Comment: 5 pages, 3 figures. Substantially revised version

Standard security proofs of quantum key distribution (QKD) protocols often rely on symmetry arguments. In this paper, we prove the security of a three-state protocol that does not possess rotational symmetry. The three-state QKD protocol we consider involves three qubit states, where the first two states, |0_z> and |1_z>, can contribute to key generation and the third state, |+>=(|0_z>+|1_z>)/\sqrt{2}, is for channel estimation. This protocol has been proposed and implemented experimentally in some frequency-based QKD systems where the three states can be prepared easily. Thus, by founding on the security of this three-state protocol, we prove that these QKD schemes are, in fact, unconditionally secure against any attacks allowed by quantum mechanics. The main task in our proof is to upper bound the phase error rate of the qubits given the bit error rates observed. Unconditional security can then be proved not only for the ideal case of a single-photon source and perfect detectors, but also for the realistic case of a phase-randomized weak coherent light source and imperfect threshold detectors. Our result on the phase error rate upper bound is independent of the loss in the channel. Also, we compare the three-state protocol with the BB84 protocol. For the single-photon source case, our result proves that the BB84 protocol strictly tolerates a higher quantum bit error rate than the three-state protocol; while for the coherent-source case, the BB84 protocol achieves a higher key generation rate and secure distance than the three-state protocol when a decoy-state method is used., 10 pages, 3 figures, 2 columns

Decoy states have recently been proposed as a useful method for substantially improving the performance of quantum key distribution (QKD) protocols when a coherent-state source is used. Previously, data postprocessing schemes based on one-way classical communications were considered for use with decoy states. In this paper, we develop two data postprocessing schemes for the decoy-state method using two-way classical communications. Our numerical simulation (using parameters from a specific QKD experiment as an example) results show that our scheme is able to extend the maximal secure distance from 142 km (using only one-way classical communications with decoy states) to 181 km. The second scheme is able to achieve a 10% greater key generation rate in the whole regime of distances. We conclude that decoy-state QKD with two-way classical postprocessing is of practical interest.