Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0609176

An Algorithm to Speed Up Quantum Search

Martinelli, Giuseppe, Massimo Panella

Published Sep 22, 2006• 0 citations
arXivHTMLPDF

Abstract

The paper has been withdrawn because the research work is still in progress.
DOI
10.48550/arxiv.quant-ph/0609176

Related papers

An Exponentially Fast Quantum Search Algorithm

Goong Chen, Zijian Diao

This paper has been withdrawn by the authors.

arXiv:quant-ph/0011109•Nov 27, 2000•9 citations

An Alternative Algorithm for the Database Search Problem on a Quantum Computer

A. Carlini, Akio Hosoya

The paper has been withdrawn

arXiv:quant-ph/9808028•Aug 18, 1998•0 citations

Faster Database search in Quantum Computing

Li‐Yi Hsu, Yih-Yuh Chen

The paper has been withdrawn

arXiv:quant-ph/0102068•Feb 13, 2001•0 citations

Quantum Architecture Search: A Survey

Darya Martyniuk, Johannes Jung, Adrian Paschke

Quantum computing has made significant progress in recent years, attracting immense interest not only in research laboratories but also in various industries. However, the application of quantum computing to solve real-world problems is still hampered by a number of challenges, including hardware limitations and a relatively under-explored landscape of quantum algorithms, especially when compared to the extensive development of classical computing. The design of quantum circuits, in particular parameterized quantum circuits (PQCs), which contain learnable parameters optimized by classical methods, is a non-trivial and time-consuming task requiring expert knowledge. As a result, research on the automated generation of PQCs, known as quantum architecture search (QAS), has gained considerable interest. QAS focuses on the use of machine learning and optimization-driven techniques to generate PQCs tailored to specific problems and characteristics of quantum hardware. In this paper, we provide an overview of QAS methods by examining relevant research studies in the field. We discuss the main challenges in designing and performing an automated search for an optimal PQC, and survey ways to address them to ease future research.

arXiv:2406.06210•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•45 citations

SIMULATION OF QUANTUM SEARCH ALGORITHM

Rina Refianti, Achmad Benny Mutiara

The rapid progress of computer science has been accompanied by a corresponding evolution of computation, from classical computation to quantum computation. As quantum computing is on its way to becoming an established discipline of computing science, much effort is being put into the development of new quantum algorithms. One of quantum algorithms is Grover's algorithm, which is used for searching an element in an unstructured list of N elements with quadratic speed-up over classical algorithms. In this work, Quantum Computer Language (QCL) is used to make a Grover's quantum search simulation in a classical computer document.

Jurnal Ilmu Komputer dan Informasi•Nov 28, 2013•0 citations

WITHDRAWN: Curved Diffraction Patterns of 2D-Cross-Grating Experiments ---Double Slit Still Has Much to Offer

Abstract Research Square has withdrawn this preprint due to extreme levels of self-citation.

•May 4, 2023•0 citations
Quantum computing has made significant progress in recent years, attracting immense interest not only in research laboratories but also in various industries. However, the application of quantum computing to solve real-world problems is still hampered by a number of challenges, including hardware limitations and a relatively under-explored landscape of quantum algorithms, especially when compared to the extensive development of classical computing. The design of quantum circuits, in particular parameterized quantum circuits (PQCs), which contain learnable parameters optimized by classical methods, is a non-trivial and time-consuming task requiring expert knowledge. As a result, research on the automated generation of PQCs, known as quantum architecture search (QAS), has gained considerable interest. QAS focuses on the use of machine learning and optimization-driven techniques to generate PQCs tailored to specific problems and characteristics of quantum hardware. In this paper, we provide an overview of QAS methods by examining relevant research studies in the field. We discuss the main challenges in designing and performing an automated search for an optimal PQC, and survey ways to address them to ease future research.
The rapid progress of computer science has been accompanied by a corresponding evolution of computation, from classical computation to quantum computation. As quantum computing is on its way to becoming an established discipline of computing science, much effort is being put into the development of new quantum algorithms. One of quantum algorithms is Grover's algorithm, which is used for searching an element in an unstructured list of N elements with quadratic speed-up over classical algorithms. In this work, Quantum Computer Language (QCL) is used to make a Grover's quantum search simulation in a classical computer document.