Gate simulation and lower bounds on the simulation time

Details Gate simulation and lower bounds on the simulation time Gate simulation and lower bounds on the simulation time

2004-03-10

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

Physical Review A 70, 032319 (2004)

Physics

Quantum Physics

17 pages

Scientific paper

10.1103/PhysRevA.70.032319

Unitary operations are the building blocks of quantum programs. Our task is to design effcient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given n-qubit system. The most common versions of this task are known as Hamiltonian simulation and gate simulation, where Hamiltonian simulation can be seen as an infinitesimal version of the general task of gate simulation. We present a Lie-theoretic approach to Hamiltonian simulation and gate simulation. From this, we derive lower bounds on the time complexity in the n-qubit case, generalizing known results to both even and odd n. To achieve this we develop a generalization of the so-called magic basis for two-qubits. As a corollary, we note a connection to entanglement measures of concurrence-type.

Affiliated with

Also associated with

No associations

Rating

Gate simulation and lower bounds on the simulation time 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 Gate simulation and lower bounds on the simulation time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Gate simulation and lower bounds on the simulation time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-418811