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

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

A new software-based architecture for quantum computer

Nan Wu, Fangmin Song, Xiangdong Li

Published Apr 2, 2010• 1 citation
Publisher

Abstract

In this paper, we study a reliable architecture of a quantum computer and a new instruction set and machine language for the architecture, which can improve the performance and reduce the cost of the quantum computing. We also try to address some key issues in detail in the software-driven universal quantum computers.
DOI
10.1117/12.853052

Related papers

Quantum Computer Architecture: Towards Full-Stack Quantum Accelerators

Koen Bertels, Aritra Sarkar, Thomas Hubregtsen +5 more

This paper presents the definition and implementation of a quantum computer architecture to enable creating a new computational device - a quantum computer as an accelerator. A key question addressed is what such a quantum computer is and how it relates to the classical processor that controls the entire execution process. In this paper, we present explicitly the idea of a quantum accelerator which contains the full stack of the layers of an accelerator. Such a stack starts at the highest level describing the target application of the accelerator. The next layer abstracts the quantum logic outlining the algorithm that is to be executed on the quantum accelerator. In our case, the logic is expressed in the universal quantum-classical hybrid computation language developed in the group, called OpenQL, which visualised the quantum processor as a computational accelerator. The OpenQL compiler translates the program to a common assembly language, called cQASM, which can be executed on a quantum simulator. The cQASM represents the instruction set that can be executed by the micro-architecture implemented in the quantum accelerator. We propose that the industrial and societal application developers use perfect qubits that have no decoherence or error-rates. The perfect qubits offers facilities to the quantum application developer and they are not blocked by issues such as decoherence.

arXiv:1903.09575•Design, Automation, and Test in Europe•Mar 1, 2020•49 citations

A quantum computer architecture perspective: executing quantum applications on real quantum processors

Carmen G. Almudéver

Building a quantum computer is not only about having qubits or quantum processors, analogously to classical computers are not only based on transistors or integrated circuits. Accordingly, in the very recent times, a few unique research groups in academia and companies have been exploring and proposing high-level and low-level programming languages, compilers, microarchitecture and instruction set architectures for quantum computation as well as different computer architecture approaches. In other words, developing a quantum computer requires bridging quantum applications and quantum devices. This talk will address the main challenges of building a scalable full-stack quantum computing system followed by a discussion on its architecture focusing on fault tolerance and compilation of quantum algorithms on NISQ devices. I will also provide my vision on how the research community could accelerate the process towards building such a scalable quantum machine, potentially through vertical cross-layer co-design structured methodologies.

Photonics for Quantum (PfQ)•Aug 27, 2021•1 citation

A Uniform Quantum Computing Model based on Virtual Quantum Processors

Georg Gesek

What else than Hybrid Quantum Computing will dominate data centers, just within a decade? But until now, it is unclear how precisely such high-performance computers will be constructed, even the fundamental functionality is in question. Thus, it is very hard to prepare today, from a programmer perspective, in-depth for the anticipated near-term programming paradigm shift due to quantum computers. Furthermore, the industry is reluctant to invest heavily into quantum software development right now, since under this uncertainty regarding the future development of hardware and Cloud services, no one would like to see all these efforts to be ruined by a novel technology, an unforeseen new machine, which would eradicate the software in place, which the industry had developed so costly. This calls for a more generic view on Hybrid Quantum Computing, on one hand hardware agnostic, but still anticipating the fundamental laws of nature which rule any future quantum computing system, regardless of its engineered excellence. This generalization can be done with the introduction of a Virtual Quantum Processor, a piece of imaginary hardware, which is described detailed enough, to emulate a generic hybrid quantum machine based on a set of instructions within a Turing machine. If this could be accomplished, we would retrieve a Uniform Computing Model for Hybrid Quantum Software, which can be applied later to any physical representation of quantum computing hardware, but would run already today on our current machines.

arXiv:2302.12750•IEEE International Conference on Web Services (ICWS)•Sep 1, 2021•2 citations

A Study on the Architecture of Quantum Computers

Jeneetha Jebanazer, Rryan J, Anirudh Vasudevan

Computers minimise human effort while also focusing on improving efficiency in order to advance technology. To improve machine efficiency, a variety of methods have been invented. Reducing the size of the transistors used in the systems is one such process. The use of quantum computers is another important strategy. When used to factor large numbers, it proved to be very accurate. It was discovered that it could decode codes in 20 minutes, while traditional computers took billions of years. This provided excellent motivation for concentrating on this topic. A quantum machine may have three states for a quantum bit, or qubit: 0, 1, and 0 or 1.The coherent state is the final state. This allows you to perform an operation on two different values at the same time. This, however, raises the issue of decoherence. Using quantum computers to perform the computation becomes difficult. A quantum computer should have five features: a scalable device, an initializable state, a long decoherence time, a universal set of quantum gates, and high measurement efficiency. The architecture of quantum computers is a new field of research. Quantum arithmetic, error management, and cluster-state computing also have an effect on it. The quantum algorithms would not be as effective without it. The algorithms used should be based on quantum parallelism to completely harness the power of a quantum computer. This paper briefly explores a few of the fundamental principles in quantum computing. The paper also looks at the various quantum computer architectures that have been proposed in the literature. The problem of building a functional large-scale quantum computer, however, remains unsolved.

•Jun 13, 2022•0 citations

A software methodology for compiling quantum programs

Thomas Häner, Damian S. Steiger, Krysta M. Svore +1 more

