arXiv subjects

Yusuke Kimura

Publications and source records attributed to Yusuke Kimura.

At least 19 recordsLinked to original sources

arXiv2026

Database Reordering for Compact Grover Oracles with ESOP Minimization

Grover's algorithm searches for data satisfying a desired condition in an unstructured database. This algorithm can search a space of size $N$ in $\sqrt{N}$ queries, thereby achieving a quadratic speedup. However, within the Grover oracle circuit that is repeatedly applied, the quantum state preparation circuit -- which embeds database information into quantum states -- suffers from a large gate count and circuit depth. To address this problem, we propose reducing the quantum state preparation circuit by reordering the database. Specifically, we consider a Quantum Read-Only Memory (QROM), where data are assigned to addresses, and assume that the address assignment of data can be freely permuted. By applying Exclusive Sum-of-Products (ESOP) minimization to the resulting truth table, we reduce the quantum circuit. Although the resulting circuit logic differs from the original, the state preparation remains correct in the sense that every desired datum is encoded at some address. Furthermore, we propose a proxy metric that estimates circuit size without compilation, and combine it with simulated annealing to efficiently find a near-optimal data ordering. In our experiments, an exhaustive search over all orderings for databases of size $N=8$ reveals that circuit size varies by up to approximately a factor of two depending on the ordering, demonstrating the utility of reordering. Compared with applying ESOP minimization without reordering, simulated annealing reduces the circuit size by approximately 30\% and yields circuits close to optimal. For $N=64$ and $128$, simulated annealing is shown to discover smaller circuits compared with random search.

quant-ph↗

arXiv2026

MAFFT-inspired Quantum Shift-based Sequence Alignment and its Efficient Simulation on Decision Diagrams

Multiple sequence alignment (MSA) is a core operation for comparing genome sequences and is widely used in bio-informatics. MAFFT, a practical MSA tool, repeatedly shifts a pair of sequences and computes a distance. Because the number of sequence pairs grows quadratically with the number of sequences, this procedure can become a bottleneck. We propose Quantum Shift-based Sequence Alignment (QShift-SA), which implements this ``shift-wise score computation'' as a gate-based quantum circuit and searches over shift amounts and sequence pairs using Grover algorithm. QShift-SA constructs an oracle circuit that compute the Hamming distance (the number of mismatches) between two sequences with data encoding, controlled shift, comparison, and addition. This oracle can search for candidates with small distances. QShift-SA does not aim to replace the full MSA workflow; instead, it targets the screening steps that often dominate the runtime in classical MAFFT as stated above. We evaluate circuit resources (number of qubits, gate count, and depth) and benchmark simulation time across multiple quantum circuit simulators. We find that a decision diagram (DD)-based quantum circuit simulator runs more than 1,000$\times$ faster than state-vector and MPS simulators and can handle larger circuits.

quant-ph↗

arXiv2025

Scoring-based Static Variable Ordering for Decision Diagram-based Quantum Circuit Simulation

Decision diagram (DD)-based quantum circuit simulators represent quantum states and gates using DDs, enabling memory-efficient and fast simulations for some quantum circuits like Shor. Although it is known that DD size and processing time vary depending on the variable order in classical circuits, there has not been much research on the variable order under quantum circuit simulation. One existing study pointed out that dynamic reordering worsens the simulation time and numerical accuracy, and there is no comprehensive research on static orders in the context of quantum circuit simulation. Therefore, this paper proposes a scoring-based heuristic method for determining a static variable order that enables efficient DD-based quantum circuit simulation. When applied to benchmark circuits, the default original variable orders resulted in slow simulations, whereas the proposed method achieved speedups of up to 150x. Furthermore, the proposed order completed the simulation of Shor's 1011 factorization in 5 hours on a single-core laptop, although it was not completed within two days previously.

quant-ph↗

arXiv2025

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↗

arXiv2025

Provably Efficient Simulation of 1D Long-Range Interacting Systems at Any Temperature

We introduce a method that ensures efficient computation of one-dimensional quantum systems with long-range interactions across all temperatures. Our algorithm operates within a quasi-polynomial runtime for inverse temperatures up to $β={\rm poly}(\ln(n))$. At the core of our approach is the Density Matrix Renormalization Group algorithm, which typically does not guarantee efficiency. We have created a new truncation scheme for the matrix product operator of the quantum Gibbs states, which allows us to control the error analytically. Additionally, our method can be applied to simulate the time evolution of systems with long-range interactions, achieving significantly better precision than that offered by the Lieb-Robinson bound.

