arXiv subjects

Keisuke Fujii

Publications and source records attributed to Keisuke Fujii.

At least 199 records · Page 11Linked to original sources

arXiv2022

Computational power of one- and two-dimensional dual-unitary quantum circuits

Quantum circuits that are classically simulatable tell us when quantum computation becomes less powerful than or equivalent to classical computation. Such classically simulatable circuits are of importance because they illustrate what makes universal quantum computation different from classical computers. In this work, we propose a novel family of classically simulatable circuits by making use of dual-unitary quantum circuits (DUQCs), which have been recently investigated as exactly solvable models of non-equilibrium physics, and we characterize their computational power. Specifically, we investigate the computational complexity of the problem of calculating local expectation values and the sampling problem of one-dimensional DUQCs, and we generalize them to two spatial dimensions. We reveal that a local expectation value of a DUQC is classically simulatable at an early time, which is linear in a system length. In contrast, in a late time, they can perform universal quantum computation, and the problem becomes a BQP-complete problem. Moreover, classical simulation of sampling from a DUQC turns out to be hard.

quant-ph↗

arXiv2021

How does AI play football? An analysis of RL and real-world football strategies

Recent advances in reinforcement learning (RL) have made it possible to develop sophisticated agents that excel in a wide range of applications. Simulations using such agents can provide valuable information in scenarios that are difficult to scientifically experiment in the real world. In this paper, we examine the play-style characteristics of football RL agents and uncover how strategies may develop during training. The learnt strategies are then compared with those of real football players. We explore what can be learnt from the use of simulated environments by using aggregated statistics and social network analysis (SNA). As a result, we found that (1) there are strong correlations between the competitiveness of an agent and various SNA metrics and (2) aspects of the RL agents play style become similar to real world footballers as the agent becomes more competitive. We discuss further advances that may be necessary to improve our understanding necessary to fully utilise RL for the analysis of football.

cs.AI↗

arXiv2021

Sampling-based quasiprobability simulation for fault-tolerant quantum error correction on the surface codes under coherent noise

We propose a sampling-based simulation for fault-tolerant quantum error correction under coherent noise. A mixture of incoherent and coherent noise, possibly due to over-rotation, is decomposed into Clifford channels with a quasiprobability distribution. Then, an unbiased estimator of the logical error probability is constructed by sampling Clifford channels with an appropriate postprocessing. We characterize the sampling cost via the channel robustness and find that the proposed sampling-based method is feasible even for planar surface codes with relatively large code distances intractable for full state-vector simulations. As a demonstration, we simulate repetitive faulty syndrome measurements on the planar surface code of distance 5 with 81 qubits. We find that the coherent error increases the logical error rate. This is a practical application of the quasiprobability simulation for a meaningful task and would be useful to explore experimental quantum error correction on the near-term quantum devices.

quant-ph↗

arXiv2021

Stable Energy Distribution of Weakly Dissipative Gasses under Collisional Energy Cascades

Collisional thermalization of a particle ensemble under the energy dissipation can be seen in variety of systems, such as heated granular gasses and particles in plasmas. Despite its universal existence, analytical descriptions of the steady-state distribution have been missing. Here, we show that the steady-state energy distribution of the wide class of collisional energy cascades can be well approximated by the generalized Mittag-Leffler distribution, which is one of stable distributions. This distribution has a power-law tail, as similar to Levy's stable distribution, the index of which is related to the energy dissipation rate. We demonstrate its universality by comparing Mont-Carlo simulations of dissipative gasses as well as the spectroscopic observation of the atom velocity distribution in a low-temperature plasma.

physics.plasm-ph↗

arXiv2021

Learning interaction rules from multi-animal trajectories via augmented behavioral models

Extracting the interaction rules of biological agents from movement sequences pose challenges in various domains. Granger causality is a practical framework for analyzing the interactions from observed time-series data; however, this framework ignores the structures and assumptions of the generative process in animal behaviors, which may lead to interpretational problems and sometimes erroneous assessments of causality. In this paper, we propose a new framework for learning Granger causality from multi-animal trajectories via augmented theory-based behavioral models with interpretable data-driven models. We adopt an approach for augmenting incomplete multi-agent behavioral models described by time-varying dynamical systems with neural networks. For efficient and interpretable learning, our model leverages theory-based architectures separating navigation and motion processes, and the theory-guided regularization for reliable behavioral modeling. This can provide interpretable signs of Granger-causal effects over time, i.e., when specific others cause the approach or separation. In experiments using synthetic datasets, our method achieved better performance than various baselines. We then analyzed multi-animal datasets of mice, flies, birds, and bats, which verified our method and obtained novel biological insights.

