arXiv subjects

Kaoru Mizuta

Publications and source records attributed to Kaoru Mizuta.

At least 19 recordsLinked to original sources

arXiv2026

Quantum signal processing in Hilbert space fragmented systems

Quantum signal processing (QSP), originally developed for composite pulse sequences in nuclear magnetic resonance systems, has recently attracted attention as a unified framework for quantum algorithms. A pioneering study applied QSP to nonequilibrium control in integrable many-body systems, enabling the realization of nonequilibrium dynamics with greater flexibility than Floquet engineering. However, extending QSP to nonintegrable systems faces fundamental obstacles arising from the limited number of conserved quantities and thermalization. In this work, we propose a protocol that leverages QSP in systems exhibiting Hilbert space fragmentation (HSF). Specifically, we consider a pair-hopping model with four-fold periodic potentials that exhibits an HSF structure, thereby providing integrable and nonintegrable sectors within a single system. We analytically show that nonequilibrium dynamics can be flexibly designed through QSP engineered by these potentials in the integrable sectors. In contrast, we numerically identify signatures of thermalization in the nonintegrable sectors. Remarkably, by inserting domain walls, we achieve parallel control of multiple quantum dynamics within a single system. This approach sheds light on the control of nonequilibrium dynamics from the perspective of quantum computation by extending the scope of QSP to nonintegrable systems.

quant-ph↗

arXiv2025

On the commutator scaling in Hamiltonian simulation with multi-product formulas

A multi-product formula (MPF) is a promising approach for Hamiltonian simulation efficiently both in the system size $N$ and the inverse allowable error $1/\varepsilon$ by combining Trotterization and the linear combination of unitaries (LCU). It achieves poly-logarithmic cost in $1/\varepsilon$ like LCU [G. H. Low, V. Kliuchnikov, N. Wiebe, arXiv:1907.11679 (2019)]. The efficiency in $N$ is expected to come from the commutator scaling in Trotterization, and this appears to be confirmed by the error bound of MPF expressed by nested commutators [J. Aftab, D. An, K. Trivisa, arXiv:2403.08922 (2024)]. However, we point out that the efficiency of MPF in the system size $N$ is not exactly resolved yet in that the present error bound expressed by nested commutators is incompatible with the size-efficient complexity reflecting the commutator scaling. The problem is that $q$-fold nested commutators with arbitrarily large $q$ are involved in their requirement and error bound. The benefit of commutator scaling by locality is absent, and the cost efficient in $N$ becomes prohibited in general. In this paper, we show an alternative commutator-scaling error of MPF and derive its size-efficient cost properly inheriting the advantage in Trotterization. The requirement and the error bound in our analysis, derived by techniques from the Floquet-Magnus expansion, have a certain truncation order in the nested commutators and can fully exploit the locality. We prove that Hamiltonian simulation by MPF certainly achieves the cost whose system-size dependence is as large as Trotterization while keeping the $\mathrm{polylog}(1/\varepsilon)$-scaling like the LCU. Our results will provide improved or accurate error and cost also for various algorithms using interpolation or extrapolation of Trotterization.

quant-ph↗

arXiv2025

Trotterization is substantially efficient for low-energy states

Trotterization is one of the central approaches for simulating quantum many-body dynamics on quantum computers or tensor networks. In addition to its simple implementation, recent studies have revealed that its error and cost can be reduced if the initial state is closed in the low-energy subspace. However, the improvement by the low-energy property rapidly vanishes as the Trotter order grows in the previous studies, and thus, it is mysterious whether there exists genuine advantage of low-energy initial states. In this Letter, we resolve this problem by proving the optimal error bound and cost of Trotterization for low-energy initial states. For generic local Hamiltonians composed of positive-semidefinite terms, we show that the Trotter error is at most linear in the initial state energy $\Delta$ and polylogarithmic in the system size $N$. As a result, the computational cost becomes substantially small for low-energy states with $\Delta \in o(Ng)$ compared to the one for arbitrary initial states, where $g$ denotes the energy per site and $Ng$ means the whole-system energy. Our error bound and cost of Trotterization achieve the theoretically-best scaling in the initial state energy $\Delta$. In addition, they can be partially extended to weakly-correlated initial states having low-energy expectation values, which are not necessarily closed in the low-energy subspace. Our results will pave the way for fast and accurate simulation of low-energy states, which are one central targets in condensed matter physics and quantum chemistry.

