Classical programmability is enough for quantum circuits universality in approximate sense

Details Classical programmability is enough for quantum circuits universality in approximate sense Classical programmability is enough for quantum circuits universality in approximate sense

2001-03-20

arxiv.org/abs/quant-ph/0103119v1

Physics

Quantum Physics

5 pages, LaTeX, Extended abstract

Scientific paper

It was shown by M.A. Nielsen and I.L. Chuang 1997, that it is impossible to build strictly universal programmable quantum gate array, that could perform any unitary operation precisely and it was suggested to use probabilistic gate arrays instead. In present work is shown, that if to use more physical and weak condition of universality (suggested already in earliest work by D.Deutsch 1985) and to talk about simulation with arbitrary, but finite precision, then it is possible to build universal programmable gate array. But now the same no-go theorem by Nielsen and Chuang will have new interesting consequence --- controlling programs for the gate arrays can be considered as pure classical. More detailed design of such deterministic quantum gate arrays universal ``in approximate sense'' is considered in the paper.

Affiliated with

Also associated with

No associations

Rating

Classical programmability is enough for quantum circuits universality in approximate sense does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Classical programmability is enough for quantum circuits universality in approximate sense, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classical programmability is enough for quantum circuits universality in approximate sense will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-239504