Pith. sign in

REVIEW 4 major objections 5 minor 1 cited by

Probabilistic Computers for MIMO Detection: From Sparsification to 2D Parallel Tempering

T0 review · 4 major / 5 minor · reviewed 2026-08-03 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Sparsified p-bit computers with 2D parallel tempering can decode large MIMO channels near-optimally without manual tuning.

desk verdict Solid on-chip 1D-PT hardware result for 64x64 MIMO, but the abstract overclaims on-chip 2D-PT validation that the body explicitly says does not exist; needs a revision, not a desk reject. read the letter →

arxiv 2601.09037 v2 pith:K7SVJWKU submitted 2026-01-14 cs.ET cond-mat.dis-nncs.DC

M Mahmudul Hasan Sajeeb , Kevin Callahan-Coray , Corentin Delacour , Sanjay Seshan , Tathagata Srimani , Kerem Y. Camsari This is my paper
classification cs.ETcond-mat.dis-nncs.DC
keywords probabilisticcomputingp-bitsMIMOdetectiongraphsparsificationparalleltemperingIsingmachinesFPGAcombinatorialoptimization
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Probabilistic computers built from stochastic p-bits can solve dense combinatorial problems, but the all-to-all connectivity required by real-world instances like MIMO detection has scaled poorly in hardware. This paper argues that graph sparsification with auxiliary copy variables, plus a novel two-dimensional parallel tempering (2D-PT) algorithm that exchanges replicas across both temperature and copy-constraint strength, solves that scaling problem. The authors demonstrate a fully on-chip FPGA solver with 1,920 p-bits that decodes 64×64 BPSK MIMO with bit error rates well below the MMSE baseline in 4.7 ms end-to-end, and show in simulation that 2D-PT converges about 500× faster than optimally tuned 1D parallel tempering on Sherrington-Kirkpatrick spin glasses and reaches zero bit errors on 128×128 MIMO where 1D-PT has an error floor. The central value is that the tuning bottleneck of sparsified Ising machines — the ferromagnetic copy-coupling strength P — is eliminated by the second dimension, making dense optimization practical on sparse hardware.

What carries the argument

The central mechanism is the p-bit update rule combined with graph sparsification: every original node gets a small number of auxiliary 'copy' nodes connected by ferromagnetic couplings of strength P, converting the all-to-all Hamiltonian into a bounded-degree graph. The second key piece is 2D-PT, which places replicas on a two-dimensional grid indexed by inverse temperature β and copy strength P, and performs Metropolis exchanges along both axes. The P-axis swaps let feasible low-energy states from soft-constraint replicas migrate into hard-constraint replicas, enforcing copy agreement while maintaining fast mixing. The FPGA implementation uses 10-bit fixed-point arithmetic, a Taylor approx

What would settle it

On a 256×256 BPSK MIMO instance with two copies per node, run 2D-PT with the adaptive schedule from the paper; if the best decoded BER at 20 dB SNR does not go below the MMSE baseline within 10^5 swaps, or if the copy-agreement percentage in the converged replicas stays below 95%, the claim that sparsification preserves the global optimum landscape is falsified.

Watch

Extended reading notes

Core claim

The paper establishes that dense MIMO detection can be mapped to a sparse p-bit network using auxiliary copy variables, and that a fully on-chip parallel tempering solver on an FPGA — 15 temperature replicas, 1,920 p-bits — decodes 64×64 BPSK MIMO with bit error rates substantially below the MMSE detector, with complete end-to-end solution times of 4.7 ms per instance including all overheads. It then shows that the main weakness of sparsification, the sharp sensitivity to the copy-constraint strength P, is removed by 2D-PT, which swaps replicas along both temperature and P. In simulation, 2D-PT converges about 500× faster than optimally tuned 1D-PT on 64-spin Sherrington–Kirkpatrick spin gla

Load-bearing premise

The load-bearing premise is that sparsifying the all-to-all graph with two auxiliary copies per node and a moderate ferromagnetic coupling P preserves the global optimum landscape closely enough that low-energy sparse states project back to near-optimal dense solutions; if this mapping is biased for larger or denser problems, the BER claims collapse.

Editorial extensions

