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

Communications in computer and information science

Human Factors of Quantum Modeling and Computing

Pi Liu, Denny Yu

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-981-95-7829-0_15

Related papers

Quantum Computation in a Human Environment

Fernando Flores, Luis de‐Marcos, Carmen Flores

•Jan 1, 2019•3 citations

Quantum Structure Model of Judgement in Battlespace

Zhihua Song, Han Zhang, Wanfang Che +1 more

A quantum structure model of judgment in battlespace is presented and used to compute the probability of target identification and its evolution with incoming new evidence deprived from the refreshed reconnaissance image.On the one hand, human behavioral factors are hard to model using the classic probability theory in battlespace which is full of antagonism, uncertainty and irrationality.On the other hand, quantum theory is more general and powerful for representing and analyzing human's judgment and decisionmaking.In the task of identifying of real-false targets pair, a Mental Hamilton is constructed in order to transform a state to the next after new evidence arrived.The results computed on the basis of random-phase initial state of cognition and constructed mental Hamiltonian show that interference effect may appear and the Formula of Total Probability may be violated with quantum structure model of judgment, and these are just what usually happen in the human's judgment and decision-making in the reality.

International Conference on Intelligent Computing and Cognitive Informatics (ICICCI)•Jan 1, 2015•0 citations

Low-depth quantum architectures for factoring

Aram W. Harrow, Paul Pham

Quantum computing is a new field which combines computer science and quantum physics. Its most famous result, Shor's factoring algorithm, would enable us to one day compromise the widely-used RSA cryptosystem if we are able to design efficient quantum architectures. Studying the depth of these architectures would allow us to solve this human problem within a human lifetime. Toward that end, we contribute two hybrid factoring architectures in poly-logarithmic and sub-logarithmic depths, which are both exponential improvements over previous known works. We also present an improved procedure for generating quantum Fourier states useful for quantum compiling. Finally, we invent a new circuit resource called coherence which upper bounds the error-correcting effort needed in a future quantum computer. We use this to characterize a better time-space tradeoff for factoring as well as to provide configurable-depth factoring architectures.

•Jan 1, 2013•0 citations

Quantum computing research: An in-depth exploration

N. A. Natraj, Pethuru Raj Chelliah

Advances in computers•Jan 1, 2025•0 citations

The limits of computation

Mingji Xia, Zhengfeng Ji

The powerful idea of computation has accompanied the development of human civilization, has deeply changed the way we live and work, and has accelerated the advancement of many areas of sciences. In this article, we explore the power and limits of computation from several different perspectives. We will discuss topics from the models of computation and Church-Turing thesis, to the impact of the P versus NP problem and quantum computing on our understanding of the limits of computation. More concretely, we will explore the computability and the halting problem, the efficiency problem of computation, the P versus NP problem. We then move on to the discussion of quantum computation, quantum algorithm for factoring and its implications, quantum simulation and the relation between quantum and classical computations.

Chinese Science Bulletin (Chinese Version)•Jan 25, 2016•1 citation

Quantum Computing and Its Impact

Matt Turlington, Lee E. Sattler, Dante J. Pacella +2 more

Springer eBooks•Jan 1, 2021•4 citations
A quantum structure model of judgment in battlespace is presented and used to compute the probability of target identification and its evolution with incoming new evidence deprived from the refreshed reconnaissance image.On the one hand, human behavioral factors are hard to model using the classic probability theory in battlespace which is full of antagonism, uncertainty and irrationality.On the other hand, quantum theory is more general and powerful for representing and analyzing human's judgment and decisionmaking.In the task of identifying of real-false targets pair, a Mental Hamilton is constructed in order to transform a state to the next after new evidence arrived.The results computed on the basis of random-phase initial state of cognition and constructed mental Hamiltonian show that interference effect may appear and the Formula of Total Probability may be violated with quantum structure model of judgment, and these are just what usually happen in the human's judgment and decision-making in the reality.
Quantum computing is a new field which combines computer science and quantum physics. Its most famous result, Shor's factoring algorithm, would enable us to one day compromise the widely-used RSA cryptosystem if we are able to design efficient quantum architectures. Studying the depth of these architectures would allow us to solve this human problem within a human lifetime. Toward that end, we contribute two hybrid factoring architectures in poly-logarithmic and sub-logarithmic depths, which are both exponential improvements over previous known works. We also present an improved procedure for generating quantum Fourier states useful for quantum compiling. Finally, we invent a new circuit resource called coherence which upper bounds the error-correcting effort needed in a future quantum computer. We use this to characterize a better time-space tradeoff for factoring as well as to provide configurable-depth factoring architectures.
The powerful idea of computation has accompanied the development of human civilization, has deeply changed the way we live and work, and has accelerated the advancement of many areas of sciences. In this article, we explore the power and limits of computation from several different perspectives. We will discuss topics from the models of computation and Church-Turing thesis, to the impact of the P versus NP problem and quantum computing on our understanding of the limits of computation. More concretely, we will explore the computability and the halting problem, the efficiency problem of computation, the P versus NP problem. We then move on to the discussion of quantum computation, quantum algorithm for factoring and its implications, quantum simulation and the relation between quantum and classical computations.