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

The New Scientist

Going quantum

Alex Wilkins

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1016/s0262-4079(26)00090-4

Related papers

Quantum A Go Go

Earl Callen

•Jan 1, 1966•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

Enter the quantum

Princeton University Press eBooks•Jan 17, 2023•0 citations

Taking the quantum leap

Maria Maragkou

Nature Photonics•Oct 1, 2014•12 citations

quantum

KODUKULLA V S L S DEEPAK

•Jul 6, 2025•0 citations

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
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.