Search

There exist metastable domain walls of the flavor-singlet meson $\eta$ for the ${\rm U}(1)$ axial symmetry in two-flavor color superconductivity (2SC) in QCD at large baryon density. We show that, due to the coupling of $\eta$ to confined ${\rm SU}(2)$ gluons in the 2SC phase, the effective theory on the domain wall is described by the ${\rm SU}(2)_{-1}$ Chern-Simons theory, which is dual to the ${\rm U}(1)_{2}$ Chern-Simons theory. This theory has a spin-1 droplet excitation that does not carry baryon number, which we identify as a vector meson. We also discuss the effective theories and baryonic droplet excitations on the domain walls of the flavor-singlet mesons in the superfluid phases of QCD at large isospin density and two-color QCD at large baryon density., Comment: 13 pages

Cathodoluminescence (CL), the emission of light induced by accelerated free electrons, has been extensively utilized in various applications, such as displays, streak cameras, and high-spatial-resolution analysis of optical material, surpassing the diffraction limit of light. Despite its long history, the photon statistics of CL have only recently been examined, revealing unexpectedly large bunching of photons. Here we find that this peculiar photon bunching contains information of intervening excitation processes before the photon emission, which can be extracted from the photon statistics within each excitation event by a single free electron. Using this approach, we experimentally unveiled the statistical differences of coherent CL involving a single electromagnetic interaction process and incoherent CL involving multiple excitation processes. The developed formulation is universally applicable for particle generation processes in general to investigate the nature of cascade reactions.

We develop an energy calculation algorithm leveraging quantum phase difference estimation (QPDE) scheme and a tensor-network-based unitary compression method in the preparation of superposition states and time-evolution gates. Alongside its efficient implementation, this algorithm reduces depolarization noise affections exponentially. We demonstrated energy gap calculations for one-dimensional Hubbard models on IBM superconducting devices using circuits up to 32-system (plus one-ancilla) qubits, a five-fold increase over previous QPE demonstrations, at the 7242 controlled-Z gate level of standard transpilation, utilizing a Q-CTRL error suppression module. Additionally, we propose a technique towards molecular executions using spatial orbital localization and index sorting, verified by a 13- (17-)qubit hexatriene (octatetraene) simulation. Since QPDE can handle the same objectives as QPE, our algorithm represents a leap forward in quantum computing on real devices., Comment: 25 pages

Partial differential equations (PDEs) are crucial for modeling various physical phenomena such as heat transfer, fluid flow, and electromagnetic waves. In computer-aided engineering (CAE), the ability to handle fine resolutions and large computational models is essential for improving product performance and reducing development costs. However, solving large-scale PDEs, particularly for systems with spatially varying material properties, poses significant computational challenges. In this paper, we propose a quantum algorithm for solving second-order linear PDEs of non-conservative systems with spatially varying parameters, using the linear combination of Hamiltonian simulation (LCHS) method. Our approach transforms those PDEs into ordinary differential equations represented by qubit operators, through spatial discretization using the finite difference method. Then, we provide an algorithm that efficiently constructs the operator corresponding to the spatially varying parameters of PDEs via a logic minimization technique, which reduces the number of terms and subsequently the circuit depth. We also develop a scalable method for realizing a quantum circuit for LCHS, using a tensor-network-based technique, specifically a matrix product state (MPS). We validate our method with applications to the acoustic equation with spatially varying parameters and the dissipative heat equation. Our approach includes a detailed recipe for constructing quantum circuits for PDEs, leveraging efficient encoding of spatially varying parameters of PDEs and scalable implementation of LCHS, which we believe marks a significant step towards advancing quantum computing's role in solving practical engineering problems., Comment: 21 pages, 5 figures

Quantum reservoir computing (QRC) is a highly promising computational paradigm that leverages quantum systems as a computational resource for nonlinear information processing. While its application to time-series analysis is eagerly anticipated, prevailing approaches suffer from the collapse of the quantum state upon measurement, resulting in the erasure of temporal input memories. Neither repeated initializations nor weak measurements offer a fundamental solution, as the former escalates the time complexity while the latter restricts the information extraction from the Hilbert space. To address this issue, we propose the feedback-driven QRC framework. This methodology employs projective measurements on all qubits for unrestricted access to the quantum state, with the measurement outcomes subsequently fed back into the reservoir to restore the memory of prior inputs. We demonstrate that our QRC successfully acquires the fading-memory property through the feedback connections, a critical element in time-series processing. Notably, analysis of measurement trajectories reveal three distinct phases depending on the feedback strength, with the memory performance maximized at the edge of chaos. We also evaluate the predictive capabilities of our QRC, demonstrating its suitability for forecasting signals originating from quantum spin systems., Comment: 15 pages, 10 figures

