Yoshifumi Nakata
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
Yoshifumi Nakata has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
Mio Murao
Department of Physics Graduate School of Science The University of Tokyo 7-3-1 Hongo Bunkyo-ku 113-0033 Tokyo Japan
12 shared publicationsMasato Koashi
Photon Science Center, Graduate School of Engineering, the University of Tokyo, Bunkyo-ku, Tokyo 113-8656, Japan
5 shared publications- Andreas Winter
Departament de Física Grup d'Informació Quàntica Universitat Autònoma de Barcelona 08193 Bellaterra (Barcelona Spain
4 shared publications Eyuri Wakakuwa
Department of Communication Engineering and Informatics, Graduate School of Informatics and Engineering, The University of Electro-Communications, Tokyo 182-8585, Japan
4 shared publications- Christoph Hirche
Institute for Information Processing (tnt/L3S) Leibniz Universität Hannover Germany
3 shared publications - Ciara Morgan
Institut für Theoretische Physik Leibniz Universität Hannover Appelstraße 2 30167 Hannover Germany
3 shared publications
Latest Publications
- Open Access
- 13 March 2026
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 10, 2024
Explicit decoders using fixed-point amplitude amplification based on QSVT
Reliably transmitting quantum information via a noisy quantum channel is a central challenge in quantum information science. While constructing a decoder is crucial to this goal, little was known about quantum circuit implementations of decoders that reach high communication rates. In this paper, we provide two decoders with explicit quantum circuits capable of recovering quantum information when the decoupling condition is satisfied, i.e., when quantum information is in principle recoverable. These are applicable to both entanglement-assisted and non-assisted settings. By developing a technique that relies on a symmetric structure of the decoders, we show that they are applicable to any noise model. As a consequence, for any noisy channel, our decoders can be used to achieve a communication rate arbitrarily close to the quantum capacity by increasing the number of channel uses. To construct the decoders, we employ the fixed-point amplitude amplification (FPAA) based on the quantum singular value transformation (QSVT), extending a previous approach applicable only to erasure noise. Our constructions offer advantages in the computational cost, largely reducing the circuit complexity compared to previous explicit decoders. Through an investigation of the decoding problem, unique advantages of the QSVT-based FPAA are highlighted.
- 13 March 2026
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 10, 2024
Open AccessExplicit decoders using fixed-point amplitude amplification based on QSVT
Reliably transmitting quantum information via a noisy quantum channel is a central challenge in quantum information science. While constructing a decoder is crucial to this goal, little was known about quantum circuit implementations of decoders that reach high communication rates. In this paper, we provide two decoders with explicit quantum circuits capable of recovering quantum information when the decoupling condition is satisfied, i.e., when quantum information is in principle recoverable. These are applicable to both entanglement-assisted and non-assisted settings. By developing a technique that relies on a symmetric structure of the decoders, we show that they are applicable to any noise model. As a consequence, for any noisy channel, our decoders can be used to achieve a communication rate arbitrarily close to the quantum capacity by increasing the number of channel uses. To construct the decoders, we employ the fixed-point amplitude amplification (FPAA) based on the quantum singular value transformation (QSVT), extending a previous approach applicable only to erasure noise. Our constructions offer advantages in the computational cost, largely reducing the circuit complexity compared to previous explicit decoders. Through an investigation of the decoding problem, unique advantages of the QSVT-based FPAA are highlighted.
- Open Access
- 9 September 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (3)
Computational Complexity of Unitary and State Design Properties
We investigate unitary and state t -designs from a computational complexity perspective. First, we address the problems of computing frame potentials that characterize (approximate) t -designs. We present a quantum algorithm for computing frame potentials and establish the following: (1) exact computation can be achieved by a single query to a # P oracle and is # P -hard; (2) for state vectors, deciding whether the frame potential is larger than or smaller than certain values is B Q P -complete, provided that the promise gap between the two values is inverse polynomial in the number of qubits; and (3) for both state vectors and unitaries, this promise problem is P P -complete if the promise gap is exponentially small. Second, we address the promise problem of deciding whether or not a given set is a good approximation to a design. Given a certain promise gap that could be constant, we show that this problem is P P -hard, highlighting the inherent computational difficulty of determining properties of unitary and state designs. We further identify implications of our results, including variational methods for constructing designs, diagnosing quantum chaos, and exploring emergent designs in Hamiltonian systems.
- 9 September 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (3)
Open AccessComputational Complexity of Unitary and State Design Properties
We investigate unitary and state t -designs from a computational complexity perspective. First, we address the problems of computing frame potentials that characterize (approximate) t -designs. We present a quantum algorithm for computing frame potentials and establish the following: (1) exact computation can be achieved by a single query to a # P oracle and is # P -hard; (2) for state vectors, deciding whether the frame potential is larger than or smaller than certain values is B Q P -complete, provided that the promise gap between the two values is inverse polynomial in the number of qubits; and (3) for both state vectors and unitaries, this promise problem is P P -complete if the promise gap is exponentially small. Second, we address the promise problem of deciding whether or not a given set is a good approximation to a design. Given a certain promise gap that could be constant, we show that this problem is P P -hard, highlighting the inherent computational difficulty of determining properties of unitary and state designs. We further identify implications of our results, including variational methods for constructing designs, diagnosing quantum chaos, and exploring emergent designs in Hamiltonian systems.
- Open Access
- 10 January 2025
- Published by Springer Nature in npj Quantum Information
- Vol. 11 (1) , 1-19
Decoding general error correcting codes and the role of complementarity
- 10 January 2025
- Published by Springer Nature in npj Quantum Information
- Vol. 11 (1) , 1-19
Open AccessDecoding general error correcting codes and the role of complementarity
- Open Access
- 25 April 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (2) , L022021
Hayden-Preskill recovery in Hamiltonian systems
Information scrambling refers to the unitary dynamics that quickly spreads and encodes localized quantum information over an entire many-body system and makes the information accessible from any small subsystem. While information scrambling is the key to understanding complex quantum many-body dynamics and is well-understood in random unitary models, it has been hardly explored in Hamiltonian systems. In this Letter, we investigate the information recovery in various time-independent Hamiltonian systems, including chaotic spin chains and Sachdev-Ye-Kitaev models. We show that information recovery is possible in certain, but not all, chaotic models, which highlights the difference between information recovery and quantum chaos based on the energy spectrum or the out-of-time-ordered correlators. We also show that information recovery probes transitions caused by the change of information-theoretic features of the dynamics. Published by the American Physical Society 2024
- 25 April 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (2) , L022021
Open AccessHayden-Preskill recovery in Hamiltonian systems
Information scrambling refers to the unitary dynamics that quickly spreads and encodes localized quantum information over an entire many-body system and makes the information accessible from any small subsystem. While information scrambling is the key to understanding complex quantum many-body dynamics and is well-understood in random unitary models, it has been hardly explored in Hamiltonian systems. In this Letter, we investigate the information recovery in various time-independent Hamiltonian systems, including chaotic spin chains and Sachdev-Ye-Kitaev models. We show that information recovery is possible in certain, but not all, chaotic models, which highlights the difference between information recovery and quantum chaos based on the energy spectrum or the out-of-time-ordered correlators. We also show that information recovery probes transitions caused by the change of information-theoretic features of the dynamics. Published by the American Physical Society 2024
- Open Access
- 16 April 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (2) , 023055
Low-depth random Clifford circuits for quantum coding against Pauli noise using a tensor-network decoder
Recent work [M. J. Gullans et al., Phys. Rev. X 11, 031066 (2021)] has shown that quantum error correcting codes defined by random Clifford encoding circuits can achieve a nonzero encoding rate in correcting errors even if the random circuits on qubits, embedded in one spatial dimension (1D), have a logarithmic depth . However, this was demonstrated only for a simple erasure noise model. In this work, we discover that, for the same class of codes, this desired property indeed holds for the conventional Pauli noise model. Specifically, we numerically demonstrate that the hashing bound, i.e., a rate known to be achieved with -depth random encoding circuits, can be attained for the above codes even when the circuit depth is restricted to in 1D for depolarizing noise of various strengths. This analysis is made possible with our development of a tensor-network maximum-likelihood decoding algorithm that works efficiently for -depth encoding circuits in 1D.- 16 April 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (2) , 023055
Open AccessLow-depth random Clifford circuits for quantum coding against Pauli noise using a tensor-network decoder
Recent work [M. J. Gullans et al., Phys. Rev. X 11, 031066 (2021)] has shown that quantum error correcting codes defined by random Clifford encoding circuits can achieve a nonzero encoding rate in correcting errors even if the random circuits on qubits, embedded in one spatial dimension (1D), have a logarithmic depth . However, this was demonstrated only for a simple erasure noise model. In this work, we discover that, for the same class of codes, this desired property indeed holds for the conventional Pauli noise model. Specifically, we numerically demonstrate that the hashing bound, i.e., a rate known to be achieved with -depth random encoding circuits, can be attained for the above codes even when the circuit depth is restricted to in 1D for depolarizing noise of various strengths. This analysis is made possible with our development of a tensor-network maximum-likelihood decoding algorithm that works efficiently for -depth encoding circuits in 1D. - Open Access
Hayden-Preskill Recovery in Hamiltonian Systems
Information scrambling refers to the unitary dynamics that quickly spreads and encodes localized quantum information over an entire many-body system and makes the information accessible from any small subsystem. While information scrambling is the key to understanding complex quantum many-body dynamics and is well-understood in random unitary models, it has been hardly explored in Hamiltonian systems. In this Letter, we investigate the information recovery in various time-independent Hamiltonian systems, including chaotic spin chains and Sachdev-Ye-Kitaev (SYK) models. We show that information recovery is possible in certain, but not all, chaotic models, which highlights the difference between information recovery and quantum chaos based on the energy spectrum or the out-of-time-ordered correlators. We also show that information recovery probes transitions caused by the change of information-theoretic features of the dynamics.
Open AccessHayden-Preskill Recovery in Hamiltonian Systems
Information scrambling refers to the unitary dynamics that quickly spreads and encodes localized quantum information over an entire many-body system and makes the information accessible from any small subsystem. While information scrambling is the key to understanding complex quantum many-body dynamics and is well-understood in random unitary models, it has been hardly explored in Hamiltonian systems. In this Letter, we investigate the information recovery in various time-independent Hamiltonian systems, including chaotic spin chains and Sachdev-Ye-Kitaev (SYK) models. We show that information recovery is possible in certain, but not all, chaotic models, which highlights the difference between information recovery and quantum chaos based on the energy spectrum or the out-of-time-ordered correlators. We also show that information recovery probes transitions caused by the change of information-theoretic features of the dynamics.
- Open Access
- 21 February 2023
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 7, 928-35
Black holes as clouded mirrors: the Hayden-Preskill protocol with symmetry
The Hayden-Preskill protocol is a qubit-toy model of the black hole information paradox. Based on the assumption of scrambling, it was revealed that quantum information is instantly leaked out from the quantum many-body system that models a black hole. In this paper, we extend the protocol to the case where the system has symmetry and investigate how the symmetry affects the leakage of information. We especially focus on the conservation of the number of up-spins. Developing a partial decoupling approach, we first show that the symmetry induces a delay of leakage and an information remnant. We then clarify the physics behind them: the delay is characterized by thermodynamic properties of the system associated with the symmetry, and the information remnant is closely related to the symmetry-breaking of the initial state. These relations bridge the information leakage problem to macroscopic physics of quantum many-body systems and allow us to investigate the information leakage only in terms of physical properties of the system.
- 21 February 2023
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 7, 928-35
Open AccessBlack holes as clouded mirrors: the Hayden-Preskill protocol with symmetry
The Hayden-Preskill protocol is a qubit-toy model of the black hole information paradox. Based on the assumption of scrambling, it was revealed that quantum information is instantly leaked out from the quantum many-body system that models a black hole. In this paper, we extend the protocol to the case where the system has symmetry and investigate how the symmetry affects the leakage of information. We especially focus on the conservation of the number of up-spins. Developing a partial decoupling approach, we first show that the symmetry induces a delay of leakage and an information remnant. We then clarify the physics behind them: the delay is characterized by thermodynamic properties of the system associated with the symmetry, and the information remnant is closely related to the symmetry-breaking of the initial state. These relations bridge the information leakage problem to macroscopic physics of quantum many-body systems and allow us to investigate the information leakage only in terms of physical properties of the system.
- Open Access
Black holes as clouded mirrors: the Hayden-Preskill protocol with symmetry
The Hayden-Preskill protocol is a qubit-toy model of the black hole information paradox. Based on the assumption of scrambling, it was revealed that quantum information is instantly leaked out from the quantum many-body system that models a black hole. In this paper, we extend the protocol to the case where the system has symmetry and investigate how the symmetry affects the leakage of information. We especially focus on the conservation of the number of up-spins. Developing a partial decoupling approach, we first show that the symmetry induces a delay of leakage and an information remnant. We then clarify the physics behind them: the delay is characterized by thermodynamic properties of the system associated with the symmetry, and the information remnant is closely related to the symmetry-breaking of the initial state. These relations bridge the information leakage problem to macroscopic physics of quantum many-body systems and allow us to investigate the information leakage only in terms of physical properties of the system.
Open AccessBlack holes as clouded mirrors: the Hayden-Preskill protocol with symmetry
The Hayden-Preskill protocol is a qubit-toy model of the black hole information paradox. Based on the assumption of scrambling, it was revealed that quantum information is instantly leaked out from the quantum many-body system that models a black hole. In this paper, we extend the protocol to the case where the system has symmetry and investigate how the symmetry affects the leakage of information. We especially focus on the conservation of the number of up-spins. Developing a partial decoupling approach, we first show that the symmetry induces a delay of leakage and an information remnant. We then clarify the physics behind them: the delay is characterized by thermodynamic properties of the system associated with the symmetry, and the information remnant is closely related to the symmetry-breaking of the initial state. These relations bridge the information leakage problem to macroscopic physics of quantum many-body systems and allow us to investigate the information leakage only in terms of physical properties of the system.
- Open Access
One-Shot Hybrid State Redistribution
We consider state redistribution of a "hybrid" information source that has both classical and quantum components. The sender transmits classical and quantum information at the same time to the receiver, in the presence of classical and quantum side information both at the sender and at the decoder. The available resources are shared entanglement, and noiseless classical and quantum communication channels. We derive one-shot direct and converse bounds for these three resources, represented in terms of the smooth conditional entropies of the source state. Various coding theorems for two-party source coding problems are systematically obtained by reduction from our results, including the ones that have not been addressed in previous literature.
Open AccessOne-Shot Hybrid State Redistribution
We consider state redistribution of a "hybrid" information source that has both classical and quantum components. The sender transmits classical and quantum information at the same time to the receiver, in the presence of classical and quantum side information both at the sender and at the decoder. The available resources are shared entanglement, and noiseless classical and quantum communication channels. We derive one-shot direct and converse bounds for these three resources, represented in terms of the smooth conditional entropies of the source state. Various coding theorems for two-party source coding problems are systematically obtained by reduction from our results, including the ones that have not been addressed in previous literature.
- Open Access
- 3 September 2021
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 2 (3) , 030339
Quantum Circuits for Exact Unitary -Designs and Applications to Higher-Order Randomized BenchmarkingA unitary -design is a powerful tool in quantum information science and fundamental physics. Despite its usefulness, only approximate implementations were known for general . In this paper, we provide quantum circuits that generate exact unitary -designs for any on an arbitrary number of qubits. Our construction is inductive and is of practical use in small systems. We then introduce a -order generalization of randomized benchmarking (-RB) as an application of exact -designs. We particularly study the -RB in detail and show that it reveals self-adjointness of quantum noise, a metric related to the feasibility of quantum error correction (QEC). We numerically demonstrate that the -RB in one- and two-qubit systems is feasible, and experimentally characterize background noise of a superconducting qubit by the -RB. It is shown from the experiment that interactions with adjacent qubits induce the noise that may result in an obstacle toward a realization of QEC.- 3 September 2021
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 2 (3) , 030339
Open AccessQuantum Circuits for Exact Unitary -Designs and Applications to Higher-Order Randomized BenchmarkingA unitary -design is a powerful tool in quantum information science and fundamental physics. Despite its usefulness, only approximate implementations were known for general . In this paper, we provide quantum circuits that generate exact unitary -designs for any on an arbitrary number of qubits. Our construction is inductive and is of practical use in small systems. We then introduce a -order generalization of randomized benchmarking (-RB) as an application of exact -designs. We particularly study the -RB in detail and show that it reveals self-adjointness of quantum noise, a metric related to the feasibility of quantum error correction (QEC). We numerically demonstrate that the -RB in one- and two-qubit systems is feasible, and experimentally characterize background noise of a superconducting qubit by the -RB. It is shown from the experiment that interactions with adjacent qubits induce the noise that may result in an obstacle toward a realization of QEC.