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

International Conference on Field Programmable Logic and Applications (FPL)

A reconfigurable accelerator for quantum computations

Michail Zampetakis, Vasilis Samoladas, Apostolos Dollas

Published Jan 1, 2008• 0 citations
Publisher

Abstract

This paper presents a new architecture to accelerate quantum computations, using reconfigurable computing structures. It was designed post place and route, validated with standard benchmarks, and its performance has been evaluated vs. a high end computer running the same benchmarks with highly optimized code. The acceleration of arbitrary quantum circuits is very promising because it extends the kind of quantum computing problems that can be solved with reconfigurable architectures.

DOI
10.1109/fpl.2008.4630024

Related papers

A Scalable FPGA Architecture for Quantum Computing Simulation

Lee A. Belfore

A quantum computing simulation provides the opportunity to explore the behaviors of quantum circuits, study the properties of quantum gates, and develop quantum computing algorithms. Simulating quantum circuits requires geometric time and space complexities, impacting the size of the quantum circuit that can be simulated as well as the respective time required to simulate a particular circuit. Applying the parallelism inherent in the simulation and crafting custom architectures, larger quantum circuits can be simulated. A scalable accelerator architecture is proposed to provide a high performance, highly parallel, accelerator. Among the challenges of creating a scalable architecture is managing parallelism, efficiently routing quantum state components for gate evaluation, and measurement. An example is demonstrated on an Intel Agilex field programmable gate array (FPGA).

arXiv:2407.06415•Jul 8, 2024•4 citations

How to Synthesize Quantum-Circuit Optimizers

Amanda Xu

Recent breakthroughs in quantum computing hardware have brought us closer to realizing the dream of quantum computers accelerating domains such as materials discovery, chemistry, and beyond. Further shrinking the timeline for solving useful problems with quantum computing requires a flexible compilation stack that can adapt to emerging hardware. My research develops robust tools and techniques for optimizing quantum programs to be run on arbitrary quantum computing architectures.

ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH)•Oct 10, 2025•0 citations

DQAOA-GPT: AI-Accelerated Distributed Quantum Optimization for Combinatorial Problems

Seongmin Kim, Abhinav Rijal, Yuri Alexeev +5 more

While combinatorial optimization problems are central to many scientific and engineering applications, their solution remains challenging due to exponentially large search spaces. Variational quantum algorithms offer a promising route for tackling such problems, yet their practical performance is limited by repeated quantum circuit evaluations and classical parameter updates. In this work, we introduce DQAOA-GPT, a hybrid framework that integrates the distributed quantum approximate optimization algorithm (DQAOA), which decomposes a large optimization problem into smaller sub-problems, with GPT-based quantum circuit generation for solving those sub-problems. Rather than relying on iterative variational optimization, the proposed approach uses a trained generative model to directly generate high-quality quantum circuits for the decomposed sub-problems. As a benchmark, we evaluate DQAOA-GPT against conventional DQAOA on dense HUBO optimization problems with up to 100 decision variables. The results demonstrate that DQAOA-GPT significantly reduces computational cost while maintaining competitive solution quality, with larger acceleration observed for larger sub-problem sizes. Although this work focuses on benchmark-scale validation, the framework provides a promising foundation for larger-scale combinatorial optimization in hybrid HPC-QC environments through increased GPU resources and parallel computing capability.

quant-pharXiv:2607.20225•Jul 23, 2026•1 citation

Quantum Computing Architectures for Future Reconfigurable Systems

R. Calef

At the forefront of technological innovation, quantum computing holds the potential to bring computational power to cryptography, materials science and beyond. In this new frontier we are moving to, the architectures supporting quantum systems are changing rapidly with an eye towards these goals of scalability, error correction and reconfigurability. Turning the pages of this article we explore the penetration of cutting edge quantum computing architectures in the future of reconfigurable systems and practical quantum applications. With researchers and engineers working to surmount the byzantine issues of quantum systems, it is very much a time of great change, a time when the landscape of quantum computing is in transformative phase. They are huge hurdles including noise mitigation and qubit stability. But new architectural approaches are evolving which promise to glimpse what computing on a quantum computer might look like in the future, as reconfigurable and self made fashion quantum computers dynamically reconfigure to attack a wide spectrum of difficult problems.

SCCTS Transactions on Reconfigurable Computing•Jun 7, 2025•9 citations

超伝導単一磁束量子回路を用いた高性能な極低温計算機に関する研究

Koki Ishida