cs.LG↗

arXiv2021

Quantum error mitigation as a universal error-minimization technique: applications from NISQ to FTQC eras

In the early years of fault-tolerant quantum computing (FTQC), it is expected that the available code distance and the number of magic states will be restricted due to the limited scalability of quantum devices and the insufficient computational power of classical decoding units. Here, we integrate quantum error correction and quantum error mitigation into an efficient FTQC architecture that effectively increases the code distance and $T$-gate count at the cost of constant sampling overheads in a wide range of quantum computing regimes. For example, while we need $10^4$ to $10^{10}$ logical operations for demonstrating quantum advantages from optimistic and pessimistic points of view, we show that we can reduce the required number of physical qubits by $80\%$ and $45\%$ in each regime. From another perspective, when the achievable code distance is up to about 11, our scheme allows executing $10^3$ times more logical operations. This scheme will dramatically alleviate the required computational overheads and hasten the arrival of the FTQC era.

quant-ph↗

arXiv2021

Qulacs: a fast and versatile quantum circuit simulator for research purpose

To explore the possibilities of a near-term intermediate-scale quantum algorithm and long-term fault-tolerant quantum computing, a fast and versatile quantum circuit simulator is needed. Here, we introduce Qulacs, a fast simulator for quantum circuits intended for research purpose. We show the main concepts of Qulacs, explain how to use its features via examples, describe numerical techniques to speed-up simulation, and demonstrate its performance with numerical benchmarks.

quant-ph↗

arXiv2021

Variational Quantum Algorithms

Applications such as simulating complicated quantum systems or solving large-scale linear algebra problems are very challenging for classical computers due to the extremely high computational cost. Quantum computers promise a solution, although fault-tolerant quantum computers will likely not be available in the near future. Current quantum devices have serious constraints, including limited numbers of qubits and noise processes that limit circuit depth. Variational Quantum Algorithms (VQAs), which use a classical optimizer to train a parametrized quantum circuit, have emerged as a leading strategy to address these constraints. VQAs have now been proposed for essentially all applications that researchers have envisioned for quantum computers, and they appear to the best hope for obtaining quantum advantage. Nevertheless, challenges remain including the trainability, accuracy, and efficiency of VQAs. Here we overview the field of VQAs, discuss strategies to overcome their challenges, and highlight the exciting prospects for using them to obtain quantum advantage.

quant-ph↗

arXiv2021

Comparative Study of Sampling-Based Simulation Costs of Noisy Quantum Circuits

Noise in quantum operations often negates the advantage of quantum computation. However, most classical simulations of quantum computers calculate the ideal probability amplitudes either storing full state vectors or using sophisticated tensor network contractions. Here, we investigate sampling-based classical simulation methods for noisy quantum circuits. Specifically, we characterize the simulation costs of two major schemes, stabilizer-state sampling of magic states and Heisenberg propagation, for quantum circuits being subject to stochastic Pauli noise, such as depolarizing and dephasing noise. To this end, we introduce several techniques for the stabilizer-state sampling to reduce the simulation costs under such noise. It revealed that in the low noise regime, stabilizer-state sampling results in a smaller sampling cost, while Heisenberg propagation is better in the high noise regime. Furthermore, for a high depolarizing noise rate $\sim 10\%$, these methods provide better scaling compared to that given by the low-rank stabilizer decomposition. We believe that these knowledge of classical simulation costs is useful to squeeze possible quantum advantage on near-term noisy quantum devices as well as efficient classical simulation methods.

quant-ph↗

arXiv2021

Comprehensive Laboratory Measurements Resolving the LMM Dielectronic Recombination Satellite Lines in Ne-like Fe XVII Ions

We investigated experimentally and theoretically dielectronic recombination (DR) populating doubly excited configurations $3l3l'$ (LMM) in Fe XVII, the strongest channel for soft X-ray line formation in this ubiquitous species. We used two different electron beam ion traps and two complementary measurement schemes for preparing the Fe XVII samples and evaluating their purity, observing negligible contamination effects. This allowed us to diagnose the electron density in both EBITs. We compared our experimental resonant energies and strengths with those of previous independent work at a storage ring as well as those of configuration interaction, multiconfiguration Dirac-Fock calculations, and many-body perturbation theory. This last approach showed outstanding predictive power in the comparison with the combined independent experimental results. From these we also inferred DR rate coefficients, unveiling discrepancies from those compiled in the OPEN-ADAS and AtomDB databases.

physics.atom-ph↗

arXiv2021

Microscopic derivation of the Boltzmann equation for transport coefficients of resonating fermions at high temperature

