Fetching the paper…
Reading the bibliography…
Measurement-based uncomputation (MBU) is a technique used to perform probabilistic uncomputation of quantum circuits.
“Spooky Pebble Games and Irreversible Uncomputation” Blog: Algorithmic Assertions, 2019
Craig Gidney · 1905
Earlier work this paper cites.
“Logical Reversibility of Computation”
C.. Bennett · 1973
Earlier work this paper cites.
“Time/Space Trade-offs for Reversible Computation”
Charles. Bennett · 1989
Earlier work this paper cites.
“First Draft of a Report on the EDVAC”
John Von · 1993
Earlier work this paper cites.
“Algorithms for quantum computation: Discrete logarithms and factoring”
Peter. Shor · 1994
Earlier work this paper cites.
“Quantum networks for elementary arithmetic operations”
Vlatko Vedral, Adriano Barenco and Artur Ekert · 1996
Earlier work this paper cites.
“Addition on a quantum computer”
Thomas Draper · 2000
Earlier work this paper cites.
“Circuit for Shor’s algorithm using 2n+ 3 qubits”
Stephane Beauregard · 2002
Earlier work this paper cites.
“Quantum Information Processing in Continuous Time”
Andrew. Childs · 2002
Earlier work this paper cites.
“A new quantum ripple-carry addition circuit”
Steven Cuccaro, Thomas Draper, Samuel Kutin and David Moulton · 2004
Earlier work this paper cites.
“A logarithmic-depth quantum carry-lookahead adder”
Thomas. Draper, Samuel. Kutin, Eric. Rains and Krysta. Svore · 2004
Earlier work this paper cites.
“Shor’s algorithm with fewer (pure) qubits”
Christof Zalka · 2006
Cited alongside, same era.
“Quantum arithmetic circuits: a survey”
Yasuhiro Takahashi · 2009
Cited alongside, same era.
“Quantum Addition Circuits and Unbounded Fan-Out”
Yasuhiro Takahashi, Seiichiro Tani and Noboru Kunihiro · 2009
Cited alongside, same era.
“Digital design and computer architecture”
David Harris and Sarah Harris · 2010
Cited alongside, same era.
“Constructing Large Increment Gates” Blog: Algorithmic Assertions, 2015
Craig Gidney · 2015
Cited alongside, same era.
“Quantum attacks on Bitcoin, and how to protect against them”
Divesh Aggarwal, Gavin Brennen, Troy Lee, Miklos Santha and Marco Tomamichel · 2017
Cited alongside, same era.
Craig Gidney · 2019
Later among the works it cites.
“How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits”
Craig Gidney and Martin Ekerå · 2021
Later among the works it cites.
“Tight Bounds on the Spooky Pebble Game: Recycling Qubits with Measurements”
Niels Kornerup, Jonathan Sadun and David Soloveichik · 2021
Later among the works it cites.
“Quantum Algorithm for Stochastic Optimal Stopping Problems with Applications in Finance”
João Doriguello, Alessandro Luongo, Jinge Bao, Patrick Rebentrost and Miklos Santha · 2022
Later among the works it cites.
“Performance Analysis of a Repetition Cat Code Architecture: Computing 256-bit Elliptic Curve Logarithm in 9 Hours with 126133 Cat Qubits”
Élie Gouzien, Diego Ruiz, Francois-Marie Leégent, Jérémie Guillaud and Nicolas Sangouard · 2023
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Encoding electronic spectra in quantum circuits with linear T complexity”
Ryan Babbush, Craig Gidney, Dominic Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler and Hartmut Neven · 2018
Cited alongside, same era.
“Quantum algorithms for computing general discrete logarithms and orders with tradeoffs”
Martin Ekerå · 2018
Cited alongside, same era.
“Halving the cost of quantum addition”
Craig Gidney · 2018
Cited alongside, same era.
“Qubitization of arbitrary basis quantum chemistry leveraging sparsity and low rank factorization”
Dominic Berry, Craig Gidney, Mario Motta, Jarrod McClean and Ryan Babbush · 2019
Cited alongside, same era.
“Approximate encoded permutations and piecewise quantum adders”
Craig Gidney · 2019
Cited alongside, same era.
Later among the works it cites.
“How to compute a 256-bit elliptic curve private key with only 50 million Toffoli gates”
Daniel Litinski · 2023
Later among the works it cites.
“An improved QFT-based quantum comparator and extended modular arithmetic using one ancilla qubit”
Yewei Yuan, Chao Wang, Bei Wang, Zhao-Yun Chen, Meng-Han Dou, Yu-Chun Wu and Guo-Ping Guo · 2023
Later among the works it cites.
“Optimal Toffoli-Depth Quantum Adder”
Siyi Wang, Suman Deb, Ankit Mondal and Anupam Chattopadhyay · 2024
Closest in time.
“A Comprehensive Study of Quantum Arithmetic Circuits”
Siyi Wang, Xiufan Li, Wei Lee, Suman Deb, Eugene Lim and Anupam Chattopadhyay · 2024
Closest in time.
“Quantum Computation and Quantum Information: 10th Anniversary Edition”
Michael. Nielsen and Isaac. Chuang · 2025
Closest in time.