Efficient Circuits for Exact-Universal Computations with Qudits

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, 3 figures, 2 tables

Scientific paper

This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one two-qudit gate, CINC, is exact-universal. A recent paper (PRL 94 230502) describes quantum circuits for qudits which require O(d^n) two-qudit gates for state synthesis and O(d^{2n}) two-qudit gates for unitary synthesis, matching the respective lower bound complexities. In this work, we present the state synthesis circuit in much greater detail and prove that it is correct. Also, the (n-2)/(d-2) ancillas required in the original algorithm may be removed without changing the asymptotics. Further, we present a new algorithm for unitary synthesis, inspired by the QR matrix decomposition, which is also asymptotically optimal.

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

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

Rate now

     

Profile ID: LFWR-SCP-O-504116

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