SearcharxivSearch

arXiv subjects

Kentaro Kato

Publications and source records attributed to Kentaro Kato.

At least 19 recordsLinked to original sources

G\"ortler number-based scaling of boundary-layer transition on rotating cones in axial inflow

This paper reports on the efficacy of the G\"ortler number in scaling the laminar-turbulent boundary-layer transition on rotating cones facing axial inflow. Depending on the half-cone angle $\psi$ and axial flow strength, the competing centrifugal and crossflow instabilities dominate the transition. Traditionally, the flow is evaluated by using two parameters: the local meridional Reynolds number $Re_l$ comparing the inertial versus viscous effects and the local rotational speed ratio $S$ accounting for the boundary-layer skew. We focus on the centrifugal effects, and evaluate the flow fields and reported transition points using G\"ortler number based on the azimuthal momentum thickness of the similarity solution and local cone radius. The results show that G\"ortler number alone dominates the late stages of transition (maximum amplification and turbulence onset phases) for a wide range of investigated $S$ and half-cone angle ($15^{\circ} \leq \psi \leq 50^{\circ}$), although the early stage (critical phase) seems to be not determined by the G\"ortler number alone on the broader cones ($\psi=30^{\circ}$ and $50^{\circ}$) where the primary crossflow instability dominates the flow. Overall, this indicates that the centrifugal effects play an important role in the boundary-layer transition on rotating cones in axial inflow.

physics.flu-dyn

Generalized quantum process discrimination problems

We study a broad class of quantum process discrimination problems that can handle many optimization strategies such as the Bayes, Neyman-Pearson, and unambiguous strategies, where each process can consist of multiple time steps and can have an internal memory. Given a collection of candidate processes, our task is to find a discrimination strategy, which may be adaptive and/or entanglement-assisted, that maximizes a given objective function subject to given constraints. Our problem can be formulated as a convex problem. Its Lagrange dual problem with no duality gap and necessary and sufficient conditions for an optimal solution are derived. We also show that if a problem has a certain symmetry and at least one optimal solution exists, then there also exists an optimal solution with the same type of symmetry. A minimax strategy for a process discrimination problem is also discussed. As applications of our results, we provide some problems in which an adaptive strategy is not necessary for optimal discrimination. We also present an example of single-shot channel discrimination for which an analytical solution can be obtained.

quant-ph

Simple upper and lower bounds on the ultimate success probability for discriminating arbitrary finite-dimensional quantum processes

We consider the problem of discriminating finite-dimensional quantum processes, also called quantum supermaps, that can consist of multiple time steps. Obtaining the ultimate performance for discriminating quantum processes is of fundamental importance, but is challenging mainly due to the necessity of considering all discrimination strategies allowed by quantum mechanics, including entanglement-assisted strategies and adaptive strategies. In the case in which the processes to be discriminated have internal memories, the ultimate performance would generally be more difficult to analyze. In this paper, we present a simple upper bound on the ultimate success probability for discriminating arbitrary quantum processes. In the special case of multi-shot channel discrimination, it can be shown that the ultimate success probability increases by at most a constant factor determined by the given channels if the number of channel evaluations increases by one. We also present a lower bound based on Bayesian updating, which has a low computational cost. Our numerical experiments demonstrate that the proposed bounds are reasonably tight. The proposed bounds do not explicitly depend on any quantum phenomena, and can be readily extended to a general operational probabilistic theory.

quant-ph

Local unambiguous discrimination of symmetric ternary states

We investigate unambiguous discrimination between given quantum states with a sequential measurement, which is restricted to local measurements and one-way classical communication. If the given states are binary or those each of whose individual systems is two-dimensional, then it is in some cases known whether a sequential measurement achieves a globally optimal unambiguous measurement. In contrast, for more than two states each of whose individual systems is more than two-dimensional, the problem becomes extremely complicated. This paper focuses on symmetric ternary pure states each of whose individual systems is three-dimensional, which include phase shift keyed (PSK) optical coherent states and a lifted version of "double trine" states. We provide a necessary and sufficient condition for an optimal sequential measurement to be globally optimal for the bipartite case. A sufficient condition of global optimality for multipartite states is also presented. One can easily judge whether these conditions hold for given states. Some examples are given, which demonstrate that, despite the restriction to local measurements and one-way classical communication, a sequential measurement can be globally optimal in quite a few cases.

quant-ph

Optimal discrimination of optical coherent states cannot always be realized by interfering with coherent light, photon counting, and feedback

It is well known that a minimum error quantum measurement for arbitrary binary optical coherent states can be realized by a receiver that comprises interfering with a coherent reference light, photon counting, and feedback control. We show that, for ternary optical coherent states, a minimum error measurement cannot always be realized by such a receiver. The problem of finding an upper bound on the maximum success probability of such a receiver can be formulated as a convex programming. We derive its dual problem and numerically find the upper bound. At least for ternary phase-shift keyed coherent states, this bound does not reach that of a minimum error measurement.