Stochastic gradient descent (SGD) is a frequently used optimization technique in classical machine learning and Variational Quantum Eigensolver (VQE). For the implementation of VQE on quantum hardware, the results are always affected by measurement shot noise. However, there are many unknowns about the structure and properties of the measurement noise in VQE and how it contributes to the optimization. In this work, we analyze the effect of measurement noise to the optimization dynamics. Especially, we focus on escaping from saddle points in the loss landscape, which is crucial in the minimization of the non-convex loss function. We find that the escape time (1) decreases as the measurement noise increases in a power-law fashion and (2) is expressed as a function of $\eta/N_s$ where $\eta$ is the learning rate and $N_s$ is the number of measurements. The latter means that the escape time is approximately constant when we vary $\eta$ and $N_s$ with the ratio $\eta/N_s$ held fixed. This scaling behavior is well explained by the stochastic differential equation (SDE) that is obtained by the continuous-time approximation of the discrete-time SGD. According to the SDE, $\eta/N_s$ is interpreted as the variance of measurement shot noise. This result tells us that we can learn about the optimization dynamics in VQE from the analysis based on the continuous-time SDE, which is theoretically simpler than the original discrete-time SGD., Comment: 10pages, 8figures

In quantum mechanics, measuring the expectation value of a general observable has an inherent statistical uncertainty that is quantified by variance or mean squared error of measurement outcome. While the uncertainty can be reduced by averaging several samples, the number of samples should be minimized when each sample is very costly. This is especially the case for fault-tolerant quantum computing that involves measurement of multiple observables of non-trivial states in large quantum systems that exceed the capabilities of classical computers. In this work, we provide an adaptive quantum algorithm for estimating the expectation values of $M$ general observables within root mean squared error $\varepsilon$ simultaneously, using $\mathcal{O}(\varepsilon^{-1}\sqrt{M}\log M)$ queries to a state preparation oracle of a target state. This remarkably achieves the scaling of Heisenberg limit $1/\varepsilon$, a fundamental bound on the estimation precision in terms of mean squared error, together with the sublinear scaling of the number of observables $M$. The proposed method is an adaptive version of the quantum gradient estimation algorithm and has a resource-efficient implementation due to its adaptiveness. Specifically, the space overhead in the proposed method is $\mathcal{O}(M)$ which is independent from the estimation precision $\varepsilon$ unlike non-iterative algorithms. In addition, our method can avoid the numerical instability problem for constructing quantum circuits in a large-scale task (e.g., $\varepsilon\ll 1$ in our case), which appears in the actual implementation of many algorithms relying on quantum signal processing techniques. Our method paves a new way to precisely understand and predict various physical properties in complicated quantum systems using quantum computers.

In quantum computation, amplitude estimation is a fundamental subroutine that is utilized in various quantum algorithms. A general important task of such estimation problems is to characterize the estimation lower bound, which is referred to as quantum Cram\'er-Rao bound (QCRB), and to construct an optimal estimator that achieves QCRB. This paper studies the amplitude estimation in the presence of depolarizing noise with unknown intensity. The main difficulty in this problem is that the optimal measurement depends on both the unknown quantum state and the amplitude we aim to estimate. To deal with these issues, we utilize the variational quantum circuits to approximate the (unknown) optimal measurement basis combined with the 2-step adaptive estimation strategy which was proposed in the quantum estimation theory.We numerically show that the proposed method can nearly attain the QCRB., Comment: 14 pages, 7 figures

Dynamical response functions are fundamental quantities to describe the excited-state properties in quantum many-body systems. Quantum algorithms have been proposed to evaluate these quantities by means of quantum phase estimation (QPE), where the energy spectra are directly extracted from the QPE measurement outcomes in the frequency domain. Accurate estimation of excitation energies and transition probabilities with these QPE-based approaches is, however, challenging because of the problem of spectral leakage (or peak broadening) which is inherent in the QPE algorithm. To overcome this issue, in this work we consider an extension of the QPE-based approach adopting the optimal entangled input states, which is known to achieve the Heisenberg-limited scaling for the estimation precision. We show that with this method the peaks in the calculated energy spectra are more localized than those calculated by the original QPE-based approaches, suggesting the mitigation of the spectral leakage problem. By analyzing the probability distribution with the entangled phase estimation, we propose a simple scheme to better estimate both the transition energies and the corresponding transition probabilities of the peaks of interest in the spectra. The validity of our prescription is demonstrated by numerical simulations in various quantum many-body problems: the spectral function of a simple electron-plasmon model in condensed-matter physics, the dipole transitions of the H$_2$O molecule in quantum chemistry, and the electromagnetic transitions of the $^6$Li nucleus in nuclear physics.