Processors, the essential part of computer systems, have dramatically improved their performance with transistors' shrinking technology since the first processors are developed in the early 1970s.However, around the 2000s, the problem of power consumption became apparent, and it became hard to improve the clock frequency, which significantly contributed to the improvement of performance.Although processors' performance improvement has been maintained by introducing multi-core designs, it will be challenging to improve chip performance only with conventional CMOS computing technology continuously after the end of transistors' scaling.To solve these problems, this dissertation focuses on a cryogenic computing technology using superconductor single flux quantum (SFQ) logic that has both high speed and low power consumption.SFQ logic uses low-voltage impulseshaped signals for logic operations, which allows the ultra-fast (10 -12 s) and lowenergy switching (10 -19 J).Due to these potentials, several researchers have so far contributed to SFQ-related research, and several physical implementations, including processors, have successfully demonstrated at the outstanding frequency, e.g., several tens of GHz.However, this is the performance at the logic gate level in the circuit, and when converted to the processor's performance based on software execution, it remains at the same level as conventional CMOS processors.The fundamental problem existing behind the SFQ processors is the lack of architectural optimizations to exploit the full potential of SFQ devices.Moreover, although several circuits' demonstrations have successfully shown the device-level potential, few studies focus on the architectural unit designs to show the SFQ computing potential.Therefore, the following questions must be clearly addressed to show the SFQ computing's potential: (1) what architecture is promising for this technology, (2) how is the feasibility and effectiveness of the architecture, (3) how to evaluate the effective performance and power efficiency of the target designs.To solve the problem, this dissertation firstly explores the architectural design space of SFQ processors to determine the basic design guidelines for the realization of high-performance SFQ processors.Specifically, we assume a simple processor (i.e., in-order scalar processor) and analyze the effect of two architectural parameters (i.e., instruction pipeline stages and bit-width) on performance and power consumption.As a result, the bit-parallel processing and gate-level deep pipeline structure are suitable for achieving high performance in SFQ processors.Moreover, the result indicates that SFQ processors must conceal almost all pipeline stalls to achieve high performance in such an ultra-deep pipelining.Second, this dissertation designs and implements a 4-bit SFQ processor chip as a prototype to clarify our proposed architectural design guidelines' effectiveness and feasibility.As a result, we confirm the correct operation at 32 GHz of clock frequency with 6.5 mW of power consumption.Moreover, this dissertation has extended into the 64-bit processor based on these results and evaluated its power efficiency with the cooling overhead for keeping SFQ circuits at 4 kelvin.The power efficiency, including the cooling cost, is estimated to at most 7.1 GOPS/W, and our processor outperforms the CMOS processor model 7.8 times.Third, this dissertation proposes and evaluates the SFQ accelerator design for neural network applications to show the real potential of SFQ computing.Specifically, this dissertation designs the basic architecture of the neural network accelerator based on the basic design guidelines for SFQ processors and develops an evaluation environment based on power performance modeling.Besides, we analyze the performance bottleneck and optimize the architecture.As a result of the evaluation, our design outperforms about 23 and 1.2 times higher performance and power efficiency with the cooling cost compared to a state-of-the-art CMOS accelerator, respectively.List of Tables 3.1 Delay parameters . . . . . . . . .

•Feb 8, 2021•0 citations

An improved architecture of a realizable quantum computer for quantum programming languages

Nan Wu, Fangmin Song, Xiangdong Li

