Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Link opens in a new tab
Search content at Illinois Experts
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
The NISQ Complexity of Collision Finding
Yassine Hamoudi
, Qipeng Liu
,
Makrand Sinha
Siebel School of Computing and Data Science
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The NISQ Complexity of Collision Finding'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Noisy Intermediate-scale Quantum
100%
Quantum Complexity
100%
Hybrid Algorithm
66%
Quantum Query
66%
Classical Algorithm
50%
Quantum Circuit
33%
Oracle
33%
Depolarizing Channel
33%
Quantum Algorithms
33%
Low Depth
33%
Dephasing Channel
33%
Optimal Lower Bound
33%
Noisy Oracle
33%
Collision Finding
33%
Fourier
16%
Key Length
16%
Quantum Approach
16%
Tight Bounds
16%
Quantum Computer
16%
Hashing
16%
Quantum Computing
16%
Cryptographic Applications
16%
Search Problems
16%
Simple Proof
16%
Hash Value
16%
Information Theoretic Framework
16%
Modern Cryptography
16%
Quantum Attacks
16%
Impact Efficiency
16%
Quantum Adversary
16%
Tapper
16%
Quantum Collision Models
16%
Collision-resistant Hashing
16%
Computer Science
Hybrid Algorithm
100%
Quantum Algorithm
75%
Quantum Circuit
50%
Finding Problem
25%
Hashing
25%
Quantum Computing
25%
Theoretic Framework
25%
Modern Cryptography
25%
Cryptographic Application
25%
Key Length
25%
Quantum Computer
25%