arXiv subjects

Ryuji Takagi

Publications and source records attributed to Ryuji Takagi.

At least 19 recordsLinked to original sources

arXiv2026

Scaling-optimal purification of noisy qubit unitary channels

We consider the problem of purifying noisy qubit unitary channels. Given the ability to apply an unknown qubit unitary channel followed by depolarizing noise, we aim to construct a superchannel that purifies the noisy unitary back to the original unknown unitary. We first provide numerical evidence that sequential strategies can strictly outperform parallel strategies when the number of channel uses is finite, highlighting the fundamental distinction from state purification. We then provide a concrete $\mathrm{U}(2)$-covariant parallel protocol based on a novel entanglement-assisted quantum error-correcting code that suppresses the first-order noise strength as $O(1/n)$ with $n$ channel uses and show this scaling is asymptotically optimal in the low-noise regime, even when sequential strategies are allowed.

quant-ph↗

arXiv2026

Reliability of asymptotic work extraction

Extracting work from quantum states is a fundamental task in quantum thermodynamics. Previous studies have primarily focused on determining the best achievable rate of work extraction, and remarkably, this characterization appeared to remain unchanged regardless of the choice of allowed processes: whether one considers the operationally motivated class of energy-conserving thermal operations, or the axiomatic class of Gibbs-preserving operations, the optimal extractable work is given by the Helmholtz free energy. Here, we challenge this perspective, showing that a more refined analysis of the asymptotic performance of work extraction reveals significant differences in the performance for the two different classes of free operations. Precisely, we focus on the trade-off between the extraction rate and its reliability, characterized by the optimal asymptotic speed at which the extraction error can be suppressed. We establish that the reliability of Gibbs-preserving operations and of thermal operations are respectively characterized by the Petz and the sandwiched R\'enyi relative entropies, demonstrating that the former in general strictly outperforms the latter, and providing new interpretations of several information-theoretic divergences. Our analysis reveals that operational constraints such as energy conservation impose stronger limitations on the achievable precision of quantum tasks than can be inferred from their asymptotic rates, thereby questioning the use of Gibbs-preserving operations as a mathematically convenient substitute for the physically realizable thermal processes.

quant-ph↗

arXiv2026

Asymptotic magic state distillation with almost linear rate

The overhead exponent -- characterizing the scaling of the number of noisy magic states with respect to the target distillation error -- has been a central quantity to benchmark magic state distillation protocols. On the other hand, a related but less investigated quantity motivated by an information-theoretic viewpoint is the asymptotic distillation rate, the largest ratio of output to input magic states such that error vanishes asymptotically. These two quantities are tightly related in the specific case -- the overhead exponent is zero if and only if the asymptotic distillation rate is linear. However, their relationship in other regimes has been unclear. Here, we show that their quantitative relation is generally not robust, by presenting a family of magic state distillation protocols with an overhead exponent not close to zero -- in fact, larger than one -- that still achieves the asymptotic rate arbitrarily close to the linear rate. This implies that the distillation rate is not constrained by the overhead exponent within the sublinear rate regime. Notably, our protocol is based on error checking by measurements of logical Clifford operators, which underlies the recent magic state cultivation protocol, suggesting the potential of this mechanism for asymptotic magic state distillation.

quant-ph↗

arXiv2026

Universal quantum resource distillation via composite generalised quantum Stein's lemma

The performance of quantum resource manipulation protocols, including key examples such as distillation of quantum entanglement, is measured in terms of the rate at which desired target states can be produced from a given noisy state. However, to achieve optimal rates, known protocols require precise tailoring to the quantum state in question, demanding a perfect knowledge of the input and allowing no errors in its preparation. Here we show that distillation of quantum resources in the framework of resource non-generating operations can be performed universally: optimal rates of distillation can be achieved with no knowledge of the input state whatsoever, certifying the robustness of quantum resource distillation. The findings apply in particular to the purification of quantum entanglement under non-entangling maps, where the optimal rates are governed by the regularised relative entropy of entanglement. Our result relies on an extension of the generalised quantum Stein's lemma in quantum hypothesis testing to a composite setting where the null hypothesis is no longer a fixed quantum state, but is rather composed of i.i.d. copies of an unknown state. The solution of this asymptotic problem is made possible through new developments in one-shot quantum information and a refinement of the blurring technique from [Lami, arXiv:2408.06410].

quant-ph↗

arXiv2026

Weak distillation of quantum resources