If this is right

  • If sparsification plus 2D-PT holds, dense Ising problems no longer require dense hardware; sparse chips with fixed-degree routing can scale to thousands of p-bits at constant clock frequency.
  • MIMO detection on 64×64 and 128×128 BPSK channels can be solved near-optimally (BER below MMSE, zero at high SNR) with end-to-end latencies of milliseconds on current FPGAs, and faster on ASICs.
  • The elimination of manual P-tuning makes sparsified Ising machines practical as black-box solvers for other constrained optimization problems, since the 2D-PT schedule is adaptive.
  • Parallel arrays of low-power ASICs (projected around 90–110 MHz and 124–185 mW in 7 nm) could approach the throughput demands of next-generation wireless receivers.
  • The 2D-PT framework applies to any Hamiltonian with a tunable penalty, not just copy constraints in MIMO, potentially generalizing the approach across constrained NP-hard problems.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The 2D-PT idea generalizes beyond sparsification: any optimization with a tunable penalty (e.g., a Lagrange multiplier or regularization strength) could use a second replica axis to anneal both temperature and penalty, making it a general hyperparameter-free annealing scheme.
  • A careful reader should note that the abstract's on-chip 2D-PT validation for 16×16 MIMO is not described in the body's methods or results; the body states the FPGA implements 1D-PT only, so the hardware evidence for 2D-PT currently rests on the simulation results unless that discrepancy is resolved.
  • A natural testable extension is to apply the same sparsification-plus-2D-PT pipeline to non-BPSK MIMO (e.g., QAM) and to channel sizes beyond 128×128, where the copy-variable overhead and P-sensitivity may grow; the paper's own Fig. 4a suggests performance degrades sharply outside an optimal P window, so scaling behavior is an open question.
  • The residual-energy versus swap-budget scaling (power-law at high SNR) suggests the solver's throughput-versus-accuracy trade-off can be tuned per SNR; a practical decoder could choose the number of steps adaptively, and 2D-PT's faster convergence directly buys latency.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper proposes graph sparsification with auxiliary copy variables to make dense optimization problems (MIMO detection, SK spin glasses) tractable for p-bit computers. It reports an FPGA implementation of 1D parallel tempering with 15 replicas of a 128-node sparsified 64×64 MIMO problem (1,920 p-bits) and claims complete end-to-end solution times of 4.7 ms per instance, with BER below MMSE. It also introduces 2D parallel tempering (2D-PT), which exchanges replicas along both temperature and copy-constraint dimensions, and reports simulated speedups over tuned 1D-PT on SK and 128×128 MIMO, plus an abstract-level claim of an on-chip 16×16 MIMO 2D-PT validation. The body states that the FPGA implements only 1D-PT and that 2D-PT results are from Matlab simulation; no on-chip 2D-PT experiment appears in the manuscript.

Significance. If fully substantiated, the fully on-chip 1D-PT FPGA demonstration is a useful engineering result: it shows that sparsification plus on-chip replica exchange can handle dense MIMO instances beyond the size typical of dense p-bit implementations, with claimed end-to-end overhead accounting. The 2D-PT method is conceptually appealing as a way to avoid manual penalty-strength tuning, and the simulated speedups on SK and MIMO are potentially interesting. However, the paper's advertised hardware validation of 2D-PT is contradicted by the body, and the central quantitative claims contain internal inconsistencies. The manuscript also does not provide publicly available code or data, relying on 'available upon request.' The contribution therefore cannot be assessed at its face value until the scope and numbers are corrected.

