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

Springer eBooks

Elements of Classical Computation

Published Feb 2, 2007• 0 citations
Publisher
DOI
10.1007/978-3-540-34572-5_7

Related papers

Introduction to classical computation

WORLD SCIENTIFIC eBooks•Dec 1, 2018•0 citations

The effect of sample property on optimum search by quantum computing

Hamed Edalati Fard, Majid Vafaei Jahan, Mehrdad Jalali

Quantum computers are designed based on quantum mechanics. They have special features such as entanglement and parallelism, which do not exist in classic mechanics-based computers. Therefore, quantum algorithms have their own privilege for solving some problems compare to classic ones such as finding the minimum value of a function in optimization problems. For instance, finding the minimum of N elements in quantum method is faster than classic method. In this case, having information about N elements of distribution does not reduce the cost of finding the minimum value in classic method due to linear search of each element. But in quantum method, all elements are simultaneously considered as well as distribution information, which is related to the whole elements. This distribution information effectively influences on finding the minimum value. Numerical simulations show having mean and variance of N elements can reduces the cost of minimum finding through quantum method by %40. Furthermore, it is shown the greater variance causes less cost.

International Conference on Computer and Knowledge Engineering•Oct 1, 2011•0 citations

Introduction to Classical Computation

WORLD SCIENTIFIC eBooks•Apr 1, 2004•1 citation

Simulating Grover's Quantum Search in a Classical Computer

D. K. Ningtyas, 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 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

arXiv:1003.1930•Mar 9, 2010•0 citations

Classical computation

A. Kitaev, Alexander Khanievich Shen', M. Vyalyi

Graduate studies in mathematics•May 31, 2002•1 citation

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
Quantum computers are designed based on quantum mechanics. They have special features such as entanglement and parallelism, which do not exist in classic mechanics-based computers. Therefore, quantum algorithms have their own privilege for solving some problems compare to classic ones such as finding the minimum value of a function in optimization problems. For instance, finding the minimum of N elements in quantum method is faster than classic method. In this case, having information about N elements of distribution does not reduce the cost of finding the minimum value in classic method due to linear search of each element. But in quantum method, all elements are simultaneously considered as well as distribution information, which is related to the whole elements. This distribution information effectively influences on finding the minimum value. Numerical simulations show having mean and variance of N elements can reduces the cost of minimum finding through quantum method by %40. Furthermore, it is shown the greater variance causes less cost.
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 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
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.