Searcharxiv⌕ Search

arXiv subjects

Masayuki Ohzeki

Publications and source records attributed to Masayuki Ohzeki.

At least 19 recordsLinked to original sources

Phase transition in compressed sensing using log-sum penalty and adaptive smoothing

In many real-world problems, recovering sparse signals from underdetermined linear systems remains a fundamental challenge. Although $\ell_1$ norm minimization is widely used, it suffers from estimation bias that prevents it from reaching the Bayes-optimal reconstruction limit. Nonconvex alternatives, such as the log-sum penalty, have been proposed to promote stronger sparsity. However, maintaining their algorithmic stability is challenging. To address this challenge, we introduce an adaptive smoothing strategy within an approximate message passing framework to mitigate algorithmic instability. Furthermore, we evaluate the typical exact-recovery threshold for Gaussian measurement matrices using the replica method and state evolution. The results indicate that the adaptive method achieves exact recovery over a broader region than $\ell_1$-norm minimization, although metastable states hinder the attainment of the information-theoretic limit.

cs.IT↗

Spin-glass order in a field requires magnetic-field chaos in XY gauge glasses for $d\leq 4$

The XY gauge-glass model is believed to exhibit a spin-glass phase in dimensions $d\geq 3$. In this paper, we prove that, in dimensions $d\leq 4$ and at any finite temperature, a magnetic field applied in a fixed direction, with amplitudes that fluctuate from site to site according to the Rayleigh distribution, must either induce magnetic-field chaos in the spin-glass phase or destroy spin-glass order altogether, whenever a spin-glass phase exists at zero field. In particular, if a spin-glass phase persists under such a field, as predicted by the replica-symmetry-breaking (RSB) picture, it must exhibit magnetic-field chaos. This conclusion follows from our proof that, for any fixed nonzero field strength, the disorder average of the squared overlap between equilibrium spin configurations at zero field and those at nonzero field vanishes in the thermodynamic limit. By gauge transformations, the overlap statistics are identical to the magnetization statistics of an XY gauge glass with correlated bond disorder in a Gaussian random field. Our proof combines this exact identity with quantitative estimates on the suppression of ferromagnetic order by random fields in continuous-spin systems, due to Dario, Harel, and Peled [Commun. Math. Phys. 405, 212 (2024)] and building on the work of Imry and Ma [Phys. Rev. Lett. 35, 1399 (1975)] and of Aizenman and Wehr [Phys. Rev. Lett. 62, 2503 (1989); Commun. Math. Phys. 130, 489 (1990)]. We extend these estimates to bond-dependent interactions. Although our result provides a rare rigorous constraint on the nature of spin-glass phases in finite-dimensional systems, it does not determine whether spin-glass order survives in a field, and therefore does not distinguish between the droplet and RSB pictures. The case of a strictly uniform field remains open.

cond-mat.dis-nn↗

Boundary-Canceled Score-Hamiltonian Sampling

Diffusion sampling is related to imaginary-time quantum annealing through a forward/backward Schrödinger equation pair and its one-sided counterdiabatic connection. For a smooth, gapped Score-Hamiltonian path, the exact connection transports the target density at any evolution time. We apply quantum-annealing performance analysis to residuals from approximating this connection with a trained score. If the first $r$ terminal schedule derivatives vanish, the squared Hellinger error scales as $T^{-2r-2}$, with a prefactor determined by the terminal learning residual and inverse gaps. Direct two-dimensional imaginary-time evolution with one fixed neural score reproduces these powers and prefactors. Terminal schedule design thus suppresses the distributional effect of imperfect score learning without retraining the network.

quant-ph↗

Existence and Absence of Spin-Glass Phases on Migdal--Kadanoff Hierarchical Lattices: A Complete Classification

We consider the Ising spin-glass model on Migdal--Kadanoff (MK) hierarchical lattices, characterized by the fractal dimension $d=1+\log s/\log b$, where $s$ and $b$ denote the number of parallel branches and the number of bonds in series within each branch, respectively. For independent Gaussian couplings, we rigorously establish a necessary and sufficient condition for the existence of finite-temperature spin-glass order for arbitrary integers $b,s\ge2$. We prove that a finite-temperature spin-glass phase exists whenever \[ \frac{b}{\sqrt{s}} \left( \frac{b\sqrt{s(s-1)}}{bs-1} \right)^{s-1}<1. \] In particular, this condition holds for all three-dimensional MK hierarchical lattices ($d=3$, or equivalently $s=b^2$), regardless of the choice of $b$. Conversely, we prove the absence of finite-temperature spin-glass order for fractal dimensions $d<1+\log17/\log6\approx2.58$, as well as in the large-$b$ limit for any fixed $d<3$. In the intermediate regime $1+\log17/\log6\le d<3$, we provide a finite-step procedure to determine the presence or absence of spin-glass order, which depends on $b$ and $s$. Our results provide a complete characterization of finite-temperature spin-glass order on MK hierarchical lattices.

