arXiv subjects

Go Kato

Publications and source records attributed to Go Kato.

At least 37 records · Page 2Linked to original sources

arXiv2020

Bounds for nonadiabatic transitions

We discuss bounds for nonadiabatic transitions from the viewpoints of the adiabatic perturbation theory and the quantum speed limit. We show that the amount of nonadiabatic transitions from the $n$th level to the $m$th level is bounded by a function of the quantum geometric tensor for the $m$th level. We analyze this bound from the viewpoint of the adiabatic perturbation theory. In addition, this bound and the viewpoint of the quantum speed limit suggest nontrivial relationship between the dynamical transformation and the adiabatic transformation. We also derive a universal bound for any nonadiabatic transition. This bound is written in terms of the counterdiabatic Hamiltonian.

quant-ph↗

arXiv2020

Second law of black hole thermodynamics

If simple entropy in the Bekenstein-Hawking area law for a Schwarzschild black hole is replaced with 'negative' quantum conditional entropy, which quantifies quantum entanglement, of positive-energy particles of the black hole relative to its outside, a paradox with the original pair-creation picture of Hawking radiation, the first law for black hole mechanics and quantum mechanics is resolved. However, there was no way to judge experimentally which area law is indeed adopted by black holes. Here, with the no-hair conjecture, we derive the perfect picture of a second law of black hole thermodynamics for any black hole from the modified area law, rather than Bekenstein's generalized one from the original area law. The second law is testable with an event horizon telescope, in contrast to Bekenstein's. If this is confirmed, the modified area law could be exalted to the first example of fundamental equations in physics which cannot be described without the concept of quantum information.

hep-th↗

arXiv2020

Linear programs for entanglement and key distribution in the quantum internet

Quantum networks will allow to implement communication tasks beyond the reach of their classical counterparts. A pressing and necessary issue for the design of quantum network protocols is the quantification of the rates at which these tasks can be performed. Here, we propose a simple recipe that yields efficiently computable lower and upper bounds on the maximum achievable rates. For this we make use of the max-flow min-cut theorem and its generalization to multi-commodity flows to obtain linear programs. We exemplify our recipe deriving the linear programs for bipartite settings, settings where multiple pairs of users obtain entanglement in parallel as well as multipartite settings, covering almost all known situations. We also make use of a generalization of the concept of paths between user pairs in a network to Steiner trees spanning a group of users wishing to establish Greenberger-Horne-Zeilinger states.

quant-ph↗

arXiv2020

Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication

It is natural in a quantum network system that multiple users intend to send their quantum message to their respective receivers, which is called a multiple unicast quantum network. We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network from a secure classical network code. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack when the attack satisfies a certain natural condition. In our security proof, the eavesdropper is allowed to modify wiretapped information dependently on the previously wiretapped messages. Our protocol guarantees the secrecy by utilizing one-way classical information transmission (public communication) in the same direction as the quantum network although the verification of quantum information transmission requires two-way classical communication. Our secure network code can be applied to several networks including the butterfly network.

quant-ph↗

arXiv2020

Reduction Theorem for Secrecy over Linear Network Code for Active Attacks

We discuss the effect of sequential error injection on information leakage under a network code. We formulate a network code for the single transmission setting and the multiple transmission setting. Under this formulation, we show that the eavesdropper cannot improve the power of eavesdropping by sequential error injection when the operations in the network are linear operations. We demonstrate the usefulness of this reduction theorem by applying a concrete example of network.

cs.IT↗

arXiv2020

Tight finite-key security for twin-field quantum key distribution

Quantum key distribution (QKD) offers a reliable solution to communication problems that require long-term data security. For its widespread use, however, the rate and reach of QKD systems must be improved. Twin-field (TF) QKD is a step forward toward this direction, with early demonstrations suggesting it can beat the current rate-versus-distance records. A recently introduced variant of TF-QKD is particularly suited for experimental implementation, and has been shown to offer a higher key rate than other variants in the asymptotic regime where users exchange an infinite number of signals. Here, we extend the security of this protocol to the finite-key regime, showing that it can overcome the fundamental bounds on point-to-point QKD with around $10^{10}$ transmitted signals. Within distance regimes of interest, our analysis offers higher key rates than those of alternative variants. Moreover, some of the techniques we develop are applicable to the finite-key analysis of other QKD protocols.

quant-ph↗

arXiv2020

Concentration inequality using unconfirmed knowledge