major comments (4)
  1. [Abstract vs. Section V, final paragraph] The abstract claims 'We further validate 2D-PT entirely on-chip with 54 replicas (1,728 p-bits) on a 16 × 16 MIMO instance' and describes 'two fully on-chip parallel tempering solvers.' Section V explicitly states: 'our current FPGA only implements 1D-PT due to capacity limits' and that the SK and 128×128 MIMO 2D-PT experiments are performed in Matlab simulation. No 16×16 MIMO, 54-replica, or on-chip 2D-PT result appears in the body, figures, or Methods. This is not a minor presentation issue: the paper's advertised central hardware claim is unsupported. The abstract, conclusion, and any title-level framing must be revised to state that 2D-PT is validated in simulation only.
  2. [Section V, Methods B, Eq. (12)] The paper claims 2D-PT is 'tuning-free' or removes manual parameter optimization, but the adaptive schedule uses hyperparameters αβ and αP that are 'initially tuned on a single instance,' and the final β and P schedules are averaged over 10 instances. No sensitivity analysis is provided for αβ, αP, or the stopping thresholds. Without such analysis, the reported 500× speedup and 10× MIMO acceleration could reflect the hand-selected schedules rather than the method itself. A concrete test would be to vary αβ and αP over a reasonable range and report the distribution of residual energy/BER, or to fix the parameters across problem sizes and instance distributions.
  3. [Abstract, Section III, Section V] The quantitative claims are mutually inconsistent across the front matter and body. The front-matter abstract cites 1,408 p-bits and 3 ms/instance; the body says 1,920 p-bits and 4.7 ms/instance. The abstract reports ~250× faster 2D-PT convergence; Section V reports 500×. The body also says timing is averaged over 13,000 instances, while the BER results are averaged over 100 channels × 10 transmitted vectors = 1,000 instances. These numbers are headline results and must be reconciled or clearly labeled as different configurations/versions.
  4. [Section V, Fig. 5a] For the 128×128 MIMO 2D-PT result, BER = 0 at high SNR is reported for 200 channels and 10 transmitted symbols per channel, which is 256,000 bits. On a finite test set, BER = 0 only provides an upper bound (roughly < 1.2×10^-5 at 95% confidence). The paper should state this bound and, ideally, report the number of bit errors or the confidence interval rather than a literal zero, especially when comparing with 1D-PT's error floor near 10^-5.
minor comments (5)
  1. [Section III, Fig. 2] The caption states 'all timing values are averaged over 13,000 instances,' but the text says results are averaged over 100 channel realizations each decoding 10 transmitted vectors, i.e., 1,000 instances. Please correct the count or clarify what was measured.
  2. [Section IV, Abstract] The abstract mentions ASIC projections of 103 MHz and 285.8 mW for the 16×16 2D-PT design, while Section IV gives 89 MHz and 185.2 mW for the 64×64 1D-PT design. The relationship between these projections is not discussed in the body, and the 16×16 ASIC results are absent. Clarify which design each projection refers to.
  3. [Section V, Table II] The table reports β and P schedules with inconsistent decimal precision (e.g., 0.500 vs. 0.801 vs. 24.6). Use a consistent format and indicate the number of significant digits. Also note that the MIMO P column has 13 entries, matching the 13 columns, but the β column has 16 entries; this should be explicitly stated in the caption.
  4. [Methods A, Eq. (9)] The base-2 exponential approximation uses a floor operation in the exponent but the subsequent 'fractional multiplication factor 23/16' description is unclear. Please define the approximation precisely so that the fixed-point implementation can be reproduced.
  5. [Section V, Fig. 4c] The text says 2D-PT finds 'constrained ground states (ρ=0)' in fewer than 1,000 swaps. The figure shows residual energy down to 10^-6, not exactly zero. Specify whether ρ=0 is exact, within numerical tolerance, or a statistical statement.

Circularity Check

3 steps flagged · score 3.0 of 10

Moderate circularity: 2D-PT's 'tuning-free' claim relies on a self-cited adaptive schedule with fitted hyperparameters, and the abstract's on-chip 2D-PT claim is contradicted by the body's own limitation statement.

  1. self citation load bearing [Section V, first paragraph; Section VII.B, Methods]
    "we use Two-Dimensional Parallel Tempering (2D-PT) [26], which automatically enforces hard constraints in the latest replicas, while benefiting from fast-mixing replicas having small to medium penalty strengths. ... The β and P schedules for 2D-PT are determined iteratively using the adaptive algorithm proposed in Ref. [26]."

    The central algorithmic novelty—2D-PT and its adaptive scheduling—is imported from a same-author prior publication (Ref. [26]) rather than derived or independently verified here. The paper's headline 'tuning-free' framework is therefore load-bearing on that self-citation. The new simulations apply the method rather than establish it, so the core premise is not fully independent.

  2. fitted input called prediction [Section VII.B, Methods; Section V, experiments in Fig. 4/5]
    "The step parameters αβ and αP were initially tuned on a single instance to ensure a minimum of 10 values in each direction. For the experiments shown in FIG. 4 and FIG. 5, the final schedules are averaged over 10 instances of SK and MIMO problems (Table II)."

    The reported 2D-PT speedups and 'no manual tuning' claims are obtained after explicitly fitting αβ and αP on a single instance and averaging schedules over 10 random instances. This is a genuine tuning step buried in the methods. Because the performance curves are then presented as predictions, the claim of tuning-free acceleration is partly a restatement of a fitted schedule; however, evaluation on separate instances means the result is not fully statistically forced.

