Parallelism for Quantum Computation with Qudits

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages, 3 figures

Scientific paper

10.1103/PhysRevA.74.032334

Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well known that any single-qudit unitary can be decomposed into a sequence of Givens rotations on two-dimensional subspaces of the qudit state space. Using a coupling graph to represent physically allowed couplings between pairs of qudit states, we then show that the logical depth of the parallel gate sequence is equal to the height of an associated tree. The implementation of a given unitary can then optimize the tradeoff between gate time and resources used. These ideas are illustrated for qudits encoded in the ground hyperfine states of the atomic alkalies $^{87}$Rb and $^{133}$Cs. Second, we provide a protocol for implementing parallelized non-local two-qudit gates using the assistance of entangled qubit pairs. Because the entangled qubits can be prepared non-deterministically, this offers the possibility of high fidelity two-qudit gates.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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

Rate now

     

Profile ID: LFWR-SCP-O-711925

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.