MétaCan
Menu
Back to cohort
Record W4382362536 · doi:10.31234/osf.io/z675e

Steps Toward Quantum Computational Creativity

2023· preprint· en· W4382362536 on OpenAlexafffund
Liane Gabora

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsUniversity of British Columbia
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsQuantum entanglementCreativityComputer scienceContext (archaeology)Superposition principleQuantumQuantum computerCognitionTheoretical computer scienceCognitive scienceQuantum mechanicsPhysicsPsychology

Abstract

fetched live from OpenAlex

At the heart of creativity is the forging of new concept combinations and the adapting of existing ideas to new situations. However, these processes have resisted mathematical description; concepts violate the rules of classical logic when they interact, e.g., concept combinations can exhibit emergent features not possessed by their constituent concepts. These challenges can be addressed using the quantum cognition framework, wherein nonclassical behavior is described in terms of superposition, entanglement, and interference. While in classical probability theory events are drawn from a common sample space, in quantum models events are defined only with respect to a measurement, or (in quantum cognition) a context, and the probabilities reflect the underlying reality. The measurement (or context) causes collapse from a superposition state to a definite eigenstate. The paper explains how creativity can be modelled using quantum cognition approach with an illustrative example, and discuss how the approach could be implemented computationally. Quantum computing is widely expected to revolutionize many fields in the near future through immense increases in speed and computing power. The time may be ripe to explore the potential of quantum computational creativity.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.011
Threshold uncertainty score0.036

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.006
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0020.008
Scholarly communication0.0050.009
Open science0.0020.004
Research integrity0.0030.005
Insufficient payload (model declined to judge)0.0110.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.051
GPT teacher head0.295
Teacher spread0.244 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2023
Admission routes2
Has abstractyes

Explore more

Same topicQuantum Computing Algorithms and ArchitectureFrench-language works237,207