{"id":"https://openalex.org/W7170487538","doi":"https://doi.org/10.48550/arxiv.2607.21077","title":"A scalable and resource-efficient pipelined p-computer for probabilistic Ising machines","display_name":"A scalable and resource-efficient pipelined p-computer for probabilistic Ising machines","publication_year":2026,"publication_date":"2026-07-23","ids":{"openalex":"https://openalex.org/W7170487538","doi":"https://doi.org/10.48550/arxiv.2607.21077"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.21077","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.21077","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.21077","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043040203","display_name":"Deborah Volpe","orcid":"https://orcid.org/0000-0003-3364-1114"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Volpe, Deborah","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023090722","display_name":"Eleonora Raimondo","orcid":"https://orcid.org/0000-0002-6512-988X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Raimondo, Eleonora","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084048860","display_name":"Andrea Grimaldi","orcid":"https://orcid.org/0000-0002-8052-0764"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Grimaldi, Andrea","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016666318","display_name":"Pedram Khalili Amiri","orcid":"https://orcid.org/0000-0002-1539-1521"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amiri, Pedram Khalili","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078418112","display_name":"Stefano Chiappini","orcid":"https://orcid.org/0000-0001-9520-7618"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chiappini, Stefano","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107870277","display_name":"Anna Giordano","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Giordano, Anna","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029016493","display_name":"Mario Carpentieri","orcid":"https://orcid.org/0000-0001-5165-5873"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Carpentieri, Mario","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5143586044","display_name":"Hyunsoo Yang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang, Hyunsoo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077966961","display_name":"M. Chiappini","orcid":"https://orcid.org/0000-0001-7433-9435"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chiappini, Massimo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5021617238","display_name":"Giovanni Finocchio","orcid":"https://orcid.org/0000-0002-1043-3876"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Finocchio, Giovanni","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.3901999890804291,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.3901999890804291,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.12280000001192093,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.08709999918937683,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7512000203132629},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7340999841690063},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.40849998593330383},{"id":"https://openalex.org/keywords/memory-bandwidth","display_name":"Memory bandwidth","score":0.39489999413490295},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.3425999879837036},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3422999978065491},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.33480000495910645}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8270999789237976},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7512000203132629},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7340999841690063},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5461999773979187},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.40849998593330383},{"id":"https://openalex.org/C188045654","wikidata":"https://www.wikidata.org/wiki/Q17148339","display_name":"Memory bandwidth","level":2,"score":0.39489999413490295},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3718000054359436},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.3425999879837036},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3422999978065491},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3400000035762787},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.33480000495910645},{"id":"https://openalex.org/C188854837","wikidata":"https://www.wikidata.org/wiki/Q268469","display_name":"Software pipelining","level":3,"score":0.3176000118255615},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.3133000135421753},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.2897000014781952},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C2779602883","wikidata":"https://www.wikidata.org/wiki/Q15544750","display_name":"Memory architecture","level":2,"score":0.28529998660087585},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2784000039100647},{"id":"https://openalex.org/C118524514","wikidata":"https://www.wikidata.org/wiki/Q173212","display_name":"Computer architecture","level":1,"score":0.2630999982357025},{"id":"https://openalex.org/C123657996","wikidata":"https://www.wikidata.org/wiki/Q12271","display_name":"Architecture","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2547000050544739},{"id":"https://openalex.org/C114289077","wikidata":"https://www.wikidata.org/wiki/Q3284399","display_name":"Statistical model","level":2,"score":0.2522999942302704}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.21077","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.21077","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.21077","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.21077","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"score":0.45742523670196533,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Probabilistic":[0],"Ising":[1],"machines":[2],"(PIMs)":[3],"based":[4],"on":[5,152],"probabilistic":[6,76,184],"bits":[7],"offer":[8],"a":[9,49,71,88],"hardware-friendly":[10],"route":[11,180],"to":[12,32,123,171,181],"solve":[13],"combinatorial":[14],"optimization":[15,154,188],"problems,":[16,34],"but":[17],"most":[18],"digital":[19,183],"implementations":[20],"achieve":[21],"high":[22],"throughput":[23],"by":[24],"exploiting":[25],"sparse":[26],"interactions.":[27],"This":[28,67],"limits":[29],"their":[30],"applicability":[31],"dense":[33,149,187],"for":[35,93,148,186],"which":[36,80],"memory":[37,91],"bandwidth":[38],"and":[39,65,84,96,108,110,115,119,155,165],"data":[40],"movement":[41],"become":[42],"the":[43,94,145,172],"dominant":[44],"bottlenecks.":[45],"Here,":[46],"we":[47],"show":[48],"resource-efficient":[50],"pipelined":[51,73],"Field-Programmable":[52],"Gate":[53],"Array":[54],"architecture":[55,68,100],"enabling":[56],"high-throughput":[57],"execution":[58],"of":[59,129],"fully-connected":[60],"PIMs":[61],"while":[62,143],"maintaining":[63],"scalability":[64],"modularity.":[66],"design":[69],"combines":[70],"deeply":[72],"(>20":[74],"stages)":[75],"bit":[77],"update":[78,136],"path,":[79],"overlaps":[81],"spin":[82],"evaluation":[83],"local-field":[85],"updates,":[86],"with":[87,104,113,162],"bandwidth-aware":[89],"on-chip":[90],"organization":[92],"coupling":[95],"bias":[97],"matrices.":[98],"The":[99],"supports":[101],"512":[102],"p-bits":[103,112],"16-bit":[105],"fixed-point":[106],"coefficients":[107],"1024":[109],"2048":[111],"10-bit":[114],"2-bit":[116],"coefficients,":[117],"respectively,":[118],"operates":[120],"at":[121],"up":[122],"300":[124],"MHz.":[125],"At":[126],"fixed":[127],"degree":[128],"parallelization,":[130],"it":[131],"delivers":[132],"an":[133,139,178],"order-of-magnitude":[134],"higher":[135],"rate":[137],"than":[138],"optimized":[140],"non-pipelined":[141,173],"baseline,":[142],"improving":[144],"time-area":[146],"trade-off":[147],"workloads.":[150],"Validation":[151],"portfolio":[153],"low-density":[156],"parity-check":[157],"decoding":[158],"shows":[159],"close":[160],"agreement":[161],"software":[163],"references":[164],"substantial":[166],"reductions":[167],"in":[168],"time-to-solution":[169],"relative":[170],"design,":[174],"establishing":[175],"pipelining":[176],"as":[177],"effective":[179],"scalable":[182],"computing":[185],"problems.":[189]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-25T00:00:00"}