Noise-Directed Adaptive Remapping for Integer Optimization: from qubits to (encoded) qudits

• URL: http://arxiv.org/abs/2606.28234v1
• Date: Fri, 26 Jun 2026 16:21:57 GMT
• Title: Noise-Directed Adaptive Remapping for Integer Optimization: from qubits to (encoded) qudits
• Abstract summary: We extend Noise-Directed Adaptive Remapping (NDAR), a recently proposed meta-algorithm that leverages device noise as a computational resource.<n>We identify encoding-dependent requirements for NDAR beyond binary domains.<n>We show that NDAR-guided noise considerations provide a new criterion for comparing device-level encoding choices for quantum optimization.
• Score: 2.8891834214263885
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We extend Noise-Directed Adaptive Remapping (NDAR), a recently proposed heuristic meta-algorithm that leverages device noise as a computational resource, to optimization problems over discrete (integer) domains. While originally introduced for unconstrained binary optimization, the proposed generalization introduces additional gauge degrees of freedom at the logical level, such that the gauge transformation applied at each iteration is no longer unique, allowing tailoring to particular encodings or quantum hardware. We identify encoding-dependent requirements for NDAR beyond binary domains: feasibility of the noise attractor, existence of compatible gauge transformations that preserve an efficiently implementable circuit family, and a systematic way to select the transform to apply at each step. We analyze these criteria for qudit-native and for binary, one-hot, and domain-wall qubit encodings, using the Max-k-colorable subgraph problem as a running example. We demonstrate that these encodings can exhibit distinct advantages and tradeoffs when integrated within the NDAR framework, particularly in how noise-induced dynamics interact with the solution landscape and choice of encoding. Our results indicate that NDAR-guided noise considerations provide a new criterion for comparing device-level encoding choices for quantum optimization. Finally, we outline directions toward experimental realization in superconducting qudit devices and further algorithmic improvements.

Related papers

• Quantum Approximate Optimization via Noise-Directed Adaptive Warm-Starting [2.794538040289806]
  Noise-Directed Adaptive Warm-Starting builds on concepts such as Warm-Start QAOA and Noise-Directed Adaptive Remapping.<n>We experimentally implement high-performance quantum optimization anstze on 100-qubit Ising Hamiltonians.
  arXiv  Detail & Related papers  (2026-07-10T12:46:10Z)
• Gradient-Free Noise Optimization for Reward Alignment in Generative Models [52.42087778653147]
  ZeNO is a gradient-free framework that formulates noise optimization as a path-integral control problem.<n>It enables effective inference-time scaling and demonstrates strong performance across diverse generators and reward functions.
  arXiv  Detail & Related papers  (2026-05-12T00:05:36Z)
• WUSH: Near-Optimal Adaptive Transforms for LLM Quantization [52.77441224845925]
  Quantization to low bitwidth is a standard approach for deploying large language models.<n>A few extreme weights and activations stretch the dynamic range and reduce the effective resolution of the quantizer.<n>We derive, for the first time, closed-form optimal linear blockwise transforms for joint weight-activation quantization.
  arXiv  Detail & Related papers  (2025-11-30T16:17:34Z)
• Adaptive Algorithms with Sharp Convergence Rates for Stochastic Hierarchical Optimization [31.032959636901086]
  We propose novel adaptive algorithms for hierarchical optimization problems.<n>Our algorithms achieve sharp convergence rates without prior knowledge of the noise level.<n>Experiments on synthetic and deep learning tasks demonstrate the effectiveness of our proposed algorithms.
  arXiv  Detail & Related papers  (2025-09-18T20:17:18Z)
• Accelerated zero-order SGD under high-order smoothness and overparameterized regime [79.85163929026146]
  We present a novel gradient-free algorithm to solve convex optimization problems. Such problems are encountered in medicine, physics, and machine learning. We provide convergence guarantees for the proposed algorithm under both types of noise.
  arXiv  Detail & Related papers  (2024-11-21T10:26:17Z)
• Gradient Normalization Provably Benefits Nonconvex SGD under Heavy-Tailed Noise [60.92029979853314]
  We investigate the roles of gradient normalization and clipping in ensuring the convergence of Gradient Descent (SGD) under heavy-tailed noise. Our work provides the first theoretical evidence demonstrating the benefits of gradient normalization in SGD under heavy-tailed noise. We introduce an accelerated SGD variant incorporating gradient normalization and clipping, further enhancing convergence rates under heavy-tailed noise.
  arXiv  Detail & Related papers  (2024-10-21T22:40:42Z)
• Optimal and robust error filtration for quantum information processing [0.0]
  Error filtration is a hardware scheme that mitigates noise by exploiting auxiliary qubits and entangling gates.<n>We benchmark our approach against figures of merit that correspond to different applications.
  arXiv  Detail & Related papers  (2024-09-02T17:58:44Z)
• Improving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping [2.6447353939786296]
  Noise-Directed Remapping (NDAR) is a algorithm for approximately solving binary optimization problems by leveraging certain types of noise.<n>We consider access to a noisy quantum processor with dynamics that features a global attractor state.<n>Our algorithm bootstraps the noise attractor state by iteratively gauge-transforming the cost-function Hamiltonian in a way that transforms the noise attractor into higher-quality solutions.
  arXiv  Detail & Related papers  (2024-04-01T18:28:57Z)
• Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms [0.0]
  We propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. We implement a quasi-Newton algorithm where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA.
  arXiv  Detail & Related papers  (2024-01-10T14:08:04Z)
• Conditional Denoising Diffusion for Sequential Recommendation [62.127862728308045]
  Two prominent generative models, Generative Adversarial Networks (GANs) and Variational AutoEncoders (VAEs) GANs suffer from unstable optimization, while VAEs are prone to posterior collapse and over-smoothed generations. We present a conditional denoising diffusion model, which includes a sequence encoder, a cross-attentive denoising decoder, and a step-wise diffuser.
  arXiv  Detail & Related papers  (2023-04-22T15:32:59Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Preconditioned Plug-and-Play ADMM with Locally Adjustable Denoiser for Image Restoration [54.23646128082018]
  We extend the concept of plug-and-play optimization to use denoisers that can be parameterized for non-constant noise variance. We show that our pixel-wise adjustable denoiser, along with a suitable preconditioning strategy, can further improve the plug-and-play ADMM approach for several applications.
  arXiv  Detail & Related papers  (2021-10-01T15:46:35Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.