arXiv subjects

Koji Azuma

Publications and source records attributed to Koji Azuma.

35 records · Page 2Linked to original sources

arXiv2017

Security of quantum key distribution with iterative sifting

Several quantum key distribution (QKD) protocols employ iterative sifting. After each quantum transmission round, Alice and Bob disclose part of their setting information (including their basis choices) for the detected signals. The quantum phase of the protocol then ends when the numbers of detected signals per basis exceed certain pre-agreed threshold values. Recently, however, Pfister et al. [New J. Phys. 18 053001 (2016)] showed that iterative sifting makes QKD insecure, especially in the finite key regime, if the parameter estimation for privacy amplification uses the random sampling theory. This implies that a number of existing finite key security proofs could be flawed and cannot guarantee security. Here, we solve this serious problem by showing that the use of Azuma's inequality for parameter estimation makes QKD with iterative sifting secure again. This means that the existing protocols whose security proof employs this inequality remain secure even if they employ iterative sifting. Also, our results highlight a fundamental difference between the random sampling theorem and Azuma's inequality in proving security.

quant-ph↗

arXiv2017

Fundamental limitation on quantum broadcast networks

The ability to distribute entanglement over complex quantum networks is an important step towards a quantum internet. Recently, there has been significant theoretical effort, mainly focusing on the distribution of bipartite entanglement via a simple quantum network composed only of bipartite quantum channels. There are, however, a number of quantum information processing protocols based on multipartite rather than bipartite entanglement. Whereas multipartite entanglement can be distributed by means of a network of bipartite channels, a more natural way is to use a more general network, that is, a quantum broadcast network including quantum broadcast channels. In this work, we present a general frame- work for deriving upper bounds on the rates at which GHZ states or multipartite private states can be distributed among a number of different parties over an arbitrary quantum broadcast network. Our upper bounds are written in terms of the multipartite squashed entanglement, corresponding to a generalisation of recently derived bounds [K. Azuma et al., Nat. Commun. 7, 13523 (2016)]. We also discuss how lower bounds can be obtained by combining a generalisation of an aggregated quantum repeater protocol with graph theoretic concepts.

quant-ph↗

arXiv2016

Aggregating quantum repeaters for the quantum internet

The quantum internet holds promise for performing quantum communication, such as quantum teleportation and quantum key distribution, freely between any parties all over the globe. For such a quantum internet protocol, a general fundamental upper bound on the performance has been derived [K. Azuma, A. Mizutani, and H.-K. Lo, arXiv:1601.02933]. Here we consider its converse problem. In particular, we present a protocol constructible from any given quantum network, which is based on running quantum repeater schemes in parallel over the network. The performance of this protocol and the upper bound restrict the quantum capacity and the private capacity over the network from both sides. The optimality of the protocol is related to fundamental problems such as additivity questions for quantum channels and questions on the existence of a gap between quantum and private capacities.

quant-ph↗

arXiv2016

Fundamental rate-loss tradeoff for the quantum internet

