Decoupling with random diagonal unitaries
arXiv:1509.05155 · doi:10.22331/q-2017-07-21-18
Abstract
We investigate decoupling, one of the most important primitives in quantum Shannon theory, by replacing the uniformly distributed random unitaries commonly used to achieve the protocol, with repeated applications of random unitaries diagonal in the Pauli- and - bases. This strategy was recently shown to achieve an approximate unitary -design after a number of repetitions of the process, which implies that the strategy gradually achieves decoupling. Here, we prove that even fewer repetitions of the process achieve decoupling at the same rate as that with the uniform ones, showing that rather imprecise approximations of unitary -designs are sufficient for decoupling. We also briefly discuss efficient implementations of them and implications of our decoupling theorem to coherent state merging and relative thermalisation.
arXiv comment26 pages, 3 figures. v2: 19 pages, 3 figures, both results and presentations are improved. One conjecture in the previous version was proven. v3: 16 pages, 1 figure. v4: doi links are added, published version
References in corpus (31)
- Black holes as mirrors: quantum information in random subsystems
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- On the quantum, classical and total amount of correlations in a quantum state
- Evenly distributed unitaries: on the structure of unitary designs
- Quantum Data Hiding
- Quantum Information Processing with Finite Resources -- Mathematical Foundations
- Random Quantum Circuits are Approximate 2-designs
- Local random quantum circuits are approximate polynomial-designs
- A Fully Quantum Asymptotic Equipartition Property
- Quantum state merging and negative information
- The mother of all protocols: Restructuring quantum information's family tree
- One-shot decoupling
- Efficient Generation of Generic Entanglement
- Relating quantum privacy and quantum coherence: an operational approach
- Decoupling with random quantum circuits
- The decoupling approach to quantum information theory
- Efficient unitary designs with nearly time-independent Hamiltonian dynamics
- Emergence of typical entanglement in two-party random processes
- Decoupling with unitary approximate two-designs
- The apex of the family tree of protocols: Optimal rates and resource inequalities
- Comment on the paper "Random Quantum Circuits are Approximate 2-designs"
- Unitary -designs from random - and -diagonal unitaries
- Generating a state -design by diagonal quantum circuits
- Parameters of Pseudo-Random Quantum Circuits
- Efficient algorithm for multi-qudit twirling for ensemble quantum computation
- Diagonal quantum circuits: their computational power and applications
- Relative Thermalization
- Quantum pseudo-randomness from cluster-state quantum computation
- Diagonal-unitary 2-designs and their implementations by quantum circuits
- Pseudo-randomness and Learning in Quantum Computation
- Efficient achievability for quantum protocols using decoupling theorems
Cited by in corpus (11)
- Unitary -designs from random - and -diagonal unitaries
- Markovianization with approximate unitary designs
- One-shot quantum error correction of classical and quantum information
- Efficient methods for one-shot quantum communication
- On the explicit constructions of certain unitary -designs
- Decoupling by local random unitaries without simultaneous smoothing, and applications to multi-user quantum information tasks
- Quantum tomography with random diagonal unitary maps and statistical bounds on information generation using random matrix theory
- Quantum State Merging for Arbitrarily Small-Dimensional Systems
- Reliability Function of Quantum Information Decoupling via the Sandwiched Rényi Divergence
- Decoding general error correcting codes and the role of complementarity
- Optimized synthesis of circuits for diagonal unitary matrices with reflection symmetry