# A concentration of measure result for non-catalytic decoupling via approximate unitary t-designs

@article{Nema2020ACO, title={A concentration of measure result for non-catalytic decoupling via approximate unitary t-designs}, author={Aditya Nema and Pranab Kumar Sen}, journal={arXiv: Quantum Physics}, year={2020} }

Decoupling theorems are an important tool in quantum information theory where they are used as building blocks in a host of information transmission protocols. A decoupling theorem takes a bipartite quantum state shared between a system and a reference, applies some local operation on the system, and under suitable constraints, proves that the resulting state is close to a product state between the output system and the untouched reference. The theorem is said to be non-catalytic if it does not…

## One Citation

One-shot multi-sender decoupling and simultaneous decoding for the quantum MAC

- Computer ScienceArXiv
- 2021

This work is the first one to obtain a non-trivial simultaneous decoder for the QMAC with limited entanglement assistance in both one-shot and asymptotic iid settings; previous works used unlimited entanglements assistance.

## References

SHOWING 1-10 OF 35 REFERENCES

Large deviation bounds for k-designs

- Mathematics, Computer ScienceProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
- 2009

It is shown that, if the dynamics of the universe produces a k-design, then suitably sized subsystems will be in the canonical state, as predicted by statistical mechanics and pseudo-random states are useless for measurement-based quantum computation.

A quantum Johnson-Lindenstrauss lemma via unitary t-designs

- Mathematics, Computer Science
- 2018

This work shows that the Haar random unitary can be replaced by a uniformly random unitaries chosen from a finite set called an approximate unitary t-design for t = O(log n) that approximately preserves all their lengths.

The decoupling approach to quantum information theory

- Computer Science
- 2010

The central theorem of this thesis proves the existence of a protocol that transmits quantum data that is partially known to the receiver through a single use of an arbitrary noisy quantum channel via entanglement-assisted and unassisted asymptotic coding theorems.

Proceedings of the Royal Society A: Mathematical

- Physical and Engineering Sciences, 465(2111):32893308, May
- 2009

Efficient quantum tensor product expanders and unitary t-designs via the zigzag product.

- Mathematics
- 2018

A classical t-tensor product expander is a natural way of formalising correlated walks of t particles on a regular expander graph. A quantum t-tensor product expander is a completely positive trace…

Achieving the Han-Kobayashi inner bound for the quantum interference channel

- Computer Science2012 IEEE International Symposium on Information Theory Proceedings
- 2012

An encoding and decoding scheme achieving the Chong-Motani-Garg inner bound for a two sender two receiver interference channel with classical input and quantum output and proves its inner bounds using a non-commutative union bound to analyse the decoding error probability, and a geometric notion of approximate interesection of two conditionally typical subspaces.

ArXiv e-prints

- July
- 2018

Efficient methods for one-shot quantum communication

- Computer Science
- 2018

A new one-shot entanglement-assisted protocol for quantum channel coding that achieves near-optimal communication through a given channel and a new method involving two new versions of convex-split lemma that use small amount of additional resource to achieve this.

arXiv e-prints

- page arXiv:1809.07056, Sep
- 2018