Searcharxiv⌕ Search

arXiv subjects

Yoshifumi Nakata

Publications and source records attributed to Yoshifumi Nakata.

At least 19 recordsLinked to original sources

When Classical Correlations Certify Entanglement Recovery

Entanglement and state distinguishability have long been central topics in quantum foundations. While each has developed into a rich subject in its own right, they can be connected through measurements in complementary bases. This connection provides insights into quantum and classical correlations and underlies many information-processing tasks, most notably quantum error correction (QEC). However, it has remained largely open whether the connection between entanglement and distinguishability extends to general measurements without assuming complementarity. We answer this question in the affirmative: the key is irreducibility induced by measurements, a much more relaxed condition than complementarity. Specifically, for POVMs satisfying an irreducibility condition, we establish a quantitative relation between the infidelity of one-sided local transformation into a maximally entangled state and the failure probability in state discrimination. We then characterize when both errors can vanish simultaneously. Our results have direct applications to entanglement distillation and QEC. Their errors can be certified by estimating classical input-output correlations from experimentally accessible local measurements, without requiring complementarity. The results also extend to quantum measurement theory. We derive novel trade-off relations that bridge two historically distinct approaches: information gain--irreversibility and observable noise--disturbance. Our connection between entanglement and distinguishability via irreducibility thus offers a common framework for entanglement distillation, QEC, and measurement trade-offs.

quant-ph↗

Towards Optimal Quantum Estimators for State Frame Potential

The state frame potential is a standard diagnostic of how closely a quantum state ensemble approximates Haar randomness. In this work, we study the problem of estimating the state frame potential of order $t$ to within additive error $\varepsilon$ under three progressively weaker access models: (i) query access to a multi-state-preparation oracle, (ii) general sample access, and (iii) single-copy sample access. In the query model, we establish a near-optimal query complexity of $\widetildeΘ(\sqrt{t}/\varepsilon)$, yielding a quadratic improvement in the dependence on $t$ over the previous best result of Nakata, Takeuchi, Kliesch, and Darmawan (PRX Quantum 2025). In the general sample model, we establish the optimal sample complexity $Θ(t/\varepsilon^2)$. In the single-copy sample model, we present a store-and-estimate approach whose sample complexity depends on the Rényi entropy of the ensemble weights. As an application, we use the single-copy algorithm to assess the randomness of projected state ensembles, where the entropy term becomes the observational Rényi entropy associated with measuring one subsystem.

quant-ph↗

Rethinking quantum information in gravity and fields

This paper presents a curated selection of research questions at the intersection of quantum gravity and quantum information, chosen to highlight issues that we regard as particularly important for researchers in both fields. We organize the discussion into four main themes: the operational characterization of observables, the role of observers, quantum error correction, and the infinite-dimensionality of Hilbert spaces. We hope that addressing these questions will engage researchers across both communities and further strengthen the profound interplay between the two disciplines.

hep-th↗

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.

quant-ph↗

Quantum algorithms for Uhlmann transformation

Uhlmann's theorem is a central result in quantum information theory, which associates the closeness of two quantum states with that of their purifications. The theorem also well characterizes a fundamental task: how close a pure quantum state can be transformed into another state via local operations acting only on its subsystem. The optimal transformation for this task is called the Uhlmann transformation, which has broad applications in various information-processing tasks. However, its quantum circuit implementation and computational cost have remained unclear, limiting the utility of the transformation. In this work, we fill this gap by proposing quantum algorithms that realize the Uhlmann transformation in query and sample access models. Notably, our Uhlmann transformation algorithms can be polynomial-time for low-rank states, exhibiting an exponential improvement over the previous approach and other naive approaches based on quantum state tomography. In addition, we derive a lower bound on the query and sample complexities of the Uhlmann transformation for a deeper understanding of its algorithmic features. We apply our Uhlmann transformation algorithms to fidelity estimation between two states, and substantially improve the previous best query and sample complexities. We further discuss other applications to several information-theoretic tasks, including entanglement transmission, quantum state merging, and the algorithmic implementation of the Petz recovery map, providing a comprehensive evaluation of their computational costs. These results, hence, contribute to the practical realization of such widely recognized and useful protocols.

quant-ph↗

