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

Near-Term Stepping Stones on the Path to Useful Quantum Computing

Abigail McClain Gomez

Published Jan 1, 2025• 0 citations
OpenAlex

Abstract

In 2000, David P. DiVincenzo proposed seven necessary criteria to construct a physical quantum computer. His requirements included device scalability, having well-defined qubits with long coherence times, and the ability to implement a universal gate set. Since then, research has propelled several experimental platforms to the forefront as contenders for quantum computing. The near-term implementations of these various architectures often face technical challenges -- such as limited scalability, short coherence times, or sub-universal computation -- leading to only a partial fulfillment of DiVincenzo's criteria. Despite device shortcomings, progress marches forward with increasingly useful demonstrations of quantum computation and simulation. Towards this end, the research compiled in this thesis presents novel quantum computing methods and applications that can be leveraged in the current era of constrained hardware capabilities. This thesis examines a diverse array of near-term topics, including the use of machine learning to aid in sample-efficient quantum state reconstruction via Born machines, methods to link distributed quantum simulators with incomplete information transfer for approximate fragmented simulation, universal computation with globally controlled analog simulators, and fast scrambling achieved with measurement-only quantum circuits.

Related papers

Quantum Computing: Current Advances And Near-Term Applications

Win Mathew John

Quantum computing has transitioned from a theoretical curiosity to an emerging technological paradigm with demonstrable computational advantages in specific problem domains. This paper presents a comprehensive review of current advances in quantum computing hardware, software, and near-term applications within the Noisy Intermediate-Scale Quantum (NISQ) era. We examine the architectural evolution of leading quantum platforms, including superconducting, trapped-ion, and photonic systems, analyzing their qubit counts, gate fidelities, and coherence times. The paper evaluates key quantum algorithms Shor's factoring algorithm [1], Grover's search algorithm [2], the Variational Quantum Eigensolver (VQE) [3], and the Quantum Approximate Optimization Algorithm (QAOA) [4] in the context of their practical applicability to real-world problems. We further discuss the milestone of quantum computational advantage demonstrated by Google's Sycamore processor [5] and IBM's ambitious hardware roadmap toward fault-tolerant quantum computing [6]. Our analysis reveals that while universal fault-tolerant quantum computing remains a long-term objective, NISQ-era devices are already yielding valuable results in quantum chemistry simulation, combinatorial optimization, and quantum machine learning. We conclude by identifying the critical challenges—error correction, scalability, and algorithm design that must be addressed to realize the full potential of quantum computing.

•Apr 29, 2026•0 citations

Algorithm development for near-term quantum computers

Sim, Sukin

Fault-tolerant quantum computers, when realized, guarantee significant speedups for particular computational tasks. Quantum hardware in the near term, however, is limited to low hundreds of noisy qubits that are not error-corrected. To leverage such devices as well as accommodate rapid developments in both hardware and algorithms, variational quantum algorithms (VQAs) were introduced. These algorithms have the potential to be useful in areas such as chemistry, optimization, machine learning, among others. Despite this potential, the largest experiment to date has employed just twelve qubits to implement the Variational Quantum Eigensolver (VQE), a VQA for simulating ground state energies of fermionic systems. In this dissertation, we present several methods for extending and further developing VQAs to step closer towards realizing applications in which quantum computers can provide meaningful advantages over classical computers. In the first part, we present methods for analyzing and optimizing parameterized quantum circuits (PQCs), a core component in VQAs for approximating target quantum states, e.g. ground state wavefunctions in VQE. To compare among PQCs and guide their design and selection, we introduce a set of algorithm-independent descriptors that can be estimated from simulations. Using these descriptors, we rule out circuits with limited capabilities in expressive and entangling powers. Next, we present a strategy for optimizing PQCs with large parameter counts and high redundancy by removing circuit operations that are less important for optimizing the algorithm objective, effectively reducing the search space. We demonstrate that this method enables larger VQE simulations by converging previously difficult optimizations while additionally reducing circuit resources. In the second part, we present methods for developing VQAs that are related to the quantum hardware. We introduce a new algorithm for simulating components of a quantum processor using an existing quantum computer. The goal of this application is to leverage near-term devices and algorithms to aid in the design of more powerful next-generation quantum hardware. Lastly, we present a guide for algorithm prototyping by deploying instances of VQAs on quantum computers via the cloud. We demonstrate instances of two algorithms, the quantum autoencoder and classifier, on an eight-qubit device. While further advancements in hardware and algorithms lie ahead, our work, along with developments from previous studies, represents significant progress towards realizing practical quantum advantage.