1 more flagged steps
  1. other [Abstract vs Section V, final paragraph]
    "We further validate 2D-PT entirely on-chip with 54 replicas (1,728 p-bits) on a 16 × 16 MIMO instance ... While our current FPGA only implements 1D-PT due to capacity limits, its modular architecture ... is designed to support 2D-PT in future ASIC implementations."

    This is not a circular derivation but a direct missing-support contradiction: the abstract claims an on-chip 2D-PT validation that the body explicitly says was not implemented. No 16×16/54-replica on-chip 2D-PT experiment or data appear in the body, so the flagship hardware claim is unsupported by the presented evidence.

full rationale

The MIMO-to-Ising mapping (Eq. 1–3), the FPGA 1D-PT implementation (Section III, Methods A), and the MMSE baseline are self-contained and benchmarked externally, so no circularity arises there. The 2D-PT results do not reduce entirely to their inputs by construction: the schedules are fitted on a small set and evaluated on independent instances, and the SK/MIMO simulations are newly reported. However, the 'tuning-free' claim is weakened because αβ and αP were explicitly tuned and schedules averaged over instances (Methods B), and the 2D-PT concept and adaptive algorithm are cited from same-group Ref. [26], making the self-citation load-bearing for the main algorithmic conclusion. Separately, the abstract's on-chip 2D-PT validation is contradicted by Section V's statement that the current FPGA implements only 1D-PT; this is a missing-support/correctness problem rather than a circularity, but it should be flagged and weighed. Overall, the circularity burden is moderate, not severe: no central result is the direct renaming of a fitted parameter, and the hardware/1D-PT contributions are independent. Score 3.

Assumptions & free parameters 5 free parameters · 5 assumptions · 1 invented entities

The paper's contribution rests on a sparsification assumption (finite-P copies preserve the original landscape), on hand-tuned schedule parameters (P, αβ, αP, replica counts, sweeps), and on hardware approximation assumptions (fixed-point, Taylor exp). The 2D-PT method itself is new but is self-cited from Ref. 26; its validation in this paper is partly simulated. The 1D-PT baseline is idealized as budget-optimized P, which is fair but means the 'without manual tuning' claim is contrastive rather than fully parameter-free.

free parameters (5)
  • Copy strength P = P=3.5 for 1D-PT 64x64 MIMO; P-ladder 0.5-2.05 (SK), 0.8-9.44 (MIMO); per-budget optimum P~1.25-1.5 in Fig. 4a
    The central tuning knob: weak P causes copy disagreement, strong P traps local minima; performance is sharply sensitive to P (Fig. 4a). The 2D-PT ladder still requires choosing the range and endpoints, and 1D-PT comparisons use budget-optimized P.
  • Number of copies per node = 2 copies (3 copies mentioned in abstract of previous version? Text uses 2 copies; abstract of arXiv says 2)
    The sparsification ratio is a design choice; results are shown only for 2-copy sparsification, and the residual energy, BER, and P-sensitivity depend on it.
  • Adaptive schedule parameters αβ, αP = αβ=2.5, αP=0.4 (SK); αβ=1.25, αP=0.75 (MIMO); 'initially tuned on a single instance'
    The 2D-PT β and P schedules are produced by an adaptive algorithm whose step sizes are manually tuned; final schedules are then averaged over 10 instances. This is a hand-tuned ingredient in the headline algorithm.
  • Temperature ladder endpoints and replica count = 15 replicas for 1D; 10x10 for SK 2D; 16x13 for MIMO 2D; 15β in Table II
    Replica count and β range determine the quality of parallel tempering; the adaptive algorithm stops row expansion when σE falls below a threshold (one-tenth of mean weight amplitude), a heuristic choice.
  • Number of sweeps per swap = 100 sweeps per swap (1D-PT, Fig. 2; SK Fig. 4), 5 sweeps per swap (MIMO 2D, Fig. 5), 50 MC steps (16x16 on-chip)
    The sweep-to-swap ratio is a chosen hyperparameter affecting mixing and runtime; different values are used in different experiments.
