Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2502.11316 · IEEE Transactions on Computers

Quantum at the Edge: Scalable Standalone FPGA Emulator for QAOA-Based Weighted-MaxCut

S. Choi, Kyeongwon Lee, Jae‐Jin Lee, Woojoo Lee

Published Aug 17, 2026• 3 citations
arXivHTMLPDF

Abstract

Quantum computing (QC) emulation is critical for exploring and advancing near-term quantum algorithms, given the ongoing scalability and reliability challenges of quantum hardware. While FPGA-based QC emulators have emerged as efficient alternatives to bridge the gap toward practical quantum computers, most existing solutions depend on high-performance systems, limiting their applicability in embedded and edge environments. In this work, we present a scalable, standalone FPGA-based emulator specialized for resource-constrained systems. Our design targets the Quantum Approximate Optimization Algorithm (QAOA), particularly for the Weighted-MaxCut problem. By leveraging diagonal decomposition and a pipeline-centric hardware architecture, we reduce the computational complexity of QAOA from$\boldsymbol{O(N^{2})}$to$\boldsymbol{O(N)}$, where$\boldsymbol{N}$$\boldsymbol{=}$$\boldsymbol{2^{n}}$is the state dimension for$\boldsymbol{n}$qubits. This reformulation and its architectural co-design significantly reduces hardware overhead, enabling larger qubit configurations on edge-level FPGAs. We encapsulate these optimizations into a hardware accelerator called theQuantum MaxCut Accelerator(QMA), which integrates seamlessly into a RISC-V platform, forming a self-contained emulator. Additionally, we introduceQC Emulator eXpress(QEX), a full-stack automation framework that streamlines QMA integration into configurable RISC-V platforms, significantly facilitating rapid and scalable emulator development and deployment. Through extensive prototyping of various QAOA emulators, our experiments confirm that the proposed QMA achieves energy reductions of up to$\textbf{907}\boldsymbol{\times}$compared to the CPU-only software baseline under the same standalone FPGA/RISC-V setting and reliably supports up to 9 qubits on a mid-tier FPGA. These results demonstrate the energy efficiency and scalability of the proposed system as a self-contained FPGA/RISC-V platform for edge-local QAOA emulation, prototyping, and HW/SW co-design exploration under resource-constrained conditions.

DOI
10.1109/tc.2026.3724836

Related papers

Developing a Grover's quantum algorithm emulator on standalone FPGAs: optimization and implementation

S. Choi, Woojoo Lee

Quantum computing (QC) leverages superposition, entanglement, and parallelism to solve complex problems that are challenging for classical computing methods. The immense potential of QC has spurred explosive interest and research in both academia and industry. However, the practicality of QC based on large-scale quantum computers remains limited by issues of scalability and error correction. To bridge this gap, QC emulators utilizing classical computing resources have emerged, with modern implementations employing FPGAs for efficiency. Nevertheless, FPGA-based QC emulators face significant limitations, particularly in standalone implementations required for low-power, low-performance devices like IoT end nodes, embedded systems, and wearable devices, due to their substantial resource demands. This paper proposes optimization techniques to reduce resource requirements and enable standalone FPGA implementations of QC emulators. We specifically focused on Grover's algorithm, known for its excellent performance in searching unstructured databases. The proposed resource-saving optimization techniques allow for the emulation of the largest possible Grover's algorithm within the constrained resources of FPGAs. Using these optimization techniques, we developed a hardware accelerator for Grover's algorithm and integrated it with a RISC-V processor architecture. We completed a standalone Grover's algorithm-specific emulator operating on FPGAs, demonstrating significant performance enhancements and resource savings afforded by the proposed techniques.

AIMS Mathematics•Jan 1, 2024•5 citations

Improving Emulation of Quantum Algorithms using Space-Efficient Hardware Architectures

Naveed Mahmud, Esam El‐Araby

With rapid advancement in quantum computing technology, continuous efforts are being directed to simulation and emulation of quantum algorithms on classical platforms. A well-known limitation to classical emulation of quantum circuits is scalability. Existing hardware emulators implement gate-based circuit models of quantum circuits that result in heavy resource utilization and degrade the scalability of the system. Also, current quantum emulation hardware use fixedpoint arithmetic, which has an adverse effect on accuracy when the system is scaled up. In this work, we employ a complexmultiply-and-accumulate (CMAC) and lookup-based emulation approach that greatly reduces resource utilization and improves system scalability in terms of number of emulated qubits. We demonstrate emulation of up to 16 fully-entangled qubits which is highest among existing work. We design fully-pipelined, highthroughput hardware architectures that use floating-point precision for higher accuracy. Experimental evaluation and analysis of the architectures in terms of speed and area is also provided. The emulator is prototyped on a high-performance reconfigurable computing (HPRC) system and our results demonstrate quantitative improvement over existing Field-Programmable-Gate-Array (FPGA)-based hardware emulators.

IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)•Jul 1, 2019•2 citations

Towards Higher Scalability of Quantum Hardware Emulation Using Efficient Resource Scheduling

Naveed Mahmud, Esam El‐Araby

Quantum algorithms can be efficiently emulated on classical hardware such as field programmable gate arrays (FPGAs), achieving significant speedup over software simulations. However, the increase in the required hardware resources for emulating quantum systems becomes a critical limitation as the number of qubits is increased. In this paper, we propose a scalable emulation framework for modeling quantum algorithms on FPGAs that employs efficient resource scheduling such as space and space-time scheduling. In addition, full floating point precision arithmetic and dataflow non-linear (dynamic) pipelining are also used to achieve higher accuracy and higher throughput. We propose scalable and optimized hardware architectures for Quantum Fourier Transform (QFT) and Grover's search algorithm and demonstrate the scalability of our framework by scaling the system up to 5 fully-entangled qubits. A multi-node (multi-FPGA), state-of-the-art high-performance reconfigurable computer (HPRC) was used for implementation of the proposed architectures. Our experimental results show that by employing efficient resource scheduling techniques, the hardware resource constraints could be mitigated and the proposed emulation framework could be made feasible for emulation of more complex, larger-scale quantum algorithms while maintaining higher accuracy and throughput than existing work.

IEEE International Conference on Rebooting Computing (ICRC)•Nov 1, 2018•9 citations

Towards Quantum Circuit Emulation on Low-Tier FPGAs

Christian Conti, Deborah Volpe, Giovanni Amedeo Cirillo +3 more

Researchers and industries are increasingly drawn to quantum computing for its computational potential. However, validating new quantum algorithms is challenging due to current quantum device limitations. Software simulators are time and memory-intensive, making hardware emulators an attractive alternative. This article introduces a digital architecture, designed to emulate quantum computing on low-tier Field-Programmable Gate Arrays (FPGAs), supporting Clifford+T and rotational gate sets. It simplifies and accelerates quantum algorithm verification using a RISC-like structure and efficiently handling sparse quantum gates. A dedicated compiler translates OpenQASM 2.0 into RISC-like instructions. The architecture is validated against the Qiskit state vector simulator, successfully emulating sixteen qubits on a Xilinx Kria KV260 SoM.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•3 citations

AMARETTO, Accelerating Quantum Algorithm Development With FPGA Emulation

Christian Conti, Deborah Volpe, Mariagrazia Graziano +1 more

In recent decades, Quantum Computing (QC) has gained widespread attention among researchers and industries, driven by its potential to outperform classical systems in several key areas. However, validating novel quantum algorithms poses substantial challenges due to limited qubit availability and noise in current quantum devices. Although software simulators are frequently employed to validate quantum circuits, they are time-consuming and require high memory availability since as the number of qubits increases, the memory occupation grows exponentially. Hardware emulators have recently emerged as a faster, more efficient, cost-effective alternative. This article introduces AMARETTO (quAntuM ARchitecture EmulaTion TechnOlogy), a new architecture designed to improve quantum computing emulation on resource-constrained Field-Programmable Gate Arrays (FPGAs). To provide a flexible and complete tool for quantum algorithm development, the emulator supports two universal gate sets, Clifford+T and rotational. AMARETTO mimics quantum computing’s inherent parallelism through multiple concurrent processing elements, achieving high throughput by harnessing the sparse nature of the gate matrices, coupled with pipelining in a Reduced Instruction Set Computer (RISC)-like architecture. A dedicated compiler translates OpenQASM 2.0 into AMARETTO’s instructions, enabling support for custom gates leveraging the equivalences known in the literature. Experimental results on an AMD Zynq UltraScale+ MPSoC ZCU106 demonstrate successful emulation of quantum circuits up to eighteen qubits with a throughput of$\mathbf{12.207}\frac{\mathbf{kgates}}{\mathbf{s}}$, validated against Qiskit simulators. Our evaluation confirms competitive performance with existing FPGA-based emulators in terms of throughput and scalability, while targeting an affordable FPGA platform.

IEEE Transactions on Computers•Jul 7, 2026•0 citations

FPGA-Based Emulation Framework for Two-Qubit Quantum Computation: Design, Implementation, and Validation v2

Arfeen Zahra, Madiha Khalid, Naveed Riaz +3 more

