A Closeness Centrality-based Circuit Partitioner for Quantum Simulations Article Swipe

PDF

Doru Thom Popovici , Harlin Lee , Mauro Del Ben , Nobuyasu Ito , Katherine Klymko , Daan Camps ·

YOU? · · 2025 · Open Access · · DOI: https://doi.org/10.48550/arxiv.2509.14098

Simulating quantum circuits (QC) on high-performance computing (HPC) systems has become an essential method to benchmark algorithms and probe the potential of large-scale quantum computation despite the limitations of current quantum hardware. However, these simulations often require large amounts of resources, necessitating the use of large clusters with thousands of compute nodes and large memory footprints. In this work, we introduce an end-to-end framework that provides an efficient partitioning scheme for large-scale QCs alongside a flexible code generator to offer a portable solution that minimizes data movement between compute nodes. By formulating the distribution of quantum states and circuits as a graph problem, we apply closeness centrality to assess gate importance and design a fast, scalable partitioning method. The resulting partitions are compiled into highly optimized codes that run seamlessly on a wide range of supercomputers, providing critical insights into the performance and scalability of quantum algorithm simulations.

Related Topics

2025 Fide Circuit

Circuit De Spa-Francorchamps

Silverstone Circuit

Integrated Circuit

United States Court Of Appeals For The Ninth Circuit

Printed Circuit Board

Short Circuit (1986 Film)

Monza Circuit

Closed-Circuit Television

2024 Fide Circuit

Circuit De La Sarthe

United States Court Of Appeals For The Fourth Circuit

Concepts

No concepts available.

Metadata

Type: preprint
Language: en
Landing Page: http://arxiv.org/abs/2509.14098
PDF: https://arxiv.org/pdf/2509.14098
OA Status: green
OpenAlex ID: https://openalex.org/W4417080445

All OpenAlex metadata

Raw OpenAlex JSON

OpenAlex ID: https://openalex.org/W4417080445

Canonical identifier for this work in OpenAlex
DOI: https://doi.org/10.48550/arxiv.2509.14098

Digital Object Identifier
Title: A Closeness Centrality-based Circuit Partitioner for Quantum Simulations

Work title
Type: preprint

OpenAlex work type
Language: en

Primary language
Publication year: 2025

Year of publication
Publication date: 2025-09-17

Full publication date if available
Authors: Doru Thom Popovici, Harlin Lee, Mauro Del Ben, Nobuyasu Ito, Katherine Klymko, Daan Camps

List of authors in order
Landing page: https://arxiv.org/abs/2509.14098

Publisher landing page
PDF URL: https://arxiv.org/pdf/2509.14098

Direct link to full text PDF
Open access: Yes

Whether a free full text is available
OA status: green

Open access status per OpenAlex
OA URL: https://arxiv.org/pdf/2509.14098

Direct OA link when available
Cited by: 0

Total citation count in OpenAlex

Full payload