We give a concentration inequality based on the premise that random variables take values within a particular region. The concentration inequality guarantees that, for any sequence of correlated random variables, the difference between the sum of conditional expectations and that of the observed values takes a small value with high probability when the expected values are evaluated under the condition that the past values are known. Our inequality outperforms other well-known inequalities, e.g. the Azuma-Hoeffding inequality, especially in terms of the convergence speed when the random variables are highly biased. This high performance of our inequality is provided by the key idea in which we predict some parameters and adopt the predicted values in the inequality.

math.PR↗

arXiv2019

Algebra and Hilbert space structures induced by quantum probes

In the general setting of quantum controls, it is unrealistic to control all of the degrees of freedom of a quantum system. We consider a scenario where our direct access is restricted to a small subsystem $S$ that is constantly interacting with the rest of the system $E$. What we investigate here is the fundamental structure of the Hilbert space that is caused solely by the restrictedness of the direct control. We clarify the intrinsic space structure of the entire system and that of the operations which could be activated through $S$. The structures hereby revealed would help us make quantum control problems more transparent and provide a guide for understanding what we can implement. They can be deduced by considering an algebraic structure, which is the Jordan algebra formed from Hermitian operators, naturally induced by the setting of limited access. From a few very simple assumptions about direct operations, we elucidate rich structures of the operator algebras and Hilbert spaces that manifest themselves in quantum control scenarios.

quant-ph↗

arXiv2019

Enumeration of associative magic squares of order 7

An associative magic square is a magic square such that the sum of any 2 cells at symmetric positions with respect to the center is constant. The total number of associative magic squares of order 7 is enormous, and thus, it is not realistic to obtain the number by simple backtracking. As a recent result, Artem Ripatti reported the number of semi-magic squares of order 6 (the magic squares of 6x6 without diagonal sum conditions) in 2018. In this research, with reference to Ripatti's method of enumerating semi-magic squares, we have calculated the total number of associative magic squares of order 7. There are exactly 1,125,154,039,419,854,784 associative magic squares of order 7, excluding symmetric patterns.

math.CO↗

arXiv2019

A Tight Bound of Tail Probabilities for a Discrete-time Martingale with Uniformly Bounded Jumps

We investigate the properties of a discrete-time martingale $\{X_m\}_{m\in \mathbb Z_{\geq 0}}$, where all differences between adjacent random variables are limited to be not more than a constant as a promise. In this situation, it is known that the Azuma-Hoeffding inequality holds, which gives an upper bound of a probability for exceptional events. The inequality gives a simple form of the upper bound, and it has been utilized for many investigations. However, the inequality is not tight. We give an explicit expression of a tight upper bound, and we show that it and the bound obtained from the Azuma-Hoeffding inequality have different asymptotic behaviors.

math.PR↗

arXiv2018

Perfect discrimination of non-orthogonal quantum states with posterior classical partial information

The indistinguishability of non-orthogonal pure states lies at the heart of quantum information processing. Although the indistinguishability reflects the impossibility of measuring complementary physical quantities by a single measurement, we demonstrate that the distinguishability can be perfectly retrieved simply with the help of posterior classical partial information. We demonstrate this by showing an ensemble of non-orthogonal pure states such that a state randomly sampled from the ensemble can be perfectly identified by a single measurement with help of the post-processing of the measurement outcomes and additional partial information about the sampled state, i.e., the label of subensemble from which the state is sampled. When an ensemble consists of two subensembles, we show that the perfect distinguishability of the ensemble with the help of the post-processing can be restated as a matrix-decomposition problem. Furthermore, we give the analytical solution for the problem when both subensembles consist of two states.

quant-ph↗

arXiv2018

Secrecy and Robustness for Active Attack in Secure Network Coding and its Application to Network Quantum Key Distribution

In network coding, we discuss the effect of sequential error injection on information leakage. We show that there is no improvement when the operations in the network are linear operations. However, when the operations in the network contains non-linear operations, we find a counterexample to improve Eve's obtained information. Furthermore, we discuss the asymptotic rate in a linear network under the secrecy and robustness conditions as well as under the secrecy condition alone. Finally, we apply our results to network quantum key distribution, which clarifies the type of network that enables us to realize secure long distance communication via short distance quantum key distribution.

cs.IT↗

arXiv2018

Bipartite discrimination of independently prepared quantum states as a counterexample to a parallel repetition conjecture