Importance sampling based on quasi-probability decomposition is the backbone of many widely used techniques, such as error mitigation, circuit knitting, and, more generally, virtual quantum resource distillation, as it allows one to simulate operations that are not accessible in a given setting. However, this class of protocols faces a fundamental problem -- it only allows to estimate expectation values. Here, we provide a general framework that lifts any quasi-probability-based protocol from expectation value estimation to a weak simulator, realizing sampling from the desired distribution only using a restricted class of quantum resources. Our method runs with the sampling cost proportional to the negativity of the quasi-probability, in stark contrast to the naive estimation-based approach that requires a large number of samples even in the case of small negativity. We show that our method requires significantly fewer samples in a number of relevant scenarios, such as error mitigation, entanglement distillation and magic state distillation. Our framework realizes the weak simulation of quantum resources without actually distilling the state, introducing a new notion of quantum resource distillation.

quant-ph↗

arXiv2026

Spin-Cat Qubit with Biased Noise in an Optical Tweezer Array

Bias-tailored quantum error correcting codes (QECCs) offer a higher error threshold than standard QECCs and have the potential to achieve lower logical errors with less space overhead. The spin-cat qubit, encoded in a large nuclear spin-$F$ system, is a promising candidate for bias-tailored QECCs. Yet its feasibility is hindered by the difficulty of performing fast covariant SU(2) rotation with arbitrary rotation angles for nuclear spins and by a lack of noise characterization for gate operations in neutral atom platforms. Here we demonstrate single-qubit controls of ${}^{173}\mathrm{Yb}$ spin-cat qubits with nuclear spin $I=5/2$ in an optical tweezer array. We implement a covariant SU(2) rotation and non-linear rotations by optical beams and achieve an averaged single-Clifford gate fidelity of $0.961_{-5}^{+5}$. The measurement of the coherence time and spin relaxation time shows that the idling error becomes increasingly biased toward dephasing errors as the magnitude of the encoded sublevel $|m_F|$ increases. Furthermore, we benchmark the noise bias of rank-preserving gates on spin-cat qubits, demonstrating a finite bias of $18_{-11}^{+132}$, in contrast to the case of the two-level system in ${}^{171}\mathrm{Yb}$, which shows no bias within the experimental uncertainty. Our work demonstrates the feasibility of spin-cat qubits for realizing bias-tailored QECCs, paving the way for achieving hardware-efficient quantum error correction.

quant-ph↗

arXiv2026

Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates

To build large-scale quantum computers while minimizing resource requirements, one may want to use high-rate quantum error-correcting codes that can efficiently encode information. However, realizing an addressable gate$\unicode{x2014}$a logical gate on a subset of logical qubits within a high-rate code$\unicode{x2014}$in a fault-tolerant manner can be challenging and may require ancilla qubits. Transversal and fold-transversal gates could provide a means to fault-tolerantly implement logical gates using a constant-depth circuit without ancilla qubits, but available gates of these types could be limited depending on the code and might not be addressable. In this work, we study a family of $[\![n=2^m,k={m \choose m/2}\approx n/\sqrt{\pi \log_2(n)/2},d=2^{m/2}=\sqrt{n}]\!]$ self-dual quantum Reed$\unicode{x2013}$Muller codes, where $m$ is a positive even number. For any code in this family, we construct a generating set of the full logical Clifford group comprising only transversal and fold-transversal gates, thus enabling the implementation of any addressable Clifford gate. To our knowledge, this is the first known construction of the full logical Clifford group using only transversal and fold-transversal gates without requiring ancilla qubits for a family of codes in which $k$ grows near-linearly in $n$ up to a $1/\sqrt{\log n}$ factor.

quant-ph↗

arXiv2025

Random dilation superchannel

We present a quantum circuit that implements the random dilation superchannel, transforming parallel queries of an unknown quantum channel into the same number of parallel queries of a randomly chosen dilation isometry of the input channel. This is a natural generalization of the random purification channel, that transforms copies of an unknown mixed state to copies of a randomly chosen purification state. The circuit complexity of our construction is $O(\mathrm{poly}(n, \log d_I, \log d_O))$, where $n$ is the number of queries and $d_I$ and $d_O$ are the input and output dimensions of the input channel, respectively. This random dilation superchannel is extended to the sequential queries approximately, by transforming the parallel random dilation isometry into sequential random dilation unitaries with $O(\mathrm{poly}(d_I))$ overhead in the number of queries. We also show that our results can be further extended to the case of quantum superchannels. On the other hand, we show a no-go theorem on the exact random dilation of sequential queries with $o(\mathrm{poly}(\min\{d_I, d_O\}))$ query overhead, showcasing a fundamental difference between the parallel and sequential cases. As an application, we show an efficient storage-and-retrieval of an unknown quantum channel, which improves the program cost exponentially in the retrieval error $\varepsilon$. For the case where the Kraus rank $r$ is the least possible (i.e., $r = d_I/d_O$), we show quantum circuits that transform $n$ parallel queries of an unknown quantum channel $\Lambda$ to $\Theta(n^\alpha)$ parallel queries of $\Lambda$ for any $\alpha<2$ approximately, and implement its Petz recovery map for the maximally mixed reference state probabilistically and exactly.

