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

Frontiers in ICT

The Grand Challenge of Quantum Computing: Bridging the Capacity Gap

Alexandre M. Zagoskin

Published Oct 22, 2014• 2 citations
Publisher
DOI
10.3389/fict.2014.00002

Related papers

The Quantum Computing Challenge

Paul M. B. Vitanyi

Lecture notes in computer science•Jan 1, 2001•2 citations

Quantum Computing: Bridging the Gap Between Theory and Practical Applications in Advanced Computing Systems

Le Thi Lan, Tran Minh Quang

Quantum computing represents a revolutionary leap in computational science, promising to solve problems that are currently intractable for classical computers. This article provides an in-depth exploration of the theoretical foundations of quantum computing, the current state of research, and the practical applications that are beginning to bridge the gap between theory and real-world implementation. We discuss the challenges faced in the field, including qubit stability, error correction, and scalability, and explore future directions for quantum computing. By examining these aspects, this article aims to provide a comprehensive understanding of the transformative potential of quantum computing and its implications for advanced computing systems.

Artificial Intelligence and Machine Learning Review•Jan 12, 2025•0 citations

Untangling the challenges of quantum computing

Nature Electronics•Mar 30, 2026•0 citations

Quantum computing and supply chain optimization: addressing complexity and efficiency challenges

Ming-Lang Tun Hwang, Wi-Lang Collin, Lee Sen Wang-xu

Quantum computing is used to address supply chain optimization complexity and efficiency. Multiple locations, time periods, transportation expenses, facility opening costs, production capacity, and demand fulfillment requirements complicate supply chains. Supply chain optimization's complexity and huge solution areas challenge traditional optimization methods. Quantum algorithms can efficiently explore bigger solution areas in quantum computing. Starting with problem identification, this research reviews quantum computing and supply chain optimization literature. The supply chain optimization problem is modeled mathematically to incorporate transportation, facility opening, production, and cost. Binary choice factors and constraints ensure demand fulfillment, facility capacity limitations, and flow balance. The mathematical theory is applied numerically. The example addresses three locations, two time periods, transportation costs, demand amounts, production capacity, and facility opening costs. A proper optimization solver optimizes the decision variables to reduce total cost while meeting demand and making efficient supply chain decisions. The supply chain optimization model reduces costs and informs transportation, facility opening, and production decisions. The numerical example shows how quantum computing may optimize supply chain topologies and reduce costs. The study explains the findings, highlights gaps in the literature, and stresses the need for more research to bridge theory and practice. This study advances supply chain optimization with quantum computing. It shows how quantum computing might improve supply chain network decision-making, efficiency, and cost.

International Journal of Enterprise Modelling•Sep 30, 2021•14 citations

Reopening the one clean qubit case of a semi-grand challenge

Christopher Mansell

In his 2005 list of semi-grand challenges for quantum computing theory, Scott Aaronson asked whether a quantum computer that is always in a separable mixed state can be simulated by a classical computer in polynomial time. An affirmative answer was claimed for the one clean qubit model of quantum computation. The supporting mathematical arguments relied on an exhaustive characterization of circuits that stay in separable states. Here, we give a counterexample where one pure qubit, known as the clean qubit, controls a sequence of three gates that act on a maximally mixed three-qubit register. The overall unitary that accumulates as these gates are applied has the properties that ensure the state of all four qubits remains fully separable. Crucially, we show that the final unitary cannot be put into the form required by the claimed simulation result. We also give a continuous-time implementation of the same circuit that keeps the qubits fully separable throughout and ends at the same unitary. We extend our counterexamples to a uniform family, and pinpoint the gap in the earlier proof. Since our circuits are themselves efficient to simulate classically, this work does not settle Aaronson's question. It does, however, reopen the semi-grand challenge for an actively researched model of quantum computation.

arXiv:2611.05046•Nov 3, 2026•0 citations

The Promise of Quantum Computing

Jeff Kabachinski

Biomedical Instrumentation & Technology•Dec 1, 2013•0 citations
Quantum computing represents a revolutionary leap in computational science, promising to solve problems that are currently intractable for classical computers. This article provides an in-depth exploration of the theoretical foundations of quantum computing, the current state of research, and the practical applications that are beginning to bridge the gap between theory and real-world implementation. We discuss the challenges faced in the field, including qubit stability, error correction, and scalability, and explore future directions for quantum computing. By examining these aspects, this article aims to provide a comprehensive understanding of the transformative potential of quantum computing and its implications for advanced computing systems.
Quantum computing is used to address supply chain optimization complexity and efficiency. Multiple locations, time periods, transportation expenses, facility opening costs, production capacity, and demand fulfillment requirements complicate supply chains. Supply chain optimization's complexity and huge solution areas challenge traditional optimization methods. Quantum algorithms can efficiently explore bigger solution areas in quantum computing. Starting with problem identification, this research reviews quantum computing and supply chain optimization literature. The supply chain optimization problem is modeled mathematically to incorporate transportation, facility opening, production, and cost. Binary choice factors and constraints ensure demand fulfillment, facility capacity limitations, and flow balance. The mathematical theory is applied numerically. The example addresses three locations, two time periods, transportation costs, demand amounts, production capacity, and facility opening costs. A proper optimization solver optimizes the decision variables to reduce total cost while meeting demand and making efficient supply chain decisions. The supply chain optimization model reduces costs and informs transportation, facility opening, and production decisions. The numerical example shows how quantum computing may optimize supply chain topologies and reduce costs. The study explains the findings, highlights gaps in the literature, and stresses the need for more research to bridge theory and practice. This study advances supply chain optimization with quantum computing. It shows how quantum computing might improve supply chain network decision-making, efficiency, and cost.
In his 2005 list of semi-grand challenges for quantum computing theory, Scott Aaronson asked whether a quantum computer that is always in a separable mixed state can be simulated by a classical computer in polynomial time. An affirmative answer was claimed for the one clean qubit model of quantum computation. The supporting mathematical arguments relied on an exhaustive characterization of circuits that stay in separable states. Here, we give a counterexample where one pure qubit, known as the clean qubit, controls a sequence of three gates that act on a maximally mixed three-qubit register. The overall unitary that accumulates as these gates are applied has the properties that ensure the state of all four qubits remains fully separable. Crucially, we show that the final unitary cannot be put into the form required by the claimed simulation result. We also give a continuous-time implementation of the same circuit that keeps the qubits fully separable throughout and ends at the same unitary. We extend our counterexamples to a uniform family, and pinpoint the gap in the earlier proof. Since our circuits are themselves efficient to simulate classically, this work does not settle Aaronson's question. It does, however, reopen the semi-grand challenge for an actively researched model of quantum computation.