Two qubit-operation-sharing schemes (Zhang and Cheung in J. Phys. B 44:165508, 2011) are generalized to the qutrit ones. Operations to be shared are classified into three different classes in terms of different probabilities (i.e, 1/3, 2/3 and 1). For the latter two classes, ten and three restricted sets of operations are found out, respectively. Moreover, the two generalized schemes are amply compared from four aspects, namely, quantum and classical resource consumption, necessary-operation complexity, success probability and efficiency. It is found that the second scheme is overall more optimal than the first one as far as three restricted sets of operations are concerned. Moreover, the experimental feasibility of our schemes is confirmed with respect to the nowaday technique.
Quantum Information Processing – Springer Journals
Published: Jul 30, 2013
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud