Bounding the computational power of bosonic systems Article Swipe

PDF

Varun Upreti , D. Rudolph , Ulysse Chabaud ·

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

Bosonic quantum systems operate in an infinite-dimensional Hilbert space, unlike discrete-variable quantum systems. This distinct mathematical structure leads to fundamental differences in quantum information processing, such as an exponentially greater complexity of state tomography [MMB+24] or a factoring algorithm in constant space [BCCRK24]. Yet, it remains unclear whether this structural difference of bosonic systems may also translate to a practical computational advantage over finite-dimensional quantum computers. Here we take a step towards answering this question by showing that universal bosonic quantum computations can be simulated in polynomial space (and exponential time) on a classical computer, significantly improving the best previous upper bound requiring exponential memory [CJMM24]. In complexity-theoretic terms, we improve the best upper bound on $\textsf{CVBQP}$ from $ \textsf{EXPSPACE}$ to $\textsf{PSPACE}$. This result is achieved using a simulation strategy based on finite energy cutoffs and approximate coherent state decompositions. While we propose ways to potentially refine this bound, we also present arguments supporting the plausibility of an exponential computational advantage of bosonic quantum computers over their discrete-variable counterparts. Furthermore, we emphasize the role of circuit energy as a resource and discuss why it may act as the fundamental bottleneck in realizing this advantage in practical implementations.

Related Topics

Mighty Morphin Power Rangers

Thorium-Based Nuclear Power

Power Rangers Cosmic Fury

The Power Station (Band)

Romina Power

Concepts

No concepts available.

Metadata

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

All OpenAlex metadata

Raw OpenAlex JSON

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

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

Digital Object Identifier
Title: Bounding the computational power of bosonic systems

Work title
Type: preprint

OpenAlex work type
Language: en

Primary language
Publication year: 2025

Year of publication
Publication date: 2025-03-05

Full publication date if available
Authors: Varun Upreti, D. Rudolph, Ulysse Chabaud

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

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

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.03600

Direct OA link when available
Cited by: 0

Total citation count in OpenAlex

Full payload