The quantum internet holds promise for performing quantum communication, such as quantum teleportation and quantum key distribution (QKD), freely between any parties all over the globe. Such a future quantum network, depending on the communication distance of the requesting parties, necessitates to invoke several classes of optical quantum communication such as point-to-point communication protocols, intercity QKD protocols and quantum repeater protocols. Recently, Takeoka, Guha and Wilde (TGW) have presented a fundamental rate-loss tradeoff on quantum communication capacity and secret key agreement capacity of any lossy channel assisted by unlimited forward and backward classical communication [Nat. Commun. 5, 5235 (2014)]. However, this bound is applicable only to the simplest class of quantum communication, i.e., the point-to-point communication protocols, and it has thus remained open to grasp the potential of a `worldwide' quantum network. Here we generalize the TGW bound to be applicable to any type of two-party quantum communication over the quantum internet, including other indispensable but much more intricate classes of quantum communication, intercity QKD protocols and quantum repeater protocols. We also show that there is essentially no scaling gap between our bound and the quantum communication efficiencies of known protocols. Therefore, our result, corresponding to a fundamental and practical limitation for the quantum internet, will contribute to design an efficient quantum internet in the future.

quant-ph↗

arXiv2015

Quantum Benchmark via an Uncertainty Product of Canonical Variables

We present an uncertainty-relation-type quantum benchmark for continuous-variable (CV) quantum channels that works with an input ensemble of Gaussian distributed coherent states and homodyne measurements. It determines an optimal trade-off relation between canonical quadrature noises unbeatable by entanglement breaking channels and refines the notion of two quantum duties introduced in the original papers of CV quantum teleportation. It can verify the quantum-domain performance for all one-mode Gaussian channels.We also address the case of stochastic channels and the effect of asymmetric gains.

quant-ph↗

arXiv2014

Measurement-device-independent quantum key distribution with all-photonic adaptive Bell measurement

The time-reversed version of entanglement-based quantum key distribution (QKD), called measurement-device-independent QKD (mdiQKD), was originally introduced to close arbitrary security loopholes of measurement devices. Here we show that the mdiQKD has another advantage which should be distinguished from the entanglement-based QKD. In particular, an all-photonic adaptive Bell measurement, based on the concept of quantum repeaters, can be installed solely in the mdiQKD, which leads to a square root improvement in the key rate. This Bell measurement also provides a similar improvement in the single-photon-based entanglement generation of quantum repeaters.

quant-ph↗

arXiv2013

Loss-tolerant quantum cryptography with imperfect sources

In principle, quantum key distribution (QKD) offers unconditional security based on the laws of physics. In practice, flaws in the state preparation undermine the security of QKD systems, as standard theoretical approaches to deal with state preparation flaws are not loss-tolerant. An eavesdropper can enhance and exploit such imperfections through quantum channel loss, thus dramatically lowering the key generation rate. Crucially, the security analyses of most existing QKD experiments are rather unrealistic as they typically neglect this effect. Here, we propose a novel and general approach that makes QKD loss-tolerant to state preparation flaws. Importantly, it suggests that the state preparation process in QKD can be significantly less precise than initially thought. Our method can widely apply to other quantum cryptographic protocols.

quant-ph↗

arXiv2013

All photonic quantum repeaters

Quantum communication holds promise for unconditionally secure transmission of secret messages and faithful transfer of unknown quantum states. Photons appear to be the medium of choice for quantum communication. Owing to photon losses, robust quantum communication over long lossy channels requires quantum repeaters. It is widely believed that a necessary and highly demanding requirement for quantum repeaters is the existence of matter quantum memories at the repeater nodes. Here we show that such a requirement is, in fact, unnecessary by introducing the concept of all photonic quantum repeaters based on flying qubits. As an example of the realization of this concept, we present a protocol based on photonic cluster state machine guns and a loss-tolerant measurement equipped with local high-speed active feedforwards. We show that, with such an all photonic quantum repeater, the communication efficiency still scales polynomially with the channel distance. Our result paves a new route toward quantum repeaters with efficient single-photon sources rather than matter quantum memories.

quant-ph↗

arXiv2013

Does "quantum nonlocality without entanglement" have quantum origin?

Quantum separable operations are defined as those that cannot produce entanglement from separable states, and it is known that they strictly surpass local operations and classical communication (LOCC) in a number of tasks, which is sometimes referred to as "quantum nonlocality without entanglement." Here we consider a task with such a gap regarding the trade-off between state discrimination and preservation of entanglement. We show that this task along with the gap has an analogue in a purely classical setup, indicating that the quantum properties are not essential in the existence of a nonzero gap between the separable operations and LOCC.

quant-ph↗

arXiv2011

Optimal entanglement manipulation via coherent-state transmission

We derive an optimal bound for arbitrary entanglement manipulation based on the transmission of a pulse in coherent states over a lossy channel followed by local operations and unlimited classical communication (LOCC). This stands on a theorem to reduce LOCC via a local unital qubit channel to local filtering. We also present an optimal protocol based on beam splitters and a quantum nondemolition (QND) measurement on photons. Even if we replace the QND measurement with photon detectors, the protocol outperforms known entanglement generation schemes.

quant-ph↗

arXiv2010

Quantum repeaters and computation by a single module

We present a protocol of remote nondestructive parity measurement (RNPM) on a pair of quantum memories. The protocol works as a single module for key operations such as entanglement generation, Bell measurement, parity check measurement, and an elementary gate for extending one-dimensional cluster states. The RNPM protocol is achieved by a simple combination of devices such as lasers, optical fibers, beam splitters, and photon detectors. Despite its simplicity, a quantum repeater composed of RNPM protocols is shown to have a communication time that scales sub-exponentially with the channel length, and it can be further equipped with entanglement distillation. With a reduction in the internal losses, the RNPM protocol can also be used for generating cluster states toward measurement-based quantum communication.

quant-ph↗

arXiv2009

Tight bound on coherent-state-based entanglement generation over lossy channels

The first stage of the hybrid quantum repeaters is entanglement generation based on transmission of pulses in coherent states over a lossy channel. Protocols to make entanglement with only one type of error are favorable for rendering subsequent entanglement distillation efficient. Here we provide the tight upper bound on performances of these protocols that is determined only by the channel loss. In addition, we show that this bound is achievable by utilizing a proposed protocol [arXiv:0811.3100] composed of a simple combination of linear optical elements and photon-number-resolving detectors.

quant-ph↗

arXiv2008

Optimal entanglement generation for efficient hybrid quantum repeaters

We propose a realistic protocol to generate entanglement between quantum memories at neighboring nodes in hybrid quantum repeaters. Generated entanglement includes only one type of error, which enables efficient entanglement distillation. In contrast to the known protocols with such a property, our protocol with ideal detectors achieves the theoretical limit of the success probability and the fidelity to a Bell state, promising higher efficiencies in the repeaters. We also show that the advantage of our protocol remains even with realistic threshold detectors.

quant-ph↗

arXiv2008

Quantum catalysis of information

Heisenberg's uncertainty principle and recently derived many no-go theorems including the no-cloning theorem and the no-deleting theorem have corroborated the idea that we can never access quantum information without causing disturbance. Here we disprove this presumption by predicting a novel phenomenon, `quantum catalysis of information,' where a system enables an otherwise impossible task by exchanging information through a quantum communication channel. This fact implies that making use of quantum information does not always cause disturbance.