quant-ph↗

arXiv2025

Recovery of the second law in fully quantum thermodynamics

Quantum thermodynamics investigates how robust the second law of thermodynamics serves as the unique fundamental law in the small quantum world. To tackle this problem, the quantum coherence constitutes a major difficulty of investigations, which provides severe constraints hindering the recovery of a single thermodynamic potential. Here we solve this long-standing problem of quantum information theory by revealing that the state convertibility under thermal operations is fully characterized by the second law of thermodynamics. Specifically, we prove that whether a quantum state with quantum coherence is convertible to another by a thermal operation with a correlated catalyst is completely determined by the free energy ordering. Unlike previous attempts, our setting does not resort to any additional external coherent assist, providing a faithful operational characterization of thermodynamic state transformation.

quant-ph↗

arXiv2025

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↗

arXiv2025

Measuring non-Gaussianity with Correlation

Quantum non-Gaussianity is a key resource for quantum advantage in continuous-variable systems. We introduce a general framework to quantify non-Gaussianity based on correlation generation: two copies of a state become correlated at a $50{:}50$ beam splitter if and only if the state is non-Gaussian, with correlations reducing to entanglement in the pure-state case. This connection enables operational measures of non-Gaussianity, defined through correlation quantifiers such as R\'enyi-$\alpha$ entropy for pure states and R\'enyi-$\alpha$ mutual information for mixed states. We prove that all such measures are monotonic under Gaussian channels. Building on this framework, we propose a sample-efficient experimental protocol to estimate non-Gaussianity using standard optical components, even in the state agnostic setting. Finally, we establish a lower bound on the sample complexity of estimating Wigner negativity, allowing a direct comparison with our protocol. Our results provide both a unifying theoretical framework for non-Gaussianity and a practical route toward its experimental quantification.

quant-ph↗

arXiv2025

Universal tradeoff relations between resource cost and irreversibility of channels: General-resource Wigner-Araki-Yanase theorems and beyond

Quantum technologies offer exceptional -- sometimes almost magical -- speed and performance, yet every quantum process costs physical resources. Designing next-generation quantum devices, therefore, depends on solving the following question: which resources, and in what amount, are required to implement a desired quantum process? Casting the problem in the language of quantum resource theories, we prove a universal cost-irreversibility tradeoff: the lower the irreversibility of a quantum process, the greater the required resource cost for its realization. The trade-off law holds for a broad range of resources -- energy, magic, asymmetry, coherence, athermality, and others -- yielding lower bounds on resource cost of any quantum channel. Its broad scope positions this result as a foundation for deriving the following key results: (1) we show a universal relation between the energetic cost and the irreversibility for arbitrary channels, encompassing the energy-error tradeoff for any measurement or unitary gate; (2) we extend the energy-error tradeoff to free energy and work costs; (3) we extend the Wigner-Araki-Yanase theorem, which is the universal limitation on measurements under conservation laws, to a wide class of resource theories: the probability of failure in distinguishing resourceful states via a measurement is inversely proportional to its resource cost; (4) we prove that infinitely many resource-non-increasing operations in fact require an infinite implementation cost. These findings reveal a universal relationship between quantumness and irreversibility, providing a first step toward a general theory that explains when -- and how -- quantumness can suppress irreversibility.

quant-ph↗

arXiv2025

Universal work extraction in quantum thermodynamics

Evaluating the maximum amount of work extractable from a nanoscale quantum system is one of the central problems in quantum thermodynamics. Previous works identified the free energy of the input state as the optimal rate of extractable work under the crucial assumption: experimenters know the description of the given quantum state, which restricts the applicability to significantly limited settings. Here, we show that this optimal extractable work can be achieved without knowing the input states at all, removing the aforementioned fundamental operational restrictions. We achieve this by presenting a universal work extraction protocol, whose description does not depend on input states but nevertheless extracts work quantified by the free energy of the unknown input state. Remarkably, our result partially encompasses the case of infinite-dimensional systems, for which optimal extractable work has not been known even for the standard state-aware setting. Our results clarify that, in spite of the crucial difference between the state-aware and state-agnostic scenarios in accomplishing information-theoretic tasks, whether we are in possession of information on the given state does not influence the optimal performance of the asymptotic work extraction.

quant-ph↗

arXiv2025

Symmetric channel verification for purifying noisy quantum channels

