AMARETTO: Enabling Efficient Quantum Algorithm Emulation on Low-Tier FPGAs

• URL: http://arxiv.org/abs/2411.09320v1
• Date: Thu, 14 Nov 2024 10:01:53 GMT
• Title: AMARETTO: Enabling Efficient Quantum Algorithm Emulation on Low-Tier FPGAs
• Authors: Christian Conti, Deborah Volpe, Mariagrazia Graziano, Maurizio Zamboni, Giovanna Turvani,
• Abstract summary: AMARETTO is designed for quantum computing emulation on low-tier Field-Programmable gate arrays (FPGAs) It simplifies and accelerates the verification of quantum algorithms using a Reduced-Instruction-Set-Computer (RISC)-like structure and efficient handling of sparse quantum gates.
• Score: 0.6553587309274792
• License:
• Abstract: Researchers and industries are increasingly drawn to quantum computing for its computational potential. However, validating new quantum algorithms is challenging due to the limitations of current quantum devices. Software simulators are time and memory-consuming, making hardware emulators an attractive alternative. This article introduces AMARETTO (quAntuM ARchitecture EmulaTion TechnOlogy), designed for quantum computing emulation on low-tier Field-Programmable gate arrays (FPGAs), supporting Clifford+T and rotational gate sets. It simplifies and accelerates the verification of quantum algorithms using a Reduced-Instruction-Set-Computer (RISC)-like structure and efficient handling of sparse quantum gates. A dedicated compiler translates OpenQASM 2.0 into RISC-like instructions. AMARETTO is validated against the Qiskit simulators. Our results show successful emulation of sixteen qubits on a AMD Kria KV260 SoM. This approach rivals other works in emulated qubit capacity on a smaller, more affordable FPGA

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)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• 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)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• QuantumCircuitOpt: An Open-source Framework for Provably Optimal Quantum Circuit Design [0.0]
  We propose QuantumCircuitOpt, a novel open-source framework which implements mathematical optimization formulations and algorithms for decomposing arbitrary unitary gates into a sequence of hardware-native gates. We show that QCOpt can find up to 57% reduction in the number of necessary gates on circuits with up to four qubits, and in run times less than a few minutes on commodity computing hardware. We also show how the QCOpt package can be adapted to various built-in types of native gate sets, based on different hardware platforms like those produced by IBM, Rigetti and Google.
  arXiv  Detail & Related papers  (2021-11-23T06:45:40Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Quantum Accelerator Stack: A Research Roadmap [0.0]
  We present the idea of a quantum accelerator which contains the full stack of the layers of an accelerator. Qbits are defined as perfect qubits, implying they do not decohere and perform good quantum gate operations. The logic is expressed in the universal quantum-classical hybrid computation language developed in the group, called OpenQL.
  arXiv  Detail & Related papers  (2021-02-03T12:33:12Z)
• Faster Schr\"odinger-style simulation of quantum circuits [2.0940228639403156]
  Recent demonstrations of superconducting quantum computers by Google and IBM fueled new research in quantum algorithms. We advance Schr"odinger-style simulation of quantum circuits that is useful standalone and as a building block in layered simulation algorithms.
  arXiv  Detail & Related papers  (2020-08-01T08:47:24Z)
• CODAR: A Contextual Duration-Aware Qubit Mapping for Various NISQ Devices [4.866886176084101]
  We propose a Multi-architecture Adaptive Quantum Abstract Machine (maQAM) and a COntext-sensitive and Duration-Aware Remapping algorithm (CODAR) The CODAR remapper is aware of gate duration difference and program context, enabling it to extract more parallelism from programs.
  arXiv  Detail & Related papers  (2020-02-24T04:30:05Z)
• Intel Quantum Simulator: A cloud-ready high-performance simulator of quantum circuits [0.0]
  We introduce the latest release of Intel Quantum Simulator (IQS), formerly known as qHiPSTER. The high-performance computing capability of the software allows users to leverage the available hardware resources. IQS allows to subdivide the computational resources to simulate a pool of related circuits in parallel.
  arXiv  Detail & Related papers  (2020-01-28T19:00:25Z)

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.