Motivated by the recently observed failure of the kinetic theory for the bulk viscosity, we in turn revisit the shear viscosity and the thermal conductivity of two-component fermions with a zero-range interaction both in two and three dimensions. In particular, we show that their Kubo formula evaluated exactly in the high-temperature limit to the lowest order in fugacity is reduced to the linearized Boltzmann equation. Previously, such a microscopic derivation of the latter was achieved only incompletely corresponding to the relaxation-time approximation. Here, we complete it by resuming all contributions that are naively higher orders in fugacity but become comparable in the zero-frequency limit due to the pinch singularity, leading to a self-consistent equation for a vertex function identical to the linearized Boltzmann equation. We then compute the shear viscosity and the thermal conductivity in the high-temperature limit for an arbitrary scattering length and find that the Prandtl number exhibits a nonmonotonic behavior slightly below the constant value in the relaxation-time approximation.

cond-mat.quant-gas↗

arXiv2021

Supervised sequential pattern mining of event sequences in sport to identify important patterns of play: an application to rugby union

Given a set of sequences comprised of time-ordered events, sequential pattern mining is useful to identify frequent subsequences from different sequences or within the same sequence. However, in sport, these techniques cannot determine the importance of particular patterns of play to good or bad outcomes, which is often of greater interest to coaches and performance analysts. In this study, we apply a recently proposed supervised sequential pattern mining algorithm called safe pattern pruning (SPP) to 490 labelled event sequences representing passages of play from one rugby team's matches from the 2018 Japan Top League. We compare the SPP-obtained patterns that are the most discriminative between scoring and non-scoring outcomes from both the team's and opposition teams' perspectives, with the most frequent patterns obtained with well-known unsupervised sequential pattern mining algorithms when applied to subsets of the original dataset, split on the label. Our obtained results found that linebreaks, successful lineouts, regained kicks in play, repeated phase-breakdown play, and failed exit plays by the opposition team were identified as as the patterns that discriminated most between the team scoring and not scoring. Opposition team linebreaks, errors made by the team, opposition team lineouts, and repeated phase-breakdown play by the opposition team were identified as the patterns that discriminated most between the opposition team scoring and not scoring. It was also found that, by virtue of its supervised nature as well as its pruning and safe-screening properties, SPP obtained a greater variety of generally more sophisticated patterns than the unsupervised models, which are likely to be of more utility to coaches and performance analysts.

cs.LG↗

arXiv2021

Measurement of the Higgs boson mass and $e^+e^- \to ZH$ cross section using $Z \to μ^+μ^-$ and $Z \to e^+ e^-$ at the ILC

This paper presents a full simulation study of the measurement of the production cross section ($σ_{\mathrm{ZH}}$) of the Higgsstrahlung process $\mathrm{e^{+}e^{-}\rightarrow ZH}$ and the Higgs boson mass ($M_{\mathrm{H}}$) at the International Linear Collider (ILC), using events in which a Higgs boson recoils against a Z boson decaying into a pair of muons or electrons. The analysis is carried out for three center-of-mass energies $\sqrt{s}$ = 250, 350, and 500 GeV, and two beam polarizations $\mathrm{e_{L}^{-}e_{R}^{+}}$ and $\mathrm{e_{R}^{-}e_{L}^{+}}$, for which the polarizations of $\mathrm{e^{-}}$ and $\mathrm{e^{+}}$ are $\left(P\mathrm{e^{-}},P\mathrm{e^{+}}\right)$ =($-$80\%, +30\%) and (+80\%, $-$30\%), respectively. Assuming an integrated luminosity of 250 $\mathrm{fb^{-1}}$ for each beam polarization at $\sqrt{s}$ = 250 GeV, where the best lepton momentum resolution is obtainable, $σ_{\mathrm{ZH}}$ and $M_{\mathrm{H}}$ can be determined with a precision of 2.5\% and 37 MeV for $\mathrm{e_{L}^{-}e_{R}^{+}}$ and 2.9\% and 41 MeV for $\mathrm{e_{R}^{-}e_{L}^{+}}$, respectively. Regarding a 20 year ILC physics program, the expected precisions for the $\mathrm{HZZ}$ coupling and $M_{\mathrm{H}}$ are estimated to be 0.4\% and 14 MeV, respectively. The event selection is designed to optimize the precisions of $σ_{\mathrm{ZH}}$ and $M_{\mathrm{H}}$ while minimizing the bias on the measured $σ_{\mathrm{ZH}}$ due to discrepancy in signal efficiencies among Higgs decay modes. For the first time, model independence has been demonstrated to a sub-percent level for the $σ_{\mathrm{ZH}}$ measurement at each of the three center-of-mass energies. The results presented show the impact of center-of-mass energy and beam polarization on the evaluated precisons and serve as a benchmark for the planning of the ILC run scenario.