quant-ph↗

arXiv2025

Clustering theorem in 1D long-range interacting systems at arbitrary temperatures

This paper delves into a fundamental aspect of quantum statistical mechanics -- the absence of thermal phase transitions in one-dimensional (1D) systems. Originating from Ising's analysis of the 1D spin chain, this concept has been pivotal in understanding 1D quantum phases, especially those with finite-range interactions as extended by Araki. In this work, we focus on quantum long-range interactions and successfully derive a clustering theorem applicable to a wide range of interaction decays at arbitrary temperatures. This theorem applies to any interaction forms that decay faster than $r^{-2}$ and does not rely on translation invariance or infinite system size assumptions. Also, we rigorously established that the temperature dependence of the correlation length is given by $e^{{\rm const.} β}$, which is the same as the classical cases. Our findings indicate the absence of phase transitions in 1D systems with super-polynomially decaying interactions, thereby expanding upon previous theoretical research. To overcome significant technical challenges originating from the divergence of the imaginary-time Lieb-Robinson bound, we utilize the quantum belief propagation to refine the cluster expansion method. This approach allowed us to address divergence issues effectively and contributed to a deeper understanding of low-temperature behaviors in 1D quantum systems.

quant-ph↗

arXiv2024

Accelerating Decision Diagram-based Multi-node Quantum Simulation with Ring Communication and Automatic SWAP Insertion

An N-bit quantum state requires a vector of length $2^N$, leading to an exponential increase in the required memory with N in conventional statevector-based quantum simulators. A proposed solution to this issue is the decision diagram-based quantum simulator, which can significantly decrease the necessary memory and is expected to operate faster for specific quantum circuits. However, decision diagram-based quantum simulators are not easily parallelizable because data must be manipulated dynamically, and most implementations run on one thread. This paper introduces ring communication-based optimal parallelization and automatic swap insertion techniques for multi-node implementation of decision diagram-based quantum simulators. The ring communication approach is designed so that each node communicates with its neighboring nodes, which can facilitate faster and more parallel communication than broadcasting where one node needs to communicate with all nodes simultaneously. The automatic swap insertion method, an approach to minimize inter-node communication, has been employed in existing multi-node state vector-based simulators, but this paper proposes two methods specifically designed for decision diagram-based quantum simulators. These techniques were implemented and evaluated using the Shor algorithm and random circuits with up to 38 qubits using a maximum of 256 nodes. The experimental results have revealed that multi-node implementation can reduce run-time by up to 26 times. For example, Shor circuits that need 38 qubits can finish simulation in 147 seconds. Additionally, it was shown that ring communication has a higher speed-up effect than broadcast communication, and the importance of selecting the appropriate automatic swap insertion method was revealed.

quant-ph↗

arXiv2024

Viscosity of quark-gluon plasma and gravitons Bose-Einstein condensate

We propose a theoretical model of quark-gluon plasma (QGP) produced at the Brookhaven National Laboratory (BNL) Relativistic Heavy Ion Collider (RHIC). In this model, we hypothesize that the gas of quarks and gluons are confined within the film of gravitons as a Bose-Einstein condensate (BEC) during the production of QGP. The structure of this theoretical model of QGP explains why QGP behaves in a liquid-like manner, resembling a perfect fluid rather than a gas. Based on this theoretical model, we calculated the shear viscosity of QGP. This is essentially the shear viscosity of the BEC film of gravitons. The computational results obtained in this study appear to be consistent with experimental findings.

physics.gen-ph↗

arXiv2023

Parallelizing quantum simulation with decision diagrams

