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

Elsevier eBooks

Quantum Algorithms and Methods

Ivan B. Djordjević

Published Jan 1, 2021• 2 citations
Publisher
DOI
10.1016/b978-0-12-821982-9.00006-x

Related papers

Quantum Algorithms and Applications

Melinda Andrews, Joseph Stephen Dulny, Andrew N. Glaudell +6 more

•Sep 1, 2020•0 citations

IMPLEMENTATION OF QUANTUM IMAGE HALFTONING ALGORITHM

Anastasia Monika Oktorianti, Achmad Benny Mutiara, Rina Refianti

Developing new computing methods and signal processing algorithms by borrowing from the principle of quantum mechanics is a very interesting and new research topic. By utilizing quantum algorithm in the process of computing, it is expected that this algorithm can solved the problems of image processing faster than using a classical algorithm. In this paper, a quantum digital image halftoning algorithm will be presented.The image would be processed using bitmap image (.bmp) and the applications would be created using Matlab R2009a. Test phase of the applications is using an image, lena.bmp. This application will show three new images as results of three halftoning methods: binary threshold method, ordered dithering method, and method with quantum algorithm. The method with quantum algorithm shows better than two others methods. Kata Kunci: image Processing, quantum Algoritm, halftoning method.

•Jan 1, 2014•0 citations

Quantum Algorithms

Richard Jozsa

•Jan 1, 2000•0 citations

Permutation Optimization Using a Gene-Coding Method of Quantum Bit by Local Improvement like the k-Opt

Yoshifumi Moriyama, Ichiro Iimura, Tomotsugu Ohno +1 more

The quantum-inspired evolutionary algorithm (QEA) is one of the evolutionary algorithms incorporating principles of quantum computation. In QEA, each gene is represented by a quantum bit (qubit), and the quantum superposition state is imitated. QEA can effectively shift from a global search to a local search. Han, et al. showed that QEA has superior search performance to a genetic algorithm (GA) in the 0-1 knapsack problem (0-1KP). Nakayama, et al. proposed a simpler algorithm that is referred to as QEA based on pair swap (QEAPS). QEAPS requires fewer parameters to be adjusted than QEA. Nakayama, et al. showed that QEAPS can find similar or even better quality solutions than QEA in 0-1KP. However, in QEA and QEAPS, each gene is represented by a qubit and both algorithms can only use a binary value as an observation result for a qubit. Therefore, Iimura, et al. proposed a novel integer-type gene-coding method that can obtain an integer value as an observation result by assigning multiple qubits in a gene locus. Moreover, they implemented the gene-coding method in both QEA and QEAPS and showed that it can search for similar or even better quality solutions in a shorter time than a conventional binary-type gene-coding method in the integer knapsack problem (IKP). However, the integer-type gene-coding method cannot deal with permutations simply.In order to expand the gene-coding method based on the qubit representation, Moriyama, et al. proposed two interpretation methods based on the integer-type gene-coding method that can deal with permutations. Also, they clarified that the two proposed interpretation methods can search for the optimal solution, even with the genecoding method based on the qubit representation. This paper proposes a new gene-coding method that can deal with permutations. The proposed method promises effect of improving a solution in permutation space, like the k-Opt method, and can search for the optimal solution of the traveling salesman problem (TSP) effectively. From experimental results for TSP, the discovery rate of the optimal solution using the proposed method is higher than using conventional method in many cases of QEA and QEAPS.

Transactions of the Japanese Society for Artificial Intelligence•Jan 1, 2016•0 citations

Quantum Query Algorithm Constructions for Computing AND, OR and MAJORITY Boolean Functions

Alina Vasiljeva

Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box and the aim is to compute function value for arbitrary input using as few queries as possible. We concentrate on quantum query algorithm designing tasks in this paper. The main aim of the research was to find new efficient algorithms and develop general algorithm designing techniques. First, we present several exact quantum query algorithms for certain problems that are better than classical counterparts. Next, we introduce algorithm transformation methods that allow significant enlarging of exactly computable functions sets. Finally, we propose quantum algorithm designing methods. Given algorithms for the set of sub-functions, our methods use them to design a more complex one, based on algorithms described before. Methods are applicable for input algorithms with specific properties and preserve acceptable error probability and number of queries. Methods offer constructions for computing AND, OR and MAJORITY kinds of Boolean functions.

•Jan 1, 2008•1 citation

Quantum Algorithms

Umesh V. Vazirani

Fundamentals of Computation Theory•Aug 22, 2001•0 citations
Developing new computing methods and signal processing algorithms by borrowing from the principle of quantum mechanics is a very interesting and new research topic. By utilizing quantum algorithm in the process of computing, it is expected that this algorithm can solved the problems of image processing faster than using a classical algorithm. In this paper, a quantum digital image halftoning algorithm will be presented.The image would be processed using bitmap image (.bmp) and the applications would be created using Matlab R2009a. Test phase of the applications is using an image, lena.bmp. This application will show three new images as results of three halftoning methods: binary threshold method, ordered dithering method, and method with quantum algorithm. The method with quantum algorithm shows better than two others methods. Kata Kunci: image Processing, quantum Algoritm, halftoning method.
The quantum-inspired evolutionary algorithm (QEA) is one of the evolutionary algorithms incorporating principles of quantum computation. In QEA, each gene is represented by a quantum bit (qubit), and the quantum superposition state is imitated. QEA can effectively shift from a global search to a local search. Han, et al. showed that QEA has superior search performance to a genetic algorithm (GA) in the 0-1 knapsack problem (0-1KP). Nakayama, et al. proposed a simpler algorithm that is referred to as QEA based on pair swap (QEAPS). QEAPS requires fewer parameters to be adjusted than QEA. Nakayama, et al. showed that QEAPS can find similar or even better quality solutions than QEA in 0-1KP. However, in QEA and QEAPS, each gene is represented by a qubit and both algorithms can only use a binary value as an observation result for a qubit. Therefore, Iimura, et al. proposed a novel integer-type gene-coding method that can obtain an integer value as an observation result by assigning multiple qubits in a gene locus. Moreover, they implemented the gene-coding method in both QEA and QEAPS and showed that it can search for similar or even better quality solutions in a shorter time than a conventional binary-type gene-coding method in the integer knapsack problem (IKP). However, the integer-type gene-coding method cannot deal with permutations simply.In order to expand the gene-coding method based on the qubit representation, Moriyama, et al. proposed two interpretation methods based on the integer-type gene-coding method that can deal with permutations. Also, they clarified that the two proposed interpretation methods can search for the optimal solution, even with the genecoding method based on the qubit representation. This paper proposes a new gene-coding method that can deal with permutations. The proposed method promises effect of improving a solution in permutation space, like the k-Opt method, and can search for the optimal solution of the traveling salesman problem (TSP) effectively. From experimental results for TSP, the discovery rate of the optimal solution using the proposed method is higher than using conventional method in many cases of QEA and QEAPS.
Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box and the aim is to compute function value for arbitrary input using as few queries as possible. We concentrate on quantum query algorithm designing tasks in this paper. The main aim of the research was to find new efficient algorithms and develop general algorithm designing techniques. First, we present several exact quantum query algorithms for certain problems that are better than classical counterparts. Next, we introduce algorithm transformation methods that allow significant enlarging of exactly computable functions sets. Finally, we propose quantum algorithm designing methods. Given algorithms for the set of sub-functions, our methods use them to design a more complex one, based on algorithms described before. Methods are applicable for input algorithms with specific properties and preserve acceptable error probability and number of queries. Methods offer constructions for computing AND, OR and MAJORITY kinds of Boolean functions.