On 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 $\# \textsf{P}$-oracle and is $\# \textsf{P}$-hard; (2) for state vectors, deciding whether the frame potential is larger than or smaller than certain values is $\textsf{BQP}$-complete, provided 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 $\textsf{PP}$-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 $\textsf{PP}$-hard, highlighting the inherent computational difficulty of determining properties of unitary and state designs. We further identify the implications of our results across diverse areas, including variational methods for constructing designs, diagnosing quantum chaos through out-of-time-ordered correlators (OTOCs), and exploring emergent designs in Hamiltonian systems.

quant-ph↗

Decoding general error correcting codes and the role of complementarity

Among various classes of quantum error correcting codes (QECCs), non-stabilizer codes have rich properties and are of theoretical and practical interest. Decoding non-stabilizer codes is, however, a highly non-trivial task. In this paper, we show that a decoding circuit for Calderbank-Shor-Steane (CSS) codes can be straightforwardly extended to handle general QECCs. The key to the extension lies in the use of a pair of classical-quantum (CQ) codes associated with the QECC to be decoded. The decoding error of the proposed decoding circuit depends on the classical decoding errors of the CQ codes and their degree of complementarity. We demonstrate the power of the decoding circuit in a toy model of the black hole information paradox, improving decoding errors compared to previous results. In addition, we reveal that black hole dynamics may optimally encode quantum information but poorly encode classical information.

quant-ph↗

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.

cond-mat.str-el↗

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.

quant-ph↗

One-Shot Triple-Resource Trade-Off in Quantum Channel Coding

We analyze a task in which classical and quantum messages are simultaneously communicated via a noisy quantum channel, assisted with a limited amount of shared entanglement. We derive direct and converse bounds for the one-shot capacity region, represented by the smooth conditional entropies and the error tolerance. The proof is based on the randomized partial decoupling theorem, which is a generalization of the decoupling theorem. The two bounds match in the asymptotic limit of infinitely many uses of a memoryless channel and coincide with the previous result obtained by Hsieh and Wilde. Direct and converse bounds for various communication tasks are obtained as corollaries, both for the one-shot and asymptotic scenarios.

quant-ph↗

Low-depth random Clifford circuits for quantum coding against Pauli noise using a tensor-network decoder

Recent work [M. J. Gullans et al., Physical Review X, 11(3):031066 (2021)] has shown that quantum error correcting codes defined by random Clifford encoding circuits can achieve a non-zero encoding rate in correcting errors even if the random circuits on $n$ qubits, embedded in one spatial dimension (1D), have a logarithmic depth $d=\mathcal{O}(\log{n})$. However, this was demonstrated only for a simple erasure noise model. In this work, we discover that 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 $d=\mathcal{O}(n)$-depth random encoding circuits, can be attained even when the circuit depth is restricted to $d=\mathcal{O}(\log n)$ 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 $\log$-depth encoding circuits in 1D.

quant-ph↗

Characterizing quantum pseudorandomness by machine learning

Random dynamics in isolated quantum systems is of practical use in quantum information and is of theoretical interest in fundamental physics. Despite a large number of theoretical studies, it has not been addressed how random dynamics can be verified from experimental data. In this paper, based on an information-theoretic formulation of random dynamics, i.e., unitary $t$-designs, we propose a method for verifying random dynamics from the data that is experimentally easy-to-access. More specifically, we use measurement probabilities estimated by a finite number of measurements of quantum states generated by a given random dynamics. Based on a supervised learning method, we construct classifiers of random dynamics and show that the classifiers succeed to characterize random dynamics. We then apply the classifiers to the data set generated by local random circuits (LRCs), which are canonical quantum circuits with growing circuit complexity, and show that the classifiers successfully characterize the growing features. We further apply the classifiers to noisy LRCs, showing the possibility of using them for verifying noisy quantum devices, and to monitored LRCs, indicating that the measurement-induced phase transition may possibly not be directly related to randomness.

quant-ph↗

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.

quant-ph↗

One-Shot Randomized and Nonrandomized Partial Decoupling

