Scalable Memory Recycling for Large Quantum Programs Article Swipe

PDF

Israel Reichental , R. Alon , Lior Preminger , Matan Vax , Amir Naveh ·

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

As quantum computing technology advances, the complexity of quantum algorithms increases, necessitating a shift from low-level circuit descriptions to high-level programming paradigms. This paper addresses the challenges of developing a compilation algorithm that optimizes memory management and scales well for bigger, more complex circuits. Our approach models the high-level quantum code as a control flow graph and presents a workflow that searches for a topological sort that maximizes opportunities for qubit reuse. Various heuristics for qubit reuse strategies handle the trade-off between circuit width and depth. We also explore scalability issues in large circuits, suggesting methods to mitigate compilation bottlenecks. By analyzing the structure of the circuit, we are able to identify sub-problems that can be solved separately, without a significant effect on circuit quality, while reducing runtime significantly. This method lays the groundwork for future advancements in quantum programming and compiler optimization by incorporating scalability into quantum memory management.

Related Topics

Long Short-Term Memory

Memory, Sorrow, And Thorn

Concepts

No concepts available.

Metadata

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

All OpenAlex metadata

Raw OpenAlex JSON

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

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

Digital Object Identifier
Title: Scalable Memory Recycling for Large Quantum Programs

Work title
Type: preprint

OpenAlex work type
Language: en

Primary language
Publication year: 2025

Year of publication
Publication date: 2025-03-02

Full publication date if available
Authors: Israel Reichental, R. Alon, Lior Preminger, Matan Vax, Amir Naveh

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

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

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/2503.00822

Direct OA link when available
Cited by: 0

Total citation count in OpenAlex

Full payload