Quantum algorithms are still challenging to solve linear systems of equations on real devices. This challenge arises from the need for deep circuits and numerous ancilla qubits. We introduce the quantum conjugate gradient (QCG) method using the quantum eigenvalue transformation (QET). The circuit depth of this algorithm depends on the square root of the coefficient matrix's condition number $\kappa$, representing a square root improvement compared to the previous quantum algorithms, while the total query complexity worsens. The number of ancilla qubits is constant, similar to other QET-based algorithms. Additionally, to implement the QCG method efficiently, we devise a QET-based technique that uses only the positive side of the polynomial (denoted by $P(x)$ for $x\in[0,1]$). We conduct numerical experiments by applying our algorithm to the one-dimensional Poisson equation and successfully solve it. Based on the numerical results, our algorithm significantly improves circuit depth, outperforming another QET-based algorithm by three to four orders of magnitude., Comment: 20 pages, 13 figures

QRAO (Quantum Random Access Optimization) is a relaxation algorithm that reduces the number of qubits required to solve a problem by encoding multiple variables per qubit using QRAC (Quantum Random Access Code). Reducing the number of qubits is a common way of dealing with the impact of noise on a quantum algorithm. Our interest lies in the impact of noise on the quality of the binary solution of QRAO, which is unknown. We demonstrate that the mean approximation ratio of the (3, 1)-QRAC Hamiltonian, i.e., the Hamiltonian utilizing the encoding of 3 bits into 1 qubit by QRAC, is less affected by noise compared to the Ising Hamiltonian used in quantum annealer and QAOA (Quantum Approximate Optimization Algorithm). Based on this observation, we discuss a plausible mechanism behind the robustness of QRAO under depolarizing noise. Finally, we assess the number of shots required to estimate the values of binary variables correctly under depolarizing noise and show that the (3, 1)-QRAC Hamiltonian requires less shots to achieve the same accuracy compared to the Ising Hamiltonian., Comment: 9 pages, 5 figures

Quantum optimization methods use a continuous degree-of-freedom of quantum states to heuristically solve combinatorial problems, such as the MAX-CUT problem, which can be attributed to various NP-hard combinatorial problems. This paper shows that some existing quantum optimization methods can be unified into a solver that finds the binary solution that is most likely measured from the optimal quantum state. Combining this finding with the concept of quantum random access codes (QRACs) for encoding bits into quantum states on fewer qubits, we propose an efficient recursive quantum relaxation method called recursive quantum random access optimization (RQRAO) for MAX-CUT. Experiments on standard benchmark graphs with several hundred nodes in the MAX-CUT problem, conducted in a fully classical manner using a tensor network technique, show that RQRAO outperforms the Goemans--Williamson method and is comparable to state-of-the-art classical solvers. The codes will be made available soon., Comment: 31 pages, 10 figures, 3 tables

Solving partial differential equations for extremely large-scale systems within a feasible computation time serves in accelerating engineering developments. Quantum computing algorithms, particularly the Hamiltonian simulations, present a potential and promising approach to achieve this purpose. Actually, there are several oracle-based Hamiltonian simulations with potential quantum speedup, but their detailed implementations and accordingly the detailed computational complexities are all unclear. This paper presents a method that enables us to explicitly implement the quantum circuit for Hamiltonian simulation; the key technique is the explicit gate construction of differential operators contained in the target partial differential equation discretized by the finite difference method. Moreover, we show that the space and time complexities of the constructed circuit are exponentially smaller than those of conventional classical algorithms. We also provide numerical experiments and an experiment on a real device for the wave equation to demonstrate the validity of our proposed method., Comment: 25 pages, 6 figures

We study the convergence of the Ginzburg-Landau (GL) expansion in the context of the Bardeen-Cooper-Schrieffer (BCS) theory for superconductivity and the Nambu-Jona-Lasinio (NJL) model for chiral symmetry breaking at finite temperature $T$ and chemical potential $\mu$. We present derivations of the all-order formulas for the coefficients of the GL expansions in both systems under the mean-field approximation. We show that the convergence radii for the BCS gap $\Delta$ and dynamical quark mass $M$ are given by $\Delta_\text{conv} = \pi T$ and $M_\text{conv} = \sqrt{\mu^2 + (\pi T)^2}$, respectively. We also discuss the implications of these results and the quantitative reliability of the GL expansion near the first-order chiral phase transition., Comment: 21 pages, 3 figures; v2: minor corrections, published version

Control of the angular momentum of light is a key technology for next-generation nano-optical devices and optical communications, including quantum communication and encoding. We propose an approach to controllably generate circularly polarized light from a circular hole in a metal film using an electron beam by coherently exciting transition radiation and light scattering from the hole through surface plasmon polaritons. The circularly polarized light generation is confirmed by fully polarimetric four-dimensional cathodoluminescence mapping where angle-resolved spectra are simultaneously obtained. The obtained intensity and Stokes maps show clear interference fringes as well as almost fully circularly polarized light generation with controllable parities by electron beam position. By applying this approach to a metal film with three holes, a vortex field with a phase singularity is visualized in the middle of the holes.

