Parallel spooky pebbling makes Regev factoring more practical
From MaRDI portal
Cites work
- A Note on Bennett’s Time-Space Tradeoff for Reversible Computation
- A quantum circuit for Shor's factoring algorithm using 2n+2 qubits
- An efficient quantum factoring algorithm
- Depth-robust graphs and their cumulative memory complexity
- Extending Regev's factoring algorithm to compute discrete logarithms
- Fast parallel circuits for the quantum Fourier transform
- High Parallel Complexity Graphs and Memory-Hard Functions
- scientific article; zbMATH DE number 1617936 (Why is no real title available?)
- scientific article; zbMATH DE number 5320229 (Why is no real title available?)
- scientific article; zbMATH DE number 1406121 (Why is no real title available?)
- Moderately hard functions: definition, instantiations, and applications
- On completely factoring any integer efficiently in a single run of an order-finding algorithm
- On post-processing in the quantum algorithm for computing short discrete logarithms
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum algorithms for computing short discrete logarithms and factoring RSA integers
- Quantum algorithms revisited
- Reducing the number of qubits in quantum factoring
- Space-efficient and noise-robust quantum factoring
- Sustained space complexity
- The impact of reversibility on parallel pebbling
- The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs
- Time/Space Trade-Offs for Reversible Computation
This page was built for publication: Parallel spooky pebbling makes Regev factoring more practical
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299730)
