Searcharxiv⌕ Search

arXiv subjects

Nobuyuki Yoshioka

Publications and source records attributed to Nobuyuki Yoshioka.

At least 19 recordsLinked to original sources

Asymptotic scars arising from the remnants of quantum phase transitions

Many-body localisation, Hilbert space fragmentation and quantum many-body scars (QMBS) are well-established mechanisms of ergodicity breaking in quantum systems. Recently, asymptotic quantum many-body scars (AQMBS), non-thermal states whose stability grows with system size, have been proposed theoretically and probed experimentally. Here, we show that AQMBS arise naturally as remnants of certain quantum phase transitions. For a broad class of frustration-free Hamiltonians, we prove that their gapless excitations survive deformation into a scarred Hamiltonian as states whose energy variance is bounded by the excitation gap. Consequently, the gapless excitations at a quantum critical point become AQMBS of the scarred Hamiltonian. Their fidelity relaxation time is then set by the critical scaling of the gap, determined by the dynamic critical exponent. Modelling the critical Fredkin and Motzkin chains and the two-dimensional PVBS model, we obtain AQMBS whose variances directly reflect the dynamic exponents of the underlying transitions. Where the gap of the Motzkin chain closes super-exponentially, we find exponentially stable AQMBS, for which we also observe numerical evidence of volume-law entanglement.

quant-ph↗

Provably Efficient Learning of Fermionic Correlations under Particle-Number Symmetry

Predicting local fermionic correlations is a central task in quantum many-body physics, as these correlations encode many physically relevant local observables. The ubiquitous particle-number symmetry imposes strong structural constraints on quantum states, suggesting that local correlations should be learned with fewer samples than by symmetry-agnostic approaches. However, it has remained unclear whether such a provable advantage exists in collective learning of local correlations. Here, we develop a framework of number-conserving fermionic-shadow tomography based on random orbital rotations. We prove that, for every given order $k$, we can simultaneously estimate all $k$-body fermionic correlations of an $N$-mode $η$-particle state with a given variance $\varepsilon^2$ using only $O_k(η^k/\varepsilon^2)$ samples, which are independent of the system size $N$. We further establish a matching information-theoretic lower bound $Ω_k(η^k/\varepsilon^2)$ for any adaptive protocol based on single-copy measurements, showing that the $(η^k,\varepsilon)$-dependence is optimal up to constants depending only on $k$. Furthermore, numerical studies show a 20-fold query reduction for one-body correlation estimation at $N=200$, $η=20$, and $\varepsilon=10^{-2}$, compared with the best alternative including Heisenberg-limited estimation methods. Relative to fermionic Gaussian-unitary shadows, sample costs for the square-lattice Fermi-Hubbard model at $N=288$ are reduced by factors of $148$ for energy density and $161$ for spin structure factor estimation. For molecular energy derivatives with respect to atomic coordinates, our method reduces sample requirements by factors of $53$ for $\mathrm{Cr}_2$ and $18.5$ for $[\mathrm{Fe}_2\mathrm{S}_2]^{2-}$ at $N=128$. These results demonstrate the practical advantage of particle-number symmetry for fermionic observable estimation.

quant-ph↗

Polylog-depth Quantum Thermal Simulation via Local Recovery Channels

We establish sufficient conditions for preparing quantum thermal states of noncommuting local Hamiltonians with polylogarithmic circuit depth in arbitrary fixed spatial dimension. Our conditions combine locality and stability bounds on the effective interactions of reduced density matrices of a Gibbs state with a quantitative high-temperature condition and access to coarse classical reference Hamiltonians. When these references can be generated locally, the classical preprocessing cost is $N^{1+o(1)}$ for $N$ sites at inverse-polynomial global accuracy. We construct the preparation circuit from spatially localized Petz recovery maps. Quantum corrections derived from the microscopic Hamiltonian enable accurate recovery while the classical references remain coarse. After preprocessing, the resulting circuit prepares the canonical purification using $N\operatorname{polylog}(N/\varepsilon)$ gates and qubits, where $\varepsilon$ is the preparation error. These results link two fundamental questions: how correlations are organized in thermal equilibrium, and how efficiently the corresponding states can be realized through operations allowed by quantum mechanics. By translating static equilibrium structure into explicit preparation circuits, they give equilibrium locality a constructive computational interpretation and a physically grounded role in quantum algorithm design.

quant-ph↗

Copy-scarce learning of ground states