cond-mat.dis-nn↗

Optimization versus fair sampling in quantum annealing: An exactly characterized frustrated Ising benchmark

Reaching a degenerate ground-state manifold and sampling it uniformly are distinct properties of a quantum annealer. We quantify this distinction using an Ising ring with additional couplings between maximally separated sites. For antiferromagnetic benchmark couplings and $N \geq 5$, we derive the exact ground-state energy, degeneracy, and defect structure for each congruence class of $N$ modulo four. This classification separates ground-state hit probability from conditional sampling bias. We embed instances with up to 162 logical spins on a D-Wave Advantage processor using length-two chains and compare its output with simulated annealing on the embedded and logical problems. For a frustrated $N=83$ instance, the processor visits 164 of the 166 exact ground states, yet the conditional distributions over states and defect sectors remain nonuniform. For $N=160$, the processor has a larger ground-state hit probability than logical simulated annealing (0.869 versus 0.519), but also a larger total-variation distance from uniformity (0.317 versus 0.136). A pause during the anneal raises the ground-state hit probability from 0.42 to 0.86 without restoring uniform sampling. These results identify a relaxation window and demonstrate that optimization success and sampling quality need not improve together, providing an exactly characterized benchmark for open-system quantum annealing.

quant-ph↗

Performance Evaluation of Ising and QUBO Variable Encodings in Boltzmann Machine Learning

We compare Ising ({-1, +1}) and QUBO ({0, 1}) encodings for Boltzmann machine learning under controlled protocols that fix the sampler, optimizer, and learning-rate design within each comparison. Exploiting the identity that the Fisher information matrix (FIM) equals the covariance of sufficient statistics, we visualize empirical moments from model samples and reveal systematic, representation-dependent differences. QUBO induces larger cross terms between first- and second-order statistics, creating more small-eigenvalue directions in the FIM and lowering spectral entropy. This ill-conditioning explains slower convergence under stochastic gradient descent (SGD). In contrast, full-FIM natural gradient descent (NGD), which rescales updates by the FIM metric, achieves similar convergence across encodings, whereas diagonal-FIM approximation can reintroduce representation-dependent differences. Practically, for SGD-based training, the Ising encoding provides more isotropic curvature and faster convergence; for QUBO, centering/scaling or NGD-style preconditioning mitigates curvature pathologies. These results clarify how representation shapes information geometry and finite-time learning dynamics in Boltzmann machines and yield actionable guidelines for variable encoding and preprocessing.

cs.LG↗

Residual Fisher Information in Measurement-Error Uncertainty

Measurement error in the Watanabe-Sagawa-Ueda formulation is the excess estimation error of a classical record over the quantum statistical limit. We show that, at the quantum-instrument level, this excess has an exact decomposition. The record-only error matrix equals a residual-aware error matrix plus a positive Schur-complement term fixed by Fisher information left in the unread post-measurement system. Thus measurement error separates into intrinsic instrument loss and record-restriction loss

quant-ph↗

QUBO Sampling for Mixed Binary Quadratic Programming without Continuous Variable Binarization

Quantum annealing and related combinatorial optimization methods typically accept quadratic unconstrained binary optimization (QUBO) problems as input, whereas many practical models include constraints and continuous variables. Standard QUBO conversions discretize continuous variables, increasing the binary dimension and often making feasible low-energy states harder to sample. We develop a Lagrange-multiplier method for a separable class of mixed-binary quadratic programs (MBQPs) without discretizing continuous variables. The method is based on a finite-temperature free-energy formulation and uses QUBO sampling for the binary sector. At fixed Lagrange multipliers, the continuous sector is integrated out analytically and enters only the multiplier update, leaving a QUBO over the original binary variables. We evaluate the method on the continuous relaxation of the quadratic $p$-median problem. Compared with a penalty-based QUBO formulation, it generates feasible solutions more reliably. At an appropriate inverse temperature, its conditional relative error is comparable to that of local search for small instances and often lower for the larger tested instances. In the time-to-target comparisons, the proposed method maintains high target-reached rates for stringent fixed-accuracy targets. For the larger instances within the tested range, it also reaches the prescribed targets faster than a commercial mixed-integer optimization solver.

