Deterministic twirling with low resources

DOI10.1016/J.PHYSLETA.2019.126179MaRDI QIDQ2212925zbMATH OpenOpenAlexWikidataFDO

Authors David Jakob Stonner, Jaroslav Kysela, Graeme Weir, J. Novotný, Gernot Alber, Igor Jex

Publication date 27 November 2020

Published in Physics Letters. A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1912.06014

zbMATH Keywords

entanglement distillationWerner statesquantum operationstwirling

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum gates (81P65) Entanglement measures, concurrencies, separability criteria (81P42)

Abstract: Twirling operations, which average a quantum state with respect to a unitary subgroup, have become a frequently-employed tool in quantum information processing. We investigate the efficient implementation of twirling operations with minimal resources, without necessitating the ability to perform all possible unitary operations on the quantum system of interest. We present a general algebraic method allowing us to choose a set of - typically very few - unitary operators which, when applied randomly and repeatedly, produce the given twirling operation exponentially quickly. The method is applied to twirling operations for bipartite quantum systems with respect to the unitary group $U(d)otimesU(d)$, an essential ingredient in entanglement distillation protocols. In particular, we provide a complete classification of sets of unitary operators capable of performing twirling on two qubits. Moreover, we construct a generic set containing at most three unitary operators achieving the twirling operation for a general two-qudit system.

Recommendations

• On random rotations
• Design of continuous twisting algorithm
• Accelerated Twisting Algorithm
• Selective and robust time-optimal rotations of spin systems
• Dreidel lasts \(O(n^2)\) spins
• Generalized pinwheel problem
• Adaptive continuous twisting algorithm
• Complexity of tile rotation problems
• Generating a random sink-free orientation in quadratic time

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Quantum data hiding
• Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
• Random unitary dynamics of quantum networks
• The theory of manipulations of pure state asymmetry. I: Basic tools, equivalence classes and single copy transformations

Cited in

(1)

• Twirling channels have minimal mixed-unitary rank

This page was built for publication: Deterministic twirling with low resources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2212925)