Searcharxiv⌕ Search

arXiv subjects

Go Kato

Publications and source records attributed to Go Kato.

53 records · Page 3Linked to original sources
arXiv2017

Information-theoretic security proof of differential-phase-shift quantum key distribution protocol based on complementarity

We show the information-theoretic security proof of the differential-phase-shift (DPS) quantum key distribution (QKD) protocol based on the complementarity approach [arXiv:0704.3661 (2007)]. Our security proof provides a slightly better key generation rate compared to the one derived in the previous security proof in [arXiv:1208.1995 (2012)] that is based on the Shor-Preskill approach [Phys. Rev. Lett. ${\bf 85}$, 441 (2000)]. This improvement is obtained because the complementarity approach can employ more detailed information on Alice's sending state in estimating the leaked information to an eavesdropper. Moreover, we remove the necessity of the numerical calculation that was needed in the previous analysis to estimate the leaked information. This leads to an advantage that our security proof enables us to evaluate the security of the DPS protocol with any block size. This paper highlights one of the fundamental differences between the Shor-Preskill and the complementarity approaches.

quant-ph↗
arXiv2017

Differential-phase-shift quantum key distribution protocol with small number of random delays

The differential-phase-shift (DPS) quantum key distribution (QKD) protocol was proposed aiming at simple implementation, but it can tolerate only a small disturbance in a quantum channel. The round-robin DPS (RRDPS) protocol could be a good solution for this problem, which in fact can tolerate even up to $50\%$ of a bit error rate. Unfortunately, however, such a high tolerance can be achieved only when we compromise the simplicity, i.e., Bob's measurement must involve a large number of random delays ($|\mathcal{R}|$ denotes its number), and in a practical regime of $|\mathcal{R}|$ being small, the tolerance is low. In this paper, we propose a new DPS protocol to achieve a higher tolerance than the one in the original DPS protocol, in which the measurement setup is less demanding than the one of the RRDPS protocol for the high tolerance regime. We call the new protocol the small-number-random DPS (SNRDPS) protocol, and in this protocol, we add only a small amount of randomness to the original DPS protocol, i.e., $2\leq|\mathcal{R}|\leq10$. In fact, we found that the performance of the SNRDPS protocol is significantly enhanced over the original DPS protocol only by employing a few additional delays such as $|\mathcal{R}|=2$. Also, we found that the key generation rate of the SNRDPS protocol outperforms the RRDPS protocol without monitoring the bit error rate when it is less than $5\%$ and $|\mathcal{R}|\leq10$. Our protocol is an intermediate protocol between the original DPS protocol and the RRDPS protocol, and it increases the variety of the DPS-type protocols with quantified security.

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↗
arXiv2014

Probing untouchable environment as a resource for quantum computing

When manipulating a quantum system $S$, its surrounding system, or \textit{environment}, $E$ induces unwanted effects. It is mainly due to its vastness and the lack of knowledge about the Hamiltonian $H_{SE}$ that governs the dynamics inside $E$ and the interaction with $S$. The detail of $H_{SE}$ is usually extremely hard to identify, since $E$ can hardly be measured or controlled directly. Nevertheless, here we show that it is possible to probe and control a part of, if not all, the dynamics involving $E$, within the timescale in which its effective dimension can be seen finite. That is, we may be able to let a noisy environment work in our favor as a part of quantum computer.

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↗
arXiv2012

Unconditional security of coherent-state-based differential phase shift quantum key distribution protocol with block-wise phase randomization

We prove the unconditional security of coherent-state-based differential phase shift quantum key distribution protocol (DPSQKD) with block-wise phase randomization. Our proof is based on the conversion of DPSQKD to an equivalent entanglement-distillation protocol where the estimated phase error rate determines the amount of the privacy amplification. The generated final key has a contribution from events where the sender emits two or more photons, indicating the robustness of DPSQKD against photon-number-splitting attacks.

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

Security of six-state quantum key distribution protocol with threshold detectors

We prove the unconditional security of the six-state protocol with threshold detectors and one-way classical communication. Unlike the four-state protocol (BB84), it has been proven that the squash operator for the six-state does not exist, i.e., the statistics of the measurements cannot be obtained via measurement on qubits. We propose a technique to determine which photon number states are important, and we consider a fictitious measurement on a qubit, which is defined through the squash operator of BB84, for the better estimation of Eve's information. As a result, we prove that the bit error rate threshold for the six-state protocol (12.611%) remains almost the same as the one of the qubit-based six-state protocol (12.619%). This clearly demonstrates the robustness of the six-state protocol against the use of the practical devices.

