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

Assessing the mapping of quantum algorithms on superconducting quantum processors

Daniel Manzano

Published Feb 1, 2019• 0 citations
OpenAlex

Abstract

Quantum computing is a promising field regarding computation capabilities for several important tasks. One of the most promising solid-state quantum technology, which is being developed at Qutech (TU Delft), is superconducting qubits. In superconducting quantum processors, qubits are arranged along a 2D grid that only permits information transmission between adjacent qubits. In order to run a quantum algorithm on such a processor a mapping strategy of scheduling-placement-routing is needed.

Related papers

Superconducting Qubits

B. L. T. Plourde, Frank K. Wilhelm

Quantum computing is a novel paradigm for information processing that promises computational speedup for certain computational tasks while not being driven by Moore's law. Superconducting circuits based on Josephson junctions are one of the leading approaches for implementing the quantum bits, or qubits, in a quantum processor. Most superconducting qubit architectures involve circuit quantum electrodynamics, where the qubits are analogous to artificial atoms that are coupled to superconducting linear resonant cavities. This scheme allows for the readout of individual qubits, the manipulation of single-qubit states, and the generation of entanglement between qubits. The performance of current state-of-the-art systems is limited by decoherence of the qubits and associated gate errors. Nonetheless, experiments have been performed that already demonstrate a significant computational speedup compared to classical processing. Future implementations of fault-tolerant quantum computers will require the development of quantum error correction. Initial tests of elements of error correction in superconducting qubit arrays are underway.

CRC Press eBooks•May 17, 2022•3 citations

Quantum computation and simulation with superconducting qubits*

Kaiyong He, Xiao Geng, Rutian Huang +2 more

Superconducting circuits based on Josephson junctions are regarded as one of the most promising technologies for the implementation of scalable quantum computers. This review presents the basic principles of superconducting qubits and shows the progress of quantum computing and quantum simulation based on superconducting qubits in recent years. The experimental realization of gate operations, readout, error correction codes, as well as some quantum algorithms are summarized, followed by an introduction of quantum simulation. And then some important applications in fields including condensed matter physics, quantum annealing, and quantum chemistry are discussed.

Chinese Physics B•Jul 22, 2021•24 citations

Enabling Technologies for Scalable Superconducting Quantum Computing

Xanthe Croot, Kasra Nowrouzi, Christopher Spitzer +21 more

Experiments with superconducting quantum processors have successfully demonstrated the basic functions needed for quantum computation and evidence of utility, albeit without a sizable array of error-corrected qubits. The realization of the full potential of quantum computing centers on achieving large scale fault-tolerant quantum computers. Science, engineering and industry advances are needed to robustly generate, sustain, and efficiently manipulate an exponentially large computational (Hilbert) space as well as supply the number and quality components needed for such a scaled system. In this article, we suggest critical areas of quantum system and ecosystem development, with respect to the handling and transmission of quantum information within and out of a cryogenic environment, that would accelerate the development of quantum computers based on superconducting circuits.

quant-pharXiv:2512.15001•Dec 18, 2025•12 citations

Superconducting quantum computers: who is leading the future?

M. AbuGhanem

Abstract Superconducting quantum computing has emerged as a leading platform in the pursuit of practical quantum computers, driven by rapid advances from industry, academia, and government initiatives. This review examines the state of superconducting quantum technology, with emphasis on qubit design, processor architecture, scalability, and supporting quantum software. We compare the hardware strategies and performance milestones of key players—including IBM Quantum, Google Quantum AI, Rigetti Computing, Intel Quantum, QuTech, and Oxford Quantum Circuits—highlighting innovations in qubit coherence, control, and system integration. Landmark demonstrations such as quantum supremacy experiments are discussed alongside progress toward real-world applications in the noisy intermediate-scale quantum (NISQ) era. Beyond hardware, attention is given to the broader software and service ecosystem, including quantum programming frameworks, operating environments, and cloud-accessible platforms such as Amazon Braket, Azure Quantum, and OriginQ Cloud, which enable remote access and algorithm development. Persistent challenges in superconducting quantum computing—such as error correction, system stability, and large-scale integration—are assessed in light of emerging approaches aimed at fault-tolerant quantum computing. As the field moves from the NISQ era toward fault-tolerant quantum computing, we capture the defining hardware achievements and characteristics of current superconducting processors, while examining the ongoing efforts and challenges in overcoming NISQ-era limitations. These developments offer critical insights into the path toward scalable quantum systems and their transformative impact on future technologies, while also underscoring the strategic and societal considerations that require balancing innovation with responsible oversight and thoughtful governance.

EPJ Quantum Technology•Aug 19, 2025•38 citations

Quantum supremacy in a superconducting quantum processor

John M. Martinis

The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor. We have used a programmable superconducting processor to create quantum states on 53 qubits, corresponding to a "parallel computation" of 10 million trillion states. For a simple algorithm, our Sycamore processor takes about 200 seconds to run a quantum circuit a million times - the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy, heralding a much-anticipated computing paradigm.

Photonics for Quantum (PfQ)•Jul 13, 2021•7 citations

Mapping quantum algorithms in a crossbar architecture

Alejandro Morais Tejerina