quant-ph↗

arXiv2024

Controlling discrete time crystals via single-site operations in zero-field diamond quantum simulators

Discrete time crystals (DTCs) have emerged as novel nonequilibrium phases of matter that spontaneously break discrete time-translation symmetry in periodically driven systems. Rigorous experimental validation of DTCs, which requires highly controllable quantum simulators, has stimulated extensive research across diverse fields in condensed matter physics and quantum information technologies. Among these advances, DTCs were demonstrated in a hybrid spin register within diamond, comprising a processor spin and surrounding memory spins. However, in conventional strategies involving a bias magnetic field, the field application effectively restricts the controllability of the processor spin. This limitation can be a significant barrier to the next goal of DTCs: achieving multifunctionality through enhanced local controllability. In this study, we theoretically propose multiple DTC protocols through the design of specific single-site control within the entire system. To this end, we consider a concrete model of a diamond-based quantum simulator operating without a bias magnetic field, thereby eliminating the restrictions on the processor spin. Our findings demonstrate that single-site operations enable access to DTCs with multiple distinct features in terms of periodicity and lifetime. Therefore, this approach provides a promising platform for creating diverse DTCs induced by single-site operations.

cond-mat.stat-mech↗

arXiv2024

Comment on "Multivariable quantum signal processing (M-QSP): prophecies of the two-headed oracle"

Multivariable Quantum Signal Processing (M-QSP) [1] is expected to provide an efficient means to handle polynomial transformations of multiple variables simultaneously. However, we noticed several inconsistencies in the main Theorem 2.3 and its proof in Ref. [1]. Moreover, a counterexample for Conjecture 2.1 in Ref. [1], which is used as an assumption in the proof of Theorem 2.3, is presented at Quantum Information Processing 2023 [2], meaning the requirement of the conjecture should be included as a condition in Theorem 2.3. Here we note our observations and propose the revised necessary conditions of M-QSP. We also show that these necessary conditions cannot be sufficient conditions, and thus some additional condition on top of these revisions is essentially required for complete M-QSP Theorem.

quant-ph↗

arXiv2024

Explicit error bounds with commutator scaling for time-dependent product and multi-product formulas

Product formula (PF), which approximates the time evolution under a many-body Hamiltonian by the product of local time evolution operators, is one of the central approaches for simulating quantum dynamics by quantum computers. It has been of great interest whether PFs have a bound of the error from the exact time evolution, which is expressed by commutators among local terms (called commutator scaling), since it brings the substantial suppression of the computational cost in the system size. Although recent studies have revealed the presence and the explicit formulas of the PF error bounds for time-independent systems, those for time-dependent Hamiltonians remain to be a difficult problem except for low-order PFs. In this paper, we derive an explicit error bound of generic PFs for smooth time-dependent Hamiltonians, which is expressed by commutators among local terms and their time derivatives. This error bound can also host the substantial suppression in the system size for generic local Hamiltonians with finite-, short-, and long-ranged interactions, thereby giving a much better estimate of gate counts. Our derivation employs Floquet theory; Embedding generic smooth time-dependent Hamiltonians into time-periodic ones, we map the time-dependent PF error to the time-independent one defined on an infinite-dimensional space. This approach allows to obtain the error bounds not only for the ordinary time-dependent PF but also for its various family. In particular, we also clarify the explicit error bound of a time-dependent multi-product formula, with which we can achieve much smaller error by a linear combination of time-dependent PFs. Our results will shed light on various applications of quantum computers, ranging from quantum simulation of nonequilibrium materials to faster algorithms exploiting time-dependent Hamiltonians like adiabatic state preparation.

quant-ph↗

