Approximation by Quantum Circuits

Details Approximation by Quantum Circuits Approximation by Quantum Circuits

1995-08-08

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

Physics

Quantum Physics

uuencoded, compressed postscript, LACES 68Q-95-29

Scientific paper

In a recent preprint by Deutsch et al. [1995] the authors suggest the possibility of polynomial approximability of arbitrary unitary operations on $n$ qubits by 2-qubit unitary operations. We address that comment by proving strong lower bounds on the approximation capabilities of g-qubit unitary operations for fixed g. We consider approximation of unitary operations on subspaces as well as approximation of states and of density matrices by quantum circuits in several natural metrics. The ability of quantum circuits to probabilistically solve decision problem and guess checkable functions is discussed. We also address exact unitary representation by reducing the upper bound by a factor of n^2 and by formalizing the argument given by Barenco et al. [1995] for the lower bound. The overall conclusion is that almost all problems are hard to solve with quantum circuits.

Affiliated with

Also associated with

No associations

Rating

Approximation by Quantum Circuits 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 Approximation by Quantum Circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximation by Quantum Circuits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-88937