Quantum computing leverages quantum mechanics to perform complex computations efficiently, yet its practical implementation is hindered by hardware-software interdependence and quantum state instability. This paper advances lightweight FPGA-based quantum emulation by incorporating a universal quantum gate set, including parameterized Phase gates and the CNOT gate, to support comprehensive quantum protocol emulation on FPGA hardware. The FPGA platform used for synthesis is Atrix 7. The proposed emulator is validated through simulations of quantum circuits, including Bell States, the Deutsch algorithm, Superdense coding, Grover’s search, and BB84 QKD, with results benchmarked against IBM’s noiseless quantum simulator. Utilizing FPGA’s customizable parallelism and energy efficiency, this framework offers a resource-efficient, reliable platform for developing and testing quantum algorithms.

•Jul 20, 2026•1 citation
Quantum computing (QC) emulation is critical for exploring and advancing near-term quantum algorithms, given the ongoing scalability and reliability challenges of quantum hardware. While FPGA-based QC emulators have emerged as efficient alternatives to bridge the gap toward practical quantum computers, most existing solutions depend on high-performance systems, limiting their applicability in embedded and edge environments. In this work, we present a scalable, standalone FPGA-based emulator specialized for resource-constrained systems. Our design targets the Quantum Approximate Optimization Algorithm (QAOA), particularly for the Weighted-MaxCut problem. By leveraging diagonal decomposition and a pipeline-centric hardware architecture, we reduce the computational complexity of QAOA fromO(N2)\boldsymbol{O(N^{2})}O(N2)toO(N)\boldsymbol{O(N)}O(N), where\boldsymbol{N}$$\boldsymbol{=}$$\boldsymbol{2^{n}}is the state dimension forn\boldsymbol{n}nqubits. This reformulation and its architectural co-design significantly reduces hardware overhead, enabling larger qubit configurations on edge-level FPGAs. We encapsulate these optimizations into a hardware accelerator called theQuantum MaxCut Accelerator(QMA), which integrates seamlessly into a RISC-V platform, forming a self-contained emulator. Additionally, we introduceQC Emulator eXpress(QEX), a full-stack automation framework that streamlines QMA integration into configurable RISC-V platforms, significantly facilitating rapid and scalable emulator development and deployment. Through extensive prototyping of various QAOA emulators, our experiments confirm that the proposed QMA achieves energy reductions of up to907×\textbf{907}\boldsymbol{\times}907×compared to the CPU-only software baseline under the same standalone FPGA/RISC-V setting and reliably supports up to 9 qubits on a mid-tier FPGA. These results demonstrate the energy efficiency and scalability of the proposed system as a self-contained FPGA/RISC-V platform for edge-local QAOA emulation, prototyping, and HW/SW co-design exploration under resource-constrained conditions.
Quantum computing (QC) leverages superposition, entanglement, and parallelism to solve complex problems that are challenging for classical computing methods. The immense potential of QC has spurred explosive interest and research in both academia and industry. However, the practicality of QC based on large-scale quantum computers remains limited by issues of scalability and error correction. To bridge this gap, QC emulators utilizing classical computing resources have emerged, with modern implementations employing FPGAs for efficiency. Nevertheless, FPGA-based QC emulators face significant limitations, particularly in standalone implementations required for low-power, low-performance devices like IoT end nodes, embedded systems, and wearable devices, due to their substantial resource demands. This paper proposes optimization techniques to reduce resource requirements and enable standalone FPGA implementations of QC emulators. We specifically focused on Grover's algorithm, known for its excellent performance in searching unstructured databases. The proposed resource-saving optimization techniques allow for the emulation of the largest possible Grover's algorithm within the constrained resources of FPGAs. Using these optimization techniques, we developed a hardware accelerator for Grover's algorithm and integrated it with a RISC-V processor architecture. We completed a standalone Grover's algorithm-specific emulator operating on FPGAs, demonstrating significant performance enhancements and resource savings afforded by the proposed techniques.
With rapid advancement in quantum computing technology, continuous efforts are being directed to simulation and emulation of quantum algorithms on classical platforms. A well-known limitation to classical emulation of quantum circuits is scalability. Existing hardware emulators implement gate-based circuit models of quantum circuits that result in heavy resource utilization and degrade the scalability of the system. Also, current quantum emulation hardware use fixedpoint arithmetic, which has an adverse effect on accuracy when the system is scaled up. In this work, we employ a complexmultiply-and-accumulate (CMAC) and lookup-based emulation approach that greatly reduces resource utilization and improves system scalability in terms of number of emulated qubits. We demonstrate emulation of up to 16 fully-entangled qubits which is highest among existing work. We design fully-pipelined, highthroughput hardware architectures that use floating-point precision for higher accuracy. Experimental evaluation and analysis of the architectures in terms of speed and area is also provided. The emulator is prototyped on a high-performance reconfigurable computing (HPRC) system and our results demonstrate quantitative improvement over existing Field-Programmable-Gate-Array (FPGA)-based hardware emulators.
Quantum algorithms can be efficiently emulated on classical hardware such as field programmable gate arrays (FPGAs), achieving significant speedup over software simulations. However, the increase in the required hardware resources for emulating quantum systems becomes a critical limitation as the number of qubits is increased. In this paper, we propose a scalable emulation framework for modeling quantum algorithms on FPGAs that employs efficient resource scheduling such as space and space-time scheduling. In addition, full floating point precision arithmetic and dataflow non-linear (dynamic) pipelining are also used to achieve higher accuracy and higher throughput. We propose scalable and optimized hardware architectures for Quantum Fourier Transform (QFT) and Grover's search algorithm and demonstrate the scalability of our framework by scaling the system up to 5 fully-entangled qubits. A multi-node (multi-FPGA), state-of-the-art high-performance reconfigurable computer (HPRC) was used for implementation of the proposed architectures. Our experimental results show that by employing efficient resource scheduling techniques, the hardware resource constraints could be mitigated and the proposed emulation framework could be made feasible for emulation of more complex, larger-scale quantum algorithms while maintaining higher accuracy and throughput than existing work.
Researchers and industries are increasingly drawn to quantum computing for its computational potential. However, validating new quantum algorithms is challenging due to current quantum device limitations. Software simulators are time and memory-intensive, making hardware emulators an attractive alternative. This article introduces a digital architecture, designed to emulate quantum computing on low-tier Field-Programmable Gate Arrays (FPGAs), supporting Clifford+T and rotational gate sets. It simplifies and accelerates quantum algorithm verification using a RISC-like structure and efficiently handling sparse quantum gates. A dedicated compiler translates OpenQASM 2.0 into RISC-like instructions. The architecture is validated against the Qiskit state vector simulator, successfully emulating sixteen qubits on a Xilinx Kria KV260 SoM.
In recent decades, Quantum Computing (QC) has gained widespread attention among researchers and industries, driven by its potential to outperform classical systems in several key areas. However, validating novel quantum algorithms poses substantial challenges due to limited qubit availability and noise in current quantum devices. Although software simulators are frequently employed to validate quantum circuits, they are time-consuming and require high memory availability since as the number of qubits increases, the memory occupation grows exponentially. Hardware emulators have recently emerged as a faster, more efficient, cost-effective alternative. This article introduces AMARETTO (quAntuM ARchitecture EmulaTion TechnOlogy), a new architecture designed to improve quantum computing emulation on resource-constrained Field-Programmable Gate Arrays (FPGAs). To provide a flexible and complete tool for quantum algorithm development, the emulator supports two universal gate sets, Clifford+T and rotational. AMARETTO mimics quantum computing’s inherent parallelism through multiple concurrent processing elements, achieving high throughput by harnessing the sparse nature of the gate matrices, coupled with pipelining in a Reduced Instruction Set Computer (RISC)-like architecture. A dedicated compiler translates OpenQASM 2.0 into AMARETTO’s instructions, enabling support for custom gates leveraging the equivalences known in the literature. Experimental results on an AMD Zynq UltraScale+ MPSoC ZCU106 demonstrate successful emulation of quantum circuits up to eighteen qubits with a throughput of12.207kgatess\mathbf{12.207}\frac{\mathbf{kgates}}{\mathbf{s}}12.207skgates​, validated against Qiskit simulators. Our evaluation confirms competitive performance with existing FPGA-based emulators in terms of throughput and scalability, while targeting an affordable FPGA platform.
Quantum computing leverages quantum mechanics to perform complex computations efficiently, yet its practical implementation is hindered by hardware-software interdependence and quantum state instability. This paper advances lightweight FPGA-based quantum emulation by incorporating a universal quantum gate set, including parameterized Phase gates and the CNOT gate, to support comprehensive quantum protocol emulation on FPGA hardware. The FPGA platform used for synthesis is Atrix 7. The proposed emulator is validated through simulations of quantum circuits, including Bell States, the Deutsch algorithm, Superdense coding, Grover’s search, and BB84 QKD, with results benchmarked against IBM’s noiseless quantum simulator. Utilizing FPGA’s customizable parallelism and energy efficiency, this framework offers a resource-efficient, reliable platform for developing and testing quantum algorithms.