arXiv2024

Nearly optimal quasienergy estimation and eigenstate preparation of time-periodic Hamiltonians by Sambe space formalism

Time-periodic (Floquet) systems are one of the most interesting nonequilibrium systems. As the computation of energy eigenvalues and eigenstates of time-independent Hamiltonians is a central problem in both classical and quantum computation, quasienergy and Floquet eigenstates are the important targets. However, their computation has difficulty of time dependence; the problem can be mapped to a time-independent eigenvalue problem by the Sambe space formalism, but it instead requires additional infinite dimensional space and seems to yield higher computational cost than the time-independent cases. It is still unclear whether they can be computed with guaranteed accuracy as efficiently as the time-independent cases. We address this issue by rigorously deriving the cutoff of the Sambe space to achieve the desired accuracy and organizing quantum algorithms for computing quasienergy and Floquet eigenstates based on the cutoff. The quantum algorithms return quasienergy and Floquet eigenstates with guaranteed accuracy like Quantum Phase Estimation (QPE), which is the optimal algorithm for outputting energy eigenvalues and eigenstates of time-independent Hamiltonians. While the time periodicity provides the additional dimension for the Sambe space and ramifies the eigenstates, the query complexity of the algorithms achieves the near-optimal scaling in allwable errors. In addition, as a by-product of these algorithms, we also organize a quantum algorithm for Floquet eigenstate preparation, in which a preferred gapped Floquet eigenstate can be deterministically implemented with nearly optimal query complexity in the gap. These results show that, despite the difficulty of time-dependence, quasienergy and Floquet eigenstates can be computed almost as efficiently as time-independent cases, shedding light on the accurate and fast simulation of nonequilibrium systems on quantum computers.

quant-ph↗

arXiv2023

A comprehensive survey on quantum computer usage: How many qubits are employed for what purposes?

Quantum computers (QCs), which work based on the law of quantum mechanics, are expected to be faster than classical computers in several computational tasks such as prime factoring and simulation of quantum many-body systems. In the last decade, research and development of QCs have rapidly advanced. Now hundreds of physical qubits are at our disposal, and one can find several remarkable experiments actually outperforming the classical computer in a specific computational task. On the other hand, it is unclear what the typical usages of the QCs are. Here we conduct an extensive survey on the papers that are posted in the quant-ph section in arXiv and claim to have used QCs in their abstracts. To understand the current situation of the research and development of the QCs, we evaluated the descriptive statistics about the papers, including the number of qubits employed, QPU vendors, application domains and so on. Our survey shows that the annual number of publications is increasing, and the typical number of qubits employed is about six to ten, growing along with the increase in the quantum volume (QV). Most of the preprints are devoted to applications such as quantum machine learning, condensed matter physics, and quantum chemistry, while quantum error correction and quantum noise mitigation use more qubits than the other topics. These imply that the increase in QV is fundamentally relevant, and more experiments for quantum error correction, and noise mitigation using shallow circuits with more qubits will take place.

quant-ph↗

arXiv2023

Recursive Quantum Eigenvalue/Singular-Value Transformation: Analytic Construction of Matrix Sign Function by Newton Iteration

Quantum eigenvalue transformation (QET) and its generalization, quantum singular value transformation (QSVT), are versatile quantum algorithms that allow us to apply broad matrix functions to quantum states, which cover many of significant quantum algorithms such as Hamiltonian simulation. However, finding a parameter set which realizes preferable matrix functions in these techniques is difficult for large-scale quantum systems: there is no analytical result other than trivial cases as far as we know and we often suffer also from numerical instability. We propose recursive QET or QSVT (r-QET or r-QSVT), in which we can execute complicated matrix functions by recursively organizing block-encoding by low-degree QET or QSVT. Owing to the simplicity of recursive relations, it works only with a few parameters with exactly determining the parameters, while its iteration results in complicated matrix functions. In particular, by exploiting the recursive relation of Newton iteration, we construct the matrix sign function, which can be applied for eigenstate filtering for example, in a tractable way. We show that an analytically-obtained parameter set composed of only $8$ different values is sufficient for executing QET of the matrix sign function with an arbitrarily small error $\varepsilon$. Our protocol will serve as an alternative protocol for constructing QET or QSVT for some useful matrix functions without numerical instability.