Recent technological advancements show promise in leveraging quantum mechanical phenomena for computation. This brings substantial speed-ups to problems that are once considered to be intractable in the classical world. However, the physical realization of quantum computers is still far away from us, and a majority of research work is done using quantum simulators running on classical computers. Classical computers face a critical obstacle in simulating quantum algorithms. Quantum states reside in a Hilbert space whose size grows exponentially to the number of subsystems, i.e., qubits. As a result, the straightforward statevector approach does not scale due to the exponential growth of the memory requirement. Decision diagrams have gained attention in recent years for representing quantum states and operations in quantum simulations. The main advantage of this approach is its ability to exploit redundancy. However, mainstream quantum simulators still rely on statevectors or tensor networks. We consider the absence of decision diagrams due to the lack of parallelization strategies. This work explores several strategies for parallelizing decision diagram operations, specifically for quantum simulations. We propose optimal parallelization strategies. Based on the experiment results, our parallelization strategy achieves a 2-3 times faster simulation of Grover's algorithm and random circuits than the state-of-the-art single-thread DD-based simulator DDSIM.

quant-ph↗

arXiv2023

Black hole graviton and quantum gravity

Drawing from a thought experiment that we conduct, we propose that a virtual graviton gives rise to a black hole geometry when its momentum surpasses a certain threshold value on the Planck scale. This hypothesis implies that the propagator of a virtual graviton, that possesses momentum surpassing this threshold, vanishes. Consequently, a Feynman diagram containing this type of graviton propagator does not add to the overall amplitude. This mechanism suggests the feasibility of formulating an ultraviolet-finite four-dimensional quantum gravitational theory. The elementary particles including the gravitons are treated as point particles in this formulation.

hep-th↗

arXiv2023

Eight-dimensional non-geometric heterotic strings and enhanced gauge groups

We review the construction of eight-dimensional (8D) non-geometric heterotic strings, proposed by Malmendier and Morrison, which do not allow for a geometric interpretation. In the construction, the $\mathfrak{e}_8\oplus \mathfrak{e}_7$ gauge algebra is unbroken. The moduli space of 8D non-geometric heterotic strings and theories arising in the moduli space can be analyzed by studying the geometries of elliptically fibered K3 surfaces with a global section by applying F-theory/heterotic duality. Additionally, we review the results of the points in the 8D non-geometric heterotic moduli with the unbroken $\mathfrak{e}_8\oplus \mathfrak{e}_7$ gauge algebra, at which the non-Abelian gauge groups are maximally enhanced. At these points, the gauge groups formed in the theories do not allow for a perturbative interpretation of the heterotic perspective. However, from the dual F-theory perspective, the K3 geometries at these points are deformations of the stable degenerations that arise from the coincident 7-branes. On the heterotic side, these enhancements can be understood as a non-perturbative effect of 5-brane insertions.

hep-th↗

arXiv2023

Convergence condition of simulated quantum annealing with a non-stoquastic catalyst

The Ising model with a transverse field and an antiferromagnetic transverse interaction is represented as a matrix in the computational basis with non-zero off-diagonal elements with both positive and negative signs and thus may be regarded to be non-stoquastic. We show that the local Boltzmann factors of such a system under an appropriate Suzuki-Trotter representation can be chosen non-negative and thus may potentially be simulated classically without a sign problem if the parameter values are limited to a subspace of the whole parameter space. We then derive conditions for parameters to satisfy asymptotically in order that simulated quantum annealing of this system converges to thermal equilibrium in the long-time limit.

quant-ph↗

arXiv2022

Convergence condition of simulated quantum annealing for closed and open systems

Simulated quantum annealing is a generic classical protocol to simulate some aspects of quantum annealing and is sometimes regarded as a classical alternative to quantum annealing in finding the ground state of a classical Ising model. We derive a generic condition for simulated quantum annealing to converge to thermal equilibrium at a given, typically low, temperature. Both closed and open systems are treated. We rewrite the classical master equation for simulated quantum annealing into an imaginary-time Schrödinger equation, to which we apply the imaginary-time variant of asymptotic adiabatic condition to deduce the convergence condition. The result agrees qualitatively with a rigorous convergence condition of simulated quantum annealing for closed systems, which was derived from the theory of inhomogeneous Markov process. Also observed is qualitative agreement with a rigorous convergence condition of quantum annealing for closed systems under the real-time Schrödinger dynamics. This coincidence of convergence conditions for classical stochastic processes for simulated quantum annealing and the real-time quantum dynamics for quantum annealing is highly non-trivial and calls for further scrutiny.

quant-ph↗

arXiv2022

Four-dimensional $\mathcal{N}=1$ SCFTs on S-folds with T-branes and AdS/CFT correspondence

