{
  "abstract": "In our previous work, we proposed and experimentally demonstrated a physics-based simulator for combinatorial optimization problems (SSBM), which exploits a distinctive spontaneous symmetry breaking (SSB) phenomenon identified in a dissipative system exhibiting robust causality described by an iterative equation. We further conducted numerical simulations in which initial fluctuations of distinct patterns were applied to large-scale benchmark problems, and reported that the SSBM exhibits a unique behavior absent in conventional Ising machines: under specific conditions, pseudo-spin patterns progressively converge during the solution-search process and ultimately coalesce into a single pattern, with the cut value of the converged solution reaching 99.7% of the best-known cut value. In the present paper, we elucidate the conditions under which the SSBM can be configured to emulate the behavior of a continuous-variable Ising machine. We further demonstrate that by additionally incorporating an effect analogous to physical annealing into these conditions, the SSBM becomes capable of identifying the best-known cut value for the K_2000 benchmark instance.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2608.12545",
  "author_total": 1,
  "authors": [
    {
      "name": "Toshiya Sato"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/2wrk85v49zvj3.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2608.12545",
  "fulltext_url": null,
  "id": "2wrk85v49zvj3",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2608.12545",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math-ph"
    ],
    [
      "arxiv",
      "math.MP"
    ],
    [
      "arxiv",
      "nlin.AO"
    ],
    [
      "arxiv",
      "physics.optics"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Metaheuristic Optimization Algorithms Research"
    ]
  ],
  "openalex": "W7203483141",
  "pdf_url": "https://arxiv.org/pdf/2608.12545",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-20",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/2wrk85v49zvj3.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:34:04Z",
      "native_id": "2608.12545",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2608.12545"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math-ph",
      "subfield": "mathematical-physics"
    },
    {
      "field": "physics",
      "origin": "arxiv:physics.optics",
      "subfield": "optics-photonics"
    },
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    },
    {
      "field": "physics",
      "origin": "arxiv:nlin.AO",
      "subfield": "statistical-nonlinear"
    }
  ],
  "title": "Ising-machine-like Driving Condition Restrictions in SSBM and Additional Pseudo-annealing- Driving Method for SSBM that Achieves Best Cut Value Search -",
  "title_text": "Ising-machine-like Driving Condition Restrictions in SSBM and Additional Pseudo-annealing- Driving Method for SSBM that Achieves Best Cut Value Search -",
  "type": "preprint",
  "updated_at": "2026-10-30T12:34:08Z",
  "url": "https://research.draconitic.com/paper/2wrk85v49zvj3",
  "venue": "arXiv",
  "versions": []
}