MétaCan
Menu
Back to cohort
Record W4389162714 · doi:10.1109/qce57702.2023.20328

QWalkVis: Quantum Walks Visualization Application

2023· article· en· W4389162714 on OpenAlexaff
Addie Jordon, Austin Hawkins-Seagram, Samantha Norrie, José Ossorio, Ulrike Stege

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsQuantum walkRandom walkVisualizationProbabilistic logicQuantumSuperposition principleComputer scienceQuantum computerStatistical physicsSpace (punctuation)Quantum algorithmTheoretical computer scienceMathematicsPhysicsArtificial intelligenceQuantum mechanicsStatistics

Abstract

fetched live from OpenAlex

Quantum walks (QWs) are the quantum analogue to classical random walks. We present visualizations for quantum walks and show how they can be used to teach quantum concepts such as superposition and interference. Using our Quantum Walks Visualization Application (QWalkVis) for visualizing quan-tum walks lets the user select the dimensions, number of states, and number of steps in the walk and generates probabilistic plots on-the-fly. Users can view a plot for each step of the walk, allowing them to compare the probability distributions as time progresses. Visualizations share an important space in education; QWalkVis was created to aid students in learning about quantum walks and foundational quantum concepts through an interactive design. We highlight some potential use cases of QWalkVis for both self-directed student learning and the education in a classroom.

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 distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.961
Threshold uncertainty score0.756

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.001

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.010
GPT teacher head0.264
Teacher spread0.254 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
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

Citations4
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicQuantum Computing Algorithms and ArchitectureFrench-language works237,207