id	https://openalex.org/W4415083434
doi	https://doi.org/10.48550/arxiv.2503.00822
ids.doi	https://doi.org/10.48550/arxiv.2503.00822
ids.openalex	https://openalex.org/W4415083434
fwci
type	preprint
title	Scalable Memory Recycling for Large Quantum Programs
biblio.issue
biblio.volume
biblio.last_page
biblio.first_page
topics[0].id	https://openalex.org/T10682
topics[0].field.id	https://openalex.org/fields/17
topics[0].field.display_name	Computer Science
topics[0].score	0.9973000288009644
topics[0].domain.id	https://openalex.org/domains/3
topics[0].domain.display_name	Physical Sciences
topics[0].subfield.id	https://openalex.org/subfields/1702
topics[0].subfield.display_name	Artificial Intelligence
topics[0].display_name	Quantum Computing Algorithms and Architecture
topics[1].id	https://openalex.org/T10101
topics[1].field.id	https://openalex.org/fields/17
topics[1].field.display_name	Computer Science
topics[1].score	0.9679999947547913
topics[1].domain.id	https://openalex.org/domains/3
topics[1].domain.display_name	Physical Sciences
topics[1].subfield.id	https://openalex.org/subfields/1710
topics[1].subfield.display_name	Information Systems
topics[1].display_name	Cloud Computing and Resource Management
topics[2].id	https://openalex.org/T10020
topics[2].field.id	https://openalex.org/fields/17
topics[2].field.display_name	Computer Science
topics[2].score	0.9585000276565552
topics[2].domain.id	https://openalex.org/domains/3
topics[2].domain.display_name	Physical Sciences
topics[2].subfield.id	https://openalex.org/subfields/1702
topics[2].subfield.display_name	Artificial Intelligence
topics[2].display_name	Quantum Information and Cryptography
is_xpac	False
apc_list
apc_paid
language	en
locations[0].id	pmh:oai:arXiv.org:2503.00822
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/2503.00822
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/2503.00822
locations[1].id	doi:10.48550/arxiv.2503.00822
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.2503.00822
indexed_in	arxiv, datacite
authorships[0].author.id	https://openalex.org/A5036584521
authorships[0].author.orcid
authorships[0].author.display_name	Israel Reichental
authorships[0].author_position	first
authorships[0].raw_author_name	Reichental, Israel
authorships[0].is_corresponding	False
authorships[1].author.id	https://openalex.org/A5005606025
authorships[1].author.orcid	https://orcid.org/0000-0001-9161-6369
authorships[1].author.display_name	R. Alon
authorships[1].author_position	middle
authorships[1].raw_author_name	Alon, Ravid
authorships[1].is_corresponding	False
authorships[2].author.id	https://openalex.org/A5115090018
authorships[2].author.orcid
authorships[2].author.display_name	Lior Preminger
authorships[2].author_position	middle
authorships[2].raw_author_name	Preminger, Lior
authorships[2].is_corresponding	False
authorships[3].author.id	https://openalex.org/A5115090025
authorships[3].author.orcid
authorships[3].author.display_name	Matan Vax
authorships[3].author_position	middle
authorships[3].raw_author_name	Vax, Matan
authorships[3].is_corresponding	False
authorships[4].author.id	https://openalex.org/A5093902820
authorships[4].author.orcid
authorships[4].author.display_name	Amir Naveh
authorships[4].author_position	last
authorships[4].raw_author_name	Naveh, Amir
authorships[4].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/2503.00822
open_access.oa_status	green
open_access.any_repository_has_fulltext	False
created_date	2025-10-12T00:00:00
display_name	Scalable Memory Recycling for Large Quantum Programs
has_fulltext	False
is_retracted	False
updated_date	2025-11-06T06:51:31.235846
primary_topic.id	https://openalex.org/T10682
primary_topic.field.id	https://openalex.org/fields/17
primary_topic.field.display_name	Computer Science
primary_topic.score	0.9973000288009644
primary_topic.domain.id	https://openalex.org/domains/3
primary_topic.domain.display_name	Physical Sciences
primary_topic.subfield.id	https://openalex.org/subfields/1702
primary_topic.subfield.display_name	Artificial Intelligence
primary_topic.display_name	Quantum Computing Algorithms and Architecture
cited_by_count	0
locations_count	2
best_oa_location.id	pmh:oai:arXiv.org:2503.00822
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/2503.00822
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/2503.00822
primary_location.id	pmh:oai:arXiv.org:2503.00822
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/2503.00822
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/2503.00822
publication_date	2025-03-02
publication_year	2025
referenced_works_count	0
abstract_inverted_index.a	12, 29, 52, 58, 63, 119
abstract_inverted_index.As	0
abstract_inverted_index.By	100
abstract_inverted_index.We	86
abstract_inverted_index.as	51
abstract_inverted_index.be	115
abstract_inverted_index.by	143
abstract_inverted_index.in	91, 137
abstract_inverted_index.of	7, 27, 104
abstract_inverted_index.on	122
abstract_inverted_index.to	18, 96, 110
abstract_inverted_index.we	107
abstract_inverted_index.Our	44
abstract_inverted_index.and	36, 56, 84, 140
abstract_inverted_index.are	108
abstract_inverted_index.can	114
abstract_inverted_index.for	39, 62, 69, 74, 134
abstract_inverted_index.the	5, 25, 47, 79, 102, 105, 132
abstract_inverted_index.This	22, 129
abstract_inverted_index.able	109
abstract_inverted_index.also	87
abstract_inverted_index.code	50
abstract_inverted_index.flow	54
abstract_inverted_index.from	14
abstract_inverted_index.into	146
abstract_inverted_index.lays	131
abstract_inverted_index.more	41
abstract_inverted_index.sort	65
abstract_inverted_index.that	32, 60, 66, 113
abstract_inverted_index.well	38
abstract_inverted_index.graph	55
abstract_inverted_index.large	92
abstract_inverted_index.paper	23
abstract_inverted_index.qubit	70, 75
abstract_inverted_index.reuse	76
abstract_inverted_index.shift	13
abstract_inverted_index.while	125
abstract_inverted_index.width	83
abstract_inverted_index.depth.	85
abstract_inverted_index.effect	121
abstract_inverted_index.future	135
abstract_inverted_index.handle	78
abstract_inverted_index.issues	90
abstract_inverted_index.memory	34, 148
abstract_inverted_index.method	130
abstract_inverted_index.models	46
abstract_inverted_index.reuse.	71
abstract_inverted_index.scales	37
abstract_inverted_index.solved	116
abstract_inverted_index.Various	72
abstract_inverted_index.between	81
abstract_inverted_index.bigger,	40
abstract_inverted_index.circuit	16, 82, 123
abstract_inverted_index.complex	42
abstract_inverted_index.control	53
abstract_inverted_index.explore	88
abstract_inverted_index.methods	95
abstract_inverted_index.quantum	1, 8, 49, 138, 147
abstract_inverted_index.runtime	127
abstract_inverted_index.without	118
abstract_inverted_index.approach	45
abstract_inverted_index.circuit,	106
abstract_inverted_index.compiler	141
abstract_inverted_index.identify	111
abstract_inverted_index.mitigate	97
abstract_inverted_index.presents	57
abstract_inverted_index.quality,	124
abstract_inverted_index.reducing	126
abstract_inverted_index.searches	61
abstract_inverted_index.workflow	59
abstract_inverted_index.addresses	24
abstract_inverted_index.advances,	4
abstract_inverted_index.algorithm	31
abstract_inverted_index.analyzing	101
abstract_inverted_index.circuits,	93
abstract_inverted_index.circuits.	43
abstract_inverted_index.computing	2
abstract_inverted_index.low-level	15
abstract_inverted_index.maximizes	67
abstract_inverted_index.optimizes	33
abstract_inverted_index.structure	103
abstract_inverted_index.trade-off	80
abstract_inverted_index.algorithms	9
abstract_inverted_index.challenges	26
abstract_inverted_index.complexity	6
abstract_inverted_index.developing	28
abstract_inverted_index.groundwork	133
abstract_inverted_index.heuristics	73
abstract_inverted_index.high-level	19, 48
abstract_inverted_index.increases,	10
abstract_inverted_index.management	35
abstract_inverted_index.paradigms.	21
abstract_inverted_index.strategies	77
abstract_inverted_index.suggesting	94
abstract_inverted_index.technology	3
abstract_inverted_index.compilation	30, 98
abstract_inverted_index.management.	149
abstract_inverted_index.programming	20, 139
abstract_inverted_index.scalability	89, 145
abstract_inverted_index.separately,	117
abstract_inverted_index.significant	120
abstract_inverted_index.topological	64
abstract_inverted_index.advancements	136
abstract_inverted_index.bottlenecks.	99
abstract_inverted_index.descriptions	17
abstract_inverted_index.optimization	142
abstract_inverted_index.sub-problems	112
abstract_inverted_index.incorporating	144
abstract_inverted_index.necessitating	11
abstract_inverted_index.opportunities	68
abstract_inverted_index.significantly.	128
cited_by_percentile_year
countries_distinct_count	0
institutions_distinct_count	5
citation_normalized_percentile