Probing multiple properties of ground states is central to understanding quantum matter, yet conventional readout can be prohibitively costly because it consumes many independently prepared copies. Here, in copy-scarce regimes, we establish optimal trade-offs between the number of initial ground-state copies and elapsed Hamiltonian-evolution time required for estimating multiple observables or reconstructing a full classical description of a unique gapped ground state. We derive a unifying inequality that quantifies how well ground states can be distinguished using initial copies and controlled dynamics, even when all copies may be consumed. It yields worst-case lower bounds on elapsed Hamiltonian time that any protocol must incur to perform either task. We construct parallel catalytic readouts that return all initial copies nearly unchanged while attaining these bounds up to poly-logarithmic factors. Our protocols require no coherent preparation circuit or its inverse, and their elapsed Hamiltonian time depends only logarithmically on the inverse of the desired return error. Thus, optimal copy--dynamics trade-offs can be attained together with catalytic return. Numerical benchmarks further show substantial reductions in end-to-end elapsed Hamiltonian time relative to a task-specialized copy-consuming protocol, even under an optimistic preparation-cost model. Our results reveal a copy--dynamics resource landscape connecting copy-scarce learning to copy-only endpoints realized by known protocols for shadow tomography and pure-state tomography.

quant-ph↗

Simple, Efficient, and Generic Post-Selection Decoding for qLDPC Codes

Quantum error correction is indispensable for scalable quantum computation. Although encoding logical qubits substantially enhances noise resilience, achieving logical error rates low enough for practical algorithms remains challenging on existing hardware. Here we introduce argument reweighting, a simple and broadly applicable post-selection decoding strategy that boosts the performance of maximum-likelihood-type decoders, including minimum-weight perfect matching and belief-propagation families. The method suppresses logical errors by performing additional decoding rounds under reweighted error models, enabling acceptance of high-confidence syndrome outcomes. Circuit-level simulations across multiple decoders and qLDPC codes show that argument reweighting substantially suppresses logical errors, requiring a rejection rate of only $1.44\times10^{-5}$ to reduce the logical error rate by almost two orders of magnitude for the $[[144,12,12]]$ bivariate bicycle code. These results establish argument reweighting as a practical and resource-efficient approach for enhancing quantum fault tolerance.

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↗

Arbitrary-Distance Quantum Error Correction with Gauss's Law for $\mathbb Z_2$ Lattice Gauge Theory

It has previously been shown by Rajput, Roggero, and Wiebe that $\mathbb Z_2$ Gauss's law constraints can be used to build efficient quantum error-correcting codes (QECCs) that are robust against arbitrary single-qubit errors. In this work, we generalize the construction to be robust against arbitrary $t$-qubit errors, where $t$ is any positive integer. This includes a derivation of the optimal Gauss's law code within the considered family by minimizing the number of physical qubits required for a given code distance. Finally, we compare our codes against other efficient QECCs on metrics such as the number of physical qubits, the locality of the encoded Hamiltonian, and the logical error rate in the code capacity setting. Compared to using a domain-agnostic code for every lattice degree of freedom, we find that the Gauss's law code primarily excels at reducing the locality of the encoded Hamiltonian. Moreover, the physical qubit overhead is also reduced for $t \le 3$ (distance $d \le 7$).

hep-lat↗

Theory and Architecture of Syndrome-Resolved Logical Gates

We introduce a general framework for weak transversal gates, namely syndrome-resolved implementation of logical unitaries realized by local physical unitaries, and demonstrate its wide impact in three applications: partial fault-tolerant architecture, short-depth state preparation, and magic state distillation. Our theoretical contribution is to prove a sufficient condition for a general Calderbank-Shor-Steane code to admit weak transversal gates, and to present an efficient algorithm to determine the physical multiqubit Pauli rotations. To demonstrate the practicality of weak transversal gates in the near future, we propose a partially fault-tolerant Clifford+$ϕ$ architecture that implements in-place Pauli rotations via a repeat-until-success strategy. Numerical simulations indicate that a rotation of 0.001 attains a logical error of $9.6\times10^{-5}$ on a surface code with $d=7$ at a physical error rate of $p=10^{-4}$, while avoiding the spacetime overheads of magic state factories, small angle synthesis, and routing. Resource estimates on surface and [[144,12,12]] bivariate bicycle codes for a Trotter-like circuit with $N=108$ logical qubits indicate runtime reductions of factors of 778 and 45, respectively, relative to the conventional method, due to the natural parallelism of rotation gates. Looking further ahead, we consider state-preparation tasks allowing postselection. We show that weak transversal gadgets prepare high-level equatorial magic states with a substantially improved cost-accuracy tradeoff, achieving up to a $10^3$-fold reduction in spacetime cost for a magic state at the 11th level of the Clifford hierarchy. Furthermore, we integrate weak transversal gates into magic state distillation pipelines, reducing the logical error rate of level-2 distillation of the $\sqrt{T}$ state by up to a factor of 94 with a small increase in spacetime cost.

