Quantum algorithms for several problems in graph theory are considered. Classical algorithms for finding the lowest weight path between two points in a graph and for finding a minimal weight spanning tree involve searching over some space. Modification of classical algorithms due to Dijkstra and Prim allows quantum search to replace classical search and leads to more efficient algorithms. In th...

Here we present a first study of search spaces and fitness landscapes in the context of the evolution of quantum programs. We consider small instances of the Deutsch-Jozsa problem as a starting point for the exploration of search spaces of quantum algorithms and analyze the structure of mutation landscapes using autocorrelation functions and information measures for characterizing their behavio...

the mathematical modeling of fracture networks is critical for the exploration and development ofnatural resources. fractures can help the production of petroleum, water, and geothermal energy. theyalso greatly influence the drainage and production of methane gas from coal beds. orientation andspatial distribution of fractures in rocks are important factors in controlling fluid flow. the object...

Quantum computing has the potential to bring a new class of previously intractable problems within the reach of computer science. Harnessing the quantum mechanical phenomena of superposition and entanglement, a quantum computer can manipulate vast amounts of information in a single computational step and perform certain operations exponentially faster than classical (i.e. non-quantum) computers...

Constructing appropriate unitary matrix operators for new quantum algorithms and finding the minimum cost gate sequences for the implementation of these unitary operators is of fundamental importance in the field of quantum information and quantum computation. Evolution of quantum circuits faces two major challenges: complex and huge search space and the high costs of simulating quantum circuit...

A generalized quantum search algorithm, where phase inversions for the marked state and the prepared state are replaced by π/2 phase rotations, is realized in a 2-qubit NMR heteronuclear system. The quantum algorithm searches a marked state with a smaller step compared to standard Grover algorithm. Phase matching requirement in quantum searching is demonstrated by comparing it with another gene...

In 1985 Deutsch designed a quantum algorithm which evaluates whether the two outputs of a Boolean function are the same or not using only one function evaluation [1]. Deutsch and Jozsa generalized this algorithm for a more general case such as whether a given Boolean function is constant or balanced. This algorithm demonstrated an exponential speed-up on a quantum machine compared to the best p...

Constructing appropriate unitary matrix operators for new quantum algorithms and finding the minimum cost gate sequences for the implementation of these unitary operators is of fundamental importance in the field of quantum information and quantum computation. Evolution of quantum circuits faces two major challenges: complex and huge search space and the high costs of simulating quantum circuit...

Grover’s quantum search algorithm is considered as one of the milestone in the field of quantum computing. The algorithm can search for a single match in a database with N records in O( √ N) assuming that the item must exist in the database with quadratic speedup over the best known classical algorithm. This review paper discusses the performance of Grover’s algorithm in case of multiple matche...