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

Nature Physics

More spookiness

Iulia Georgescu

Published Oct 1, 2012• 0 citations
Publisher
DOI
10.1038/nphys2452

Related papers

From spooky foundations

Sebastian Deffner

Nature Physics•Apr 30, 2015•8 citations

Another level of weirdness

Ciarán M. Lee

The New Scientist•Mar 1, 2023•0 citations

Trade-offs between classical and quantum space using spooky pebbling

Arend-Jan Quist, Alfons Laarman

Pebble games are used to study space/time trade-offs. Recently, spooky pebble games were introduced to study classical space / quantum space / time trade-offs for simulation of classical circuits on quantum computers. In this paper, the spooky pebble game framework is applied for the first time to general circuits. Using this framework we prove an upper bound for quantum space in the spooky pebble game. We also prove that solving the spooky pebble game is PSPACE-complete. Moreover, we present a solver for the spooky pebble game based on satisfiability solvers combined with heuristic optimizers. This spooky pebble game solver was empirically evaluated by calculating optimal classical space / quantum space / time trade-offs. Within limited runtime, the solver could find a strategy reducing quantum space when classical space is taken into account, showing that the spooky pebble model is useful to reduce quantum space.

arXiv:2401.10579•Logical Methods in Computer Science•Dec 12, 2025•1 citation

Spooky Sensor at a Distance

Samuel Jarman

Spooky Sensor

Physics•Oct 30, 2025•0 citations

Strange sounds

Dmitri V. Khveshchenko

•Nov 8, 2024•0 citations

Strange sounds

Dmitri V. Khveshchenko

Physics Letters A•Oct 23, 2024•3 citations
Pebble games are used to study space/time trade-offs. Recently, spooky pebble games were introduced to study classical space / quantum space / time trade-offs for simulation of classical circuits on quantum computers. In this paper, the spooky pebble game framework is applied for the first time to general circuits. Using this framework we prove an upper bound for quantum space in the spooky pebble game. We also prove that solving the spooky pebble game is PSPACE-complete. Moreover, we present a solver for the spooky pebble game based on satisfiability solvers combined with heuristic optimizers. This spooky pebble game solver was empirically evaluated by calculating optimal classical space / quantum space / time trade-offs. Within limited runtime, the solver could find a strategy reducing quantum space when classical space is taken into account, showing that the spooky pebble model is useful to reduce quantum space.