Symmetry inherent in quantum states has been widely used to reduce the effect of noise in quantum error correction and a quantum error mitigation technique known as symmetry verification. However, these symmetry-based techniques exploit symmetry in quantum states rather than quantum channels, limiting their application to cases where the entire circuit shares the same symmetry. In this work, we propose symmetric channel verification (SCV), a channel purification protocol that leverages the symmetry inherent in quantum channels. By introducing different phases to each symmetric subspace and employing a quantum phase estimation-like circuit, SCV can detect and correct symmetry-breaking noise in quantum channels. We further propose a hardware-efficient implementation of SCV at the virtual level, which requires only a single-qubit ancilla and is robust against the noise in the ancilla qubit. Our protocol is applied to various Hamiltonian simulation circuits and phase estimation circuits, resulting in a significant reduction of errors. Furthermore, in setups where only Clifford unitaries can be used for noise purification, which is relevant in the early fault-tolerant regime, we show that SCV under Pauli symmetry represents the optimal purification method.

quant-ph↗

arXiv2025

Bridging magic and non-Gaussian resources via Gottesman-Kitaev-Preskill encoding

Although the similarity between non-stabilizer states -- also known as magic states -- in discrete-variable systems and non-Gaussian states in continuous-variable systems has widely been recognized, the precise connections between these two notions have still been unclear. We establish a fundamental link between these two quantum resources via the Gottesman-Kitaev-Preskill (GKP) encoding. We show that the negativity of the continuous-variable Wigner function for an encoded GKP state coincides with a magic measure we introduce, which matches the negativity of the discrete Wigner function for odd dimensions. We also provide a continuous-variable representation of the stabilizer Rényi entropy -- a recent proposal for a magic measure for multi-qubit states. With this in hand, we give a classical simulation algorithm with runtime scaling with the resource contents, quantified by our magic measures. We also employ our results to prove that implementing a multi-qubit logical non-Clifford operation in the GKP code subspace requires a non-Gaussian operation even at the limit of perfect encoding, despite the fact that the ideal GKP states already come with a large amount of non-Gaussianity.

quant-ph↗

arXiv2025

Black Box Work Extraction and Composite Hypothesis Testing

Work extraction is one of the most central processes in quantum thermodynamics. However, the prior analysis of optimal extractable work has been restricted to a limited operational scenario where complete information about the initial state is given. Here, we introduce a general framework of black box work extraction, which addresses the inaccessibility of information on the initial state. We show that the optimal extractable work in the black box setting is completely characterized by the performance of a composite hypothesis testing task, a fundamental problem in information theory. We employ this general relation to reduce the asymptotic black box work extraction to the quantum Stein's lemma in composite hypothesis testing, allowing us to provide their exact characterization in terms of the Helmholtz free energy. We also show a new quantum Stein's lemma motivated in this physical setting, where a composite hypothesis contains a certain correlation. Our work exhibits the importance of information about the initial state and gives a new interpretation of the quantities in the composite quantum hypothesis testing, encouraging the interplay between the physical settings and the information theory.

quant-ph↗

arXiv2025

Universal trade-off structure between symmetry, irreversibility, and quantum coherence in quantum processes

Symmetry, irreversibility, and quantum coherence are foundational concepts in physics. Here, we present a universal tradeoff relation between these three concepts. This particularly reveals that (1) under a global symmetry, any attempt to change the local conserved charge causes inevitable irreversibility, and (2) such irreversibility can be mitigated by quantum coherence. Our tradeoff relation follows solely from the unitarity and global symmetry of the total dynamics, allowing for general applicability. For non-equilibrium physics, it relates the coherence cost and the entropy production -- representing thermodynamic irreversibility -- in arbitrary quantum processes. It also provides fundamental limitations on the capability of a number of quantum information processing tasks -- such as gate and measurement implementation and error correction -- that involve symmetry restrictions. Furthermore, it predicts how many bits of classical information thrown into a black hole become unreadable under energy conservation. Our tradeoff relation is based on quantum uncertainty relation, showcasing intimate connections between fundamental physical principles and ultimate operational capability of quantum processes.

quant-ph↗

arXiv2024

Mixed-state additivity properties of magic monotones based on quantum relative entropies for single-qubit states and beyond

We prove that the stabilizer fidelity is multiplicative for the tensor product of an arbitrary number of single-qubit states. We also show that the relative entropy of magic becomes additive if all the single-qubit states but one belong to a symmetry axis of the stabilizer octahedron. We extend the latter results to include all the $α$-$z$ Rényi relative entropy of magic. This allows us to identify a continuous set of magic monotones that are additive for single-qubit states. We also show that all the monotones mentioned above are additive for several standard two and three-qubit states subject to depolarizing noise. Finally, we obtain closed-form expressions for several states and tighter lower bounds for the overhead of probabilistic one-shot magic state distillation.

quant-ph↗