Motivated by the great success of classical generative models in machine learning, enthusiastic exploration of their quantum version has recently started. To depart on this journey, it is important to develop a relevant metric to evaluate the quality of quantum generative models; in the classical case, one such example is the (classical) inception score (cIS). In this paper, as a natural extension of cIS, we propose the quantum inception score (qIS) for quantum generators. Importantly, qIS relates the quality to the Holevo information of the quantum channel that classifies a given dataset. In this context, we show several properties of qIS. First, qIS is greater than or equal to the corresponding cIS, which is defined through projection measurements on the system output. Second, the difference between qIS and cIS arises from the presence of quantum coherence, as characterized by the resource theory of asymmetry. Third, when a set of entangled generators is prepared, there exists a classifying process leading to the further enhancement of qIS. Fourth, we harness the quantum fluctuation theorem to characterize the physical limitation of qIS. Finally, we apply qIS to assess the quality of the one-dimensional spin chain model as a quantum generative model, with the quantum convolutional neural network as a quantum classifier, for the phase classification problem in the quantum many-body physics., Comment: very close to the published version

Reservoir computing is a machine learning framework that uses artificial or physical dissipative dynamics to predict time-series data using nonlinearity and memory properties of dynamical systems. Quantum systems are considered as promising reservoirs, but the conventional quantum reservoir computing (QRC) models have problems in the execution time. In this paper, we develop a quantum reservoir (QR) system that exploits repeated measurement to generate a time-series, which can effectively reduce the execution time. We experimentally implement the proposed QRC on the IBM's quantum superconducting device and show that it achieves higher accuracy as well as shorter execution time than the conventional QRC method. Furthermore, we study the temporal information processing capacity to quantify the computational capability of the proposed QRC; in particular, we use this quantity to identify the measurement strength that best tradeoffs the amount of available information and the strength of dissipation. An experimental demonstration with soft robot is also provided, where the repeated measurement over 1000 timesteps was effectively applied. Finally, a preliminary result with 120 qubits device is discussed.

Integration of quantum chemistry simulations, machine learning techniques, and optimization calculations is expected to accelerate material discovery by making large chemical spaces amenable to computational study; a challenging task for classical computers. In this work, we develop a combined quantum-classical computing scheme involving the computational-basis Variational Quantum Deflation (cVQD) method for calculating excited states of a general classical Hamiltonian, such as Ising Hamiltonian. We apply this scheme to the practical use case of generating photochromic diarylethene (DAE) derivatives for photopharmacology applications. Using a data set of 384 DAE derivatives quantum chemistry calculation results, we show that a factorization-machine-based model can construct an Ising Hamiltonian to accurately predict the wavelength of maximum absorbance of the derivatives, $\lambda_{\rm max}$, for a larger set of 4096 DAE derivatives. A 12-qubit cVQD calculation for the constructed Ising Hamiltonian provides the ground and first four excited states corresponding to five DAE candidates possessing large $\lambda_{\rm max}$. On a quantum simulator, results are found to be in excellent agreement with those obtained by an exact eigensolver. Utilizing error suppression and mitigation techniques, cVQD on a real quantum device produces results with accuracy comparable to the ideal calculations on a simulator. Finally, we show that quantum chemistry calculations for the five DAE candidates provides a path to achieving large $\lambda_{\rm max}$ and oscillator strengths by molecular engineering of DAE derivatives. These findings pave the way for future work on applying hybrid quantum-classical approaches to large system optimization and the discovery of novel materials., Comment: 13pages, 9 figures

Quantum coherence in a qubit is vulnerable to environmental noise. When long quantum calculation is run on a quantum processor without error correction, the noise often causes fatal errors and messes up the calculation. Here, we propose quantum-circuit distillation to generate quantum circuits that are short but have enough functions to produce an output almost identical to that of the original circuits. The distilled circuits are less sensitive to the noise and can complete calculation before the quantum coherence is broken in the qubits. We created a quantum-circuit distillator by building a reinforcement learning model, and applied it to the inverse quantum Fourier transform (IQFT) and Shor's quantum prime factorization. The obtained distilled circuit allows correct calculation on IBM-Quantum processors. By working with the quantum-circuit distillator, we also found a general rule to generate quantum circuits approximating the general $n$-qubit IQFTs. The quantum-circuit distillator offers a new approach to improve performance of noisy quantum processors., Comment: 11 pages, 8 figures, 1 table

We systematically derive the chiral kinetic theory for chiral fermions with collisions, including the self-energy corrections, from quantum field theories. We find that the Wigner functions and chiral kinetic equations receive both the classical and quantum corrections from the self-energies and their spacetime gradients. We also apply this formalism to study nonequilibrium neutrino transport due to the interaction with thermalized electrons and nucleons, as realized in core-collapse supernovae. We derive neutrino currents along magnetic fields and neutrino spin Hall effect induced by the density gradient at first order in the Fermi constant $G_{\rm F}$ for anisotropic neutrino distributions., Comment: 24 pages, 1 figure, minor errors corrected, published version