quant-ph↗
arXiv2010

Quantum circuit for security proof of quantum key distribution without encryption of error syndrome and noisy processing

One of the simplest security proofs of quantum key distribution is based on the so-called complementarity scenario, which involves the complementarity control of an actual protocol and a virtual protocol [M. Koashi, e-print arXiv:0704.3661 (2007)]. The existing virtual protocol has a limitation in classical postprocessing, i.e., the syndrome for the error-correction step has to be encrypted. In this paper, we remove this limitation by constructing a quantum circuit for the virtual protocol. Moreover, our circuit with a shield system gives an intuitive proof of why adding noise to the sifted key increases the bit error rate threshold in the general case in which one of the parties does not possess a qubit. Thus, our circuit bridges the simple proof and the use of wider classes of classical postprocessing.

quant-ph↗
arXiv2005

Grover like Operator Using Only Single-Qubit Gates

We propose a new quantum circuit for the quantum search problem. The quantum circuit is superior to Grover's algorithm in some realistic cases. The reasons for the superiority are in short as follows: In the quantum circuit proposed in this paper, all the operators except for the oracle can be written as direct products of single-qubit gates. Such separable operators can be executed much faster than multi-particle operators, such as c-NOT gates and Toffoli gates, in many realistic systems. The idea of this quantum circuit is inspired by the Hamiltonian used in the adiabatic quantum computer. In addition, the scaling of the number of oracle calls for this circuit is the same as that for Grover's algorithm, i.e. $O(2^{n/2})$.

quant-ph↗
arXiv2004

Third-neighbor and other four-point correlation functions of spin-1/2 XXZ chain

The correlation functions of the spin-1/2 XXZ chain in the ground state were expressed in the form of multiple integrals for -1<Δ\leq 1 and 1<Δ. In particular, adjacent four-point correlation functions were given as certain four-dimensional integrals. We show that these integrals can be reduced to polynomials with respect to specific one-dimensional integrals. The results give the polynomial representation of the third-neighbor correlation functions.

cond-mat.stat-mech↗
arXiv2003

Next Nearest-Neighbor Correlation Functions of the Spin-1/2 XXZ Chain at Critical Region

The correlation functions of the spin-1/2 XXZ spin chain in the ground state are expressed in the form of the multiple integrals. For -1< Delta <1, they were obtained by Jimbo and Miwa in 1996. Especially the next nearest-neighbour correlation functions are given as certain three-dimensional integrals. We shall show these integrals can be reduced to one-dimensional ones and thereby evaluate the values of the next nearest-neighbor correlation functions. We have also found that the remaining one-dimensinal integrals can be evaluated analytically, when nu = arccos(Delta)/pi is a rational number.

cond-mat.stat-mech↗
arXiv2002

Graphical representation of the partition function for a 1-D delta-function Bose gas

One-dimensional repulsive delta-function bose system is studied. By only using the Bethe ansatz equation, n-particle partition functions are exactly calculated. From this expression for the n-particle partition function, the n-particle cluster integral is derived. The results completely agree with those of the thermal Bethe ansatz (TBA). This directly proves the validity of the TBA. The theory of partitions and graphs is used to simplify the discussion.

cond-mat.stat-mech↗
arXiv2002

Direct Calculation of Thermodynamic Quantities for Heisenberg Model

The XXX Heisenberg model is studied at finite temperature. The free energy is derived without recourse to Thermal Bethe Ansatz method and Quantum Transfer Matrix method. The result perfectly agrees with the free energy derived by Thermal Bethe Ansatz method. An explicit expression of the cluster expansion coefficient in arbitrary order is presented for the first time.

cond-mat.stat-mech↗
arXiv2002

A direct calculation of the free energy from the Bethe ansatz equation for the Heisenberg model

Thermodynamics of the XXX Heisenberg model is studied. The trace of the Boltzmann weight with respect to the Hilbert space is taken in the thermodynamic limit with the number of up-spins being fixed. The expression of the trace gives an explanation why the correct thermodynamic quantities are derived from the string hypothesis. Combining this with the previous result, we conclude that the free energy can be calculated only by assuming the Bethe ansatz equation. The method is more direct than other known methods which were used to derive the free energy.

cond-mat.stat-mech↗
arXiv2002

Partition Function for a 1-D delta-function Bose Gas

The N-particle partition function of a one-dimensional $δ$-function bose gas is calculated explicitly using only the periodic boundary condition (the Bethe ansatz equation). The N-particles cluster integrals are shown to be the same as those by the thermal Bethe ansatz method.

cond-mat.stat-mech↗