•Jan 1, 2021•0 citations

Exploring Quantum Computation: From Algorithms to Scalable Implementations

Akanksha Budholiya, Kalash Rajkumar Tiwari, Mamta Mohan Yadav +1 more

By using quantum mechanics to perform calculations classical systems are unable to handle, quantum computing has become a groundbreaking field. Progress in quantum algorithms, quantum simulations, and reliable architectures is reviewed in this paper. Recent research on the Hidden Subgroup Problem reveals links to lattice-based cryptography. Important algorithms such as Shor's for factoring and Grover's for searching show significant speed improvements. With the aid of digital and analog quantum simulations, fermionic and many-body systems can be efficiently modelled. These simulations solve problems classical computation does not. In order to develop scalable, universal quantum processors, various platforms are being used, including superconducting circuits, trapped ions, and photonic qubits. As a result of error correction, reliable computation, and measurement-based methods, gate errors and decoherence are reduced. With established protocols like BB84, quantum cryptography protects communication. Using theoretical foundations, experimental results, and practical applications, this paper examines the interrelationships between computational complexity, quantum hardware, and information security. The results highlight the potential of quantum computing to change computation, simulation, and secure communication, creating a path for future scalable quantum technologies.

•Mar 24, 2026•0 citations

A review on the potential applications and limitations of hardware approaches to quantum computing

Gabriel Kim Guisbert, Megan Holian, Sagan Giardino +2 more

This paper assesses the current state of the quantum computing field with reference to the varied hardware approaches to quantum computing to project the most cost-effective, practical, and long-term solution to quantum computing hardware. While companies and research labs have proven the viability of quantum computing through the construction and operation of intermediate-scale quantum computers, attempts have been unsuccessful at creating scalable, long-term quantum computers with significant capacity to be used in practical applications. While quantum algorithms and applications have already been developed, current quantum computers do not have the necessary hardware capabilities to support running such algorithms. Additionally, the construction of these quantum computers varies drastically, making it difficult to compare and measure quantum computing progress across different hardware architectures. This paper performs a comparative analysis on the four predominant quantum computing hardware architectures to reveal the most sustainable and practical solution based on the criteria of scalability, ease of manufacturing, and energy consumption. These comparisons, along with the shortcomings of each quantum design are discussed to guide further research and development in the field of quantum computing.

International Journal of Student Project Reporting•Jan 1, 2025•0 citations

A Review on the Potential Applications and Limitations of Hardware Approaches to Quantum Computing

Vishal Vittal, Sagan Giardino, Megan Holian +2 more

This paper assesses the current state of the quantum computing field with reference to the varied hardware approaches to quantum computing to project the most cost-effective, practical, and long-term solution to quantum computing hardware. While companies and research labs have proven the viability of quantum computing through the construction and operation of intermediate-scale quantum computers, attempts have been unsuccessful at creating scalable, long-term quantum computers with significant capacity to be used in practical applications. While quantum algorithms and applications have already been developed, current quantum computers do not have the necessary hardware capabilities to support running such algorithms. Additionally, the construction of these quantum computers varies drastically, making it difficult to compare and measure quantum computing progress across different hardware architectures. This paper performs a comparative analysis on the four predominant quantum computing hardware architectures to reveal the most sustainable and practical solution based on the criteria of scalability, ease of manufacturing, and energy consumption. These comparisons, along with the shortcomings of each quantum design are discussed to guide further research and development in the field of quantum computing.

International Journal of Student Project Reporting•Jan 1, 2024•0 citations

New pathways to universal quantum logic in the early era of fault tolerance