quant-ph↗

arXiv2023

Optimal Hamiltonian simulation for time-periodic systems

The implementation of time-evolution operators $U(t)$, called Hamiltonian simulation, is one of the most promising usage of quantum computers. For time-independent Hamiltonians, qubitization has recently established efficient realization of time-evolution $U(t)=e^{-iHt}$, with achieving the optimal computational resource both in time $t$ and an allowable error $\varepsilon$. In contrast, those for time-dependent systems require larger cost due to the difficulty of handling time-dependency. In this paper, we establish optimal/nearly-optimal Hamiltonian simulation for generic time-dependent systems with time-periodicity, known as Floquet systems. By using a so-called Floquet-Hilbert space equipped with auxiliary states labeling Fourier indices, we develop a way to certainly obtain the target time-evolved state without relying on either time-ordered product or Dyson-series expansion. Consequently, the query complexity, which measures the cost for implementing the time-evolution, has optimal and nearly-optimal dependency respectively in time $t$ and inverse error $\varepsilon$, and becomes sufficiently close to that of qubitization. Thus, our protocol tells us that, among generic time-dependent systems, time-periodic systems provides a class accessible as efficiently as time-independent systems despite the existence of time-dependency. As we also provide applications to simulation of nonequilibrium phenomena and adiabatic state preparation, our results will shed light on nonequilibrium phenomena in condensed matter physics and quantum chemistry, and quantum tasks yielding time-dependency in quantum computation.

quant-ph↗

arXiv2023

Optimal/Nearly-optimal simulation of multi-periodic time-dependent Hamiltonians

Simulating Hamiltonian dynamics is one of the most fundamental and significant tasks for characterising quantum materials. Recently, a series of quantum algorithms employing block-encoding of Hamiltonians have succeeded in providing efficient simulation of time-evolution operators on quantum computers. While time-independent Hamiltonians can be simulated by the quantum eigenvalue transformation (QET) or quantum singularvalue transformation with the optimal query complexity in time $t$ and desirable accuracy $\varepsilon$, generic time-dependent Hamiltonians face at larger query complexity and more complicated oracles due to the difficulty of handling time-dependency. In this paper, we establish a QET-based approach for simulating time-dependent Hamiltonians with multiple time-periodicity. Such time-dependent Hamiltonians involve a variety of nonequilibrium systems such as time-periodic systems (Floquet systems) and time-quasiperiodic systems. Overcoming the difficulty of time-dependency, our protocol can simulate the dynamics under multi-periodic time-dependent Hamiltonians with optimal/nearly-optimal query complexity both in time $t$ and desirable accuracy $\varepsilon$, and simple oracles as well as the optimal algorithm for time-independent cases.

quant-ph↗

arXiv2022

Local variational quantum compilation of a large-scale Hamiltonian dynamics

Implementing time evolution operators on quantum circuits is important for quantum simulation. However, the standard way, Trotterization, requires a huge numbers of gates to achieve desirable accuracy. Here, we propose a local variational quantum compilation (LVQC) algorithm, which allows to accurately and efficiently compile a time evolution operators on a large-scale quantum system by the optimization with smaller-size quantum systems. LVQC utilizes a subsystem cost function, which approximates the fidelity of the whole circuit, defined for each subsystem as large as approximate causal cones brought by the Lieb-Robinson (LR) bound. We rigorously derive its scaling property with respect to the subsystem size, and show that the optimization conducted on the subsystem size leads to the compilation of whole-system time evolution operators. As a result, LVQC runs with limited-size quantum computers or classical simulators that can handle such smaller quantum systems. For instance, finite-ranged and short-ranged interacting $L$-size systems can be compiled with $O(L^0)$- or $O(\log L)$-size quantum systems depending on observables of interest. Furthermore, since this formalism relies only on the LR bound, it can efficiently construct time evolution operators of various systems in generic dimension involving finite-, short-, and long-ranged interactions. We also numerically demonstrate the LVQC algorithm for one-dimensional systems. Employing classical simulation by time-evolving block decimation, we succeed in compressing the depth of a time evolution operators up to $40$ qubits by the compilation for $20$ qubits. LVQC not only provides classical protocols for designing large-scale quantum circuits, but also will shed light on applications of intermediate-scale quantum devices in implementing algorithms in larger-scale quantum devices.