Grover adaptive search (GAS) is a quantum exhaustive search algorithm designed to solve binary optimization problems. In this paper, we propose higher-order binary formulations that can simultaneously reduce the numbers of qubits and gates required for GAS. Specifically, we consider two novel strategies: one that reduces the number of gates through polynomial factorization, and the other that halves the order of the objective function, subsequently decreasing circuit runtime and implementation cost. Our analysis demonstrates that the proposed higher-order formulations improve the convergence performance of GAS by both reducing the search space size and the number of quantum gates. Our strategies are also beneficial for general combinatorial optimization problems using one-hot encoding., Comment: 11 pages, 8 figures

The quantum channel decomposition techniques, which contain the so-called probabilistic error cancellation and gate/wire cutting, are powerful approach for simulating a hard-to-implement (or an ideal) unitary operation by concurrently executing relatively easy-to-implement (or noisy) quantum channels. However, such virtual simulation necessitates an exponentially large number of decompositions, thereby significantly limiting their practical applicability. This paper proposes a channel decomposition method for target unitaries that have their input and output conditioned on specific quantum states, namely unitaries with pre- and post-selection. Specifically, we explicitly determine the requisite number of decomposing channels, which could be significantly smaller than the selection-free scenario. Furthermore, we elucidate the structure of the resulting decomposed unitary. We demonstrate an application of this approach to the quantum linear solver algorithm, highlighting the efficacy of the proposed method., Comment: published version, 11 pages, 5 figures

We demonstrate a universal mechanism of a class of instabilities in infrared regions for massless Abelian $p$-form gauge theories with topological interactions, which we call generalized chiral instabilities. Such instabilities occur in the presence of initial electric fields for the $p$-form gauge fields. We show that the dynamically generated magnetic fields tend to decrease the initial electric fields and result in configurations with linking numbers, which can be characterized by non-invertible global symmetries. The so-called chiral plasma instability and instabilities of the axion electrodynamics and $(4+1)$-dimensional Maxwell-Chern-Simons theory in electric fields can be described by the generalized chiral instabilities in a unified manner. We also illustrate this mechanism in the $(2+1)$-dimensional Goldstone-Maxwell model in electric field., Comment: 38 pages, 9 figures; v2: references added, minor corrections, published version

Quantum state estimation (or state tomography) is an indispensable task in quantum information processing. Because full state tomography that determines all elements of the density matrix is computationally demanding, one usually takes the strategy of assuming a certain model of quantum states and identifying the model parameters. However, it is difficult to make a valid assumption given little prior knowledge on a quantum state of interest, and thus we need a reasonable model selection method for quantum state estimation. Actually, in the classical statistical estimation theory, several types of information criteria have been established and widely used in practice for appropriately choosing a classical statistical model. In this study, we propose quantum information criteria for evaluating the quality of the estimated quantum state in terms of the quantum relative entropy, which is a natural quantum analogue of the classical information criterion defined in terms of Kullback-Leibler divergence. In particular, we derive two quantum information criteria depending on the type of estimator for the quantum relative entropy; one uses the log-likelihood and the other uses the classical shadow. The general role of information criteria is to predict the performance of an estimated model for unseen data, although it is a function of only sampled data; this generalization capability of the proposed quantum information criteria is evaluated in numerical simulations.

Quantum computing can be used to speed up the simulation time (more precisely, the number of queries of the algorithm) for physical systems; one such promising approach is the Hamiltonian simulation (HS) algorithm. Recently, it was proven that the quantum singular value transformation (QSVT) achieves the minimum simulation time for HS. An important subroutine of the QSVT-based HS algorithm is the amplitude amplification operation, which can be realized via the oblivious amplitude amplification or the fixed-point amplitude amplification in the QSVT framework. In this work, we execute a detailed analysis of the error and number of queries of the QSVT-based HS and show that the oblivious method is better than the fixed-point one in the sense of simulation time. Based on this finding, we apply the QSVT-based HS to the one-dimensional linearized Vlasov-Poisson equation and demonstrate that the linear Landau damping can be successfully simulated., Comment: 20 pages, 16 figures

Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is employed to obtain the ground state with higher accuracy than QMC alone. We propose an algorithm combining QC-QMC with a hybrid tensor network to extend the applicability of QC-QMC beyond a single quantum device size. In a two-layer quantum-quantum tree tensor, our algorithm for the larger trial wave function can be executed than preparable wave function in a device. Our algorithm is evaluated on the Heisenberg chain model, graphite-based Hubbard model, hydrogen plane model, and MonoArylBiImidazole using full configuration interaction QMC. Our algorithm can achieve energy accuracy (specifically, variance) several orders of magnitude higher than QMC, and the hybrid tensor version of QMC gives the same energy accuracy as QC-QMC when the system is appropriately decomposed. Moreover, we develop a pseudo-Hadamard test technique that enables efficient overlap calculations between a trial wave function and an orthonormal basis state. In a real device experiment by using the technique, we obtained almost the same accuracy as the statevector simulator, indicating the noise robustness of our algorithm. These results suggests that the present approach will pave the way to electronic structure calculation for large systems with high accuracy on current quantum devices., Comment: 32 pages, 24 figures, 3 tables