assumptions (5)
  • domain assumption The sparsified graph with two ferromagnetically-coupled copies per node preserves the global optima of the original dense Ising problem for finite P.
    Central to the whole approach; if copy-disagreement at finite P (or the P=∞ limit's landscape) misrepresents the original problem, the BER claims fail. The paper acknowledges P-sensitivity in Section I and Fig. 4a.
  • standard math The p-bit update (Eq. 3) samples from the Boltzmann distribution and the Metropolis swap rule (Eq. 8) is sufficiently accurate for 2D-PT mixing.
    Standard stochastic p-bit/physics assumption from Refs. 27, 30, 31; used throughout.
  • domain assumption The 10-bit fixed-point quantization of Jij and hi, the Taylor approximation of exp (Eq. 9), and approximate swap acceptance do not bias results materially.
    Hardware approximation chosen for area; the paper does not quantify the error introduced versus floating-point simulations.
  • domain assumption The 1D-PT baseline is fairly represented by using the budget-optimized P for each swap count.
    The claimed speedup depends on this baseline; it is stated that each 1D-PT point uses its best P, which is a fair but idealized baseline, while 2D-PT does not tune per-budget.
  • ad hoc to paper The adaptive schedule from Ref. 26 produces near-optimal β/P ladders for the MIMO and SK problems.
    Schedules are averaged over 10 instances with αβ/αP tuned on a single instance; no theorem guarantees schedule quality, and the method is self-cited (Ref. 26).
invented entities (1)
  • Two-dimensional replica array with P-swaps (2D-PT) independent evidence
    purpose: Eliminates manual copy-constraint tuning by exchanging states along both temperature and constraint dimensions.
    It is a new algorithmic construct; independent evidence is the reproducible SK/MIMO simulation results and the 16x16 FPGA run, which are falsifiable against other solvers. It is not a physical entity but a new algorithmic object.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Probabilistic Computers for MIMO Detection: From Sparsification to 2D Parallel Tempering." pith.science (2026). https://pith.science/paper/K7SVJWKU

@misc{pith2026260109037,
  author       = {Pith},
  title        = {Pith review of: Probabilistic Computers for MIMO Detection: From Sparsification to 2D Parallel Tempering},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/K7SVJWKU}},
  note         = {Machine review of arXiv:2601.09037}
}
abstract

Probabilistic computers built from p-bits offer a promising path for combinatorial optimization, but the dense connectivity required by real-world problems scales poorly in hardware. Here, we address this through graph sparsification with auxiliary copy variables and demonstrate two fully on-chip parallel tempering solvers on an FPGA. Targeting MIMO detection, a dense, NP-hard problem central to wireless communications, we first fit 11 temperature replicas of a 128-node sparsified system (1,408 p-bits) on-chip and achieve bit error rates significantly below conventional linear detectors on $64 \times 64$ BPSK MIMO. We report complete end-to-end solution times of 3~ms per instance, including all loading, sampling, readout, and verification overheads. ASIC projections in 7~nm technology indicate 103~MHz operation at 285.8~mW, suggesting that massive parallelism across multiple chips could approach the throughput demands of next-generation wireless systems. Sparsification, however, introduces a sharp sensitivity to the copy-constraint strength $P$ that requires manual tuning. To eliminate this bottleneck, we utilize Two-Dimensional Parallel Tempering (2D-PT), which exchanges replicas across both temperature ($\beta$) and constraint ($P$) dimensions. On Sherrington--Kirkpatrick spin glasses, 2D-PT converges roughly $250\times$ faster than optimally tuned 1D-PT, and on $128 \times 128$ MIMO it reaches zero bit errors at high SNR where 1D-PT exhibits an error floor. We further validate 2D-PT entirely on-chip with 54 replicas (1,728 p-bits) on a $16 \times 16$ MIMO instance, where it tracks the maximum-likelihood bound in just 50 Monte Carlo steps -- $10\times$ fewer than 1D-PT -- at projected 111~MHz and 124~mW in 7~nm. Together, these results establish an on-chip p-bit architecture and a scalable, tuning-free algorithmic framework for dense combinatorial optimization.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Performance of QUBO-Formulated MIMO Detection Under Hardware Precision Constraints

    cs.IT 2026-05 unverdicted novelty 6.0 of 10

    Heterogeneous quantization of QUBO matrix entries in MIMO detection preserves full-precision bit error rates with significantly fewer bits than uniform quantization.

Reference graph

Works this paper leans on