We study a new realizable architecture for a universal quantum computer based on different optimized components and computational models. Simulation demonstrates it has a higher computing efficiency compared with others. Error correction, fault tolerance and robustness are also discussed for this architecture.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Mar 30, 2009•3 citations
This paper presents a new architecture to accelerate quantum computations, using reconfigurable computing structures. It was designed post place and route, validated with standard benchmarks, and its performance has been evaluated vs. a high end computer running the same benchmarks with highly optimized code. The acceleration of arbitrary quantum circuits is very promising because it extends the kind of quantum computing problems that can be solved with reconfigurable architectures.
A quantum computing simulation provides the opportunity to explore the behaviors of quantum circuits, study the properties of quantum gates, and develop quantum computing algorithms. Simulating quantum circuits requires geometric time and space complexities, impacting the size of the quantum circuit that can be simulated as well as the respective time required to simulate a particular circuit. Applying the parallelism inherent in the simulation and crafting custom architectures, larger quantum circuits can be simulated. A scalable accelerator architecture is proposed to provide a high performance, highly parallel, accelerator. Among the challenges of creating a scalable architecture is managing parallelism, efficiently routing quantum state components for gate evaluation, and measurement. An example is demonstrated on an Intel Agilex field programmable gate array (FPGA).
While combinatorial optimization problems are central to many scientific and engineering applications, their solution remains challenging due to exponentially large search spaces. Variational quantum algorithms offer a promising route for tackling such problems, yet their practical performance is limited by repeated quantum circuit evaluations and classical parameter updates. In this work, we introduce DQAOA-GPT, a hybrid framework that integrates the distributed quantum approximate optimization algorithm (DQAOA), which decomposes a large optimization problem into smaller sub-problems, with GPT-based quantum circuit generation for solving those sub-problems. Rather than relying on iterative variational optimization, the proposed approach uses a trained generative model to directly generate high-quality quantum circuits for the decomposed sub-problems. As a benchmark, we evaluate DQAOA-GPT against conventional DQAOA on dense HUBO optimization problems with up to 100 decision variables. The results demonstrate that DQAOA-GPT significantly reduces computational cost while maintaining competitive solution quality, with larger acceleration observed for larger sub-problem sizes. Although this work focuses on benchmark-scale validation, the framework provides a promising foundation for larger-scale combinatorial optimization in hybrid HPC-QC environments through increased GPU resources and parallel computing capability.
At the forefront of technological innovation, quantum computing holds the potential to bring computational power to cryptography, materials science and beyond. In this new frontier we are moving to, the architectures supporting quantum systems are changing rapidly with an eye towards these goals of scalability, error correction and reconfigurability. Turning the pages of this article we explore the penetration of cutting edge quantum computing architectures in the future of reconfigurable systems and practical quantum applications. With researchers and engineers working to surmount the byzantine issues of quantum systems, it is very much a time of great change, a time when the landscape of quantum computing is in transformative phase. They are huge hurdles including noise mitigation and qubit stability. But new architectural approaches are evolving which promise to glimpse what computing on a quantum computer might look like in the future, as reconfigurable and self made fashion quantum computers dynamically reconfigure to attack a wide spectrum of difficult problems.
Processors, the essential part of computer systems, have dramatically improved their performance with transistors' shrinking technology since the first processors are developed in the early 1970s.However, around the 2000s, the problem of power consumption became apparent, and it became hard to improve the clock frequency, which significantly contributed to the improvement of performance.Although processors' performance improvement has been maintained by introducing multi-core designs, it will be challenging to improve chip performance only with conventional CMOS computing technology continuously after the end of transistors' scaling.To solve these problems, this dissertation focuses on a cryogenic computing technology using superconductor single flux quantum (SFQ) logic that has both high speed and low power consumption.SFQ logic uses low-voltage impulseshaped signals for logic operations, which allows the ultra-fast (10 -12 s) and lowenergy switching (10 -19 J).Due to these potentials, several researchers have so far contributed to SFQ-related research, and several physical implementations, including processors, have successfully demonstrated at the outstanding frequency, e.g., several tens of GHz.However, this is the performance at the logic gate level in the circuit, and when converted to the processor's performance based on software execution, it remains at the same level as conventional CMOS processors.The fundamental problem existing behind the SFQ processors is the lack of architectural optimizations to exploit the full potential of SFQ devices.Moreover, although several circuits' demonstrations have successfully shown the device-level potential, few studies focus on the architectural unit designs to show the SFQ computing potential.Therefore, the following questions must be clearly addressed to show the SFQ computing's potential: (1) what architecture is promising for this technology, (2) how is the feasibility and effectiveness of the architecture, (3) how to evaluate the effective performance and power efficiency of the target designs.To solve the problem, this dissertation firstly explores the architectural design space of SFQ processors to determine the basic design guidelines for the realization of high-performance SFQ processors.Specifically, we assume a simple processor (i.e., in-order scalar processor) and analyze the effect of two architectural parameters (i.e., instruction pipeline stages and bit-width) on performance and power consumption.As a result, the bit-parallel processing and gate-level deep pipeline structure are suitable for achieving high performance in SFQ processors.Moreover, the result indicates that SFQ processors must conceal almost all pipeline stalls to achieve high performance in such an ultra-deep pipelining.Second, this dissertation designs and implements a 4-bit SFQ processor chip as a prototype to clarify our proposed architectural design guidelines' effectiveness and feasibility.As a result, we confirm the correct operation at 32 GHz of clock frequency with 6.5 mW of power consumption.Moreover, this dissertation has extended into the 64-bit processor based on these results and evaluated its power efficiency with the cooling overhead for keeping SFQ circuits at 4 kelvin.The power efficiency, including the cooling cost, is estimated to at most 7.1 GOPS/W, and our processor outperforms the CMOS processor model 7.8 times.Third, this dissertation proposes and evaluates the SFQ accelerator design for neural network applications to show the real potential of SFQ computing.Specifically, this dissertation designs the basic architecture of the neural network accelerator based on the basic design guidelines for SFQ processors and develops an evaluation environment based on power performance modeling.Besides, we analyze the performance bottleneck and optimize the architecture.As a result of the evaluation, our design outperforms about 23 and 1.2 times higher performance and power efficiency with the cooling cost compared to a state-of-the-art CMOS accelerator, respectively.List of Tables 3.1 Delay parameters . . . . . . . . .