id	https://openalex.org/W4416085645
doi	https://doi.org/10.48550/arxiv.2503.03600
ids.doi	https://doi.org/10.48550/arxiv.2503.03600
ids.openalex	https://openalex.org/W4416085645
fwci
type	preprint
title	Bounding the computational power of bosonic systems
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:2503.03600
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.03600
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.03600
locations[1].id	doi:10.48550/arxiv.2503.03600
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.03600
indexed_in	arxiv, datacite
authorships[0].author.id	https://openalex.org/A5114655812
authorships[0].author.orcid
authorships[0].author.display_name	Varun Upreti
authorships[0].author_position	first
authorships[0].raw_author_name	Upreti, Varun
authorships[0].is_corresponding	False
authorships[1].author.id	https://openalex.org/A5083206792
authorships[1].author.orcid	https://orcid.org/0000-0003-1199-3055
authorships[1].author.display_name	D. Rudolph
authorships[1].author_position	middle
authorships[1].raw_author_name	Rudolph, Dorian
authorships[1].is_corresponding	False
authorships[2].author.id	https://openalex.org/A5030753124
authorships[2].author.orcid	https://orcid.org/0000-0003-0135-9819
authorships[2].author.display_name	Ulysse Chabaud
authorships[2].author_position	last
authorships[2].raw_author_name	Chabaud, Ulysse
authorships[2].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.03600
open_access.oa_status	green
open_access.any_repository_has_fulltext	False
created_date	2025-10-10T00:00:00
display_name	Bounding the computational power of bosonic systems
has_fulltext	False
is_retracted	False
updated_date	2025-11-28T09:29:02.299577
primary_topic
cited_by_count	0
locations_count	2
best_oa_location.id	pmh:oai:arXiv.org:2503.03600
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.03600
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.03600
primary_location.id	pmh:oai:arXiv.org:2503.03600
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.03600
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.03600
publication_date	2025-03-05
publication_year	2025
referenced_works_count	0
abstract_inverted_index.$	118
abstract_inverted_index.a	36, 58, 69, 92, 127, 178
abstract_inverted_index.In	106
abstract_inverted_index.an	5, 27, 157
abstract_inverted_index.as	26, 177, 186
abstract_inverted_index.be	83
abstract_inverted_index.by	75
abstract_inverted_index.in	4, 21, 39, 85, 190, 194
abstract_inverted_index.is	124
abstract_inverted_index.it	44, 183
abstract_inverted_index.of	31, 51, 156, 161, 174
abstract_inverted_index.on	91, 115, 131
abstract_inverted_index.or	35
abstract_inverted_index.to	18, 57, 120, 144
abstract_inverted_index.we	67, 109, 141, 149, 170
abstract_inverted_index.act	185
abstract_inverted_index.and	135, 180
abstract_inverted_index.can	82
abstract_inverted_index.may	54, 184
abstract_inverted_index.the	97, 111, 154, 172, 187
abstract_inverted_index.why	182
abstract_inverted_index.(and	88
abstract_inverted_index.Here	66
abstract_inverted_index.This	13, 122
abstract_inverted_index.Yet,	43
abstract_inverted_index.also	55, 150
abstract_inverted_index.best	98, 112
abstract_inverted_index.from	117
abstract_inverted_index.over	62, 165
abstract_inverted_index.role	173
abstract_inverted_index.step	70
abstract_inverted_index.such	25
abstract_inverted_index.take	68
abstract_inverted_index.that	77
abstract_inverted_index.this	48, 73, 147, 192
abstract_inverted_index.ways	143
abstract_inverted_index.While	140
abstract_inverted_index.based	130
abstract_inverted_index.bound	101, 114
abstract_inverted_index.leads	17
abstract_inverted_index.space	41, 87
abstract_inverted_index.state	32, 138
abstract_inverted_index.their	166
abstract_inverted_index.time)	90
abstract_inverted_index.upper	100, 113
abstract_inverted_index.using	126
abstract_inverted_index.bound,	148
abstract_inverted_index.energy	133, 176
abstract_inverted_index.finite	132
abstract_inverted_index.memory	104
abstract_inverted_index.refine	146
abstract_inverted_index.result	123
abstract_inverted_index.space,	8
abstract_inverted_index.terms,	108
abstract_inverted_index.unlike	9
abstract_inverted_index.Bosonic	0
abstract_inverted_index.Hilbert	7
abstract_inverted_index.bosonic	52, 79, 162
abstract_inverted_index.circuit	175
abstract_inverted_index.cutoffs	134
abstract_inverted_index.discuss	181
abstract_inverted_index.greater	29
abstract_inverted_index.improve	110
abstract_inverted_index.operate	3
abstract_inverted_index.present	151
abstract_inverted_index.propose	142
abstract_inverted_index.quantum	1, 11, 22, 64, 80, 163
abstract_inverted_index.remains	45
abstract_inverted_index.showing	76
abstract_inverted_index.systems	2, 53
abstract_inverted_index.towards	71
abstract_inverted_index.unclear	46
abstract_inverted_index.whether	47
abstract_inverted_index.[MMB+24]	34
abstract_inverted_index.achieved	125
abstract_inverted_index.coherent	137
abstract_inverted_index.constant	40
abstract_inverted_index.distinct	14
abstract_inverted_index.previous	99
abstract_inverted_index.question	74
abstract_inverted_index.resource	179
abstract_inverted_index.strategy	129
abstract_inverted_index.systems.	12
abstract_inverted_index.[CJMM24].	105
abstract_inverted_index.advantage	61, 160, 193
abstract_inverted_index.algorithm	38
abstract_inverted_index.answering	72
abstract_inverted_index.arguments	152
abstract_inverted_index.classical	93
abstract_inverted_index.computer,	94
abstract_inverted_index.computers	164
abstract_inverted_index.emphasize	171
abstract_inverted_index.factoring	37
abstract_inverted_index.improving	96
abstract_inverted_index.practical	59, 195
abstract_inverted_index.realizing	191
abstract_inverted_index.requiring	102
abstract_inverted_index.simulated	84
abstract_inverted_index.structure	16
abstract_inverted_index.translate	56
abstract_inverted_index.universal	78
abstract_inverted_index.[BCCRK24].	42
abstract_inverted_index.bottleneck	189
abstract_inverted_index.complexity	30
abstract_inverted_index.computers.	65
abstract_inverted_index.difference	50
abstract_inverted_index.polynomial	86
abstract_inverted_index.simulation	128
abstract_inverted_index.structural	49
abstract_inverted_index.supporting	153
abstract_inverted_index.tomography	33
abstract_inverted_index.approximate	136
abstract_inverted_index.differences	20
abstract_inverted_index.exponential	89, 103, 158
abstract_inverted_index.fundamental	19, 188
abstract_inverted_index.information	23
abstract_inverted_index.potentially	145
abstract_inverted_index.processing,	24
abstract_inverted_index.Furthermore,	169
abstract_inverted_index.computations	81
abstract_inverted_index.mathematical	15
abstract_inverted_index.plausibility	155
abstract_inverted_index.computational	60, 159
abstract_inverted_index.counterparts.	168
abstract_inverted_index.exponentially	28
abstract_inverted_index.significantly	95
abstract_inverted_index.decompositions.	139
abstract_inverted_index.$\textsf{CVBQP}$	116
abstract_inverted_index.implementations.	196
abstract_inverted_index.discrete-variable	10, 167
abstract_inverted_index.$\textsf{PSPACE}$.	121
abstract_inverted_index.\textsf{EXPSPACE}$	119
abstract_inverted_index.finite-dimensional	63
abstract_inverted_index.complexity-theoretic	107
abstract_inverted_index.infinite-dimensional	6
cited_by_percentile_year
countries_distinct_count	0
institutions_distinct_count	3
citation_normalized_percentile