Friederike Butt

Quantum computers promise to solve computational problems that are inaccessible to classical machines. The reliable execution of large-scale quantum algorithms requires robust operations in the presence of noise. Quantum error correction addresses this challenge by encoding quantum information redundantly across several physical qubits, such that errors can be detected and corrected during a computation. However, no single error-correcting code intrinsically supports an inherently robust, fault-tolerant implementation of all gates needed for universal quantum computing. Moreover, most modern approaches to both quantum error correction and the implementation of universal logical operations on encoded qubits rely on mid-circuit measurements and feed-forward control. These types of operations are technologically demanding, often slow, and prone to high error rates, and they limit the overall success probability of quantum algorithms. In this thesis, we develop fault-tolerant protocols and circuits for quantum error correction and universal logical computation, with an emphasis on implementations compatible with current hardware systems. We first focus on fault-tolerant quantum error correction on small codes. By comparing different protocols, we identify trade-offs between compact circuit constructions and their robustness to noise. We then assess their practical performance by comparing numerical simulations of noisy circuits with experimental data. Beyond the preservation of encoded information, we study how universal logic can be implemented in a fault-tolerant manner on encoded qubits. A central approach considered in this thesis is code switching, in which logical information is transferred between two distinct error-correcting codes that support complementary sets of inherently fault-tolerant logical gates. In combination, these codes give access to a complete universal fault-tolerant logical gate set. In this thesis, we determine conditions that allow us to construct fault-tolerant protocols for code switching. We adapt these protocols to the capabilities of current hardware, thereby enabling the first experimental realization of universal fault-tolerant logic by means of code switching. However, the overall performance of these schemes is limited by slow and noisy mid-circuit measurements. To address this bottleneck, we construct a suite of measurement-free fault-tolerant universal operations that do not require any measurements during the execution of an algorithm. In this framework, error correction and logical operations are implemented coherently as part of the quantum circuit, without mid-circuit measurements or in-sequence classical control. We introduce measurement-free code-switching schemes that can be scaled to arbitrary code distances through concatenation, and which thereby provide, in principle, arbitrarily strong error suppression. We further tailor our approach to the capabilities of current trapped-ion quantum processors. New circuit constructions support the first experimental implementation of a logical quantum algorithm without mid-circuit measurements, demonstrated through Grover's search on three encoded qubits. Together, the results of this thesis expand the toolbox for early fault-tolerant quantum computation. They show how protocols for quantum error correction and universal logical gates can be designed without mid-circuit measurements with realistic hardware constraints in mind, opening new pathways towards universal quantum logic.

