Evolving quantum circuits using genetic algorithm

Author(s):  
M. Lukac ◽  
M. Perkowski
Author(s):  
Riccardo Rasconi ◽  
Angelo Oddi

Quantum Computing represents the next big step towards speed boost in computation, which promises major breakthroughs in several disciplines including Artificial Intelligence. This paper investigates the performance of a genetic algorithm to optimize the realization (compilation) of nearest-neighbor compliant quantum circuits. Currrent technological limitations (e.g., decoherence effect) impose that the overall duration (makespan) of the quantum circuit realization be minimized, and therefore the makespanminimization problem of compiling quantum algorithms on present or future quantum machines is dragging increasing attention in the AI community. In our genetic algorithm, a solution is built utilizing a novel chromosome encoding where each gene controls the iterative selection of a quantum gate to be inserted in the solution, over a lexicographic double-key ranking returned by a heuristic function recently published in the literature.Our algorithm has been tested on a set of quantum circuit benchmark instances of increasing sizes available from the recent literature. We demonstrate that our genetic approach obtains very encouraging results that outperform the solutions obtained in previous research against the same benchmark, succeeding in significantly improving the makespan values for a great number of instances.


Author(s):  
Davood Dadkhah ◽  
Mariam Zomorodi ◽  
Seyed Ebrahim Hosseini

AbstractIn the present work, a novel approach was proposed to optimize the teleportation cost in Distributed Quantum Circuits (DQCs) by applying a new approach. To overcome the difficulty with keeping a large number of qubits next to each other, DQCs, as a well-known solution, have always been employed. In a distributed quantum system, qubits are transferred from a subsystem to another subsystem by a quantum protocol such as teleportation. First, we proposed a heuristic approach through which we could replace the equivalent circuits in the initial quantum circuit. Then, we used a genetic algorithm to partition the placement of qubits so that the number of teleportations could be optimized for the communications of a DQC. Finally, results showed that the proposed approach could impressively work.


1994 ◽  
Vol 4 (9) ◽  
pp. 1281-1285 ◽  
Author(s):  
P. Sutton ◽  
D. L. Hunter ◽  
N. Jan

Author(s):  
J. Magelin Mary ◽  
Chitra K. ◽  
Y. Arockia Suganthi

Image processing technique in general, involves the application of signal processing on the input image for isolating the individual color plane of an image. It plays an important role in the image analysis and computer version. This paper compares the efficiency of two approaches in the area of finding breast cancer in medical image processing. The fundamental target is to apply an image mining in the area of medical image handling utilizing grouping guideline created by genetic algorithm. The parameter using extracted border, the border pixels are considered as population strings to genetic algorithm and Ant Colony Optimization, to find out the optimum value from the border pixels. We likewise look at cost of ACO and GA also, endeavors to discover which one gives the better solution to identify an affected area in medical image based on computational time.


Sign in / Sign up

Export Citation Format

Share Document