Clever Design, Unexpected Obstacles: Insights on Implementing a Quantum Boltzmann Machine

• URL: http://arxiv.org/abs/2301.13705v1
• Date: Tue, 31 Jan 2023 15:29:16 GMT
• Title: Clever Design, Unexpected Obstacles: Insights on Implementing a Quantum Boltzmann Machine
• Authors: Felix Paul, Michael Falkenthal, Sebastian Feld
• Abstract summary: We have implemented a gated-based quantum version of a restricted Boltzmann machine for approximating the ground state of a Pauli-decomposed qubit Hamiltonian. We systematically summarize our findings and categorize them according to their relevance for the implementation of similar quantum algorithms.
• Score: 1.516865739526702
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We have implemented a gated-based quantum version of a restricted Boltzmann machine for approximating the ground state of a Pauli-decomposed qubit Hamiltonian. During the implementation and evaluation, we have noticed a variety of unexpected topics. It starts from limitations due to the structure of the algorithm itself and continues with constraints induced by specific quantum software development kits, which did not (yet) support necessary features for an efficient implementation. In this paper we systematically summarize our findings and categorize them according to their relevance for the implementation of similar quantum algorithms. We also discuss the feasibility of executing such implementations on current NISQ devices.

Related papers

• Utilizing classical programming principles in the Intel Quantum SDK: implementation of quantum lattice Boltzmann method [1.4426921903884633]
  We explore the use of classical programming techniques in implementing the quantum lattice Boltzmann method in the Intel Quantum SDK. The novelty of this work lies in leveraging classical techniques for the implementation of quantum algorithms.
  arXiv  Detail & Related papers  (2024-07-05T07:30:25Z)
• 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)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Quantum improvement in Spatial Discretization [0.0]
  We introduce a quantum algorithm that improves spatial discretization within constraints. Our algorithm bridges the gap from theoretical models to tangible quantum circuitry.
  arXiv  Detail & Related papers  (2023-12-14T15:36:10Z)
• Quantum Machine Learning on Near-Term Quantum Devices: Current State of Supervised and Unsupervised Techniques for Real-World Applications [1.7041248235270652]
  This survey focuses on selected supervised and unsupervised learning applications executed on quantum hardware. It covers techniques like encoding, ansatz structure, error mitigation, and gradient methods to address these challenges.
  arXiv  Detail & Related papers  (2023-07-03T10:12:34Z)
• 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)
• Estimating gate-set properties from random sequences [0.0]
  Current quantum devices are only capable of short unstructured gate sequences followed by native measurements. A single experiment - random sequence estimation - solves a wealth of estimation problems. We derive robust channel variants of shadow estimation with close-to-optimal performance guarantees.
  arXiv  Detail & Related papers  (2021-10-25T18:01:25Z)
• Characterizing quantum instruments: from non-demolition measurements to quantum error correction [48.43720700248091]
  In quantum information processing quantum operations are often processed alongside measurements which result in classical data. Non-unitary dynamical processes can take place on the system, for which common quantum channel descriptions fail to describe the time evolution. Quantum measurements are correctly treated by means of so-called quantum instruments capturing both classical outputs and post-measurement quantum states.
  arXiv  Detail & Related papers  (2021-10-13T18:00:13Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• The Bitter Truth About Quantum Algorithms in the NISQ Era [0.6091702876917281]
  We discuss factors contributing to the depth and width as well as to the noise of an implementation of an algorithm. Our contribution will help developers in charge of realizing algorithms on such machines in achieving an executable implementation.
  arXiv  Detail & Related papers  (2020-06-04T13:51:53Z)

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.