SearcharxivSearch

arXiv subjects

Yosuke Mitsuhashi

Publications and source records attributed to Yosuke Mitsuhashi.

12 recordsLinked to original sources

The i.i.d. State Convertibility in the Resource Theory of Asymmetry for Finite Groups

We identify exact and approximate conversion rates between i.i.d. pure states under covariant operations in the resource theory of asymmetry for symmetries described by finite groups. We establish the formula for the exact conversion rate by completely specifying the relevant set of resource measures. The exact conversion is generally asymptotically irreversible due to the existence of multiple independent resource measures, and we find the necessary and sufficient condition for asymptotic reversibility. On the other hand, we show that the approximate conversion rates diverge or vanish, which implies that the asymmetry can be infinitely amplified if we allow a vanishingly small error. We reveal the underlying mechanism of such a counterintuitive phenomenon by utilizing the properties of maximally asymmetric states.

quant-ph

Spectral Small-Incremental-Entangling: Breaking Quasi-Polynomial Complexity Barriers in Long-Range Interacting Systems

How the detailed structure of quantum complexity emerges from quantum dynamics remains a fundamental challenge highlighted by advances in quantum simulators and information processing. The celebrated Small-Incremental-Entangling (SIE) theorem provides a universal constraint on the rate of entanglement generation, yet it leaves open the problem of fully characterizing fine entanglement structures. Here we introduce the concept of Spectral-Entangling strength, which captures the structural entangling power of an operator, and establish a spectral SIE theorem: a universal speed limit for R'enyi entanglement growth at $α\ge 1/2$, revealing a robust $1/s^2$ decay threshold in the entanglement spectrum. Remarkably, our bound at $α=1/2$ is both qualitatively and quantitatively optimal, defining the universal threshold beyond which entanglement growth becomes unbounded. This exposes the detailed structure of Schmidt coefficients and enables rigorous truncation-based error control, linking entanglement structure to computational complexity. Building on this, we derive a generalized entanglement area law under an adiabatic-path condition, extending a central principle of quantum many-body physics to general interactions. As a concrete application, we show that one-dimensional long-range interacting systems admit polynomial bond-dimension approximations for ground, time-evolved, and thermal states, thereby closing the long-standing quasi-polynomial gap and demonstrating that such systems can be simulated efficiently with tensor-network methods. By explicitly controlling R'enyi entanglement, we obtain a rigorous, a priori error guarantee for the time-dependent density-matrix renormalization-group algorithm. Overall, our results extend the SIE theorem to the spectral domain and establish a unified framework that unveils the detailed and universal structure underlying quantum complexity.

quant-ph

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

Symmetric Clifford twirling for cost-optimal quantum error mitigation in early FTQC regime

Twirling noise affecting quantum gates is essential in understanding and controlling errors, but applicable operations to noise are usually restricted by symmetries inherent in quantum gates. In this work, we propose symmetric Clifford twirling, a Clifford twirling utilizing only symmetric Clifford operators that commute with certain Pauli subgroups. We fully characterize how each Pauli noise is converted through the twirling and show that certain Pauli noise can be scrambled to a noise exponentially close to the global white noise. Moreover, we provide numerical demonstrations for highly structured circuits, such as Trotterized Hamiltonian simulation circuits, that noise effect on typical observables can be described by the global white noise. We further demonstrate that symmetric Clifford twirling and its hardware-efficient variant using only local symmetric Clifford operators can significantly accelerate the scrambling. These findings enable us to mitigate errors in non-Clifford operations with minimal sampling overhead in the early fault-tolerant regime.

quant-ph

Characterization of randomness in quantum circuits of continuous gate sets

In the accompanying paper of arXiv:2408.13472, we have established the method of characterizing the maximal order of asymptotic unitary designs generated by symmetric local random circuits, and have explicitly specified the order in the cases of $\mathbb{Z}_2$, U(1), and SU(2) symmetries. Here, we provide full details on the derivation of the main theorems for general symmetry and for concrete symmetries. Furthermore, we consider a general framework where we have access to a finite set of connected compact unitary subgroups, which includes symmetric local unitary gate sets.

quant-ph

Unitary Designs of Symmetric Local Random Circuits

We have established the method of characterizing the unitary design generated by a symmetric local random circuit. Concretely, we have shown that the necessary and sufficient condition for the circuit asymptotically forming a t-design is given by simple integer optimization for general symmetry and locality. By using the result, we explicitly give the maximal order of unitary design under the $\mathbb{Z}_2$, U(1), and SU(2) symmetries for general locality. This work reveals the relation between the fundamental notions of symmetry and locality in terms of randomness.

quant-ph

Non-Haar random circuits form unitary designs as fast as Haar random circuits

The unitary design formation in random circuits has attracted considerable attention due to its wide range of practical applications and relevance to fundamental physics. While the formation rates in Haar random circuits have been extensively studied in previous works, it remains an open question how these rates are affected by the choice of local randomizers. In this work, we prove that the circuit depths required for general non-Haar random circuits to form unitary designs are upper bounded by those for the corresponding Haar random circuits, up to a constant factor independent of the system size. This result is derived in a broad range of circuit structures, including one- and higher-dimensional lattices, geometrically non-local configurations, and even extremely shallow circuits with patchwork architectures. We provide specific applications of these results in randomized benchmarking and random circuit sampling, and also discuss their implications for quantum many-body physics. Our work lays the foundation for flexible and robust randomness generation in real-world experiments, and offers new insights into chaotic dynamics in complex quantum systems.