Abstract Quantum computers promise to transform our notions of computation by offering a completely new paradigm. To achieve scalable quantum computation, optimizing compilers and a corresponding software design flow will be essential. We present a software architecture for compiling quantum programs from a high-level language program to hardware-specific instructions. We describe the necessary layers of abstraction and their differences and similarities to classical layers of a computer-aided design flow. For each layer of the stack, we discuss the underlying methods for compilation and optimization. Our software methodology facilitates more rapid innovation among quantum algorithm designers, quantum hardware engineers, and experimentalists. It enables scalable compilation of complex quantum algorithms and can be targeted to any specific quantum hardware implementation.

arXiv:1604.01401•Quantum Science and Technology•Jan 8, 2018•188 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 the definition and implementation of a quantum computer architecture to enable creating a new computational device - a quantum computer as an accelerator. A key question addressed is what such a quantum computer is and how it relates to the classical processor that controls the entire execution process. In this paper, we present explicitly the idea of a quantum accelerator which contains the full stack of the layers of an accelerator. Such a stack starts at the highest level describing the target application of the accelerator. The next layer abstracts the quantum logic outlining the algorithm that is to be executed on the quantum accelerator. In our case, the logic is expressed in the universal quantum-classical hybrid computation language developed in the group, called OpenQL, which visualised the quantum processor as a computational accelerator. The OpenQL compiler translates the program to a common assembly language, called cQASM, which can be executed on a quantum simulator. The cQASM represents the instruction set that can be executed by the micro-architecture implemented in the quantum accelerator. We propose that the industrial and societal application developers use perfect qubits that have no decoherence or error-rates. The perfect qubits offers facilities to the quantum application developer and they are not blocked by issues such as decoherence.
Building a quantum computer is not only about having qubits or quantum processors, analogously to classical computers are not only based on transistors or integrated circuits. Accordingly, in the very recent times, a few unique research groups in academia and companies have been exploring and proposing high-level and low-level programming languages, compilers, microarchitecture and instruction set architectures for quantum computation as well as different computer architecture approaches. In other words, developing a quantum computer requires bridging quantum applications and quantum devices. This talk will address the main challenges of building a scalable full-stack quantum computing system followed by a discussion on its architecture focusing on fault tolerance and compilation of quantum algorithms on NISQ devices. I will also provide my vision on how the research community could accelerate the process towards building such a scalable quantum machine, potentially through vertical cross-layer co-design structured methodologies.
What else than Hybrid Quantum Computing will dominate data centers, just within a decade? But until now, it is unclear how precisely such high-performance computers will be constructed, even the fundamental functionality is in question. Thus, it is very hard to prepare today, from a programmer perspective, in-depth for the anticipated near-term programming paradigm shift due to quantum computers. Furthermore, the industry is reluctant to invest heavily into quantum software development right now, since under this uncertainty regarding the future development of hardware and Cloud services, no one would like to see all these efforts to be ruined by a novel technology, an unforeseen new machine, which would eradicate the software in place, which the industry had developed so costly. This calls for a more generic view on Hybrid Quantum Computing, on one hand hardware agnostic, but still anticipating the fundamental laws of nature which rule any future quantum computing system, regardless of its engineered excellence. This generalization can be done with the introduction of a Virtual Quantum Processor, a piece of imaginary hardware, which is described detailed enough, to emulate a generic hybrid quantum machine based on a set of instructions within a Turing machine. If this could be accomplished, we would retrieve a Uniform Computing Model for Hybrid Quantum Software, which can be applied later to any physical representation of quantum computing hardware, but would run already today on our current machines.
Computers minimise human effort while also focusing on improving efficiency in order to advance technology. To improve machine efficiency, a variety of methods have been invented. Reducing the size of the transistors used in the systems is one such process. The use of quantum computers is another important strategy. When used to factor large numbers, it proved to be very accurate. It was discovered that it could decode codes in 20 minutes, while traditional computers took billions of years. This provided excellent motivation for concentrating on this topic. A quantum machine may have three states for a quantum bit, or qubit: 0, 1, and 0 or 1.The coherent state is the final state. This allows you to perform an operation on two different values at the same time. This, however, raises the issue of decoherence. Using quantum computers to perform the computation becomes difficult. A quantum computer should have five features: a scalable device, an initializable state, a long decoherence time, a universal set of quantum gates, and high measurement efficiency. The architecture of quantum computers is a new field of research. Quantum arithmetic, error management, and cluster-state computing also have an effect on it. The quantum algorithms would not be as effective without it. The algorithms used should be based on quantum parallelism to completely harness the power of a quantum computer. This paper briefly explores a few of the fundamental principles in quantum computing. The paper also looks at the various quantum computer architectures that have been proposed in the literature. The problem of building a functional large-scale quantum computer, however, remains unsolved.
Abstract Quantum computers promise to transform our notions of computation by offering a completely new paradigm. To achieve scalable quantum computation, optimizing compilers and a corresponding software design flow will be essential. We present a software architecture for compiling quantum programs from a high-level language program to hardware-specific instructions. We describe the necessary layers of abstraction and their differences and similarities to classical layers of a computer-aided design flow. For each layer of the stack, we discuss the underlying methods for compilation and optimization. Our software methodology facilitates more rapid innovation among quantum algorithm designers, quantum hardware engineers, and experimentalists. It enables scalable compilation of complex quantum algorithms and can be targeted to any specific quantum hardware implementation.