%0 Conference Paper %1 Williams:1999:ADQ %A Williams, Colin P. %A Gray, Alexander G. %B Quantum Computing and Quantum Communications: First NASA International Conference, QCQC'98 %C Palm Springs, California, USA %D 1998 %E Williams, C. P. %I Springer-Verlag GmbH %K algorithms, computer computing genetic programming, quantum science, %P 113--125 %T Automated Design of Quantum Circuits %U http://link.springer-ny.com/link/service/series/0558/bibs/1509/15090113.htm; http://link.springer-ny.com/link/service/series/0558/papers/1509/15090113.pdf %V 1509 %X In order to design a quantum circuit that performs a desired quantum computation, it is necessary to find a decomposition of the unitary matrix that represents that computation in terms of a sequence of quantum gate operations. To date, such designs have either been found by hand or by exhaustive enumeration of all possible circuit topologies. In this paper we propose an automated approach to quantum circuit design using search heuristics based on principles ed from evolutionary genetics, i.e. using a genetic programming algorithm adapted specially for this problem. We demonstrate the method on the task of discovering quantum circuit designs for quantum teleportation. We show that to find a given known circuit design (one which was hand-crafted by a human), the method considers roughly an order of magnitude fewer designs than naive enumeration. In addition, the method finds novel circuit designs superior to those previously known.

@inproceedings{Williams:1999:ADQ, abstract = {In order to design a quantum circuit that performs a desired quantum computation, it is necessary to find a decomposition of the unitary matrix that represents that computation in terms of a sequence of quantum gate operations. To date, such designs have either been found by hand or by exhaustive enumeration of all possible circuit topologies. In this paper we propose an automated approach to quantum circuit design using search heuristics based on principles ed from evolutionary genetics, i.e. using a genetic programming algorithm adapted specially for this problem. We demonstrate the method on the task of discovering quantum circuit designs for quantum teleportation. We show that to find a given known circuit design (one which was hand-crafted by a human), the method considers roughly an order of magnitude fewer designs than naive enumeration. In addition, the method finds novel circuit designs superior to those previously known.}, acknowledgement = {ack-nhfb}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Palm Springs, California, USA}, author = {Williams, Colin P. and Gray, Alexander G.}, bibdate = {Tue Feb 5 11:53:31 MST 2002}, bibsource = {http://link.springer-ny.com/link/service/series/0558/tocs/t1509.htm}, biburl = {https://www.bibsonomy.org/bibtex/21f88d5d07105c6defbd884d9daa24fb2/brazovayeye}, booktitle = {Quantum Computing and Quantum Communications: First NASA International Conference, QCQC'98}, coden = {LNCSD9}, editor = {Williams, C. P.}, interhash = {0b8992c75b50fc3e2424850de624133b}, intrahash = {1f88d5d07105c6defbd884d9daa24fb2}, issn = {0302-9743}, keywords = {algorithms, computer computing genetic programming, quantum science,}, month = {February}, notes = {A1 Jet Propulsion Laboratory Mailstop 126-347 4800 Oak Grove Drive Pasadena, CA 91109-8099 Cited by \cite{spector:book} \cite{Leier:2003:Etssoqp}}, organisation = {NASA}, pages = {113--125}, publisher = {Springer-Verlag GmbH}, series = {Lecture Notes in Computer Science}, size = {13 pages}, timestamp = {2008-06-19T17:54:12.000+0200}, title = {Automated Design of Quantum Circuits}, url = {http://link.springer-ny.com/link/service/series/0558/bibs/1509/15090113.htm; http://link.springer-ny.com/link/service/series/0558/papers/1509/15090113.pdf}, volume = 1509, year = 1998 }