Fault-tolerant resource estimation using graph-state compilation on a modular superconducting architecture

• URL: http://arxiv.org/abs/2406.06015v1
• Date: Mon, 10 Jun 2024 04:30:48 GMT
• Title: Fault-tolerant resource estimation using graph-state compilation on a modular superconducting architecture
• Authors: S. N. Saadatmand, Tyler L. Wilson, Mark Field, Madhav Krishnan Vijayan, Thinh P. Le, Jannis Ruh, Arshpreet Singh Maan, Ioana Moflic, Athena Caesura, Alexandru Paler, Mark J. Hodson, Simon J. Devitt, Josh Y. Mutus,
• Abstract summary: Development of fault-tolerant quantum computers (FTQCs) is gaining increased attention within the quantum computing community. We present a resource estimation framework and software tool that estimates the physical resources required to execute specific quantum algorithms. This tool can predict the size, power consumption, and execution time of these algorithms at as they approach utility-scale.
• Score: 30.01663013636363
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The development of fault-tolerant quantum computers (FTQCs) is gaining increased attention within the quantum computing community. Like their digital counterparts, FTQCs, equipped with error correction and large qubit numbers, promise to solve some of humanity's grand challenges. Estimates of the resource requirements for future FTQC systems are essential to making design choices and prioritizing R&D efforts to develop critical technologies. Here, we present a resource estimation framework and software tool that estimates the physical resources required to execute specific quantum algorithms, compiled into their graph-state form, and laid out onto a modular superconducting hardware architecture. This tool can predict the size, power consumption, and execution time of these algorithms at as they approach utility-scale according to explicit assumptions about the system's physical layout, thermal load, and modular connectivity. We use this tool to study the total resources on a proposed modular architecture and the impact of tradeoffs between and inter-module connectivity, latency and resource requirements.

Related papers

• Architectural Patterns for Designing Quantum Artificial Intelligence Systems [25.42535682546052]
  Utilising quantum computing technology to enhance artificial intelligence systems is expected to improve training and inference times, increase robustness against noise and adversarial attacks, and reduce the number of parameters without compromising accuracy. However, moving beyond proof-of-concept or simulations to develop practical applications of these systems faces significant challenges due to the limitations of quantum hardware and the underdeveloped knowledge base in software engineering for such systems.
  arXiv  Detail & Related papers  (2024-11-14T05:09:07Z)
• Ecosystem-Agnostic Standardization of Quantum Runtime Architecture: Accelerating Utility in Quantum Computing [0.0]
  This research covers all layers of Quantum Computing Optimization Middleware (QCOM) It requires execution on real quantum hardware (QH) There is a need for a widely adopted runtime platform (RP) driven by the open-source community.
  arXiv  Detail & Related papers  (2024-09-26T16:43:07Z)
• Hypergame Theory for Decentralized Resource Allocation in Multi-user Semantic Communications [60.63472821600567]
  A novel framework for decentralized computing and communication resource allocation in multiuser SC systems is proposed. The challenge of efficiently allocating communication and computing resources is addressed through the application of Stackelberg hyper game theory. Simulation results show that the proposed Stackelberg hyper game results in efficient usage of communication and computing resources.
  arXiv  Detail & Related papers  (2024-09-26T15:55:59Z)
• Generative AI-enabled Quantum Computing Networks and Intelligent Resource Allocation [80.78352800340032]
  Quantum computing networks execute large-scale generative AI computation tasks and advanced quantum algorithms. efficient resource allocation in quantum computing networks is a critical challenge due to qubit variability and network complexity. We introduce state-of-the-art reinforcement learning (RL) algorithms, from generative learning to quantum machine learning for optimal quantum resource allocation.
  arXiv  Detail & Related papers  (2024-01-13T17:16:38Z)
• A Modular Engine for Quantum Monte Carlo Integration [48.25405818849956]
  We present the Quantum Monte Carlo Integration (QMCI) engine developed by Quantinuum. It is a quantum computational tool for evaluating multi-dimensional integrals that arise in various fields of science and engineering such as finance.
  arXiv  Detail & Related papers  (2023-08-11T11:42:33Z)
• Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing [73.7522199491117]
  Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources. The fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. We propose a resource allocation model to provision quantum computing and networking resources.
  arXiv  Detail & Related papers  (2023-07-25T00:38:46Z)
• Architectures and circuits for distributed quantum computing [0.0]
  This thesis treats networks providing quantum computation based on distributed paradigms. The main contribution of this thesis is on the definition of compilers that minimize the impact of telegates on the overall fidelity.
  arXiv  Detail & Related papers  (2023-07-16T00:03:59Z)
• 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)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• HCM: Hardware-Aware Complexity Metric for Neural Network Architectures [6.556553154231475]
  This paper introduces a hardware-aware complexity metric that aims to assist the system designer of the neural network architectures. We demonstrate how the proposed metric can help evaluate different design alternatives of neural network models on resource-restricted devices.
  arXiv  Detail & Related papers  (2020-04-19T16:42:51Z)

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.