quant-ph

Quantum geometric tensor determines the pure-state i.i.d. conversion rate in the resource theory of asymmetry for any compact Lie group

Quantifying physical concepts in terms of the ultimate performance of a given task has been central to theoretical progress, as illustrated by thermodynamic entropy and entanglement entropy, which respectively quantify irreversibility and quantum correlations. Symmetry breaking is equally universal, yet lacks such an operational quantification. While an operational characterization of symmetry breaking through asymptotic state-conversion efficiency is a central goal of the resource theory of asymmetry (RTA), such a characterization has so far been completed only for the $U(1)$ group among continuous symmetries. Here, we identify the complete measure of symmetry breaking for a general continuous symmetry described by any compact Lie group. Specifically, we show that the asymptotic conversion rate between many copies of pure states in RTA is determined by the quantum geometric tensor, thereby establishing it as the complete measure of symmetry breaking. As an immediate consequence of our conversion rate formula, we also resolve the Marvian-Spekkens conjecture on conditions for reversible conversion in RTA, which has remained unproven for over a decade. Leveraging the connection between symmetry breaking and the theory of quantum reference frames, we also systematically introduce a standardized reference state for frameness based on our asymptotic conversion theory. In addition, by applying our analysis to a standard quantum-thermodynamic scenario, we show that asymptotic state conversion in contact with heat baths generally requires macroscopic coherence in the thermodynamic limit.

quant-ph

More global randomness from less-random local gates

Random circuits giving rise to unitary designs are key tools in quantum information science and many-body physics. In this work, we investigate a class of random quantum circuits with a specific gate structure. Within this framework, we prove that one-dimensional structured random circuits with non-Haar random local gates can exhibit substantially more global randomness compared to Haar random circuits with the same underlying circuit architecture. In particular, we derive all the exact eigenvalues and eigenvectors of the second-moment operators for these structured random circuits under a solvable condition, by establishing a link to the Kitaev chain, and show that their spectral gaps can exceed those of Haar random circuits. Our findings have applications in improving circuit depth bounds for randomized benchmarking and the generation of approximate unitary 2-designs from shallow random circuits.

quant-ph

Clifford Group and Unitary Designs under Symmetry

We have generalized the well-known statement that the Clifford group is a unitary 3-design into symmetric cases by extending the notion of unitary design. Concretely, we have proven that a symmetric Clifford group is a symmetric unitary 3-design if and only if the symmetry constraint is described by some Pauli subgroup. We have also found a complete and unique construction method of symmetric Clifford groups with simple quantum gates for Pauli symmetries. For the overall understanding, we have also considered physically relevant U(1) and SU(2) symmetry constraints, which cannot be described by a Pauli subgroup, and have proven that the symmetric Clifford group is a symmetric unitary 1-design but not a 2-design under those symmetries. Our findings are numerically verified by computing the frame potentials, which measure the difference in randomness between the uniform ensemble on the symmetric group of interest and the symmetric unitary group. This work will open a new perspective into quantum information processing such as randomized benchmarking, and give a deep understanding to many-body systems such as monitored random circuits.

quant-ph

Programmable and sequential Gaussian gates in a loop-based single-mode photonic quantum processor

A quantum processor to import, process, and export optical quantum states is a common core technology enabling various photonic quantum information processing. However, there has been no photonic processor which is simultaneously universal, scalable, and programmable. Here, we report on an original loop-based single-mode versatile photonic quantum processor which is designed to be universal, scalable, and programmable. Our processor can perform arbitrarily many steps of programmable quantum operations on a given single-mode optical quantum state by time-domain processing in a dynamically controlled loop-based optical circuit. We use this processor to demonstrate programmable single-mode Gaussian gates and multi-step squeezing gates. In addition, we prove that the processor can perform universal quantum operations by injecting appropriate ancillary states and also be straightforwardly extended to a multi-mode processor. These results show that our processor is programmable, scalable, and potentially universal, leading to be suitable for general-purpose applications.

quant-ph

Characterizing symmetry-protected thermal equilibrium by work extraction

The second law of thermodynamics states that work cannot be extracted from thermal equilibrium, whose quantum formulation is known as complete passivity; A state is called completely passive if work cannot be extracted from any number of copies of the state by any unitary operations. It has been established that a quantum state is completely passive if and only if it is a Gibbs ensemble. In physically plausible setups, however, the class of possible operations is often restricted by fundamental constraints such as symmetries imposed on the system. In the present work, we investigate the concept of complete passivity under symmetry constraints. Specifically, we prove that a quantum state is completely passive under a symmetry constraint described by a connected compact Lie group, if and only if it is a generalized Gibbs ensemble (GGE) including conserved charges associated with the symmetry. Remarkably, our result applies to non-commutative symmetry such as $SU(2)$ symmetry, suggesting an unconventional extension of the notion of GGE. Furthermore, we consider the setup where a quantum work storage is explicitly included, and prove that the characterization of complete passivity remains unchanged. Our result extends the notion of thermal equilibrium to systems protected by symmetries, and would lead to flexible design principles of quantum heat engines and batteries. Moreover, our approach serves as a foundation of the resource theory of thermodynamics in the presence of symmetries.

quant-ph