35 extracted references · 3 linked inside Pith · cited by 1 Pith paper

  1. [1]

    Probabilistic computers for neural quantum states.arXiv preprint arXiv:2512.24558, 2025

    Shuvro Chowdhury, Jasper Pieterse, Navid Anjum Aadit, Johan H Mentink, and Kerem Y Camsari. Probabilistic computers for neural quantum states.arXiv preprint arXiv:2512.24558, 2025

    arXiv 2025

  2. [2]

    Ising machines as hardware solvers of combinatorial optimization problems.Nature Reviews Physics, 4(6):363–379, 2022

    Naeimeh Mohseni, Peter L McMahon, and Tim Byrnes. Ising machines as hardware solvers of combinatorial optimization problems.Nature Reviews Physics, 4(6):363–379, 2022

    2022

  3. [3]

    Quantum annealing with manufactured spins.Nature, 473(7346):194– 198, 2011

    Mark W Johnson, Mohammad HS Amin, Suzanne Gildert, Trevor Lanting, Firas Hamze, Neil Dickson, Richard Harris, Andrew J Berkley, Jan Johansson, Paul Bunyk, et al. Quantum annealing with manufactured spins.Nature, 473(7346):194– 198, 2011

    2011

  4. [4]

    Quantum critical dynamics in a 5,000-qubit programmable spin glass.Nature, 617(7959):61–66, 2023

    Andrew D King, Jack Raymond, Trevor Lanting, Richard Harris, Alex Zucca, Fabio Altomare, Andrew J Berkley, Kelly Boothby, Sara Ejtemaee, Colin Enderud, et al. Quantum critical dynamics in a 5,000-qubit programmable spin glass.Nature, 617(7959):61–66, 2023

    2023

  5. [5]

    A fully programmable 100-spin coherent Ising machine with all- to-all connections.Science, 354(6312):614–617, 2016

    Peter L McMahon, Alireza Marandi, Yoshitaka Haribara, Ryan Hamerly, Carsten Langrock, Shuhei Tamate, Takahiro Inagaki, Hiroki Takesue, Shoko Utsunomiya, Kazuyuki Aihara, et al. A fully programmable 100-spin coherent Ising machine with all- to-all connections.Science, 354(6312):614–617, 2016

    2016

  6. [6]

    100,000-spin coherent Ising machine.Science Advances, 7(40):eabh0952, October

    Toshimori Honjo, Tomohiro Sonobe, Kensuke Inaba, Takahiro Inagaki, Takuya Ikuta, Yasuhiro Yamada, Takushi Kazama, Koji Enbutsu, Takeshi Umeki, Ryoichi Kasahara, Ken-ichi Kawarabayashi, and Hiroki Takesue. 100,000-spin coherent Ising machine.Science Advances, 7(40):eabh0952, October

  7. [7]

    Fahimi, M

    Z. Fahimi, M. R. Mahmoodi, H. Nili, Valentin Polishchuk, and D. B. Strukov. Combinatorial optimization by weight annealing in memristive hopfield networks.Scientific Reports, 11(1): 16383, August 2021. ISSN 2045-2322

    2021

  8. [8]

    Efficient combinatorial optimization by quantum-inspired parallel annealing in analogue memristor crossbar.Nature Communications, 14(1):5927, September 2023

    Mingrui Jiang, Keyi Shan, Chengping He, and Can Li. Efficient combinatorial optimization by quantum-inspired parallel annealing in analogue memristor crossbar.Nature Communications, 14(1):5927, September 2023. ISSN 2041- 1723

    2023

