Quantum computation: Efficient network partitioning for large scale
critical infrastructures
- URL: http://arxiv.org/abs/2302.02074v1
- Date: Sat, 4 Feb 2023 03:09:25 GMT
- Title: Quantum computation: Efficient network partitioning for large scale
critical infrastructures
- Authors: Saikat Ray Majumder, Annarita Giani, Weiwei Shen, Bogdan Neculaes,
Daiwei Zhu, and Sonika Johri
- Abstract summary: We focus on network partitioning as a means for analyzing risk in critical infrastructures.
It is based on the potential speedup quantum computers can provide in the identification of eigenvalues and eigenvectors of sparse graph Laplacians.
- Score: 1.454681691352036
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum computers are emerging as a viable alternative to tackle certain
computational problems that are challenging for classical computers. With the
rapid development of quantum hardware such as those based on trapped ions,
there is practical motivation for identifying risk management problems that are
efficiently solvable with these systems. Here we focus on network partitioning
as a means for analyzing risk in critical infrastructures and present a quantum
approach for its implementation. It is based on the potential speedup quantum
computers can provide in the identification of eigenvalues and eigenvectors of
sparse graph Laplacians, a procedure which is constrained by time and memory on
classical computers.
Related papers
- Quantum Algorithm Cards: Streamlining the development of hybrid
classical-quantum applications [0.0]
The emergence of quantum computing proposes a revolutionary paradigm that can radically transform numerous scientific and industrial application domains.
The ability of quantum computers to scale computations implies better performance and efficiency for certain algorithmic tasks than current computers provide.
To gain benefit from such improvement, quantum computers must be integrated with existing software systems, a process that is not straightforward.
arXiv Detail & Related papers (2023-10-04T06:02:59Z) - Practical limitations on robustness and scalability of quantum Internet [0.7499722271664144]
We study the limitations on the scaling and robustness of quantum Internet.
We present practical bottlenecks for secure communication, delegated computing, and resource distribution among end nodes.
For some examples of quantum networks, we present algorithms to perform different quantum network tasks of interest.
arXiv Detail & Related papers (2023-08-24T12:32:48Z) - Software Architecture Challenges in Integrating Hybrid Classical-Quantum
Systems [3.2851683371946767]
The emergence of quantum computing proposes a revolutionary paradigm that can radically transform numerous scientific and industrial application domains.
The ability of quantum computers to scale computations exponentially imply better performance and efficiency for certain algorithmic tasks than current computers provide.
To gain benefit from such improvement, quantum computers must be integrated with existing software systems, a process that is not straightforward.
arXiv Detail & Related papers (2023-08-02T08:20:34Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - The Basis of Design Tools for Quantum Computing: Arrays, Decision
Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
Quantum computers promise to efficiently solve important problems classical computers never will.
A fully automated quantum software stack needs to be developed.
This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
arXiv Detail & Related papers (2023-01-10T19:00:00Z) - DQC$^2$O: Distributed Quantum Computing for Collaborative Optimization
in Future Networks [54.03701670739067]
We propose an adaptive distributed quantum computing approach to manage quantum computers and quantum channels for solving optimization tasks in future networks.
Based on the proposed approach, we discuss the potential applications for collaborative optimization in future networks, such as smart grid management, IoT cooperation, and UAV trajectory planning.
arXiv Detail & Related papers (2022-09-16T02:44:52Z) - Variational Quantum Algorithms for Computational Fluid Dynamics [0.0]
Variational quantum algorithms are particularly promising since they are comparatively noise tolerant.
We show how variational quantum algorithms can be utilized in computational fluid dynamics.
We argue that a quantum advantage over classical computing methods could be achieved by the end of this decade.
arXiv Detail & Related papers (2022-09-11T18:49:22Z) - Towards Feature Selection for Ranking and Classification Exploiting
Quantum Annealers [14.519254230787993]
This paper explores the feasibility of using currently available quantum computing architectures to solve some quadratic feature selection algorithms for both ranking and classification.
The effectiveness obtained with quantum computing hardware is comparable to that of classical solvers, indicating that quantum computers are now reliable enough to tackle interesting problems.
arXiv Detail & Related papers (2022-05-09T14:46:38Z) - Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem.
The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment.
We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
arXiv Detail & Related papers (2022-04-18T21:45:13Z) - The Computational and Latency Advantage of Quantum Communication
Networks [70.01340727637825]
This article summarises the current status of classical communication networks.
It identifies some critical open research challenges that can only be solved by leveraging quantum technologies.
arXiv Detail & Related papers (2021-06-07T06:31:02Z) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.