Exponential speedup of quantum algorithms for the pathfinding problem
From MaRDI portal
Cites work
- A quantum-inspired classical algorithm for recommendation systems
- An efficient key recovery attack on SIDH
- CSIDH: an efficient post-quantum commutative group action
- Claw finding algorithms using quantum walk
- Computing endomorphism rings of supersingular elliptic curves and connections to path-finding in isogeny graphs
- Cryptographic hash functions from expander graphs
- Exponential algorithmic speedup by a quantum walk
- Exponential quantum speedup in simulating coupled classical oscillators
- Finding more than one path through a simple maze with a quantum walk
- Multidimensional quantum walks
- On the Power of Quantum Computation
- Orientations and cycles in supersingular isogeny graphs
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
- Quantum Algorithm for path-edge sampling
- Quantum Query Complexity of Some Graph Problems
- Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
- Quantum algorithms and the power of forgetting
- Quantum cryptanalysis in the RAM model: claw-finding attacks on SIKE
- Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning
- Symmetries, graph properties, and quantum speedups
- The supersingular isogeny path and endomorphism ring problems are equivalent
This page was built for publication: Exponential speedup of quantum algorithms for the pathfinding problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6984106)
