Resource-Efficient Quantum Computing by Breaking Abstractions

• URL: http://arxiv.org/abs/2011.00028v1
• Date: Fri, 30 Oct 2020 18:18:23 GMT
• Title: Resource-Efficient Quantum Computing by Breaking Abstractions
• Authors: Yunong Shi, Pranav Gokhale, Prakash Murali, Jonathan M. Baker, Casey Duckering, Yongshan Ding, Natalie C. Brown, Christopher Chamberland, Ali Javadi Abhari, Andrew W. Cross, David I. Schuster, Kenneth R. Brown, Margaret Martonosi, Frederic T. Chong
• Abstract summary: Current quantum software stacks follow a layered approach similar to the stack of classical computers. In this review, we point out that greater efficiency of quantum computing systems can be achieved by breaking the abstractions between these layers.
• Score: 9.695745674863554
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Building a quantum computer that surpasses the computational power of its classical counterpart is a great engineering challenge. Quantum software optimizations can provide an accelerated pathway to the first generation of quantum computing applications that might save years of engineering effort. Current quantum software stacks follow a layered approach similar to the stack of classical computers, which was designed to manage the complexity. In this review, we point out that greater efficiency of quantum computing systems can be achieved by breaking the abstractions between these layers. We review several works along this line, including two hardware-aware compilation optimizations that break the quantum Instruction Set Architecture (ISA) abstraction and two error-correction/information-processing schemes that break the qubit abstraction. Last, we discuss several possible future directions.

Related papers

• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• New Abstractions for Quantum Computing [1.1929584800629673]
  We argue that new or quantum-tailored abstractions are needed to get the most benefit out of quantum computer systems. This dissertation is supported by three examples of abstractions that could become a core part of how we design and program quantum computers.
  arXiv  Detail & Related papers  (2023-03-05T04:22:18Z)
• 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)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• The Future of Quantum Computing with Superconducting Qubits [2.6668731290542222]
  We see a branching point in computing paradigms with the emergence of quantum processing units (QPUs) Extracting the full potential of computation and realizing quantum algorithms with a super-polynomial speedup will most likely require major advances in quantum error correction technology. Long term, we see hardware that exploits qubit connectivity in higher than 2D topologies to realize more efficient quantum error correcting codes.
  arXiv  Detail & Related papers  (2022-09-14T18:00:03Z)
• Full-stack quantum computing systems in the NISQ era: algorithm-driven and hardware-aware compilation techniques [1.3496450124792878]
  We will provide an overview on current full-stack quantum computing systems. We will emphasize the need for tight co-design among adjacent layers as well as vertical cross-layer design.
  arXiv  Detail & Related papers  (2022-04-13T13:26:56Z)
• Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation [3.8221353389253676]
  We introduce the Quantum Divide and Conquer Algorithm (QDCA), a hybrid variational approach to mapping large optimization problems onto distributed quantum architectures. This is achieved through the combined use of graph partitioning and quantum circuit cutting. We simulate the QDCA on instances of the Maximum Independent Set problem and find that it is able to outperform similar classical algorithms.
  arXiv  Detail & Related papers  (2021-07-15T18:00:32Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Exploring a Double Full-Stack Communications-Enabled Architecture for Multi-Core Quantum Computers [0.0]
  We propose a double full-stack architecture encompassing quantum computation and quantum communications. Using behavioral models and actual measurements from existing quantum computers, the results of simulations suggest that multi-core architectures may effectively unleash the full quantum computer potential.
  arXiv  Detail & Related papers  (2020-09-17T09:58:26Z)
• 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.