hep-ex↗

arXiv2021

Data-driven Analysis for Understanding Team Sports Behaviors

Understanding the principles of real-world biological multi-agent behaviors is a current challenge in various scientific and engineering fields. The rules regarding the real-world biological multi-agent behaviors such as team sports are often largely unknown due to their inherently higher-order interactions, cognition, and body dynamics. Estimation of the rules from data, i.e., data-driven approaches such as machine learning, provides an effective way for the analysis of such behaviors. Although most data-driven models have non-linear structures and high prediction performances, it is sometimes hard to interpret them. This survey focuses on data-driven analysis for quantitative understanding of invasion team sports behaviors such as basketball and football, and introduces two main approaches for understanding such multi-agent behaviors: (1) extracting easily interpretable features or rules from data and (2) generating and controlling behaviors in visually-understandable ways. The first approach involves the visualization of learned representations and the extraction of mathematical structures behind the behaviors. The second approach can be used to test hypotheses by simulating and controlling future and counterfactual behaviors. Lastly, the potential practical applications of extracted rules, features, and generated behaviors are discussed. These approaches can contribute to a better understanding of multi-agent behaviors in the real world.

cs.AI↗

arXiv2021

Discriminant Dynamic Mode Decomposition for Labeled Spatio-Temporal Data Collections

Extracting coherent patterns is one of the standard approaches towards understanding spatio-temporal data. Dynamic mode decomposition (DMD) is a powerful tool for extracting coherent patterns, but the original DMD and most of its variants do not consider label information, which is often available as side information of spatio-temporal data. In this work, we propose a new method for extracting distinctive coherent patterns from labeled spatio-temporal data collections, such that they contribute to major differences in a labeled set of dynamics. We achieve such pattern extraction by incorporating discriminant analysis into DMD. To this end, we define a kernel function on subspaces spanned by sets of dynamic modes and develop an objective to take both reconstruction goodness as DMD and class-separation goodness as discriminant analysis into account. We illustrate our method using a synthetic dataset and several real-world datasets. The proposed method can be a useful tool for exploratory data analysis for understanding spatio-temporal data.

cs.LG↗

arXiv2021

Overhead for simulating a non-local channel with local channels by quasiprobability sampling

As the hardware technology for quantum computing advances, its possible applications are actively searched and developed. However, such applications still suffer from the noise on quantum devices, in particular when using two-qubit gates whose fidelity is relatively low. One way to overcome this difficulty is to substitute such non-local operations by local ones. Such substitution can be performed by decomposing a non-local channel into a linear combination of local channels and simulating the original channel with a quasiprobability-based method. In this work, we first define a quantity that we call channel robustness of non-locality, which quantifies the cost for the decomposition. While this quantity is challenging to calculate for a general non-local channel, we give an upper bound for a general two-qubit unitary channel by providing an explicit decomposition. The decomposition is obtained by generalizing our previous work whose application has been restricted to a certain form of two-qubit unitary. This work develops a framework for a resource reduction suitable for first-generation quantum devices.

quant-ph↗

arXiv2021

ILC Study Questions for Snowmass 2021

To aid contributions to the Snowmass 2021 US Community Study on physics at the International Linear Collider and other proposed $e^+e^-$ colliders, we present a list of study questions that could be the basis of useful Snowmass projects. We accompany this with links to references and resources on $e^+e^-$ physics, and a description of a new software framework that we are preparing for $e^+e^-$ studies at Snowmass.

hep-ph↗

arXiv2021

Constructing a virtual two-qubit gate by sampling single-qubit operations

We show a certain kind of non-local operations can be simulated by sampling a set of local operations with a quasi-probability distribution when the task of a quantum circuit is to evaluate an expectation value of observables. Utilizing the result, we describe a strategy to decompose a two-qubit gate to a sequence of single-qubit operations. Required operations are projective measurement of a qubit in Pauli basis, and $π/2$ rotation around x, y, and z axes. The required number of sampling to get an expectation value of a target observable within an error of $ε$ is roughly $O(9^k/ε^2)$, where $k$ is the number of "cuts" performed. The proposed technique enables to perform "virtual" gates between a distant pair of qubits, where there is no direct interaction and thus a number of swap gates are inevitable otherwise. It can also be utilized to improve the simulation of a large quantum computer with a small-sized quantum device, which is an idea put forward by [Peng, et al., arXiv:1904.00102]. This work can enhance the connectivity of qubits on near-term, noisy quantum computers.

quant-ph↗