Dynamic Transitive Closure-based Static Analysis through the Lens of Quantum Search
Abstract
References
Index Terms
- Dynamic Transitive Closure-based Static Analysis through the Lens of Quantum Search
Recommendations
Superposition, entanglement and quantum computation
The paper examines the roles played by superposition and entanglement in quantum computing. The analysis is illustrated by discussion of a 'classical' electronic implementation of Grover's quantum search algorithm. It is shown explicitly that the ...
Finding Shortest Vector Using Quantum NV Sieve on Grover
Information Security and Cryptology – ICISC 2023AbstractQuantum computers, especially those with over 10,000 qubits, pose a potential threat to current public key cryptography systems like RSA and ECC due to Shor’s algorithms. Grover’s search algorithm is another quantum algorithm that could ...
Exponential-Time Quantum Algorithms for Graph Coloring Problems
AbstractThe fastest known classical algorithm deciding the k-colorability of n-vertex graph requires running time for . In this work, we present an exponential-space quantum algorithm computing the chromatic number with running time ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Transactions on Software Engineering and Methodology](/cms/asset/4a0213fc-1fcc-4d3d-8ff9-2393c5cc110f/3618079.cover.jpg)
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Australian Research
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 274Total Downloads
- Downloads (Last 12 months)274
- Downloads (Last 6 weeks)24
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in