The NISQ complexity of collision finding
From MaRDI portal
Publication:6637517
DOI10.1007/978-3-031-58737-5_1MaRDI QIDQ6637517
Qipeng Liu, Yassine Hamoudi, Makrand Sinha
Publication date: 13 November 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs
- Complexity measures and decision tree complexity: a survey.
- Quantum-access-secure message authentication via blind-unforgeability
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- Post-quantum security of the Even-Mansour cipher
- Succinct arguments in the quantum random oracle model
- Tighter proofs of CCA security in the quantum random oracle model
- 4-round Luby-Rackoff construction is a qPRP
- Quantum random oracle model with auxiliary input
- On finding quantum multi-collisions
- How to record quantum queries, and applications to quantum indifferentiability
- Quantum security proofs using semi-classical oracles
- Revisiting post-quantum Fiat-Shamir
- Optimal parallel quantum query algorithms
- Unifying presampling via concentration bounds
- Quantum key-length extension
- Quantum lower bounds for the collision and the element distinctness problems
- Impossibility of a Quantum Speed-Up with a Faulty Oracle
- Universal Arguments and their Applications
- Rapid solution of problems by quantum computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Quantum Complexity Theory
- Computations with greater Quantum depth are strictly more powerful (relative to an oracle)
- Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs
- Quantum lower bounds by polynomials
- Quantum cryptanalysis of hash and claw-free functions
- Quantum lower bounds by quantum arguments
- Adaptive versus static multi-oracle algorithms, and quantum security of a split-key PRF
- On the need for large quantum depth
- An optimal oracle separation of classical and quantum hybrid schemes
This page was built for publication: The NISQ complexity of collision finding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637517)
