Quantum communication and complexity

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Abstract

Related collections

Most cited references 33

Record: found
Abstract: not found
Article: not found

Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels

Charles Bennett, Gilles Brassard, Claude Crépeau … (1993)

0 comments Cited 1923 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states

Charles Bennett, Stephen Wiesner (1992)

0 comments Cited 937 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: found
Article: found

Is Open Access

Elementary gates for quantum computation

(2010)

We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values \((x,y)\) to \((x,x \oplus y)\)) is universal in the sense that all unitary operations on arbitrarily many bits \(n\) (U(\(2^n\))) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized Deutsch-Toffoli gates, that apply a specific U(2) transformation to one input bit if and only if the logical AND of all remaining input bits is satisfied. These gates play a central role in many proposed constructions of quantum computational networks. We derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two-and three-bit quantum gates, the asymptotic number required for \(n\)-bit Deutsch-Toffoli gates, and make some observations about the number required for arbitrary \(n\)-bit unitary operations.