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

Quantum Computing, Communication, and Simulation

Quantum and classical computing model

Kimaya Rajput, Stephanie Callahan

Published Jan 16, 2026• 0 citations
Publisher
DOI
10.1117/12.3088752

Related papers

Quantum Computing Model

Sergei Kurgalin, Sergei Borzunov

Texts in computer science•Jan 1, 2021•0 citations

The Scalability of Quantum Computing Models to Classical Computers

Vaed Dhruv, Jiya Goswami, Dhanya Velkur +1 more

Quantum Machine Learning (QML) Models are models that run on Quantum Computing platforms that offer tremendous performance benefits over Traditional Computer Systems. While Quantum Models are significantly more powerful than classical computers, they come with some serious limitations such as needing to be kept at extremely low temperatures, a need for extreme atmospheric stability, and most importantly, their particularly high costs. This paper explores some ways to scale Quantum Systems to be more accessible for everyday users, discussing solutions such as Hybrid Quantum-Classical models, Improved Qubit Technology, and Cloud Quantum Systems, and finding that the most optimal solution to scale Quantum Computing is with a joint approach between Hybrid Models as well as Cloud Infrastructure. This solution is able to utilize the best capabilities of both Quantum Computers and Classical Computers, allowing users to employ the most advanced Quantum Computers hosted on the cloud, alongside their classical computer in order to achieve performance results similar to those achieved by Quantum Models today.

•May 20, 2025•0 citations

Classical and quantum computing

Springer eBooks•Jan 1, 2007•28 citations

Classical simulation complexity of restricted models of quantum computation

Dax Enshan Koh

Restricted models of quantum computation are mathematical models which describe quantum computers that have limited access to certain resources. Well-known examples of such models include the boson sampling model, extended Clifford circuits, and instantaneous quantum polynomial-time circuits. While unlikely to be universal for quantum computation, several of these models appear to be able to outperform classical computers at certain computational tasks, such as sampling from certain probability distributions. Understanding which of these models are capable of performing such tasks and characterizing the classical simulation complexity of these models--i.e. how hard it is to simulate these models on a classical computer--are some of the central questions we address in this thesis. Our first contribution is a classification of various extended Clifford circuits according to their classical simulation complexity.

•Jan 1, 2019•0 citations

HTM: A Hybrid Classical-Quantum Computation Model

Guoqiang Shu, Zongjiang Yi, Jinyang Yao +4 more

Classical and quantum computers have achieved collaborative computation and completed applications across numerous fields. Nevertheless, the absence of a unified hybrid computation model has led to issues such as non-standardized engineering architecture design, ambiguous task partitioning criteria and so on. To address these issues, this research proposes a hybrid classical-quantum computation model (HTM). By constructing unified state sets and transition function representations, HTM clarifies hybrid control logic and implements a control-sharing mechanism. Simultaneously, a comprehensive complexity calculation method based on entanglement and superposition was proposed, supporting computation task partitioning and resource scheduling. The HTM fills a theoretical gap in the classical-quantum hybrid computation area and implements the joint promotion and development of computing models and hardware.

quant-pharXiv:2610.37249•Oct 28, 2026•0 citations

Quantum computing models

Daowen Qiu

Elsevier eBooks•Aug 29, 2025•0 citations
Quantum Machine Learning (QML) Models are models that run on Quantum Computing platforms that offer tremendous performance benefits over Traditional Computer Systems. While Quantum Models are significantly more powerful than classical computers, they come with some serious limitations such as needing to be kept at extremely low temperatures, a need for extreme atmospheric stability, and most importantly, their particularly high costs. This paper explores some ways to scale Quantum Systems to be more accessible for everyday users, discussing solutions such as Hybrid Quantum-Classical models, Improved Qubit Technology, and Cloud Quantum Systems, and finding that the most optimal solution to scale Quantum Computing is with a joint approach between Hybrid Models as well as Cloud Infrastructure. This solution is able to utilize the best capabilities of both Quantum Computers and Classical Computers, allowing users to employ the most advanced Quantum Computers hosted on the cloud, alongside their classical computer in order to achieve performance results similar to those achieved by Quantum Models today.
Restricted models of quantum computation are mathematical models which describe quantum computers that have limited access to certain resources. Well-known examples of such models include the boson sampling model, extended Clifford circuits, and instantaneous quantum polynomial-time circuits. While unlikely to be universal for quantum computation, several of these models appear to be able to outperform classical computers at certain computational tasks, such as sampling from certain probability distributions. Understanding which of these models are capable of performing such tasks and characterizing the classical simulation complexity of these models--i.e. how hard it is to simulate these models on a classical computer--are some of the central questions we address in this thesis. Our first contribution is a classification of various extended Clifford circuits according to their classical simulation complexity.
Classical and quantum computers have achieved collaborative computation and completed applications across numerous fields. Nevertheless, the absence of a unified hybrid computation model has led to issues such as non-standardized engineering architecture design, ambiguous task partitioning criteria and so on. To address these issues, this research proposes a hybrid classical-quantum computation model (HTM). By constructing unified state sets and transition function representations, HTM clarifies hybrid control logic and implements a control-sharing mechanism. Simultaneously, a comprehensive complexity calculation method based on entanglement and superposition was proposed, supporting computation task partitioning and resource scheduling. The HTM fills a theoretical gap in the classical-quantum hybrid computation area and implements the joint promotion and development of computing models and hardware.