Abstract
We investigate the scheme which enables encoding of n qudits whose Hilbert spaces are of different dimensions to one qudit of dimension smaller than that of the Hilbert space of the n qudits and then probabilistically but error-free decoding any subset of k qudits. We also give a formula for calculating the average probability of successful decoding.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