We introduce a task that we call partial decoupling, in which a bipartite quantum state is transformed by a unitary operation on one of the two subsystems and then is subject to the action of a quantum channel. We assume that the subsystem is decomposed into a direct-sum-product form, which often appears in the context of quantum information theory. The unitary is chosen at random from the set of unitaries having a simple form under the decomposition. The goal of the task is to make the final state, for typical choices of the unitary, close to the averaged final state over the unitaries. We consider a one-shot scenario, and derive upper and lower bounds on the average distance between the two states. The bounds are represented simply in terms of smooth conditional entropies of quantum states involving the initial state, the channel and the decomposition. Thereby we provide generalizations of the one-shot decoupling theorem. The obtained result would lead to further development of the decoupling approaches in quantum information theory and fundamental physics.

quant-ph↗

Quantum circuits for exact unitary $t$-designs and applications to higher-order randomized benchmarking

A unitary $t$-design is a powerful tool in quantum information science and fundamental physics. Despite its usefulness, only approximate implementations were known for general $t$. In this paper, we provide for the first time quantum circuits that generate exact unitary $t$-designs for any $t$ on an arbitrary number of qubits. Our construction is inductive and is of practical use in small systems. We then introduce a $t$-th order generalization of randomized benchmarking ($t$-RB) as an application of exact $2t$-designs. We particularly study the $2$-RB in detail and show that it reveals self-adjointness of quantum noise, a new metric related to the feasibility of quantum error correction (QEC). We numerically demonstrate that the $2$-RB in one- and two-qubit systems is feasible, and experimentally characterize background noise of a superconducting qubit by the $2$-RB. It is shown from the experiment that interactions with adjacent qubits induce the noise that may result in an obstacle toward the realization of QEC.

quant-ph↗

One-shot quantum error correction of classical and quantum information

Quantum error correction (QEC) is one of the central concepts in quantum information science and also has wide applications in fundamental physics. The capacity theorems provide solid foundations of QEC. We here provide a general and highly applicable form of capacity theorem for both classical and quantum information, i.e., hybrid information, with assistance of a limited resource of entanglement in one-shot scenario, which covers broader situations than the existing ones. Harnessing the wide applicability of the theorem, we show that a demonstration of QEC by short random quantum circuits is feasible and that QEC is intrinsic in quantum chaotic systems. Our results bridge the progress in quantum information theory, near-future quantum technology, and fundamental physics.

quant-ph↗

Holographic Pseudo Entropy

We introduce a quantity, called pseudo entropy, as a generalization of entanglement entropy via post-selection. In the AdS/CFT correspondence, this quantity is dual to areas of minimal area surfaces in time-dependent Euclidean spaces which are asymptotically AdS. We study its basic properties and classifications in qubit systems. In specific examples, we provide a quantum information theoretic meaning of this new quantity as an averaged number of Bell pairs when the post-selection is performed. We also present properties of the pseudo entropy for random states. We then calculate the pseudo entropy in the presence of local operator excitations for both the two dimensional free massless scalar CFT and two dimensional holographic CFTs. We find a general property in CFTs that the pseudo entropy is highly reduced when the local operators get closer to the boundary of the subsystem. We also compute the holographic pseudo entropy for a Janus solution, dual to an exactly marginal perturbation of a two dimensional CFT and find its agreement with a perturbative calculation in the dual CFT. We show the linearity property holds for holographic states, where the holographic pseudo entropy coincides with a weak value of the area operator. Finally, we propose a mixed state generalization of pseudo entropy and give its gravity dual.

hep-th↗

Explicit construction of exact unitary designs

The purpose of this paper is to give explicit constructions of unitary $t$-designs in the unitary group $U(d)$ for all $t$ and $d$. It seems that the explicit constructions were so far known only for very special cases. Here explicit construction means that the entries of the unitary matrices are given by the values of elementary functions at the root of some given polynomials. We will discuss what are the best such unitary $4$-designs in $U(4)$ obtained by these methods. Indeed we give an inductive construction of designs on compact groups by using Gelfand pairs $(G,K)$. Note that $(U(n),U(m) \times U(n-m))$ is a Gelfand pair. By using the zonal spherical functions for $(G,K)$, we can construct designs on $G$ from designs on $K$. We remark that our proofs use the representation theory of compact groups crucially. We also remark that this method can be applied to the orthogonal groups $O(d)$, and thus provides another explicit construction of spherical $t$-designs on the $d$ dimensional sphere $S^{d-1}$ by the induction on $d$.

math.CO↗