In recent years, Quantum Computing has gone from theory to a promising reality, leading to quantum chips that in a near future might be able to exceed the computational power of any current supercomputer. For this to happen, there are some problems that must be overcome. For example, in a quantum processor qubits are usually arranged in a 2D architecture with limited connectivity between them and in which only nearest-neighbour interactions are allowed. This restricts the execution of two-qubit gates and requires qubit to be moved to adjacent positions. Quantum algorithms, which are described as quantum circuits, neglect the quantum chip constraints and therefore cannot be directly executed. This is known as the mapping problem. This thesis focuses on the problem of mapping quantum algorithms into a quantum chip based on spin qubits, called the crossbar architecture. In this project we have developed the required compiler support (mapping) for making quantum circuits executable on the crossbar architecture based on the tools provided by OpenQL. Using this compiler, we have analyzed the mapping overhead of the crossbar architecture and studied how it relates to the characteristics of quantum algorithms. In addition, we have developed a verification program that checks the output of the compiler and provides a visualisation tool for debugging.

•Jan 1, 2019•2 citations
Quantum computing is a promising field regarding computation capabilities for several important tasks. One of the most promising solid-state quantum technology, which is being developed at Qutech (TU Delft), is superconducting qubits. In superconducting quantum processors, qubits are arranged along a 2D grid that only permits information transmission between adjacent qubits. In order to run a quantum algorithm on such a processor a mapping strategy of scheduling-placement-routing is needed.
Quantum computing is a novel paradigm for information processing that promises computational speedup for certain computational tasks while not being driven by Moore's law. Superconducting circuits based on Josephson junctions are one of the leading approaches for implementing the quantum bits, or qubits, in a quantum processor. Most superconducting qubit architectures involve circuit quantum electrodynamics, where the qubits are analogous to artificial atoms that are coupled to superconducting linear resonant cavities. This scheme allows for the readout of individual qubits, the manipulation of single-qubit states, and the generation of entanglement between qubits. The performance of current state-of-the-art systems is limited by decoherence of the qubits and associated gate errors. Nonetheless, experiments have been performed that already demonstrate a significant computational speedup compared to classical processing. Future implementations of fault-tolerant quantum computers will require the development of quantum error correction. Initial tests of elements of error correction in superconducting qubit arrays are underway.
Superconducting circuits based on Josephson junctions are regarded as one of the most promising technologies for the implementation of scalable quantum computers. This review presents the basic principles of superconducting qubits and shows the progress of quantum computing and quantum simulation based on superconducting qubits in recent years. The experimental realization of gate operations, readout, error correction codes, as well as some quantum algorithms are summarized, followed by an introduction of quantum simulation. And then some important applications in fields including condensed matter physics, quantum annealing, and quantum chemistry are discussed.
Experiments with superconducting quantum processors have successfully demonstrated the basic functions needed for quantum computation and evidence of utility, albeit without a sizable array of error-corrected qubits. The realization of the full potential of quantum computing centers on achieving large scale fault-tolerant quantum computers. Science, engineering and industry advances are needed to robustly generate, sustain, and efficiently manipulate an exponentially large computational (Hilbert) space as well as supply the number and quality components needed for such a scaled system. In this article, we suggest critical areas of quantum system and ecosystem development, with respect to the handling and transmission of quantum information within and out of a cryogenic environment, that would accelerate the development of quantum computers based on superconducting circuits.
Abstract Superconducting quantum computing has emerged as a leading platform in the pursuit of practical quantum computers, driven by rapid advances from industry, academia, and government initiatives. This review examines the state of superconducting quantum technology, with emphasis on qubit design, processor architecture, scalability, and supporting quantum software. We compare the hardware strategies and performance milestones of key players—including IBM Quantum, Google Quantum AI, Rigetti Computing, Intel Quantum, QuTech, and Oxford Quantum Circuits—highlighting innovations in qubit coherence, control, and system integration. Landmark demonstrations such as quantum supremacy experiments are discussed alongside progress toward real-world applications in the noisy intermediate-scale quantum (NISQ) era. Beyond hardware, attention is given to the broader software and service ecosystem, including quantum programming frameworks, operating environments, and cloud-accessible platforms such as Amazon Braket, Azure Quantum, and OriginQ Cloud, which enable remote access and algorithm development. Persistent challenges in superconducting quantum computing—such as error correction, system stability, and large-scale integration—are assessed in light of emerging approaches aimed at fault-tolerant quantum computing. As the field moves from the NISQ era toward fault-tolerant quantum computing, we capture the defining hardware achievements and characteristics of current superconducting processors, while examining the ongoing efforts and challenges in overcoming NISQ-era limitations. These developments offer critical insights into the path toward scalable quantum systems and their transformative impact on future technologies, while also underscoring the strategic and societal considerations that require balancing innovation with responsible oversight and thoughtful governance.
The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor. We have used a programmable superconducting processor to create quantum states on 53 qubits, corresponding to a "parallel computation" of 10 million trillion states. For a simple algorithm, our Sycamore processor takes about 200 seconds to run a quantum circuit a million times - the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy, heralding a much-anticipated computing paradigm.
In recent years, Quantum Computing has gone from theory to a promising reality, leading to quantum chips that in a near future might be able to exceed the computational power of any current supercomputer. For this to happen, there are some problems that must be overcome. For example, in a quantum processor qubits are usually arranged in a 2D architecture with limited connectivity between them and in which only nearest-neighbour interactions are allowed. This restricts the execution of two-qubit gates and requires qubit to be moved to adjacent positions. Quantum algorithms, which are described as quantum circuits, neglect the quantum chip constraints and therefore cannot be directly executed. This is known as the mapping problem. This thesis focuses on the problem of mapping quantum algorithms into a quantum chip based on spin qubits, called the crossbar architecture. In this project we have developed the required compiler support (mapping) for making quantum circuits executable on the crossbar architecture based on the tools provided by OpenQL. Using this compiler, we have analyzed the mapping overhead of the crossbar architecture and studied how it relates to the characteristics of quantum algorithms. In addition, we have developed a verification program that checks the output of the compiler and provides a visualisation tool for debugging.