quant-ph

Upper and Lower Bounds on Optimal Success Probability of Quantum State Discrimination with and without Inconclusive Results

We propose upper and lower bounds on the maximum success probability for discriminating given quantum states. The proposed upper bound is obtained from a suboptimal solution to the dual problem of the corresponding optimal state discrimination problem. We also give a necessary and sufficient condition for the upper bound to achieve the maximum success probability; the proposed lower bound can be obtained from this condition. It is derived that a slightly modified version of the proposed upper bound is tighter than that proposed by Qiu et al. [Phys. Rev. A 81, 042329 (2010)]. Moreover, we propose upper and lower bounds on the maximum success probability with a fixed rate of inconclusive results. The performance of the proposed bounds are evaluated through numerical experiments.

quant-ph

Generalized bipartite quantum state discrimination problems with sequential measurements

We investigate an optimization problem of finding quantum sequential measurements, which forms a wide class of state discrimination problems with the restriction that only sequential measurements are allowed. Sequential measurements from Alice to Bob on a bipartite system are considered. Using the fact that the optimization problem can be formulated as a problem with only Alice's measurement and is convex programming, we derive its dual problem and necessary and sufficient conditions for an optimal solution. In the problem we address, the output of Alice's measurement can be infinite or continuous, while sequential measurements with a finite number of outcomes are considered. It is shown that there exists an optimal sequential measurement in which Alice's measurement with a finite number of outcomes as long as a solution exists. We also show that if the problem has a certain symmetry, then there exists an optimal solution with the same type of symmetry. A minimax version of the problem is considered, and necessary and sufficient conditions for a minimax solution are derived. An example in which our results can be used to obtain an analytical expression for an optimal sequential measurement is finally provided.

quant-ph

Finding optimal solutions for generalized quantum state discrimination problems

We try to find an optimal quantum measurement for generalized quantum state discrimination problems, which include the problem of finding an optimal measurement maximizing the average correct probability with and without a fixed rate of inconclusive results and the problem of finding an optimal measurement in the Neyman-Pearson strategy. We propose an approach in which the optimal measurement is obtained by solving a modified version of the original problem. In particular, the modified problem can be reduced to one of finding a minimum error measurement for a certain state set, which is relatively easy to solve. We clarify the relationship between optimal solutions to the original and modified problems, with which one can obtain an optimal solution to the original problem in some cases. Moreover, as an example of application of our approach, we present an algorithm for numerically obtaining optimal solutions to generalized quantum state discrimination problems.

quant-ph

Quasi-Bell entangled coherent states and its quantum discrimination problem in the presence of thermal noise

The so-called quasi-Bell entangled coherent states in a thermal environment are studied. In the analysis, we assume thermal noise affects only one of the two modes of each state. First the matrix representation of the density operators of the quasi-Bell entangled coherent states in a thermal environment is derived. Secondly we investigate the entanglement property of one of the quasi-Bell entangled coherent states with thermal noise. At that time a lower bound of the entanglement of formation for the state is computed. Thirdly the minimax discrimination problem for two cases of the binary set of the quasi-Bell entangled coherent states with thermal noise is considered, and the error probabilities of the minimax discrimination for the two cases are computed with the help of Helstrom's algorithm for finding the Bayes optimal error probability of binary states.

quant-ph

Optimal quantum state discrimination with confidentiality

We investigate quantum state discrimination with confidentiality. $N$ observers share a given quantum state belonging to a finite set of known states. The observers want to determine the state as accurately as possible and send a discrimination result to a receiver. However, the observers are not allowed to get any information about which state was given. $N-1$ or fewer observers might try to steal the information, but if $N$ observers coexist, the honest ones will keep the dishonest ones from doing anything wrong. Assume that the state set has a certain symmetry, or more precisely, is Abelian geometrically uniform; this letter describes the case of three linearly independent cyclic pure states as a special case. We propose a protocol that realizes any optimal inconclusive measurement, which is a generalized version of a minimum-error measurement and an optimal unambiguous measurement, for such a state set and ensures that any combined state of $N-1$ or fewer observers has absolutely no information about the given state. Our protocol provides a method of performing a quantum measurement securely, which could be useful in quantum information applications.

quant-ph

Generalized quantum state discrimination problems

We address a broad class of optimization problems of finding quantum measurements, which includes the problems of finding an optimal measurement in the Bayes criterion and a measurement maximizing the average success probability with a fixed rate of inconclusive results. Our approach can deal with any problem in which each of the objective and constraint functions is formulated by the sum of the traces of the multiplication of a Hermitian operator and a detection operator. We first derive dual problems and necessary and sufficient conditions for an optimal measurement. We also consider the minimax version of these problems and provide necessary and sufficient conditions for a minimax solution. Finally, for optimization problem having a certain symmetry, there exists an optimal solution with the same symmetry. Examples are shown to illustrate how our results can be used.