We study AdS duals of four-dimensional (4D) $\mathcal{N}=1$ superconformal field theories (SCFTs) on $\mathbb{Z}_k$ S-folds with T-branes that flow to 4D $\mathcal{N}=3$ theories. In a previous study, it was discussed how considering T-brane structure breaks the $\mathcal{N}=2$ supersymmetry in 4D SCFTs on $\mathbb{Z}_k$ S-folds down to $\mathcal{N}=1$. In this study, we analyze this effect from the AdS perspective. We also discuss the constructions of 4D $\mathcal{N}=1$ SCFTs on S-folds with T-branes starting from global K3 hypersurfaces whose fibers involve complex multiplications. We choose an approach to directly analyze the global K3 geometry without relying on the standard Weierstrass technique.

hep-th↗

arXiv2022

Rigorous convergence condition for quantum annealing

We derive a generic bound on the rate of decrease of transverse field for quantum annealing to converge to the ground state of a generic Ising model when quantum annealing is formulated as an infinite-time process. Our theorem is based on a rigorous upper bound on the excitation probability in the infinite-time limit and is a mathematically rigorous counterpart of a previously known result derived only from the leading-order term of the asymptotic expansion of adiabatic condition. Since our theorem gives a sufficient condition of convergence for a generic transverse-field Ising model, any specific problem may allow a better, faster, control of the coefficient.

quant-ph↗

arXiv2022

Path integrals in JT gravity and Virasoro constraints

We examine the large-$g$ asymptotic Weil-Petersson volume formulas deduced in the previous literature. The volume formulas have application to computing the partition functions and the correlation functions in Jackiw-Teitelboim gravity. We utilize two approaches to assess the validity of the formulas. The first approach is to examine the asymptotic volume formulas from the perspective of the Witten conjecture. If the volume formulas are correct, the generating function of the intersection indices deduced from the asymptotic volume formulas would satisfy constraints that are analogous to the Virasoro constraints. We confirmed that the intersection indices computed from the large-$g$ asymptotic volume formulas satisfy variants of the string and dilaton equations. This implies that the generating function of the intersection indices deduced from the asymptotic volume formulas indeed satisfies constraints analogous to first two of the Virasoro constraints. As another approach, we also examined the asymptotic volume formulas by studying the behavior of the higher-order spectral form factors. Our analyses suggest that the large-$g$ asymptotic Weil-Petersson volume formulas yield plausible estimations.

hep-th↗

arXiv2022

Jacobian Calabi-Yau 3-fold and charge completeness in six-dimensional theory

We study aspects of an equivalent relation of the charge completeness in six-dimensional (6D) $\mathcal{N}=(1,0)$ supergravity theory and a standard assumption on the global structure of the gauge group involving F-theory geometry, recently proved by Morrison and Taylor. We constructed and analyzed a novel 6D supergravity theory, realized as F-theory, on an elliptically fibered Calabi-Yau 3-fold. Our construction yields a novel 6D theory with Mordell-Weil torsion $\mathbb{Z}_4\oplus\mathbb{Z}_4$. Furthermore, we deduce the gauge group and matter fields arising in the 6D F-theory model on the constructed elliptically fibered Calabi-Yau 3-fold. We also discuss the relations of the 6D F-theory model constructed in this study to stable degeneration and the dual heterotic string.

hep-th↗

arXiv2021

Q&A MAESTRO: Q&A Post Recommendation for Fixing Java Runtime Exceptions

Programmers often use Q&A sites (e.g., Stack Overflow) to understand a root cause of program bugs. Runtime exceptions is one of such important class of bugs that is actively discussed on Stack Overflow. However, it may be difficult for beginner programmers to come up with appropriate keywords for search. Moreover, they need to switch their attentions between IDE and browser, and it is time-consuming. To overcome these difficulties, we proposed a method, ``Q&A MAESTRO'', to find suitable Q&A posts automatically for Java runtime exception by utilizing structure information of codes described in programming Q&A website. In this paper, we describe a usage scenario of IDE-plugin, the architecture and user interface of the implementation, and results of user studies. A video is available at https://youtu.be/4X24jJrMUVw. A demo software is available at https://github.com/FujitsuLaboratories/Q-A-MAESTRO.

cs.SE↗