quant-ph↗

Bounded-depth spacetime lattice surgery for resource-efficient fault-tolerant quantum computation

Fault-tolerant quantum computing based on lattice surgery requires place-and-route compilation with low spacetime overhead. Routing, in particular, faces a basic tension between suppressing path conflicts through greater spatial allocation and exploiting the time direction to realize ancilla-efficient spacetime routing. Existing approaches do not fully resolve this trade-off while retaining compatibility with inner factory layouts and termination guarantees. Here we introduce double-slice routing, a constant-depth spacetime-routing method that uses two consecutive time slices with a guarantee that its kink-parity correction terminates under both planar and stacked architectures. We numerically benchmark the resulting compiler on Hamiltonian-simulation workloads to show that double-slice routing reduces compilation cost by up to a factor of 2.4 over a single-slice baseline. Compared to projective routing, an existing method that allows an unbounded number of time slices per path, double-slice routing achieves smaller circuit volume with only a marginal execution-time penalty. Combined with a cultivation-compatible mapping optimization, the overall improvement reaches up to 7.5-fold over a naive single-slice compilation baseline. These results identify double-slice routing as a practically useful operating point in lattice-surgery compilation and show the substantial benefit in joint optimization of mapping and routing.

quant-ph↗

Quantum advantages for syndrome-aware noisy logical observable estimation

Recent progress in fault-tolerant quantum computing suggests that leveraging error-syndrome information at the logical layer can substantially improve performance, including the estimation of logical observables from noisy states. In this work, based on quantum estimation theory, we develop an information-theoretic framework to quantify the utility of error syndromes for noisy logical observable estimation. We distinguish two operational regimes of such syndrome-aware protocols: classical protocols, in which the logical measurement basis is fixed and syndrome information is used only in classical post-processing, and quantum protocols, in which the logical quantum control can be tailored to depend on the observed error syndrome. For classical syndrome-aware protocols, we prove a universal limitation: on average, syndrome information can improve the effective logical error rate by at most a factor of two, implying at most a quadratic reduction in sampling overhead. In contrast, once syndrome-conditioned quantum control is permitted, we demonstrate that the effective logical error rate decays exponentially with the number of code blocks. These findings provide fundamental guidance for designing future fault-tolerant architectures that actively exploit syndrome records rather than discarding them after decoding.

quant-ph↗

pygridsynth: A fast numerical tool for ancilla-free Clifford+T synthesis

We present pygridsynth, an open-source Python library for ancilla-free approximate Clifford+$T$ synthesis that runs in $O(\log(1/ε))$ for precision $ε$. For $n=1, 2$ qubits, the library builds upon established efficient and high-precision synthesis routines, such as nearly optimal $Z$-rotation synthesis and magnitude approximation. For $n\ge 3$ qubits, we introduce a partial-decomposition technique that generalizes the magnitude approximation, reducing constant factors in the $T$-count as $(\frac{21}{8}\cdot 4^n - \frac{9}{2}\cdot 2^n + 9)\log_2(1/ε) + o(\log(1/ε))$. The package also exposes a mixed-synthesis workflow that approximates target unitary channels by probabilistic mixtures of Clifford+$T$ circuits, for which we empirically find that the synthesis error is reduced from $ε$ to $ε^2/(2n)$. Taken together, these features make pygridsynth a Python-native platform for high-precision Clifford$+T$ synthesis and for benchmarking unitary and mixed synthesis strategies on multi-qubit instances.

quant-ph↗

Testing the equivalence to thermal states via extractable work under LOCC

Understanding the thermal behavior of quantum many-body pure states is one of the most fundamental issues in quantum thermodynamics. It is widely known that typical pure states yield vanishing work, just as thermal states do, when one restricts to local operations that cannot access correlations among subsystems. However, it remains unclear whether this equivalence to thermal states persists under LOCC (local operations and classical communication), where classically accessible correlations can be exploited for work extraction. In this work, we establish criteria for determining whether many-body pure states remain equivalent to thermal states even under LOCC, and show that this thermal equivalence is governed by their multipartite quantum correlation structure. We show that states with asymptotically maximal multipartite entanglement, such as Haar-random states, cannot yield extensive work under LOCC, whereas some states with limited multipartite entanglement, such as constant-degree graph states, allow extensive work extraction despite being locally indistinguishable from thermal states. Thus, our work provides a refined operational notion of thermal equivalence beyond the traditional local regime, which is becoming increasingly important due to the recent expansion of experimentally accessible operations.