For distinguishing quantum states sampled from a fixed ensemble, the gap in bipartite and single-party distinguishability can be interpreted as a nonlocality of the ensemble. In this paper, we consider bipartite state discrimination in a composite system consisting of $N$ subsystems, where each subsystem is shared between two parties and the state of each subsystem is randomly sampled from a particular ensemble comprising the Bell states. We show that the success probability of perfectly identifying the state converges to $1$ as $N\rightarrow\infty$ if the entropy of the probability distribution associated with the ensemble is less than $1$, even if the success probability is less than $1$ for any finite $N$. In other words, the nonlocality of the $N$-fold ensemble asymptotically disappears if the probability distribution associated with each ensemble is concentrated. Furthermore, we show that the disappearance of the nonlocality can be regarded as a remarkable counterexample of a fundamental open question in theoretical computer science, called a parallel repetition conjecture of interactive games with two classically communicating players. Measurements for the discrimination task include a projective measurement of one party represented by stabilizer states, which enable the other party to perfectly distinguish states that are sampled with high probability.

quant-ph↗

arXiv2018

Quantum key distribution with setting-choice-independently correlated light sources

Despite the enormous theoretical and experimental progress made so far in quantum key distribution (QKD), the security of most existing QKD implementations is not rigorously established yet. A critical obstacle is that almost all existing security proofs make ideal assumptions on the QKD devices. Problematically, such assumptions are hard to satisfy in the experiments, and therefore it is not obvious how to apply such security proofs to practical QKD systems. Fortunately, any imperfections and security-loopholes in the measurement devices can be perfectly closed by measurement-device-independent QKD (MDI-QKD), and thus we only need to consider how to secure the source devices. Among imperfections in the source devices, correlations between the sending pulses are one of the principal problems. In this paper, we consider a setting-choice-independent correlation (SCIC) framework in which the sending pulses can present arbitrary correlations but they are independent of the previous setting choices such as the bit, the basis and the intensity settings. Within the framework of SCIC, we consider the dominant fluctuations of the sending states, such as the relative phases and the intensities, and provide a self-contained information theoretic security proof for the loss-tolerant QKD protocol in the finite-key regime. We demonstrate the feasibility of secure quantum communication within a reasonable number of pulses sent, and thus we are convinced that our work constitutes a crucial step toward guaranteeing implementation security of QKD.

quant-ph↗

arXiv2018

Versatile relative entropy bounds for quantum networks

We provide a versatile upper bound on the number of maximally entangled qubits, or private bits, shared by two parties via a generic adaptive communication protocol over a quantum network when the use of classical communication is not restricted. Although our result follows the idea of Azuma et al. [Nat. Comm. 7, 13523 (2016)] of splitting the network into two parts, our approach relaxes their strong restriction, consisting of the use of a single entanglement measure in the quantification of the maximum amount of entanglement generated by the channels. In particular, in our bound the measure can be chosen on a channel-by-channel basis, in order to make it as tight as possible. This enables us to apply the relative entropy of entanglement, which often gives a state-of-the-art upper bound, on every Choi-simulable channel in the network, even when the other channels do not satisfy this property. We also develop tools to compute, or bound, the max-relative entropy of entanglement for channels that are invariant under phase rotations. In particular, we present an analytical formula for the max-relative entropy of entanglement of the qubit amplitude damping channel.

quant-ph↗

arXiv2017

Entanglement-assisted classical communication can simulate classical communication without causal order

Phenomena induced by the existence of entanglement, such as nonlocal correlations, exhibit characteristic properties of quantum mechanics distinguishing from classical theories. When entanglement is accompanied by classical communication, it enhances the power of quantum operations jointly performed by two spatially separated parties. Such a power has been analyzed by the gap between the performances of joint quantum operations implementable by local operations at each party connected by classical communication with and without the assistance of entanglement. In this work, we present a new formulation for joint quantum operations connected by classical communication beyond special relativistic causal order but without entanglement and still within quantum mechanics. Using the formulation, we show that entanglement assisting classical communication necessary for implementing a class of joint quantum operations called separable maps can be interpreted to simulate "classical communication" not respecting causal order. Our results reveal a new counter-intuitive aspect of entanglement related to spacetime.

quant-ph↗

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

Secure Quantum Network Coding on Butterfly Network

Quantum network coding on the butterfly network has been studied as a typical example of quantum multiple cast network. We propose secure quantum network coding on the butterfly network in the multiple unicast setting based on a secure classical network coding. This protocol certainly transmits quantum states when there is no attack. We also show the secrecy even when the eavesdropper wiretaps one of the channels in the butterfly network.

quant-ph↗