Show all 35 references
  1. [9]

    A hardware demonstration of a universal programmable rram-based probabilistic computer for molecular docking.Nature Communications, 2025

    Yihan He, Ming-Chun Hong, Qiming Ding, Chih-Sheng Lin, Chih-Ming Lai, Chao Fang, Xiao Gong, Tuo-Hung Hou, and Gengchiau Liang. A hardware demonstration of a universal programmable rram-based probabilistic computer for molecular docking.Nature Communications, 2025

    2025

  2. [10]

    Using 9 synchronized oscillators to compute the maximum independent set.Nature communications, 11(1):1–7, 2020

    Antik Mallick, Mohammad Khairul Bashar, Daniel S Truesdell, Benton H Calhoun, Siddharth Joshi, and Nikhil Shukla. Using 9 synchronized oscillators to compute the maximum independent set.Nature communications, 11(1):1–7, 2020

    2020

  3. [11]

    A 1,968-node coupled ring oscillator circuit for combinatorial optimization problem solving.Nature Electronics, 5(5):310–317, 2022

    William Moy, Ibrahim Ahmed, Po-wei Chiu, John Moy, Sachin S Sapatnekar, and Chris H Kim. A 1,968-node coupled ring oscillator circuit for combinatorial optimization problem solving.Nature Electronics, 5(5):310–317, 2022

    2022

  4. [12]

    An ising solver chip based on coupled ring oscillators with a 48-node all-to-all connected array architecture.Nature Electronics, 6(10):771–778, 2023

    Hao Lo, William Moy, Hanzhao Yu, Sachin Sapatnekar, and Chris H Kim. An ising solver chip based on coupled ring oscillators with a 48-node all-to-all connected array architecture.Nature Electronics, 6(10):771–778, 2023

    2023

  5. [13]

    An integrated coupled oscillator network to solve optimization problems

    Markus Graber and Klaus Hofmann. An integrated coupled oscillator network to solve optimization problems. Communications Engineering, 3(1):116, Aug 2024. ISSN 2731-3395

    2024

  6. [14]

    Minor-embedding in adiabatic quantum computation: II

    Vicky Choi. Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design.Quantum Information Processing, 10(3):343–353, 2011

    2011

  7. [15]

    Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102,400 nodes.arXiv preprint arXiv:2004.03819, 2020

    Yuya Sugie, Yuki Yoshida, Normann Mertig, Takashi Takemoto, Hiroshi Teramoto, Atsuyoshi Nakamura, Ichigaku Takigawa, Shin-ichi Minato, Masanao Yamaoka, and Tamiki Komatsuzaki. Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to ...

    2004 arXiv

  8. [16]

    Ryan Hamerly, Takahiro Inagaki, Peter L. McMahon, Davide Venturelli, Alireza Marandi, Tatsuhiro Onodera, Edwin Ng, Carsten Langrock, Kensuke Inaba, Toshimori Honjo, Koji Enbutsu, Takeshi Umeki, Ryoichi Kasahara, Shoko Utsunomiya, Satoshi Kako, Ken-ichi Kawarabayashi, Robert L....

    2019

  9. [17]

    Massively parallel probabilistic computing with sparse ising machines.Nature Electronics, 5(7):460–468, 2022

    Navid Anjum Aadit, Andrea Grimaldi, Mario Carpentieri, Luke Theogarajan, John M Martinis, Giovanni Finocchio, and Kerem Y Camsari. Massively parallel probabilistic computing with sparse ising machines.Nature Electronics, 5(7):460–468, 2022

    2022

  10. [18]

    Scalable connectivity for Ising machines: Dense to sparse.Physical Review Applied, 24(1):014005, 2025

    M Mahmudul Hasan Sajeeb, Navid Anjum Aadit, Shuvro Chowdhury, Tong Wu, Cesely Smith, Dhruv Chinmay, Atharva Raut, Kerem Y Camsari, Corentin Delacour, and Tathagata Srimani. Scalable connectivity for Ising machines: Dense to sparse.Physical Review Applied, 24(1):014005, 2025

    2025

  11. [19]

    Ising machines’ dynamics and regularization for near-optimal MIMO detection.IEEE Transactions on Wireless Communications, 21(12):11080–11094, 2022

    Abhishek Kumar Singh, Kyle Jamieson, Peter L McMahon, and Davide Venturelli. Ising machines’ dynamics and regularization for near-optimal MIMO detection.IEEE Transactions on Wireless Communications, 21(12):11080–11094, 2022

    2022

  12. [20]

    Uplink MIMO detection using Ising machines: A multi-stage Ising approach.IEEE Transactions on Wireless Communications, 2024

    Abhishek Kumar Singh, Ari Kapelyan, Minsung Kim, Davide Venturelli, Peter L McMahon, and Kyle Jamieson. Uplink MIMO detection using Ising machines: A multi-stage Ising approach.IEEE Transactions on Wireless Communications, 2024

    2024

  13. [21]

    MU-MIMO Detection Using Oscillator Ising Machines

    Shreesha Sreedhara, Jaijeet Roychowdhury, Joachim Wabnig, and Pavan Koteshwar Srinath. MU-MIMO Detection Using Oscillator Ising Machines. In2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD), pages 1–9. IEEE, 2023

    2023

  14. [22]

    Das: Implementing dense ising machines using sparse resistive networks

    Naomi Sagan and Jaijeet Roychowdhury. Das: Implementing dense ising machines using sparse resistive networks. In Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design, pages 1–9, 2022

    2022

  15. [23]

    MIMO with analogue 1-bit phase shifters: A quantum annealing perspective.IEEE Wireless Communications Letters, 13(6):1571–1575, 2024

    Ioannis Krikidis. MIMO with analogue 1-bit phase shifters: A quantum annealing perspective.IEEE Wireless Communications Letters, 13(6):1571–1575, 2024

    2024

  16. [24]

    X-ResQ: Reverse annealing for quantum MIMO detection with flexible parallelism.arXiv preprint arXiv:2402.18778, 2024

    Minsung Kim, Abhishek Kumar Singh, Davide Venturelli, John Kaewell, and Kyle Jamieson. X-ResQ: Reverse annealing for quantum MIMO detection with flexible parallelism.arXiv preprint arXiv:2402.18778, 2024

    2024 arXiv

  17. [25]

    Self-adaptive ising machines for constrained optimization

    Corentin Delacour. Self-adaptive ising machines for constrained optimization. In2025 Design, Automation & Test in Europe Conference (DATE), pages 1–7. IEEE, 2025

    2025

  18. [26]

    Two-dimensional parallel tempering for constrained optimization.Physical Review E, 112 (2):L023301, 2025

    Corentin Delacour, M Mahmudul Hasan Sajeeb, Jo ˜ao P Hespanha, and Kerem Y Camsari. Two-dimensional parallel tempering for constrained optimization.Physical Review E, 112 (2):L023301, 2025

    2025

  19. [27]

    Stochastic p-bits for invertible logic.Physical Review X, 7(3):031014, 2017

    Kerem Yunus Camsari, Rafatul Faria, Brian M Sutton, and Supriyo Datta. Stochastic p-bits for invertible logic.Physical Review X, 7(3):031014, 2017

    2017

  20. [28]

    Turbo multiuser detection: An overview

    H Vincent Poor. Turbo multiuser detection: An overview. In 2000 IEEE Sixth International Symposium on Spread Spectrum Techniques and Applications. ISSTA 2000. Proceedings (Cat. No. 00TH8536), volume 2, pages 583–587. IEEE, 2000

    2000

  21. [29]

    Cambridge university press, 1998

    Sergio Verdu.Multiuser detection. Cambridge university press, 1998

    1998

  22. [30]

    Replica monte carlo simulation of spin glasses.Physical review letters, 57(21): 2607–2609, 1986

    Robert H Swendsen and Jian-Sheng Wang. Replica monte carlo simulation of spin glasses.Physical review letters, 57(21): 2607–2609, 1986

    1986

  23. [31]

    Exchange monte carlo method and application to spin glass simulations.Journal of the Physical Society of Japan, 65(6):1604–1608, 1996

    Koji Hukushima and Koji Nemoto. Exchange monte carlo method and application to spin glass simulations.Journal of the Physical Society of Japan, 65(6):1604–1608, 1996

    1996

  24. [32]

    Accelerating Adaptive Parallel Tempering with FPGA-based p-bits

    Navid Anjum Aadit, Masoud Mohseni, and Kerem Y Camsari. Accelerating Adaptive Parallel Tempering with FPGA-based p-bits. In2023 IEEE Symposium on VLSI Technology and Circuits (VLSI Technology and Circuits), pages 1–2. IEEE, 2023

    2023

  25. [33]

    All-to-all reconfigurability with sparse and higher-order ising machines.Nature Communications, 15(1):8977, 2024

    Srijan Nikhar, Sidharth Kannan, Navid Anjum Aadit, Shuvro Chowdhury, and Kerem Y Camsari. All-to-all reconfigurability with sparse and higher-order ising machines.Nature Communications, 15(1):8977, 2024

    2024

  26. [34]

    Asap7: A 7-nm finfet predictive process design kit.Microelectronics Journal, 53:105–115, 2016

    Lawrence T Clark, Vinay Vashishtha, Lucian Shifren, Aditya Gujja, Saurabh Sinha, Brian Cline, Chandarasekaran Ramamurthy, and Greg Yeric. Asap7: A 7-nm finfet predictive process design kit.Microelectronics Journal, 53:105–115, 2016

    2016

  27. [35]

    mflowgen: A modular flow generator and ecosystem for community-driven physical design

    Alex Carsello, James Thomas, Ankita Nayak, Po-Han Chen, Mark Horowitz, Priyanka Raina, and Christopher Torng. mflowgen: A modular flow generator and ecosystem for community-driven physical design. InProceedings of the 59th ACM/IEEE Design Automation Conference, pages 1339–1342, 2022

    2022

Pith tools

Reviewed August 3, 2026 · model on record in the stance chip above.