quant-ph↗

arXiv2006

Quantum cloning with nonlocal assistance: Complement of Jozsa's stronger no-cloning theorem

We investigate the cases where a set $S$ of states $\{\ket{ψ_i} \}$ cannot be cloned by itself, but is clonable with the help of another system prepared in state $\hatρ_i$. When $S$ is pair-wise nonorthogonal, it is known that one can generate the copy from $\hatρ_i$ alone, with no interaction with the original system. Here we show that a set containing orthogonal pairs exhibits a property forming a striking contrast; For any such set, there is a choice of $\hatρ_i$ that enables cloning only when the two systems are interacted in a purely quantum manner that is not achievable via classical communication.

quant-ph↗

arXiv2005

Probabilistic cloning with supplementary information

We consider probabilistic cloning of a state chosen from a mutually nonorthogonal set of pure states, with the help of a party holding supplementary information in the form of pure states. When the number of states is 2, we show that the best efficiency of producing m copies is always achieved by a two-step protocol in which the helping party first attempts to produce m-1 copies from the supplementary state, and if it fails, then the original state is used to produce m copies. On the other hand, when the number of states exceeds two, the best efficiency is not always achieved by such a protocol. We give examples in which the best efficiency is not achieved even if we allow any amount of one-way classical communication from the helping party.

quant-ph↗

arXiv2003

Proper magnetic fields for nonadiabatic geometric quantum gates in NMR

In a scheme of nonadiabatic purely geometric quantum gates in nuclear magnetic resonance(NMR) systems we propose proper magnitudes of magnetic fields that are suitable for an experiment. We impose a natural condition and reduce the degree of freedom of the magnetic fields to the extent. By varying the magnetic fields with essentially one-dimensional degree of freedom, any spin state can acquire arbitrary purely geometric phase ϕ_{g}=-2π(1-cos{theta}), 0 < cosθ < 1. This is an essential ingredient for constructing universal geometric quantum gates.

quant-ph↗