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

The Nature, Capability Limits, and Technical Boundaries of Quantum Computing DIKWP In-Depth Conclusion Report

Yucong Duan, Shuaishuai Huang, Shiming Gong

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.13140/rg.2.2.30934.00322

Related papers

Computational Boundary Transfer Theory (CBTT)

Jincheng Zhang

Computational Boundary Transfer Theory, abbreviated CBTT, proposes a principled framework for translating constraints and capabilities that are traditionally defined in one computational paradigm into an equivalent formulation in another paradigm. The central insight is that many seemingly unrelated computational limits, such as time and space bounds for Turing machines, depth and width constraints for neural networks, and communication complexity for distributed systems, can be mapped onto a common boundary space. By constructing explicit mapping functions between these boundary spaces, CBTT enables the transfer of results, intuitions, and techniques across domains that have historically been studied in isolation. This paper develops the formal underpinnings of CBTT, introduces a generic boundary mapping function f that transforms a computational boundary expressed in one model into its counterpart in another model, and demonstrates how the theory unifies several prominent computational limit frameworks. We illustrate the theory through several canonical examples, including the transfer from classical decision tree depth limits to modern deep learning architecture depth limits, and from quantum circuit depth limits to classical circuit depth limits. The theory also provides a potential pathway to a more general understanding of the computational power of hybrid models, such as quantum neural networks. CBTT's ability to bridge discrete and continuous computational boundaries suggests that the theory could serve as a foundational tool for future research in complexity theory, algorithm design, and artificial intelligence. The paper concludes with a discussion of potential implications for the Turing Award and outlines directions for future investigations that could expand the reach of CBTT to emerging computational paradigms.

•Aug 16, 2026•0 citations

Quantum computing research: An in-depth exploration

N. A. Natraj, Pethuru Raj Chelliah

Advances in computers•Jan 1, 2025•0 citations

On the need for large Quantum depth

Nai-Hui Chia, Kai-Min Chung, Ching–Yi Lai

Near-term quantum computers are likely to have small depths due to short coherence time and noisy gates. A natural approach to leverage these quantum computers is interleaving them with classical computers. Understanding the capabilities and limits of this hybrid approach is an essential topic in quantum computation. Most notably, the quantum Fourier transform can be implemented by a hybrid of logarithmic-depth quantum circuits and a classical polynomial-time algorithm. Therefore, it seems possible that quantum polylogarithmic depth is as powerful as quantum polynomial depth in the presence of classical computation.

ACM Symposium on Theory of Computing (STOC)•Jun 7, 2020•20 citations

QUANTUM COMPUTING FUNDAMENTALS AND FUTURE PROSPECTS

Mihir Harishbhai Rajyaguru, Ihtiram Raza Khan, Dr. Anima Bag +1 more

•Mar 10, 2026•0 citations

On the Need for Large Quantum Depth

Nai-Hui Chia, Kai-Min Chung, Ching–Yi Lai

Near-term quantum computers are likely to have small depths due to short coherence time and noisy gates. A natural approach to leverage these quantum computers is interleaving them with classical computers. Understanding the capabilities and limits of this hybrid approach is an essential topic in quantum computation. Most notably, the quantum Fourier transform can be implemented by a hybrid of logarithmic-depth quantum circuits and a classical polynomial-time algorithm. Therefore, it seems possible that quantum polylogarithmic depth is as powerful as quantum polynomial depth in the presence of classical computation. Indeed, Jozsa conjectured that “ Any quantum polynomial-time algorithm can be implemented with only O (log n ) quantum depth interspersed with polynomial-time classical computations. ” This can be formalized as asserting the equivalence of BQP and “ BQNC BPP .” However, Aaronson conjectured that “ there exists an oracle separation between BQP and BPP BQNC . ” BQNC BPP and BPP BQNC are two natural and seemingly incomparable ways of hybrid classical-quantum computation. In this work, we manage to prove Aaronson’s conjecture and in the meantime prove that Jozsa’s conjecture, relative to an oracle, is false. In fact, we prove a stronger statement that for any depth parameter d , there exists an oracle that separates quantum depth d and 2 d +1 in the presence of classical computation. Thus, our results show that relative to oracles, doubling the quantum circuit depth does make the hybrid model more powerful, and this cannot be traded by classical computation.

arXiv:1909.10303•Journal of the ACM•Nov 23, 2022•11 citations

The challenges and concerns of quantum computing

M. Arvindhan

Advances in computers•Jan 1, 2025•1 citation
Computational Boundary Transfer Theory, abbreviated CBTT, proposes a principled framework for translating constraints and capabilities that are traditionally defined in one computational paradigm into an equivalent formulation in another paradigm. The central insight is that many seemingly unrelated computational limits, such as time and space bounds for Turing machines, depth and width constraints for neural networks, and communication complexity for distributed systems, can be mapped onto a common boundary space. By constructing explicit mapping functions between these boundary spaces, CBTT enables the transfer of results, intuitions, and techniques across domains that have historically been studied in isolation. This paper develops the formal underpinnings of CBTT, introduces a generic boundary mapping function f that transforms a computational boundary expressed in one model into its counterpart in another model, and demonstrates how the theory unifies several prominent computational limit frameworks. We illustrate the theory through several canonical examples, including the transfer from classical decision tree depth limits to modern deep learning architecture depth limits, and from quantum circuit depth limits to classical circuit depth limits. The theory also provides a potential pathway to a more general understanding of the computational power of hybrid models, such as quantum neural networks. CBTT's ability to bridge discrete and continuous computational boundaries suggests that the theory could serve as a foundational tool for future research in complexity theory, algorithm design, and artificial intelligence. The paper concludes with a discussion of potential implications for the Turing Award and outlines directions for future investigations that could expand the reach of CBTT to emerging computational paradigms.
Near-term quantum computers are likely to have small depths due to short coherence time and noisy gates. A natural approach to leverage these quantum computers is interleaving them with classical computers. Understanding the capabilities and limits of this hybrid approach is an essential topic in quantum computation. Most notably, the quantum Fourier transform can be implemented by a hybrid of logarithmic-depth quantum circuits and a classical polynomial-time algorithm. Therefore, it seems possible that quantum polylogarithmic depth is as powerful as quantum polynomial depth in the presence of classical computation.
Near-term quantum computers are likely to have small depths due to short coherence time and noisy gates. A natural approach to leverage these quantum computers is interleaving them with classical computers. Understanding the capabilities and limits of this hybrid approach is an essential topic in quantum computation. Most notably, the quantum Fourier transform can be implemented by a hybrid of logarithmic-depth quantum circuits and a classical polynomial-time algorithm. Therefore, it seems possible that quantum polylogarithmic depth is as powerful as quantum polynomial depth in the presence of classical computation. Indeed, Jozsa conjectured that “ Any quantum polynomial-time algorithm can be implemented with only O (log n ) quantum depth interspersed with polynomial-time classical computations. ” This can be formalized as asserting the equivalence of BQP and “ BQNC BPP .” However, Aaronson conjectured that “ there exists an oracle separation between BQP and BPP BQNC . ” BQNC BPP and BPP BQNC are two natural and seemingly incomparable ways of hybrid classical-quantum computation. In this work, we manage to prove Aaronson’s conjecture and in the meantime prove that Jozsa’s conjecture, relative to an oracle, is false. In fact, we prove a stronger statement that for any depth parameter d , there exists an oracle that separates quantum depth d and 2 d +1 in the presence of classical computation. Thus, our results show that relative to oracles, doubling the quantum circuit depth does make the hybrid model more powerful, and this cannot be traded by classical computation.