quant-ph↗

Simultaneous Perturbation as a Spectral Filter

Parameterized quantum circuits require repeated measurements to estimate objective gradients, making the number of circuit evaluations a central resource. Simultaneous perturbation stochastic approximation (SPSA) is widely used because it obtains a full gradient estimate from only two cost evaluations, independently of the number of parameters. We analyze the random perturbation for the structured Fourier landscapes generated by quantum circuits. For a finite update width, we derive the exact mode-by-mode response of the mean Rademacher estimator and show that it selectively suppresses modes involving many parameters. For general generators, the filtered mean field need not be conservative. We derive its sampling variance, compare it with Gaussian random-direction smoothing, and formulate the resulting stochastic dynamics through a Fokker--Planck equation. The non-conservative field generates acceleration to the steady state and the global minimum of the cost function by gradually decreasing the parameters in SPSA.

quant-ph↗

Phase Transition in Binary Compressed Sensing via Annealing with Adaptive Regularization

Regularization choice changes the recovery phase diagrams of annealing-based binary compressed sensing. We develop a regularization-selection method that combines systematic parameter search with random forest regression. Under noiseless Gaussian measurements with known sparsity, reference parameters are selected from a candidate grid by minimizing mean squared reconstruction error over repeated simulated annealing (SA) trials. The fitted model predicts these reference values from signal dimension, sampling ratio, and sparsity. With predicted regularization, the SA recovery transition broadly follows the asymptotic reference boundary for box-constrained $\ell_1$ recovery at the larger signal dimensions examined. Without retraining, the same predictor supplies identical regularization values to SA and a quantum--classical hybrid solver. On matched problem instances, the hybrid solver yields smaller mean squared reconstruction errors than SA in parts of the evaluated parameter space. The resulting rule reuses the searched information for subsequent reconstruction without repeating candidate searches at each setting. The results quantify empirical performance under the stated finite candidate grid and solver settings; they do not constitute a solver-independent recovery guarantee or a time-to-solution comparison.

quant-ph↗

Information Erasure and Quantum Imprint in Quantum Measurement and First-Order SPAM Error Separation

We introduce information erasure and quantum imprint as two properties that classify quantum instruments. Information erasure is the property that an appropriate postselection can render the distribution of earlier measurement outcomes independent of the initial quantum state while retaining all outcome branches. Quantum imprint is the complementary property that no admissible postselection can eliminate this state dependence. We show that this classification has a nontrivial structure and that the natural intuition that measurements providing more information about the initial quantum state should be less likely to exhibit information erasure does not hold in general. We further show that, under a sufficiently reliable postselection, information erasure enables first-order separation of state-preparation and measurement (SPAM) errors. Specifically, the first-order contribution of state-preparation error vanishes from the posterior distribution, whereas visible first-order contributions of measurement error remain. This result recasts SPAM error separation from the problem of simultaneously characterizing state preparation and measurement into the problem of realizing a reliable postselection.

quant-ph↗

Sparse Signal Recovery Using Log-Sum Regularization and Adaptive Smoothing

We study sparse signal recovery from noisy linear observations using nonconvex log-sum regularization. The log-sum penalty reduces the shrinkage bias of $\ell_1$ regularization and more closely approximates the $\ell_0$ regularization, but its nonconvexity can make reconstruction algorithms unstable. To mitigate this instability, we use an adaptive smoothing strategy that determines the smoothing parameter so that the scalar proximal operator remains continuous. Using this proximal operator, we formulate the approximate message passing (AMP) algorithm and derive the corresponding state evolution (SE) recursion. The fixed point of the SE recursion predicts the final mean squared error (MSE) and, in the noiseless limit, the exact-recovery phase transition. To further investigate finite-dimensional reconstruction behavior, we implement an alternating direction method of multipliers (ADMM) algorithm. In the noiseless setting, we find that the empirical success boundary of ADMM closely agrees with the SE-predicted phase transition. In the noisy setting, we observe that AMP closely follows the SE prediction, whereas ADMM qualitatively reproduces the SE-predicted dependence of the final MSE on the regularization parameter. A comparison with $\ell_1$ regularization shows that log-sum regularization is beneficial in low-density or high-measurement-rate regimes, whereas $\ell_1$ regularization remains preferable at higher densities and lower measurement rates.

cs.IT↗

Optimal control theory for measured quantum Schrödinger bridges