A restriction in the quality and quantity of available qubits presents a substantial obstacle to the application of near-term and early fault-tolerant quantum computers in practical tasks. To confront this challenge, some techniques for effectively augmenting the system size through classical processing have been proposed; one promising approach is quantum circuit cutting. The main idea of quantum circuit cutting is to decompose an original circuit into smaller sub-circuits and combine outputs from these sub-circuits to recover the original output. Although this approach enables us to simulate larger quantum circuits beyond physically available circuits, it needs classical overheads quantified by the two metrics: the sampling overhead in the number of measurements to reconstruct the original output, and the number of channels in the decomposition. Thus, it is crucial to devise a decomposition method that minimizes both of these metrics, thereby reducing the overall execution time. This paper studies the problem of decomposing the parallel $n$-qubit identity channel, i.e., $n$-parallel wire cutting, into a set of local operations and classical communication; then we give an optimal wire-cutting method comprised of channels based on mutually unbiased bases, that achieves minimal overheads in both the sampling overhead and the number of channels, without ancilla qubits. This is in stark contrast to the existing method that achieves the optimal sampling overhead yet with ancilla qubits. Moreover, we derive a tight lower bound of the number of channels in parallel wire cutting without ancilla systems and show that only our method achieves this lower bound among the existing methods. Notably, our method shows an exponential improvement in the number of channels, compared to the aforementioned ancilla-assisted method that achieves optimal sampling overhead., Comment: Substantially updated version. 33 pages, 10 figures

Variational Quantum Eigensolver (VQE) is a hybrid algorithm for finding the minimum eigenvalue/vector of a given Hamiltonian by optimizing a parametrized quantum circuit (PQC) using a classical computer. Sequential optimization methods, which are often used in quantum circuit tensor networks, are popular for optimizing the parametrized gates of PQCs. This paper focuses on the case where the components to be optimized are single-qubit gates, in which the analytic optimization of a single-qubit gate is sequentially performed. The analytical solution is given by diagonalization of a matrix whose elements are computed from the expectation values of observables specified by a set of predetermined parameters which we call the parameter configurations. In this study, we first show that the optimization accuracy significantly depends on the choice of parameter configurations due to the statistical errors in the expectation values. We then identify a metric that quantifies the optimization accuracy of a parameter configuration for all possible statistical errors, named configuration overhead/cost or C-cost. We theoretically provide the lower bound of C-cost and show that, for the minimum size of parameter configurations, the lower bound is achieved if and only if the parameter configuration satisfies the so-called equiangular line condition. Finally, we provide numerical experiments demonstrating that the optimal parameter configuration exhibits the best result in several VQE problems. We hope that this general statistical methodology will enhance the efficacy of sequential optimization of PQCs for solving practical problems with near-term quantum devices., Comment: 20 pages, 5 figures

We demonstrate the general existence of a local dipole conservation law in bosonic field theory. The scalar charge density arises from the symplectic form of the system, whereas the tensor current descends from its stress tensor. The algebra of spatial translations becomes centrally extended in presence of field configurations with a finite nonzero charge. Furthermore, when the symplectic form is closed but not exact, the system may, surprisingly, lack a well-defined momentum density. This leads to a theorem for the presence of additional light modes in the system whenever the short-distance physics is governed by a translationally invariant local field theory. We also illustrate this mechanism for axion electrodynamics as an example of a system with Nambu--Goldstone modes of higher-form symmetries., Comment: 32 pages, 2 figures; v2: expanded discussion and updated reference list; v3: minor revision and further update of the reference list

We propose two quantum algorithms for a problem in bioinformatics, position weight matrix (PWM) matching, which aims to find segments (sequence motifs) in a biological sequence such as DNA and protein that have high scores defined by the PWM and are thus of informational importance related to biological function. The two proposed algorithms, the naive iteration method and the Monte-Carlo-based method, output matched segments, given the oracular accesses to the entries in the biological sequence and the PWM. The former uses quantum amplitude amplification (QAA) for sequence motif search, resulting in the query complexity scaling on the sequence length $n$, the sequence motif length $m$ and the number of the PWMs $K$ as $\widetilde{O}\left(m\sqrt{Kn}\right)$, which means speedup over existing classical algorithms with respect to $n$ and $K$. The latter also uses QAA, and further, quantum Monte Carlo integration for segment score calculation, instead of iteratively operating quantum circuits for arithmetic in the naive iteration method; then it provides the additional speedup with respect to $m$ in some situation. As a drawback, these algorithms use quantum random access memories and their initialization takes $O(n)$ time. Nevertheless, our algorithms keep the advantage especially when we search matches in a sequence for many PWMs in parallel.

