Lower bounds on the complexity of simulating quantum gates

Details Lower bounds on the complexity of simulating quantum gates Lower bounds on the complexity of simulating quantum gates

2003-07-25

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

Phys. Rev. A 68, 052311 (2003)

Physics

Quantum Physics

6 pages

Scientific paper

10.1103/PhysRevA.68.052311

We give a simple proof of a formula for the minimal time required to simulate
a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with
fast local unitaries. We also note that a related lower bound holds for
arbitrary n-qubit gates.

Affiliated with

Also associated with

No associations

Rating

Lower bounds on the complexity of simulating quantum gates 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 Lower bounds on the complexity of simulating quantum gates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower bounds on the complexity of simulating quantum gates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-50215