Genetic Algorithm Based Quantum Circuits Optimization for Quantum Computing Simulation

Author(s):  
Lu Wei ◽  
Zhong Ma ◽  
Yuqing Cheng ◽  
Qianyu Liu
Author(s):  
Andrés García ◽  
José Ranilla ◽  
Raul Alonso Alvarez ◽  
Luis Meijueiro

The shortage of quantum computers, and their current state of development, constraints research in many fields that could benefit from quantum computing. Although the work of a quantum computer can be simulated with classical computing, personal computers take so long to run quantum experiments that they are not very useful for the progress of research. This manuscript presents an open quantum computing simulation platform that enables quantum computing researchers to have access to high performance simulations. This platform, called QUTE, relies on a supercomputer powerful enough to simulate general purpose quantum circuits of up to 38 qubits, and even more under particular simulations. This manuscript describes in-depth the characteristics of the QUTE platform and the results achieved in certain classical experiments in this field, which would give readers an accurate idea of the system capabilities.


2009 ◽  
Vol 102 (10) ◽  
Author(s):  
Tetsufumi Tanamoto ◽  
Yu-xi Liu ◽  
Xuedong Hu ◽  
Franco Nori

2014 ◽  
Vol 14 (9&10) ◽  
pp. 763-776
Author(s):  
Omar Gamel ◽  
Daniel F.V. James

Periodic functions are of special importance in quantum computing, particularly in applications of Shor's algorithm. We explore methods of creating circuits for periodic functions to better understand their properties. We introduce a method for constructing the circuit for a simple monoperiodic function, that is one-to-one within a single period, of a given period $p$. We conjecture that to create a simple periodic function of period $p$, where $p$ is an $n$-bit number, one needs at most $n$ Toffoli gates.


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.


2006 ◽  
Vol 14 (1) ◽  
pp. 21-40 ◽  
Author(s):  
Paul Massey ◽  
John A. Clark ◽  
Susan Stepney

We show how Genetic Programming (GP) can be used to evolve useful quantum computing artefacts of increasing sophistication and usefulness: firstly specific quantum circuits, then quantum programs, and finally system-independent quantum algorithms. We conclude the paper by presenting a human-competitive Quantum Fourier Transform (QFT) algorithm evolved by GP.


2000 ◽  
Vol 11 (02) ◽  
pp. 323-334
Author(s):  
WILLI-HANS STEEB ◽  
YORICK HARDY

We show how SymbolicC++ can be used to simulate quantum circuits.


Author(s):  
Lee Spector ◽  
Jon Klein

AbstractWe demonstrate the use of genetic programming in the automatic invention of quantum computing circuits that solve problems of potential theoretical and practical significance. We outline a developmental genetic programming scheme for such applications; in this scheme the evolved programs, when executed, build quantum circuits and the resulting quantum circuits are then tested for “fitness” using a quantum computer simulator. Using the PushGP genetic programming system and the QGAME quantum computer simulator we demonstrate the invention of a new, better than classical quantum circuit for the two-oracle AND/OR problem.


2021 ◽  
Vol 10 (1) ◽  
pp. 22-25
Author(s):  
Robert Wille

Quantum computers are coming! But how to use their potential? Quantum computing is becoming a reality, but automated methods and software tools for this technology are just beginning. This project aims to develop automatic and efficient methods, e.g. for simulation, compilation, or verification of quantum circuits. DA QC will exploit design automation expertise proven powerful for conventional circuits and systems yet hardly utilised in quantum computing.


Sign in / Sign up

Export Citation Format

Share Document