id	https://openalex.org/W4417080445
doi	https://doi.org/10.48550/arxiv.2509.14098
ids.doi	https://doi.org/10.48550/arxiv.2509.14098
ids.openalex	https://openalex.org/W4417080445
fwci
type	preprint
title	A Closeness Centrality-based Circuit Partitioner for Quantum Simulations
biblio.issue
biblio.volume
biblio.last_page
biblio.first_page
is_xpac	False
apc_list
apc_paid
language	en
locations[0].id	pmh:oai:arXiv.org:2509.14098
locations[0].is_oa	True
locations[0].source.id	https://openalex.org/S4306400194
locations[0].source.issn
locations[0].source.type	repository
locations[0].source.is_oa	True
locations[0].source.issn_l
locations[0].source.is_core	False
locations[0].source.is_in_doaj	False
locations[0].source.display_name	arXiv (Cornell University)
locations[0].source.host_organization	https://openalex.org/I205783295
locations[0].source.host_organization_name	Cornell University
locations[0].source.host_organization_lineage	https://openalex.org/I205783295
locations[0].license
locations[0].pdf_url	https://arxiv.org/pdf/2509.14098
locations[0].version	submittedVersion
locations[0].raw_type	text
locations[0].license_id
locations[0].is_accepted	False
locations[0].is_published	False
locations[0].raw_source_name
locations[0].landing_page_url	http://arxiv.org/abs/2509.14098
locations[1].id	doi:10.48550/arxiv.2509.14098
locations[1].is_oa	True
locations[1].source.id	https://openalex.org/S4306400194
locations[1].source.issn
locations[1].source.type	repository
locations[1].source.is_oa	True
locations[1].source.issn_l
locations[1].source.is_core	False
locations[1].source.is_in_doaj	False
locations[1].source.display_name	arXiv (Cornell University)
locations[1].source.host_organization	https://openalex.org/I205783295
locations[1].source.host_organization_name	Cornell University
locations[1].source.host_organization_lineage	https://openalex.org/I205783295
locations[1].license
locations[1].pdf_url
locations[1].version
locations[1].raw_type	article
locations[1].license_id
locations[1].is_accepted	False
locations[1].is_published
locations[1].raw_source_name
locations[1].landing_page_url	https://doi.org/10.48550/arxiv.2509.14098
indexed_in	arxiv, datacite
authorships[0].author.id	https://openalex.org/A5019066795
authorships[0].author.orcid	https://orcid.org/0000-0002-7271-8092
authorships[0].author.display_name	Doru Thom Popovici
authorships[0].author_position	first
authorships[0].raw_author_name	Popovici, Doru Thom
authorships[0].is_corresponding	False
authorships[1].author.id	https://openalex.org/A5055567952
authorships[1].author.orcid	https://orcid.org/0000-0001-6128-9942
authorships[1].author.display_name	Harlin Lee
authorships[1].author_position	middle
authorships[1].raw_author_name	Lee, Harlin
authorships[1].is_corresponding	False
authorships[2].author.id	https://openalex.org/A5022982818
authorships[2].author.orcid	https://orcid.org/0000-0003-0755-4797
authorships[2].author.display_name	Mauro Del Ben
authorships[2].author_position	middle
authorships[2].raw_author_name	Del Ben, Mauro
authorships[2].is_corresponding	False
authorships[3].author.id	https://openalex.org/A5006054960
authorships[3].author.orcid	https://orcid.org/0000-0001-6934-8898
authorships[3].author.display_name	Nobuyasu Ito
authorships[3].author_position	middle
authorships[3].raw_author_name	Ito, Nobuyasu
authorships[3].is_corresponding	False
authorships[4].author.id	https://openalex.org/A5034924651
authorships[4].author.orcid	https://orcid.org/0000-0002-4158-5776
authorships[4].author.display_name	Katherine Klymko
authorships[4].author_position	last
authorships[4].raw_author_name	Klymko, Katherine
authorships[4].is_corresponding	False
authorships[5].author.id	https://openalex.org/A5015674933
authorships[5].author.orcid	https://orcid.org/0000-0003-0236-4353
authorships[5].author.display_name	Daan Camps
authorships[5].author_position	middle
authorships[5].raw_author_name	Camps, Daan
authorships[5].is_corresponding	False
has_content.pdf	False
has_content.grobid_xml	False
is_paratext	False
open_access.is_oa	True
open_access.oa_url	https://arxiv.org/pdf/2509.14098
open_access.oa_status	green
open_access.any_repository_has_fulltext	False
created_date	2025-10-10T00:00:00
display_name	A Closeness Centrality-based Circuit Partitioner for Quantum Simulations
has_fulltext	False
is_retracted	False
updated_date	2025-12-06T16:51:01.723491
primary_topic
cited_by_count	0
locations_count	2
best_oa_location.id	pmh:oai:arXiv.org:2509.14098
best_oa_location.is_oa	True
best_oa_location.source.id	https://openalex.org/S4306400194
best_oa_location.source.issn
best_oa_location.source.type	repository
best_oa_location.source.is_oa	True
best_oa_location.source.issn_l
best_oa_location.source.is_core	False
best_oa_location.source.is_in_doaj	False
best_oa_location.source.display_name	arXiv (Cornell University)
best_oa_location.source.host_organization	https://openalex.org/I205783295
best_oa_location.source.host_organization_name	Cornell University
best_oa_location.source.host_organization_lineage	https://openalex.org/I205783295
best_oa_location.license
best_oa_location.pdf_url	https://arxiv.org/pdf/2509.14098
best_oa_location.version	submittedVersion
best_oa_location.raw_type	text
best_oa_location.license_id
best_oa_location.is_accepted	False
best_oa_location.is_published	False
best_oa_location.raw_source_name
best_oa_location.landing_page_url	http://arxiv.org/abs/2509.14098
primary_location.id	pmh:oai:arXiv.org:2509.14098
primary_location.is_oa	True
primary_location.source.id	https://openalex.org/S4306400194
primary_location.source.issn
primary_location.source.type	repository
primary_location.source.is_oa	True
primary_location.source.issn_l
primary_location.source.is_core	False
primary_location.source.is_in_doaj	False
primary_location.source.display_name	arXiv (Cornell University)
primary_location.source.host_organization	https://openalex.org/I205783295
primary_location.source.host_organization_name	Cornell University
primary_location.source.host_organization_lineage	https://openalex.org/I205783295
primary_location.license
primary_location.pdf_url	https://arxiv.org/pdf/2509.14098
primary_location.version	submittedVersion
primary_location.raw_type	text
primary_location.license_id
primary_location.is_accepted	False
primary_location.is_published	False
primary_location.raw_source_name
primary_location.landing_page_url	http://arxiv.org/abs/2509.14098
publication_date	2025-09-17
publication_year	2025
referenced_works_count	0
abstract_inverted_index.a	74, 80, 100, 113, 131
abstract_inverted_index.By	90
abstract_inverted_index.In	56
abstract_inverted_index.an	11, 61, 66
abstract_inverted_index.as	99
abstract_inverted_index.of	21, 28, 39, 44, 49, 94, 134, 144
abstract_inverted_index.on	4, 130
abstract_inverted_index.to	14, 78, 107
abstract_inverted_index.we	59, 103
abstract_inverted_index.QCs	72
abstract_inverted_index.The	118
abstract_inverted_index.and	17, 52, 97, 111, 142
abstract_inverted_index.are	121
abstract_inverted_index.for	70
abstract_inverted_index.has	9
abstract_inverted_index.run	128
abstract_inverted_index.the	19, 26, 42, 92, 140
abstract_inverted_index.use	43
abstract_inverted_index.(QC)	3
abstract_inverted_index.code	76
abstract_inverted_index.data	85
abstract_inverted_index.gate	109
abstract_inverted_index.into	123, 139
abstract_inverted_index.that	64, 83, 127
abstract_inverted_index.this	57
abstract_inverted_index.wide	132
abstract_inverted_index.with	47
abstract_inverted_index.(HPC)	7
abstract_inverted_index.apply	104
abstract_inverted_index.codes	126
abstract_inverted_index.fast,	114
abstract_inverted_index.graph	101
abstract_inverted_index.large	37, 45, 53
abstract_inverted_index.nodes	51
abstract_inverted_index.offer	79
abstract_inverted_index.often	35
abstract_inverted_index.probe	18
abstract_inverted_index.range	133
abstract_inverted_index.these	33
abstract_inverted_index.work,	58
abstract_inverted_index.assess	108
abstract_inverted_index.become	10
abstract_inverted_index.design	112
abstract_inverted_index.highly	124
abstract_inverted_index.memory	54
abstract_inverted_index.method	13
abstract_inverted_index.nodes.	89
abstract_inverted_index.scheme	69
abstract_inverted_index.states	96
abstract_inverted_index.amounts	38
abstract_inverted_index.between	87
abstract_inverted_index.compute	50, 88
abstract_inverted_index.current	29
abstract_inverted_index.despite	25
abstract_inverted_index.method.	117
abstract_inverted_index.quantum	1, 23, 30, 95, 145
abstract_inverted_index.require	36
abstract_inverted_index.systems	8
abstract_inverted_index.However,	32
abstract_inverted_index.circuits	2, 98
abstract_inverted_index.clusters	46
abstract_inverted_index.compiled	122
abstract_inverted_index.critical	137
abstract_inverted_index.flexible	75
abstract_inverted_index.insights	138
abstract_inverted_index.movement	86
abstract_inverted_index.portable	81
abstract_inverted_index.problem,	102
abstract_inverted_index.provides	65
abstract_inverted_index.scalable	115
abstract_inverted_index.solution	82
abstract_inverted_index.algorithm	146
abstract_inverted_index.alongside	73
abstract_inverted_index.benchmark	15
abstract_inverted_index.closeness	105
abstract_inverted_index.computing	6
abstract_inverted_index.efficient	67
abstract_inverted_index.essential	12
abstract_inverted_index.framework	63
abstract_inverted_index.generator	77
abstract_inverted_index.hardware.	31
abstract_inverted_index.introduce	60
abstract_inverted_index.minimizes	84
abstract_inverted_index.optimized	125
abstract_inverted_index.potential	20
abstract_inverted_index.providing	136
abstract_inverted_index.resulting	119
abstract_inverted_index.thousands	48
abstract_inverted_index.Simulating	0
abstract_inverted_index.algorithms	16
abstract_inverted_index.centrality	106
abstract_inverted_index.end-to-end	62
abstract_inverted_index.importance	110
abstract_inverted_index.partitions	120
abstract_inverted_index.resources,	40
abstract_inverted_index.seamlessly	129
abstract_inverted_index.computation	24
abstract_inverted_index.footprints.	55
abstract_inverted_index.formulating	91
abstract_inverted_index.large-scale	22, 71
abstract_inverted_index.limitations	27
abstract_inverted_index.performance	141
abstract_inverted_index.scalability	143
abstract_inverted_index.simulations	34
abstract_inverted_index.distribution	93
abstract_inverted_index.partitioning	68, 116
abstract_inverted_index.simulations.	147
abstract_inverted_index.necessitating	41
abstract_inverted_index.supercomputers,	135
abstract_inverted_index.high-performance	5
cited_by_percentile_year
countries_distinct_count	0
institutions_distinct_count	6
citation_normalized_percentile