quant-ph↗

arXiv2022

Deep Variational Quantum Eigensolver: a divide-and-conquer method for solving a larger problem with smaller size quantum computers

We propose a divide-and-conquer method for the quantum-classical hybrid algorithm to solve larger problems with small-scale quantum computers. Specifically, we concatenate a variational quantum eigensolver (VQE) with a reduction in the system dimension, where the interactions between divided subsystems are taken as an effective Hamiltonian expanded by the reduced basis. Then the effective Hamiltonian is further solved by VQE, which we call deep VQE. Deep VQE allows us to apply quantum-classical hybrid algorithms on small-scale quantum computers to large systems with strong intra-subsystem interactions and weak inter-subsystem interactions, or strongly correlated spin models on large regular lattices. As proof-of-principle numerical demonstrations, we use the proposed method for quasi one-dimensional models, including one-dimensionally coupled 12-qubit Heisenberg anti-ferromagnetic models on Kagome lattices as well as two-dimensional Heisenberg anti-ferromagnetic models on square lattices. The largest problem size of 64 qubits is solved by simulating 20-qubit quantum computers with a reasonably good accuracy ~ a few %. The proposed scheme enables us to handle the problems of >1000 qubits by concatenating VQEs with a few tens of qubits. While it is unclear how accurate ground state energy can be obtained for such a large system, our numerical results on a 64-qubit system suggest that deep VQE provides a good approximation (discrepancy within a few percent) and has a room for further improvement. Therefore, deep VQE provides us a promising pathway to solve practically important problems on noisy intermediate-scale quantum computers.

quant-ph↗

arXiv2021

Fate of Topological Edge States in Disordered Periodically-driven Nonlinear Systems

We explore topological edge states in periodically driven nonlinear systems. Based on a self-consistency method adjusted to periodically driven systems, we obtain stationary states associated with topological phases unique to Floquet systems. In addition, we study the linear stability of these edge states and reveal that Floquet stationary edge states experience a sort of transition between two regions I and II, in which lifetimes of these edge states are extremely long and short, respectively. We characterize the transitions in lifetimes by Krein signatures or equivalently the pseudo-Hermiticity breaking, and clarify that the transitions between regions I and II are signified by collisions of edge-dominant eigenstates of Floquet operators for fluctuations. We also analyze the effects of random potentials and clarify that lifetimes of various stationary edge states are equalized due to the randomness-induced mixing of edge- and bulk-dominant eigenstates. This intriguing phenomenon originating from a competition between the nonlinearity and randomness results in that random potentials prolong lifetimes in the region II and vice versa in the region I. These changes of lifetimes induced by nonlinear and/or random effects should be detectable in experiments by preparing initial states akin to the edge states.

nlin.PS↗

arXiv2021

Deep variational quantum eigensolver for excited states and its application to quantum chemistry calculation of periodic materials