•Jan 1, 2026•0 citations
In 2000, David P. DiVincenzo proposed seven necessary criteria to construct a physical quantum computer. His requirements included device scalability, having well-defined qubits with long coherence times, and the ability to implement a universal gate set. Since then, research has propelled several experimental platforms to the forefront as contenders for quantum computing. The near-term implementations of these various architectures often face technical challenges -- such as limited scalability, short coherence times, or sub-universal computation -- leading to only a partial fulfillment of DiVincenzo's criteria. Despite device shortcomings, progress marches forward with increasingly useful demonstrations of quantum computation and simulation. Towards this end, the research compiled in this thesis presents novel quantum computing methods and applications that can be leveraged in the current era of constrained hardware capabilities. This thesis examines a diverse array of near-term topics, including the use of machine learning to aid in sample-efficient quantum state reconstruction via Born machines, methods to link distributed quantum simulators with incomplete information transfer for approximate fragmented simulation, universal computation with globally controlled analog simulators, and fast scrambling achieved with measurement-only quantum circuits.
Quantum computing has transitioned from a theoretical curiosity to an emerging technological paradigm with demonstrable computational advantages in specific problem domains. This paper presents a comprehensive review of current advances in quantum computing hardware, software, and near-term applications within the Noisy Intermediate-Scale Quantum (NISQ) era. We examine the architectural evolution of leading quantum platforms, including superconducting, trapped-ion, and photonic systems, analyzing their qubit counts, gate fidelities, and coherence times. The paper evaluates key quantum algorithms Shor's factoring algorithm [1], Grover's search algorithm [2], the Variational Quantum Eigensolver (VQE) [3], and the Quantum Approximate Optimization Algorithm (QAOA) [4] in the context of their practical applicability to real-world problems. We further discuss the milestone of quantum computational advantage demonstrated by Google's Sycamore processor [5] and IBM's ambitious hardware roadmap toward fault-tolerant quantum computing [6]. Our analysis reveals that while universal fault-tolerant quantum computing remains a long-term objective, NISQ-era devices are already yielding valuable results in quantum chemistry simulation, combinatorial optimization, and quantum machine learning. We conclude by identifying the critical challenges—error correction, scalability, and algorithm design that must be addressed to realize the full potential of quantum computing.
Fault-tolerant quantum computers, when realized, guarantee significant speedups for particular computational tasks. Quantum hardware in the near term, however, is limited to low hundreds of noisy qubits that are not error-corrected. To leverage such devices as well as accommodate rapid developments in both hardware and algorithms, variational quantum algorithms (VQAs) were introduced. These algorithms have the potential to be useful in areas such as chemistry, optimization, machine learning, among others. Despite this potential, the largest experiment to date has employed just twelve qubits to implement the Variational Quantum Eigensolver (VQE), a VQA for simulating ground state energies of fermionic systems. In this dissertation, we present several methods for extending and further developing VQAs to step closer towards realizing applications in which quantum computers can provide meaningful advantages over classical computers. In the first part, we present methods for analyzing and optimizing parameterized quantum circuits (PQCs), a core component in VQAs for approximating target quantum states, e.g. ground state wavefunctions in VQE. To compare among PQCs and guide their design and selection, we introduce a set of algorithm-independent descriptors that can be estimated from simulations. Using these descriptors, we rule out circuits with limited capabilities in expressive and entangling powers. Next, we present a strategy for optimizing PQCs with large parameter counts and high redundancy by removing circuit operations that are less important for optimizing the algorithm objective, effectively reducing the search space. We demonstrate that this method enables larger VQE simulations by converging previously difficult optimizations while additionally reducing circuit resources. In the second part, we present methods for developing VQAs that are related to the quantum hardware. We introduce a new algorithm for simulating components of a quantum processor using an existing quantum computer. The goal of this application is to leverage near-term devices and algorithms to aid in the design of more powerful next-generation quantum hardware. Lastly, we present a guide for algorithm prototyping by deploying instances of VQAs on quantum computers via the cloud. We demonstrate instances of two algorithms, the quantum autoencoder and classifier, on an eight-qubit device. While further advancements in hardware and algorithms lie ahead, our work, along with developments from previous studies, represents significant progress towards realizing practical quantum advantage.
By using quantum mechanics to perform calculations classical systems are unable to handle, quantum computing has become a groundbreaking field. Progress in quantum algorithms, quantum simulations, and reliable architectures is reviewed in this paper. Recent research on the Hidden Subgroup Problem reveals links to lattice-based cryptography. Important algorithms such as Shor's for factoring and Grover's for searching show significant speed improvements. With the aid of digital and analog quantum simulations, fermionic and many-body systems can be efficiently modelled. These simulations solve problems classical computation does not. In order to develop scalable, universal quantum processors, various platforms are being used, including superconducting circuits, trapped ions, and photonic qubits. As a result of error correction, reliable computation, and measurement-based methods, gate errors and decoherence are reduced. With established protocols like BB84, quantum cryptography protects communication. Using theoretical foundations, experimental results, and practical applications, this paper examines the interrelationships between computational complexity, quantum hardware, and information security. The results highlight the potential of quantum computing to change computation, simulation, and secure communication, creating a path for future scalable quantum technologies.
This paper assesses the current state of the quantum computing field with reference to the varied hardware approaches to quantum computing to project the most cost-effective, practical, and long-term solution to quantum computing hardware. While companies and research labs have proven the viability of quantum computing through the construction and operation of intermediate-scale quantum computers, attempts have been unsuccessful at creating scalable, long-term quantum computers with significant capacity to be used in practical applications. While quantum algorithms and applications have already been developed, current quantum computers do not have the necessary hardware capabilities to support running such algorithms. Additionally, the construction of these quantum computers varies drastically, making it difficult to compare and measure quantum computing progress across different hardware architectures. This paper performs a comparative analysis on the four predominant quantum computing hardware architectures to reveal the most sustainable and practical solution based on the criteria of scalability, ease of manufacturing, and energy consumption. These comparisons, along with the shortcomings of each quantum design are discussed to guide further research and development in the field of quantum computing.
This paper assesses the current state of the quantum computing field with reference to the varied hardware approaches to quantum computing to project the most cost-effective, practical, and long-term solution to quantum computing hardware. While companies and research labs have proven the viability of quantum computing through the construction and operation of intermediate-scale quantum computers, attempts have been unsuccessful at creating scalable, long-term quantum computers with significant capacity to be used in practical applications. While quantum algorithms and applications have already been developed, current quantum computers do not have the necessary hardware capabilities to support running such algorithms. Additionally, the construction of these quantum computers varies drastically, making it difficult to compare and measure quantum computing progress across different hardware architectures. This paper performs a comparative analysis on the four predominant quantum computing hardware architectures to reveal the most sustainable and practical solution based on the criteria of scalability, ease of manufacturing, and energy consumption. These comparisons, along with the shortcomings of each quantum design are discussed to guide further research and development in the field of quantum computing.
Quantum computers promise to solve computational problems that are inaccessible to classical machines. The reliable execution of large-scale quantum algorithms requires robust operations in the presence of noise. Quantum error correction addresses this challenge by encoding quantum information redundantly across several physical qubits, such that errors can be detected and corrected during a computation. However, no single error-correcting code intrinsically supports an inherently robust, fault-tolerant implementation of all gates needed for universal quantum computing. Moreover, most modern approaches to both quantum error correction and the implementation of universal logical operations on encoded qubits rely on mid-circuit measurements and feed-forward control. These types of operations are technologically demanding, often slow, and prone to high error rates, and they limit the overall success probability of quantum algorithms. In this thesis, we develop fault-tolerant protocols and circuits for quantum error correction and universal logical computation, with an emphasis on implementations compatible with current hardware systems. We first focus on fault-tolerant quantum error correction on small codes. By comparing different protocols, we identify trade-offs between compact circuit constructions and their robustness to noise. We then assess their practical performance by comparing numerical simulations of noisy circuits with experimental data. Beyond the preservation of encoded information, we study how universal logic can be implemented in a fault-tolerant manner on encoded qubits. A central approach considered in this thesis is code switching, in which logical information is transferred between two distinct error-correcting codes that support complementary sets of inherently fault-tolerant logical gates. In combination, these codes give access to a complete universal fault-tolerant logical gate set. In this thesis, we determine conditions that allow us to construct fault-tolerant protocols for code switching. We adapt these protocols to the capabilities of current hardware, thereby enabling the first experimental realization of universal fault-tolerant logic by means of code switching. However, the overall performance of these schemes is limited by slow and noisy mid-circuit measurements. To address this bottleneck, we construct a suite of measurement-free fault-tolerant universal operations that do not require any measurements during the execution of an algorithm. In this framework, error correction and logical operations are implemented coherently as part of the quantum circuit, without mid-circuit measurements or in-sequence classical control. We introduce measurement-free code-switching schemes that can be scaled to arbitrary code distances through concatenation, and which thereby provide, in principle, arbitrarily strong error suppression. We further tailor our approach to the capabilities of current trapped-ion quantum processors. New circuit constructions support the first experimental implementation of a logical quantum algorithm without mid-circuit measurements, demonstrated through Grover's search on three encoded qubits. Together, the results of this thesis expand the toolbox for early fault-tolerant quantum computation. They show how protocols for quantum error correction and universal logical gates can be designed without mid-circuit measurements with realistic hardware constraints in mind, opening new pathways towards universal quantum logic.