Schrödinger bridges and entropic optimal transport are usually formulated as stochastic interpolation problems between initial and final probability distributions. In their computational form, the bridge potentials are obtained by Sinkhorn or iterative proportional fitting, and are often regarded as auxiliary scaling functions. We show that for continuously monitored quantum systems, these potentials acquire a direct measurement-theoretic meaning. The mathematical structure of conditional quantum trajectory theory induces a Fokker--Planck equation on quantum state space. Conditioning this diffusion on a terminal distribution or a terminal measurement effect produces a Doob/Sinkhorn potential whose directional derivative along a unitary control vector field is the imaginary part of a generalized weak value. The same construction connects the Schrödinger-bridge viewpoint to the optimal-path framework for continuously monitored trajectories: the backward bridge potential plays the role of an effect-like costate, and its weak-value directional derivative gives the local control signal. By specifying the desired endpoint distribution, the induced drift produced by the Schrödinger bridge solution is the control solution that minimizes the quadratic cost feedback law, guiding the distribution to its desired endpoint. We quantify the control score of the available control Hamiltonian as a logarithmic directional derivative of the bridge potential, or an imaginary weak value. Three explicit examples identify weak measurement as a natural entropic regularization mechanism for quantum state transport and gives a route from Sinkhorn scaling to quantum feedback and Hamiltonian control synthesis for practical optimal control.

quant-ph↗

Simulation-free and finite-time diffusion model

The performance of generative diffusion models is determined by the choice of the reference diffusion process connecting the empirical and prior distributions. Conventional approaches typically trade off simulation-free training against finite-time generation. We propose a framework for designing the reference process that achieves both simultaneously. The key idea is to prescribe tractable time-dependent conditional distributions and then construct the reference process realizing them as its marginals. This framework reveals that score matching is not fundamental to diffusion-model training but instead emerges naturally through reversal of the reference process. We further show that conditional flow matching arises as the small-noise limit of the proposed framework.

cs.LG↗

Maxwell's Demon in Markov Chain Monte Carlo: Cooling Information Flow and Entropy Balance

Markov chain Monte Carlo algorithms can be viewed as feedback devices that compare a proposed move with the target distribution and then accept or reject it. In this paper the Maxwell demon is identified with the acceptance module: it measures a proposed edge, stores the outcome in the accept/reject bit, and uses that bit to shape the probability current. The decision bit carries a genuine Shannon mutual information about the proposal, whereas only its directional part is converted into a cooling information flow. The relative-entropy relaxation rate obeys $v(t)=\dot{\mathcal I}_{\rm cool}(t)+\dot S(t)$, which separates useful cooling from housekeeping circulation in nonreversible chains.

cond-mat.dis-nn↗

Slepian Bounds on the Success Probability of Virtual Distillation

Virtual distillation is a powerful near-term error-mitigation primitive, but it is also a spectral filter: it amplifies the dominant eigenvector component already present in the noisy density matrix. We show that, for a finite-band variational state, this filtering cannot create new concentration inside a set of accepted measurement outcomes. The asymptotic success probability after distillation is bounded by the leading eigenvalue of a Slepian concentration operator built from a specified variational band and that outcome window. Moreover, the number of robust high-success spectral components is limited by the Slepian active dimension. \rev{For bit-string outcome windows, an explicit Walsh-band realization has a Krawtchouk kernel on the Boolean hypercube. Finite-size noisy-QAOA calculations for 2-regular Max-Cut illustrate both the in-band improvement and the out-of-band failure modes predicted by the branch-resolved result.

quant-ph↗

Robust Wavelength Selection for Partial Least Squares Sugar Content Estimation Using Combinatorial Bayesian Optimization

Wavelength selection is one of the important preprocessing methods in near-infrared spectroscopy to improve prediction accuracy and interpretability of spectral data. We formulate wavelength-region selection for sugar content estimation as a binary black-box optimization problem and propose a method based on Bayesian optimization. The proposed method constructs a sparse quadratic surrogate model and sequentially extracts interested wavelength regions by Thompson sampling. Minimizing an acquisition function is performed as a quadratic unconstrained binary optimization problem by simulated or quantum annealing. Experiments show that the proposed method improves the prediction accuracy of partial least squares regression and yields more consistent wavelength regions than genetic-algorithm-based selection and simulated annealing. Under one-bit local perturbations, the selected wavelength regions show minimal fluctuations in root mean square errors between observed and predicted values of a validation set. This local stability suggests that our method converges to a smoother error landscape and avoids isolated overfitted solutions. These results indicate that combinatorial Bayesian optimization is a useful framework for robust feature selection in spectroscopic prediction tasks.

stat.ML↗