Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > quant-ph > arXiv:2212.07854v1

Help | Advanced Search

Quantum Physics

arXiv:2212.07854v1 (quant-ph)
[Submitted on 14 Dec 2022 (this version) , latest version 2 May 2023 (v2) ]

Title: Tactile Network Resource Allocation enabled by Quantum Annealing based on ILP Modeling

Title: 基于ILP建模的量子退火实现触觉网络资源分配

Authors:Arthur Witt, Christopher Körber, Andreas Kirstädter, Thomas Luu
Abstract: Agile networks with fast adaptation and reconfiguration capabilities are required for sustainable provisioning of high-quality services with high availability. We propose a new methodical framework for short-time network control based on quantum computing (QC) and integer linear program (ILP) models, which has the potential of realizing a real-time network automation. Finally, we study the approach's feasibility with the state-of-the-art quantum annealer D-Wave Advantage 5.2 in case of an example network and provide scaling estimations for larger networks. We embed network problems in quadratic unconstrained binary optimization (QUBO) form for networks of up to 6 nodes. We further find annealing parameters that obtain feasible solutions that are close to a reference solution obtained by classical ILP-solver. We estimate, that a real-sized network with 12 to 16 nodes require a quantum annealing (QA) hardware with at least 50000 qubits or more.
Abstract: 具有快速适应和重新配置能力的敏捷网络对于可持续提供高可用性的高质量服务是必要的。 我们提出了一种基于量子计算(QC)和整数线性规划(ILP)模型的短期网络控制新方法论框架,该方法有望实现实时网络自动化。 最后,我们在示例网络的情况下研究了该方法的可行性,并使用最先进的量子退火器D-Wave Advantage 5.2提供了对更大网络的扩展估计。 我们将最多6个节点的网络问题嵌入二次无约束二进制优化(QUBO)形式中。 我们进一步找到了可以获得接近经典ILP求解器获得的参考解的可行解的退火参数。 我们估计,一个实际大小的具有12到16个节点的网络需要至少50000个或更多量子位的量子退火(QA)硬件。
Comments: 8 pages, 8 figures. Submitted to "International Conference on the Design of Reliable Communication Networks (DRCN) 2023". The data of the work are available on https://jugit.fz-juelich.de/qnet-public/home/
Subjects: Quantum Physics (quant-ph) ; Optimization and Control (math.OC)
MSC classes: 68Q12 (Primary) 68R05, 68R10 (Secondary)
ACM classes: I.6; J.2
Cite as: arXiv:2212.07854 [quant-ph]
  (or arXiv:2212.07854v1 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2212.07854
arXiv-issued DOI via DataCite

Submission history

From: Arthur Witt [view email]
[v1] Wed, 14 Dec 2022 14:12:03 UTC (246 KB)
[v2] Tue, 2 May 2023 10:24:54 UTC (373 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • Other Formats
view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2022-12
Change to browse by:
math
math.OC

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号