Bounding the computational power of bosonic systems
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916932716855296 |
|---|---|
| author | Upreti, Varun Rudolph, Dorian Chabaud, Ulysse |
| author_facet | Upreti, Varun Rudolph, Dorian Chabaud, Ulysse |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_03600 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Bounding the computational power of bosonic systems Upreti, Varun Rudolph, Dorian Chabaud, Ulysse Quantum Physics Computational Complexity 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. |
| title | Bounding the computational power of bosonic systems |
| topic | Quantum Physics Computational Complexity |
| url | https://arxiv.org/abs/2503.03600 |