Generalized eigenvalue problems (GEPs) play an important role in the variety of fields including engineering, machine learning and quantum chemistry. Especially, many problems in these fields can be reduced to finding the minimum or maximum eigenvalue of GEPs. One of the key problems to handle GEPs is that the memory usage and computational complexity explode as the size of the system of interest grows. This paper aims at extending sequential quantum optimizers for GEPs. Sequential quantum optimizers are a family of algorithms that iteratively solve the analytical optimization of single-qubit gates in a coordinate descent manner. The contribution of this paper is as follows. First, we formulate the GEP as the minimization/maximization problem of the fractional form of the expectations of two Hermitians. We then showed that the fractional objective function can be analytically minimized or maximized with respect to a single-qubit gate by solving a GEP of a 4 $\times$ 4 matrix. Second, we show that a system of linear equations (SLE) characterized by a positive-definite Hermitian can be formulated as a GEP and thus be attacked using the proposed method. Finally, we demonstrate two applications to important engineering problems formulated with the finite element method. Through the demonstration, we have the following bonus finding; a problem having a real-valued solution can be solved more effectively using quantum gates generating a complex-valued state vector, which demonstrates the effectiveness of the proposed method., Comment: 19 pages, 10 figures

Electron microscopy based on high-energy electrons allows nanoscopic analytical imaging taking advantage of secondarily generated particles. Especially for cathodoluminescence, the correlation between primary incident electrons and emitted photons includes information on the entire interaction process. However, electron-photon time correlation tracking the relaxation dynamics of luminescent materials has so far not been achieved. In this work, we propose time-correlated electron and photon counting microscopy, where coincidence events of primary electrons and generated photons are counted after interaction. The electron-photon time correlation enables extracting a unique lifetime of the emitter independent of the photon state, accounting for coherent and incoherent photon generation processes. We also introduce a correlation factor and discuss the correlation between electrons and generated coherent photons. Through momentum selection, we observe correlation changes indicating the presence of pair correlation originated from the electron-photon entanglement. The present work lays the foundation for developing next-generation electron microscopy based on quantum correlation.

We develop an approach to chiral kinetic theories for electrons close to equilibrium and neutrinos away from equilibrium based on a systematic power counting scheme for different timescales of electromagnetic and weak interactions. Under this framework, we derive electric and energy currents along magnetic fields induced by neutrino radiation in general nonequilibrium states. This may be regarded as an effective chiral magnetic effect (CME), which is present without a chiral chemical potential, unlike the conventional CME. We also consider the so-called gain region of core-collapse supernovae as an example and find that the effective CME enhanced by persistent neutrino emission in time is sufficiently large to lead to the inverse cascade of magnetic and fluid kinetic energies and observed magnitudes of pulsar kicks. Our framework may also be applicable to other dense-matter systems involving nonequilibrium neutrinos., Comment: 6 pages, 1 figure, journal version

Quantum computing has a potential to accelerate the data processing efficiency, especially in machine learning, by exploiting special features such as the quantum interference. The major challenge in this application is that, in general, the task of loading a classical data vector into a quantum state requires an exponential number of quantum gates. The approximate amplitude encoding (AAE) method, which uses a variational means to approximately load a given real-valued data vector into the amplitude of a quantum state, was recently proposed as a general approach to this problem mainly for near-term devices. However, AAE cannot load a complex-valued data vector, which narrows its application range. In this work, we extend AAE so that it can handle a complex-valued data vector. The key idea is to employ the fidelity distance as a cost function for optimizing a parameterized quantum circuit, where the classical shadow technique is used to efficiently estimate the fidelity and its gradient. We apply this algorithm to realize the complex-valued-kernel binary classifier called the compact Hadamard classifier, and then give a numerical experiment showing that it enables classification of Iris dataset and credit card fraud detection., Comment: 13 pages, 8 figures

Quantum kernel method is a machine learning model exploiting quantum computers to calculate the quantum kernels (QKs) that measure the similarity between data. Despite the potential quantum advantage of the method, the commonly used fidelity-based QK suffers from a detrimental issue, which we call the vanishing similarity issue; detecting the difference between data becomes hard with the increase of the number of qubits, due to the exponential decrease of the expectation and the variance of the QK. This implies the need to design QKs alternative to the fidelity-based one. In this work, we propose a new class of QKs called the quantum Fisher kernels (QFKs) that take into account the geometric structure of the data source. We analytically and numerically demonstrate that the QFK based on the anti-symmetric logarithmic derivatives (ALDQFK) can avoid the issue when the alternating layered ansatzs (ALAs) are used, while the fidelity-based QK cannot even with the ALAs. Moreover, the Fourier analysis numerically elucidates that the ALDQFK can have expressivity comparable to that of the fidelity-based QK. These results indicate that the QFK paves the way for practical applications of quantum machine learning with possible quantum advantages.