quant-ph↗

Noise-Agnostic Unbiased Quantum Error Mitigation for Logical Qubits

Probabilistic error cancellation is a quantum error mitigation technique capable of producing unbiased computation results but requires an accurate error model. Constructing this model involves estimating a set of parameters, which, in the worst case, may scale exponentially with the number of qubits. In this paper, we introduce a method called spacetime noise inversion, revealing that unbiased quantum error mitigation can be achieved with just a single accurately measured error parameter and a sampler of Pauli errors. The error sampler can be efficiently implemented in conjunction with quantum error correction. We provide rigorous analyses of bias and cost, showing that the cost of measuring the parameter and sampling errors is low -- comparable to the cost of the computation itself. Moreover, our method is robust to the fluctuation of error parameters, a limitation of unbiased quantum error mitigation in practice. These findings highlight the potential of integrating quantum error mitigation with error correction as a promising approach to suppress computational errors in the early fault-tolerant era.

quant-ph↗

Quantum Power Iteration Unified Using Generalized Quantum Signal Processing

We propose a unifying framework for the state preparation using quantum power method algorithms based on generalized quantum signal processing (GQSP). We apply GQSP to realize quantum analogs of classical power iteration, power Lanczos, inverse iteration, and folded spectrum methods, all within a single coherent framework. GQSP allows efficient realization of methods that require complex polynomials, while avoiding the limitations of approaches based on linear combinations of time-evolution operators. Our constructions, including a Trotter-decomposition-free quantum inverse iteration, achieve near-optimal query scaling, together with reduced qubit requirements. The same formalism yields a quantum folded spectrum method for excited state preparation that avoids explicitly forming powers of the Hamiltonian or performing variational optimization. We provide a theoretical analysis of success probabilities and resource scaling, and we validate the methods numerically using molecular Hamiltonians. The results show that quantum power Lanczos lowers the computational cost and provides robust convergence compared to naive quantum power iteration. Our findings reveal that GQSP-based implementations of power methods combine scalability, flexibility, and robust convergence, paving the way for practical initial state preparations on fault-tolerant quantum devices.

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↗

Experimentally probing entropy reduction via iterative quantum information transfer

Thermodynamic principles governing energy and information are important tools for a deeper understanding and better control of quantum systems. In this work, we experimentally investigate the interplay of the thermodynamic costs and information flow in a quantum system undergoing iterative quantum measurement and feedback. Our study employs a state stabilization protocol involving repeated measurement and feedback on an electronic spin qubit associated with a Silicon-Vacancy center in diamond, which is strongly coupled to a diamond nanocavity. This setup allows us to verify the fundamental laws of nonequilibrium quantum thermodynamics, including the second law and the fluctuation theorem, both of which incorporate measures of quantum information flow induced by iterative measurement and feedback. We further assess the reducible entropy based on the feedback's causal structure and quantitatively demonstrate the thermodynamic advantages of non-Markovian feedback over Markovian feedback. For that purpose, we extend the theoretical framework of quantum thermodynamics to include the causal structure of the applied feedback protocol. Our work lays the foundation for investigating the entropic and energetic costs of real-time quantum control in various quantum systems.

quant-ph↗

Robust Error Accumulation Suppression for Quantum Circuits

We present a \textit{robust error accumulation suppression} (\textbf{REAS}) technique to manage errors in quantum computers. Our method reduces the accumulation of errors in any quantum circuit composed of single- or two-qubit gates expressed as $e^{-i σθ}$ for Pauli operators $σ$ and $θ\in [0,π)$, which forms a universal gate set. For coherent errors -- which include gate overrotation and crosstalk -- we demonstrate a reduction of the error scaling in an $L$-depth circuit from $O(L)$ to $O(\sqrt{L})$. This asymptotic error suppression behavior can be proven in a regime where all gates -- including those constituting the error-suppressing protocol itself -- are noisy. Going beyond coherent errors, we derive the general form of decoherence noise that can be suppressed by REAS. Lastly, we experimentally demonstrate the effectiveness of our approach regarding realistic errors using 100-qubit circuits with up to 64 two-qubit gate layers on IBM Quantum processors.

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↗