Communication Capacities of Some Quantum Gates, Discovered through GP

Communication Capacities of Some Quantum Gates, Discovered through GP

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Communication Capacities of Some Quantum Gates, Discovered in Part through Genetic Programming (with additional figures from the QCMC 2002 poster) Lee Spector Cognitive Science Hampshire College Amherst, MA 01002, USA lspector@hampshire.edu Herbert J. Bernstein Institute for Science and Interdisciplinary Studies (ISIS) & Natural Science Hampshire College Amherst, MA 01002, USA hjbNS@hampshire.edu ABSTRACT We explore tradeoffs between classical communication and entanglement-generating powers of unitary 2-qubit gates. The exploration is aided by a computational search technique called genetic programming. This paper, without the additional figures that follow the refer- ences, will appear in Proceedings of the Sixth International Confer- ence on Quantum Communication, Measurement, and Computing (QCMC), July 22–26, 2002, to be published by Rinton Press. 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
COMMUNICATION CAPACITIES OF SOME QUANTUM GATES, DISCOVERED IN PART THROUGH GENETIC PROGRAMMING LEE SPECTOR Cognitive Science, Hampshire College, Amherst, MA 01002, USA E-mail: lspector@hampshire.edu HERBERT J. BERNSTEIN Institute for Science and Interdisciplinary Studies (ISIS) & Natural Science, Hampshire College, Amherst, MA 01002, USA E-mail: hjbNS@hampshire.edu We explore tradeoffs between classical communication and entanglement- generating powers of unitary 2-qubit gates. The exploration is aided by a compu- tational search technique called genetic programming. The question of tradeoffs between classical communication and entanglement-generating powers of unitary transformations in quantum com- putation has great current interest. 1 If simple general rules of tradeoff are worked out, the power of a transformation U to benefit bi-partite interactions will be characterized by a single number, thus abetting and advancing the “resource” or commodity metaphor for quantum information. Bennett has theorized that a single use of any given two-particle transformation U has a unique maximum power for entanglement or communication (forward, back- ward or two-way) between Alice and Bob. Which of these various effects U produces would depend on the protocol in which it is embedded. The rule is that only U may connect Alice to Bob, as in the previous investigation of two-qubit Hamiltonian interactions epitomized by the myth of Pyramis and Thisbe. 2 The question is how many c-bits of communication and/or e-bits of entanglement one can create per U . The search for algorithms to deploy this power with or without ancilla, and with or without prior entanglement, begins the general work on Bennett’s conjecture. In principle the power of U may require asymptotic ratios of the number of e- or c-bits generated to instances of U deployed in the algorithm. We pursue the search for algorithms relevant to this study using a com- putational search technique called genetic programming (GP). In prior work we used GP to discover new quantum algorithms for determining properties of unitary oracles. 3 In the present work we used the PushGP GP system 4 (http://hampshire.edu/lspector/push.html) in conjunction with the QGAME
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 10

Communication Capacities of Some Quantum Gates, Discovered through GP

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online