Quantum-enhanced (i.e., higher performance by quantum effects than any classical methods) mean value estimation of observables is a fundamental task in various quantum technologies; in particular, it is an essential subroutine in quantum computing algorithms. Notably, the quantum estimation theory identifies the ultimate precision of such an estimator, which is referred to as the quantum Cram\'{e}r-Rao (QCR) lower bound or equivalently the inverse of the quantum Fisher information. Because the estimation precision directly determines the performance of those quantum technological systems, it is highly demanded to develop a generic and practically implementable estimation method that achieves the QCR bound. Under imperfect conditions, however, such an ultimate and implementable estimator for quantum mean values has not been developed. In this paper, we propose a quantum-enhanced mean value estimation method in a depolarizing noisy environment that asymptotically achieves the QCR bound in the limit of a large number of qubits. To approach the QCR bound in a practical setting, the method adaptively optimizes the amplitude amplification and a specific measurement that can be implemented without any knowledge of state preparation. We provide a rigorous analysis for the statistical properties of the proposed adaptive estimator such as consistency and asymptotic normality. Furthermore, several numerical simulations are provided to demonstrate the effectiveness of the method, particularly showing that the estimator needs only a modest number of measurements to almost saturate the QCR bound., Comment: 35 pages, 9 figures. Final version

This study is aimed at investigating the feasibility of generating quantum entanglement between macroscopic mechanical mirrors in optomechanical systems while under continuous measurement and feedback control. We carefully derive a covariance matrix for mechanical mirrors in a steady state, employing the Kalman filtering problem with an assumed dominant cavity photon dissipation, such that the common and differential modes of the mirrors are squeezed by the action of measuring the output light beams. We demonstrate that entanglement between the mechanical mirrors is generated when the states of the common and differential modes are squeezed with high purity in an asymmetric manner. Our results also show that quantum entanglement between $7$ mg mirrors is achievable in the short term., Comment: 20 pages, 10 figures

Generative modeling is an unsupervised machine learning framework, that exhibits strong performance in various machine learning tasks. Recently we find several quantum version of generative model, some of which are even proven to have quantum advantage. However, those methods are not directly applicable to construct a generative model for learning a set of quantum states, i.e., ensemble. In this paper, we propose a quantum generative model that can learn quantum ensemble, in an unsupervised machine learning framework. The key idea is to introduce a new loss function calculated based on optimal transport loss, which have been widely used in classical machine learning due to its several good properties; e.g., no need to ensure the common support of two ensembles. We then give in-depth analysis on this measure, such as the scaling property of the approximation error. We also demonstrate the generative modeling with the application to quantum anomaly detection problem, that cannot be handled via existing methods. The proposed model paves the way for a wide application such as the health check of quantum devices and efficient initialization of quantum computation.

Graphs are a generalized concept that encompasses more complex data structures than trees, such as difference lists, doubly-linked lists, skip lists, and leaf-linked trees. Normally, these structures are handled with destructive assignments to heaps, which is opposed to a purely functional programming style and makes verification difficult. We propose a new purely functional language, $\lambda_{GT}$, that handles graphs as immutable, first-class data structures with a pattern matching mechanism based on Graph Transformation and developed a new type system, $F_{GT}$, for the language. Our approach is in contrast with the analysis of pointer manipulation programs using separation logic, shape analysis, etc. in that (i) we do not consider destructive operations but pattern matchings over graphs provided by the new higher-level language that abstract pointers and heaps away and that (ii) we pursue what properties can be established automatically using a rather simple typing framework., Comment: 19 pages, 27 figures

Quantum machine learning (QML) is the spearhead of quantum computer applications. In particular, quantum neural networks (QNN) are actively studied as the method that works both in near-term quantum computers and fault-tolerant quantum computers. Recent studies have shown that supervised machine learning with QNN can be interpreted as the quantum kernel method (QKM), suggesting that enhancing the practicality of the QKM is the key to building near-term applications of QML. However, the QKM is also known to have two severe issues. One is that the QKM with the (inner-product based) quantum kernel defined in the original large Hilbert space does not generalize; namely, the model fails to find patterns of unseen data. The other one is that the classical computational cost of the QKM increases at least quadratically with the number of data, and therefore, QKM is not scalable with data size. This paper aims to provide algorithms free from both of these issues. That is, for a class of quantum kernels with generalization capability, we show that the QKM with those quantum kernels can be made scalable by using our proposed deterministic and random features. Our numerical experiment, using datasets including $O(1,000) \sim O(10,000)$ training data, supports the validity of our method., Comment: 19 pages, 2 figures

The two-time measurement scheme is well studied in the context of quantum fluctuation theorem. However, it becomes infeasible when the random variable determined by a single measurement trajectory is associated with the von-Neumann entropy of the quantum states. We employ the one-time measurement scheme to derive a Jarzynski-like equality of nonequilibrium information production by proposing an information production distribution based on the quantum cross entropy. The derived equality further enables one to explore the roles of the quantum cross entropy in quantum communications, quantum machine learning and quantum thermodynamics., Comment: v2: We removed the results of two-time measurement scheme, and added the relations of our main result of the one-time measurement scheme to the cost function of quantum autoencoder and maximum available work theorem