A Complexity Measure for Continuous Time Quantum Algorithms

Details A Complexity Measure for Continuous Time Quantum Algorithms A Complexity Measure for Continuous Time Quantum Algorithms

2000-09-22

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

Phys. Rev. A 64(2):022301, 2000

Physics

Quantum Physics

6 pages, Revtex

Scientific paper

10.1103/PhysRevA.64.022301

We consider unitary dynamical evolutions on n qubits caused by time dependent pair-interaction Hamiltonians and show that the running time of a parallelized two-qubit gate network simulating the evolution is given by the time integral over the chromatic index of the interaction graph. This defines a complexity measure of continuous and discrete quantum algorithms which are in exact one-to-one correspondence. Furthermore we prove a lower bound on the growth of large-scale entanglement depending on the chromatic index.

Affiliated with

Also associated with

No associations

Rating

A Complexity Measure for Continuous Time Quantum Algorithms 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 A Complexity Measure for Continuous Time Quantum Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Complexity Measure for Continuous Time Quantum Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-532538