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 A Go Go

Earl Callen

Published Jan 1, 1966• 0 citations
OpenAlex

Related papers

Going quantum

Alex Wilkins

The New Scientist•Jan 1, 2026•0 citations

Quantum ? Question

Institute of Physics eBooks•Nov 26, 2004•0 citations

Quantum Go: Designing a Proof-of-Concept on Quantum Computer

Shibashankar Sahu, Biswaranjan Panda, Arnab Chowhan +2 more

The strategic Go game, known for the tedious mathematical complexities, has been used as a theme in many fiction, movies, and books. Here, we introduce the Go game and provide a new version of quantum Go in which the boxes are initially in a superposition of quantum states |0> and |1> and the players have two kinds of moves (classical and quantum) to mark each box. The mark on each box depends on the state to which the qubit collapses after the measurement. All other rules remain the same, except for here, we capture only one stone and not chains. Due to the enormous power and exponential speed-up of quantum computers as compared to classical computers, we may think of quantum computing as the future. So, here we provide a tangible introduction to superposition, collapse, and entanglement via our version of quantum Go. Finally, we compare the classical complexity with the quantum complexity involved in playing the Go game.

arXiv:2206.05250•Jun 10, 2022•1 citation

No-go result for quantum postselection measurements of a rank- m degenerate subspace

Le Bin Ho

We present a no-go result for postselection measurements where the conditional expectation value of a joint system-device observable under postselection is nothing else than the conventional expectation value. Such a no-go result relies on the rank-$m$ degenerate of the joint observable, where $m$ is the dimension of the device subspace. Remarkably, we show that the error and disturbance in quantum measurements obey the no-go result, which implies that the error-disturbance uncertainty is unaffected under postselection measurements.

arXiv:2303.17090•Physical Review A•Apr 7, 2023•1 citation

Quantum walking the line

Anonymous

Physics•Sep 14, 2009•0 citations

Optimal no-go theorem on hidden-variable predictions of effect expectations

Andreas R. Blass, Yuri G. Gurevich

No-go theorems prove that, under reasonable assumptions, classical hidden-variable theories cannot reproduce the predictions of quantum mechanics. Traditional no-go theorems proved that hidden-variable theories cannot predict correctly the values of observables. Recent expectation no-go theorems prove that hidden-variable theories cannot predict the expectations of observables. We prove the strongest expectation-focused no-go theorem to date. It is optimal in the sense that the natural weakenings of the assumptions and the natural strengthenings of the conclusion make the theorem fail. The literature on expectation no-go theorems strongly suggests that the expectation-focused approach is more general than the value-focused one. We establish that the expectation approach is not more general.

arXiv:1509.06896•Physical Review A•Mar 26, 2018•2 citations
The strategic Go game, known for the tedious mathematical complexities, has been used as a theme in many fiction, movies, and books. Here, we introduce the Go game and provide a new version of quantum Go in which the boxes are initially in a superposition of quantum states |0> and |1> and the players have two kinds of moves (classical and quantum) to mark each box. The mark on each box depends on the state to which the qubit collapses after the measurement. All other rules remain the same, except for here, we capture only one stone and not chains. Due to the enormous power and exponential speed-up of quantum computers as compared to classical computers, we may think of quantum computing as the future. So, here we provide a tangible introduction to superposition, collapse, and entanglement via our version of quantum Go. Finally, we compare the classical complexity with the quantum complexity involved in playing the Go game.
We present a no-go result for postselection measurements where the conditional expectation value of a joint system-device observable under postselection is nothing else than the conventional expectation value. Such a no-go result relies on the rank-mmm degenerate of the joint observable, where mmm is the dimension of the device subspace. Remarkably, we show that the error and disturbance in quantum measurements obey the no-go result, which implies that the error-disturbance uncertainty is unaffected under postselection measurements.
No-go theorems prove that, under reasonable assumptions, classical hidden-variable theories cannot reproduce the predictions of quantum mechanics. Traditional no-go theorems proved that hidden-variable theories cannot predict correctly the values of observables. Recent expectation no-go theorems prove that hidden-variable theories cannot predict the expectations of observables. We prove the strongest expectation-focused no-go theorem to date. It is optimal in the sense that the natural weakenings of the assumptions and the natural strengthenings of the conclusion make the theorem fail. The literature on expectation no-go theorems strongly suggests that the expectation-focused approach is more general than the value-focused one. We establish that the expectation approach is not more general.