OpenAlex
PricingAboutJobs
Log inGet started
Work

Computational Time Complexity for Sorting Algorithm amalgamated with Quantum Search

HTML

Year: 2023
Type: conference-paper
Source: International Conference for Advancement in Technology (ICONAT)
DOI: 10.1109/iconat57137.2023.10080217
Authors: Anurag Dutta, John Harshith, Yash Soni, Avdhesh Gupta, Vishan Kumar Gupta, Ankit Gupta
Institutions: Vellore Institute of Technology University, Shri Govindram Seksaria Institute of Technology and Science, Ajay Kumar Garg Engineering College, Graphic Era University
Language: English

Topic: Quantum Computing Algorithms and Architecture
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Keywords: sorting algorithms, quantum search, Grover's algorithm, computational complexity, lower bounds, upper bounds, quantum computing, unstructured search

Open Access status: closed
OpenAlex ID: W4362496990
FWCI: 1.227
Cites: 24
Cited by: 21
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security