Deterministic twirling with low resources

From MaRDI portal
Publication:2212925

DOI10.1016/J.PHYSLETA.2019.126179zbMATH Open1448.81174arXiv1912.06014OpenAlexW2995927565WikidataQ126648065 ScholiaQ126648065MaRDI QIDQ2212925FDOQ2212925


Authors: David Jakob Stonner, Jaroslav Kysela, Graeme Weir, J. Novotný, Gernot Alber, Igor Jex Edit this on Wikidata


Publication date: 27 November 2020

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

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.


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




Recommendations




Cites Work


Cited In (1)





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)