A programmable quantum device that has a large number of qubits without fault-tolerance has emerged recently. Variational Quantum Eigensolver (VQE) is one of the most promising ways to utilize the computational power of such devices to solve problems in condensed matter physics and quantum chemistry. As the size of the current quantum devices is still not large for rivaling classical computers at solving practical problems, Fujii et al. proposed a method called "Deep VQE" which can provide the ground state of a given quantum system with the smaller number of qubits by combining the VQE and the technique of coarse-graining [K. Fujii, et al, arXiv:2007.10917]. In this paper, we extend the original proposal of Deep VQE to obtain the excited states and apply it to quantum chemistry calculation of a periodic material, which is one of the most impactful applications of the VQE. We first propose a modified scheme to construct quantum states for coarse-graining in Deep VQE to obtain the excited states. We also present a method to avoid a problem of meaningless eigenvalues in the original Deep VQE without restricting variational quantum states. Finally, we classically simulate our modified Deep VQE for quantum chemistry calculation of a periodic hydrogen chain as a typical periodic material. Our method reproduces the ground-state energy and the first-excited-state energy with the errors up to O(1)% despite the decrease in the number of qubits required for the calculation by two or four compared with the naive VQE. Our result will serve as a beacon for tackling quantum chemistry problems with classically-intractable sizes by smaller quantum devices in the near future.

quant-ph↗

arXiv2021

Breakdown of Markovianity by interactions in stroboscopic Floquet-Lindblad dynamics under high-frequency drive

Floquet-Magnus (FM) expansion theory is a powerful tool in periodically driven (Floquet) systems under high-frequency drives. In closed systems, it dictates that their stroboscopic dynamics under a time-periodic Hamiltonian is well captured by the FM expansion, which gives a static effective Hamiltonian. On the other hand, in dissipative systems driven by a time-periodic Liouvillian, it remains an important and nontrivial problem whether the FM expansion gives a static Liouvillian describing continuous-time Markovian dynamics, which we refer to as the Liouvillianity of the FM expansion. We answer this question for generic systems with local interactions. We find that, while noninteracting systems can either break or preserve Liouvillianity of the FM expansion, generic few-body and many-body interacting systems break it under any finite drive, which is essentially caused by propagation of interactions via higher order terms of the FM expansion. Liouvillianity breaking implies that Markovian dissipative Floquet systems in the high-frequency regimes do not have static (Markovian) counterparts, giving a signature of emergent non-Markovianity. Our theory provides a useful insight for questing unique phenomena in dissipative Floquet systems.

quant-ph↗

arXiv2020

Exact Floquet quantum many-body scars under Rydberg blockade

Quantum many-body scars have attracted much interest as a violation of the eigenstate thermalization hypothesis (ETH) due to recent experimental observation in Rydberg atoms and related theoretical studies. In this paper, we construct a model hosting exact Floquet quantum many-body scars, which violate the Floquet version of ETH. We consider two uniformly-driven static Hamiltonians prohibiting neighboring up spins (Rydberg blockade) like the PXP model, and construct a binary drive composed of them. We show that there exists a four-dimensional subspace which completely avoids thermalization to infinite temperature and that any other states, including some special scar states reported in the static PXP model, are vulnerable to heating and relax to infinite temperature. We also construct a more generalized periodic drive composed of time-dependent PXP-type Hamiltonians showing exact Floquet quantum many-body scars and discuss possible experimental realization of the model in Rydberg atoms.

cond-mat.stat-mech↗

arXiv2019

Floquet engineering of topological phases protected by emergent symmetries under resonant drives

Floquet engineering is one of the most vigorous fields in periodically driven (Floquet) systems, with which we can control phases of matter usually by high-frequency drives. In this paper, with Floquet engineering by a combination of high-frequency drives and resonant drives, we propose a way to realize nontrivial topological phases protected by a $\mathbb{Z}_2 \times \mathbb{Z}_2$ symmetry only in the presence of a $\mathbb{Z}_2$ symmetry, using a robust emergent $\mathbb{Z}_2$ symmetry induced by the resonant drives. Moreover, the symmetry protected topological (SPT) phases are switchable between nontrivial and trivial phases only by the direction of a static transverse field, and even perturbations on the resonant drive can be utilized to realize richer SPT phases. We also discuss the real-time dynamics of the model, and find that which topological phases the system lies in can be distinguished by a period doubling of a nonlocal order parameter, as with discrete time crystals. A realization or a control of nontrivial SPT phases without the required symmetries by resonant drives, proposed in this paper, would shed a new light on the observation of topological phenomena in nonequilibrium setups.

cond-mat.mes-hall↗