Kenji Nakahira
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Kenji Nakahira has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
Tsuyoshi Sasaki Usuda
6 shared publicationsKentaro Kato
5 shared publications- Kentaro Kato
Quantum ICT Research Institute, Tamagawa University, Tokyo, Japan
4 shared publications - Atsushi Miyamoto
Hitachi, Ltd, Research and Development Group, 292 Yoshida-cho, Totsuka-ku
2 shared publications - Tsuyoshi Sasaki Usuda
School of Information Science and Technology, Aichi Prefectural University, Nagakute, JAPAN
2 shared publications - Toshifumi Honda
Hitachi, Ltd., Production Engineering Research Laboratory, Kanagawa, Japan
1 shared publication
Latest Publications
- 5 June 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (6)
Erratum: Derivation of quantum theory with superselection rules [Phys. Rev. A 101 , 022104 (2020)]
- 5 June 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (6)
Erratum: Derivation of quantum theory with superselection rules [Phys. Rev. A 101 , 022104 (2020)]
- 20 March 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (3)
Unambiguous discrimination of the change point for quantum channels
- 20 March 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (3)
Unambiguous discrimination of the change point for quantum channels
- 8 September 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (3)
Improving quantum channel discrimination with resourceful states
- 8 September 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (3)
Improving quantum channel discrimination with resourceful states
- Open Access
- 22 November 2023
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 131 (21) , 210804
Identification of Quantum Change Points for Hamiltonians
Detecting sudden changes in the environment is crucial in many statistical applications. We mainly focus on identifying sudden changes in weak signals transmitted by electromagnetic or gravitational waves. Assuming that the Hamiltonians representing the signals before and after the change are known, we aim to find a discrimination strategy that can detect the change point with the best possible accuracy. This problem has potential applications in accurately detecting the precise timing of events such as stellar explosions, foreign object intrusions, specific chemical bonds, and phase transitions. We formulate this problem as a quantum process discrimination problem by discretizing the time evolution of a quantum system as a sequence of unitary channels. However, due to the complexity of the dynamics, solving such a multiple process discrimination problem is typically challenging. We demonstrate that the maximum success probability for the Hamiltonian change point problem with any finite number of candidate change points can be determined and has a simple analytical form.
- 22 November 2023
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 131 (21) , 210804
Open AccessIdentification of Quantum Change Points for Hamiltonians
Detecting sudden changes in the environment is crucial in many statistical applications. We mainly focus on identifying sudden changes in weak signals transmitted by electromagnetic or gravitational waves. Assuming that the Hamiltonians representing the signals before and after the change are known, we aim to find a discrimination strategy that can detect the change point with the best possible accuracy. This problem has potential applications in accurately detecting the precise timing of events such as stellar explosions, foreign object intrusions, specific chemical bonds, and phase transitions. We formulate this problem as a quantum process discrimination problem by discretizing the time evolution of a quantum system as a sequence of unitary channels. However, due to the complexity of the dynamics, solving such a multiple process discrimination problem is typically challenging. We demonstrate that the maximum success probability for the Hamiltonian change point problem with any finite number of candidate change points can be determined and has a simple analytical form.
- 10 December 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 104 (6) , 062609
Quantum process discrimination with restricted strategies
The discrimination of quantum processes, including quantum states, channels, and superchannels, is a fundamental topic in quantum information theory. It is often of interest to analyze the optimal performance that can be achieved when discrimination strategies are restricted to a given subset of all strategies allowed by quantum mechanics. In this paper, we present a general formulation of the task of finding the maximum success probability for discriminating quantum processes as a convex optimization problem whose Lagrange dual problem exhibits zero duality gap. The proposed formulation can be applied to any restricted strategy. We also derive necessary and sufficient conditions for an optimal restricted strategy to be optimal within the set of all strategies. We provide a simple example in which the dual problem given by our formulation can be much easier to solve than the original problem. We also show that the optimal performance of each restricted process discrimination problem can be written in terms of a certain robustness measure. This finding has the potential to provide a deeper insight into the discrimination performance of various restricted strategies.
- 10 December 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 104 (6) , 062609
Quantum process discrimination with restricted strategies
The discrimination of quantum processes, including quantum states, channels, and superchannels, is a fundamental topic in quantum information theory. It is often of interest to analyze the optimal performance that can be achieved when discrimination strategies are restricted to a given subset of all strategies allowed by quantum mechanics. In this paper, we present a general formulation of the task of finding the maximum success probability for discriminating quantum processes as a convex optimization problem whose Lagrange dual problem exhibits zero duality gap. The proposed formulation can be applied to any restricted strategy. We also derive necessary and sufficient conditions for an optimal restricted strategy to be optimal within the set of all strategies. We provide a simple example in which the dual problem given by our formulation can be much easier to solve than the original problem. We also show that the optimal performance of each restricted process discrimination problem can be written in terms of a certain robustness measure. This finding has the potential to provide a deeper insight into the discrimination performance of various restricted strategies.
- 3 December 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 104 (6) , 069902
Erratum: Generalized quantum process discrimination problems [Phys. Rev. A 103 , 062606 (2021)]
DOI: https://doi.org/10.1103/PhysRevA.104.069902
- 3 December 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 104 (6) , 069902
Erratum: Generalized quantum process discrimination problems [Phys. Rev. A 103 , 062606 (2021)]
DOI: https://doi.org/10.1103/PhysRevA.104.069902
- 14 June 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 103 (6) , 062606
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.
- 14 June 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 103 (6) , 062606
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.
- 18 May 2021
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 126 (20) , 200502
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 Letter, we present a simple upper bound on the ultimate success probability for discriminating arbitrary quantum processes. In the special case of multishot 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.
- 18 May 2021
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 126 (20) , 200502
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 Letter, we present a simple upper bound on the ultimate success probability for discriminating arbitrary quantum processes. In the special case of multishot 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.
- 11 January 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 103 (1) , 019903
Erratum: Minimax strategy in quantum signal detection with inconclusive results [Phys. Rev. A 88 , 032314 (2013)]
DOI: https://doi.org/10.1103/PhysRevA.103.019903
- 11 January 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 103 (1) , 019903
Erratum: Minimax strategy in quantum signal detection with inconclusive results [Phys. Rev. A 88 , 032314 (2013)]
DOI: https://doi.org/10.1103/PhysRevA.103.019903
- 5 January 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 103 (1) , 019902
Erratum: Generalized quantum state discrimination problems [Phys. Rev. A 91 , 052304 (2015)]
DOI: https://doi.org/10.1103/PhysRevA.103.019902
- 5 January 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 103 (1) , 019902
Erratum: Generalized quantum state discrimination problems [Phys. Rev. A 91 , 052304 (2015)]
DOI: https://doi.org/10.1103/PhysRevA.103.019902