quant-ph

Coupling Lemma and Its Application to The Security Analysis of Quantum Key Distribution

It is known that the coupling lemma provides a useful tool in the study of probability theory and its related areas. It describes the relation between the variational distance of two probability distributions and the probability that outcomes from the two random experiments associated with each distribution are not identical. In this paper, the failure probability interpretation problem that has been presented by Yuen and Hirota is discussed from the viewpoint of the application of the coupling lemma. First, we introduce the coupling lemma, and investigate properties of it. Next, it is shown that the claims for this problem in the literatures are justified by using the coupling lemma. Consequently, we see that the failure probability interpretation is not adequate in the security analysis of quantum key distribution.

quant-ph

Effectiveness of entangled coherent state in quantum metrology

This Letter verifies the potential of several classes of entangled coherent state in well known quantum metrology which includes detection of classical external force, and shows that there is a class of entangled coherent state for the external force detection system without the quantum limit in the detection of the light. In the case of the precision measurement of continuos parameter like phase measurement, the entangled coherent state with perfect entanglement does not provide remarkable benefit, but we provide a concrete example that certain class of entangled coherent state gives a remarkable sensitive detection scheme in the discrimination of digital signal affected by external force.

quant-ph

Quantum stream cipher by Yuen 2000 protocol: Design and experiment by intensity modulation scheme

This paper shall investigate Yuen protocol, so called Y-00, which can realize a randomized stream cipher with high bit rate(Gbps) for long distance(several hundreds km). The randomized stream cipher with randomization by quantum noise based on Y-00 is called quantum stream cipher in this paper, and it may have security against known plaintext attacks which has no analog with any conventional symmetric key ciphers. We present a simple cryptanalysis based on an attacker's heterodyne measurement and the quantum unambiguous measurement to make clear the strength of Y-00 in real communication. In addition, we give a design for the implementation of an intensity modulation scheme and report the experimental demonstration of 1 Gbps quantum stream cipher through 20 km long transmission line.

quant-ph

A quantum symmetric key cipher(Y-00) and key generation (Quantum stream cipher-Part II)

What obstructs the realization of useful quantum cryptography is single photon scheme, or entanglement which is not applicable to the current infrastructure of optical communication network. We are concerned with the following question: Can we realize the information theoretically secure symmetric key cipher under "the finite secret key" based on quantum-optical communications? A role of quantum information theory is to give an answer for such a question. As an answer for the question, a new quantum cryptography was proposed by H.P.Yuen, which can realize a secure symmetric key cipher with high speeds(Gbps) and for long distance(1000 Km). Although some researchers claim that Yuen protocol(Y-00) is equivalent to the classical cryptography, they are all mistaken. Indeed it has no classical analogue, and also provides a generalization even in the conventional cryptography. At present, it is proved that a basic model of Y-00 has at least the security such as $H(X|Y_E)=H(K|Y_E)=H(K)$, $H(K|Y_E,X)\sim 0$ under the average photon number per signal light pulse:$ \sim 10000$. Towards our final goal, in this paper, we clarify a role of classical randomness(secret key) and quantum randomness in Y-00, and give a rigorous quantum mechanical interpretation of the security, showing an analysis of quantum collective attack.

quant-ph

Quantum stream cipher based on optical communications

In 2000, an attractive new quantum cryptography was discovered by H.P.Yuen based on quantum communication theory. It is applicable to direct encryption, for example quantum stream cipher based on Yuen protocol(Y-00), with high speeds and for long distance by sophisticated optical devices which can work under the average photon number per signal light pulse:$ = 1000 \sim 10000$. In addition, it may provide information-theoretic security against known/chosen plaintext attack, which has no classical analogue. That is, one can provide secure communication, even the system has $H(K) << H(X)$. In this paper, first, we give a brief review on the general logic of Yuen's theory. Then, we show concrete security analysis of quantum stream cipher to quantum individual measurement attacks. Especially by showing the analysis of Lo-Ko known plaintext attack, the feature of Y-00 is clarified. In addition, we give a simple experimental result on the advantage distillation by scheme consisting of intensity modulation/direct detection optical communication.

quant-ph

Quantum key distribution with unconditional security for all optical fiber network

In this paper, we present an efficient implementation method of physical layer of Y-00 which can support a secure communication and a quantum key distribution (more generally key expansion) by IMDD(intensity modulation/direct detection) or FSK(frequency shift keying)optical fiber communication network. Although the general proof of the security is not yet given, a brief sketch of security analysis is shown, which involve an entanglement attack.

quant-ph