January 01, 2023 conference-paper Open access Aachen paper

Optimizing Quantum Space Using Spooky Pebble Games

Lecture notes in computer science, pp. 134–149

DOI: 10.1007/978-3-031-38100-3_10 Full text (OA) OpenAlex

Authors 2

Arend-Jan Quist corresponding Aachen Leiden Institute of Advanced Computer Science

Leiden University

Affiliation as printed

Leiden Institute of Advanced Computer Science, Leiden University, Leiden, The Netherlands
Alfons Laarman Aachen Leiden Institute of Advanced Computer Science

Leiden University

Affiliation as printed

Leiden Institute of Advanced Computer Science, Leiden University, Leiden, The Netherlands

Cited by 6 stored of 6

Dataflow-Specific Algorithms for Resource-Constrained Scheduling and Memory Design
2025 ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) conference-paper Computer Science Parallel Computing and Optimization Techniques Open access

0

citations
Tight Bounds on the Spooky Pebble Game: Recycling Qubits with Measurements
2025 Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

4

citations
Qurts: Automatic Quantum Uncomputation by Affine Types with Lifetime
2025 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access

5

citations
Automated Reasoning in Quantum Circuit Compilation
2024 Lecture notes in computer science conference-paper Computer Science Quantum Computing Algorithms and Architecture Open access

4

citations
Equivalence Checking of Quantum Circuits by Model Counting
2024 Lecture notes in computer science conference-paper Computer Science Quantum Computing Algorithms and Architecture Open access

15

citations
Incremental Property Directed Reachability
2023 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification

1

citations

6 results

No patents citing this paper on Lens.org (checked 2026-10-11).

References 17

A fast quantum mechanical algorithm for database search
1996 ACM Symposium on Theory of Computing (STOC) conference-paper Computer Science Quantum Computing Algorithms and Architecture Open access

8,773

citations
Algorithms for quantum computation: discrete logarithms and factoring
2002 conference-paper Computer Science Quantum Computing Algorithms and Architecture

8,773

citations
Z3: An Efficient SMT Solver
2008 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

6,545

citations
Handbook of Satisfiability
2021 Frontiers in artificial intelligence and applications book Computer Science Constraint Satisfaction and Optimization

1,039

citations
Time/Space Trade-Offs for Reversible Computation
1989 SIAM Journal on Computing article Computer Science Computability, Logic, AI Algorithms

414

citations
Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
2018 Physical Review X article Computer Science Quantum Computing Algorithms and Architecture Open access

379

citations
Circuit-Based Quantum Random Access Memory for Classical Data
2019 Scientific Reports article Computer Science Quantum Computing Algorithms and Architecture Open access

148

citations
He Gives C-Sieves on the CSIDH
2020 Lecture notes in computer science conference-paper Computer Science Cryptography and Residue Arithmetic

120

citations
Reversible simulation of irreversible computation
1998 Physica D Nonlinear Phenomena article Computer Science Computability, Logic, AI Algorithms Open access

47

citations
Design automation and design space exploration for quantum computers
2017 Design, Automation, and Test in Europe conference-paper Computer Science Quantum Computing Algorithms and Architecture Open access

39

citations
Reversible Pebbling Game for Quantum Memory Management
2019 Design, Automation, and Test in Europe conference-paper Computer Science Quantum Computing Algorithms and Architecture Open access

35

citations
Just a Pebble Game
2013 Proceedings - IEEE Conference on Computational Complexity/Proceedings conference-paper Computer Science Complexity and Algorithms in Graphs

28

citations
Hardness of Approximation in PSPACE and Separation Results for Pebble Games
2015 Annual Symposium on Foundations of Computer Science conference-paper Computer Science Complexity and Algorithms in Graphs

23

citations
The pebbling problem is complete in polynomial space
1979 ACM Symposium on Theory of Computing (STOC) conference-paper Computer Science Complexity and Algorithms in Graphs Open access

18

citations
Reversible Pebble Game on Trees
2015 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs

6

citations
W3103176376
details pending

0

citations
W2963563052
details pending

0

citations

17 results