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 abstracted 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Aldous and U. Vazirani, 1997. Go With the Winners Algorithms. UC Berkeley preprint. Available at http://www.cs.berkeley.edu/~vazirani/.
A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter, 1995. Elementary Gates for Quantum Computation, Phys. Rev. A, 52, p. 3457.
C. H. Bennett, G. Brassard, C. Crepeau, R. Jozsa, A. Peres, and W. Wootters, 1993. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Physical Review Letters, 70, pp. 1895–1899.
G. Brassard, 1996. Teleportation as a quantum computation. In T. Toffoli, M. Biafore, and J. Leao (eds.), Proceedings of the Fourth Workshop on Physics and Computation (PhysComp’ 96), New England Complex Systems Institute, pp. 48–50.
T. Cormen, C. Leiserson, R. Rivest, 1993. Introduction to Algorithms. Cambridge: The MIT Press.
D. Deutsch, 1989. Quantum computational networks. In Proceedings of the Royal Society of London A, 425, p. 73.
D. DiVincenzo and J. Smolin, 1994. Results on two-bit gate design for quantum computers. In W. Porod and G. Frazier (eds.), Proceedings of the Second Workshop on Physics and Computation (PhysComp’ 94), IEEE Computer Society Press, pp.14–23.
D. DiVincenzo, 1995. Two-bit gates are universal for quantumcomputation. Physical Review A, 51, pp. 1015–1022.
J. H. Holland, 1975. Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press.
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, 1983. Optimization by Simulated Annealing. Science, 220, pp. 671–680.
E. Knill, 1995. Approximation by quantum circuits. LANL Report LAUR-95-2225.
J. R. Koza, 1992. Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge: MIT Press.
S. Lloyd, 1993. A potentially realizable quantum computer. Science, 261, pp. 1569–1571.
A. Steane, 1997. Quantum computing. Review for Reports on Progress in Physics. Available at http://xxx.lanl.gov/archive/quant-ph/9708022.
C. P. Williams and S.H. Clearwater, 1998. Explorations in Quantum Computing (Book plus CD-ROM). Santa Clara: TELOS/Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Williams, C.P., Gray, A.G. (1999). Automated Design of Quantum Circuits. In: Williams, C.P. (eds) Quantum Computing and Quantum Communications. QCQC 1998. Lecture Notes in Computer Science, vol 1509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49208-9_8
Download citation
DOI: https://doi.org/10.1007/3-540-49208-9_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65514-5
Online ISBN: 978-3-540-49208-5
eBook Packages: Springer Book Archive