Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1911.07577

Construction of Random Unitary Operations for Asymptotic Preparation of Werner States

David Jakob Stonner

Published Nov 18, 2019• 1 citation
arXivHTMLPDF

Abstract

Werner states are defined as bipartite qudit states that remain unchanged under application of arbitrary unitary operators acting on both subsystems simultaneously. Their preparation is a crucial ingredient in entanglement distillation protocols. This thesis deals with an iterative approach to prepare Werner states asymptotically, using random unitary operations. The asymptotic dynamics of random unitary operations are linked to algebraic properties of the involved unitary operators applying results about general quantum operations. Then a family of random unitary operations is constructed, which prepares Werner states asymptotically for an arbitrary finite dimensional bipartite qudit system. Finally, this construction is applied in qubit and qudrit systems, where the convergence rate is optimized numerically.

DOI
10.48550/arxiv.1911.07577

Related papers

Asymptotic evolution of random unitary operations

Jaroslav Novotný, G. Alber, Igor Jex

Abstract We analyze the asymptotic dynamics of quantum systems resulting from large numbers of iterations of random unitary operations. Although, in general, these quantum operations cannot be diagonalized it is shown that their resulting asymptotic dynamics is described by a diagonalizable superoperator. We prove that this asymptotic dynamics takes place in a typically low dimensional attractor space which is independent of the probability distribution of the unitary operations applied. This vector space is spanned by all eigenvectors of the unitary operations involved which are associated with eigenvalues of unit modulus. Implications for possible asymptotic dynamics of iterated random unitary operations are presented and exemplified in an example involving random controlled-not operations acting on two qubits.

arXiv:0908.4534•Open Physics•Jan 1, 2010•33 citations

Random unitary dynamics of quantum networks

Jaroslav Novotný, G. Alber, Igor Jex

We investigate the asymptotic dynamics of quantum networks under repeated applications of random unitary operations. It is shown that in the asymptotic limit of large numbers of iterations this dynamics is generally governed by a typically low dimensional attractor space. This space is determined completely by the unitary operations involved and it is independent of the probabilities with which these unitary operations are applied. Based on this general feature analytical results are presented for the asymptotic dynamics of arbitrarily large cyclic qubit networks whose nodes are coupled by randomly applied controlled-NOT operations.

arXiv:0904.0107•Journal of Physics A Mathematical and Theoretical•Jun 26, 2009•23 citations

Computational and physical complexity of synthesizing random multi-qudit quantum states and unitary operators

Sahel Ashhab, Bora Basyildiz

We analyze the complexity of synthesizing random states and unitary operators in a multi-qudit system in two paradigms. In one case, we consider the situation in which we manipulate the system by applying a sequence of one- and two-qudit quantum gates that constitute the elementary, and universal, gate set. The minimum number of gates required to perform the desired operation represents the computational complexity. In the other case, we consider the situation in which we manipulate the physical system using physical fields with optimized control pulses. The minimum time required to perform the desired operation represents the physical complexity. In both cases, we use analytical arguments in combination with optimal-control-theory numerical calculations to determine the complexity of random operations. We show that the computational complexity of random states or unitary operators scales exponentially with the number of qudits. Our numerical results suggest that the physical complexity of preparing random quantum states and unitary operators scales more slowly than the computational complexity. We discuss various implications of our results, especially concerning the relationship between random and pseudorandom states and unitary operators.

quant-pharXiv:2605.07374•Physical Review A•May 11, 2026•0 citations

Werner states from diagrams

David W. Lyons, Cristina Mullican, Adam Rilatt +1 more

Abstract We present two results on multiqubit Werner states, defined to be those states that are invariant under the collective action of any given single-qubit unitary that acts simultaneously on all the qubits. Motivated by the desire to characterize entanglement properties of Werner states, we construct a basis for the real linear vector space of Werner invariant Hermitian operators on the Hilbert space of pure states; it follows that any mixed Werner state can be written as a mixture of these basis operators with unique coefficients. Continuing a study of ‘polygon diagram’ Werner states constructed in earlier work, with a goal to connect diagrams to entanglement properties, we consider a family of multiqubit states that generalize the singlet, and show that their 2-qubit reduced density matrices are separable.

arXiv:2302.05572•Journal of Physics A Mathematical and Theoretical•Apr 25, 2023•0 citations

Heuristic Lookahead Distillation Protocol Search

Matthew Barber, Stefano Pirandola

Bipartite qubit entanglement distillation is the process of converting noisy ebits into pure ebits using only local operations and classical communication. This is a core operation for quantum repeaters, enabling such crucial tasks as long-distance quantum communication and distributed quantum computing. In this work, we introduce a method for searching for entanglement distillation protocols and, using this technique, distil qubit Werner states at a higher rate than could be achieved using previously discovered protocols. In particular, we demonstrate the advantage of our new distillation strategy by improving the best-known lower bound for the two-way-assisted quantum capacity of the qubit depolarising channel across a wide range of channel parameters, making progress in one of the long-standing problems of quantum information theory.

quant-pharXiv:2608.13644•Aug 17, 2026•0 citations

Asymptotic dynamics of qubit networks under randomly applied controlled unitary transformations

Jaroslav Novotný, G. Alber, Igor Jex

The asymptotic dynamics of many-qubit quantum systems is investigated under iteratively and randomly applied unitary transformations. For a one-parameter family of unitary transformations, which entangle pairs of qubits, two main theorems are proved. They characterize completely the dependence of the resulting asymptotic dynamics on the topology of the interaction graph that encodes all possible qubit couplings. These theorems exhibit clearly which aspects of an interaction graph are relevant and which ones are irrelevant to the asymptotic dynamics. On the basis of these theorems, the local entropy transport between an open quantum system and its environment are explored for strong non-Markovian couplings and for different sizes of the environment and different interaction topologies. It is shown that although the randomly applied unitary entanglement operations cannot decrease the overall entropy of such a qubit network, a local entropy decrease or 'cooling' of subsystems is possible for special classes of interaction topologies.

New Journal of Physics•May 26, 2011•11 citations
Werner states are defined as bipartite qudit states that remain unchanged under application of arbitrary unitary operators acting on both subsystems simultaneously. Their preparation is a crucial ingredient in entanglement distillation protocols. This thesis deals with an iterative approach to prepare Werner states asymptotically, using random unitary operations. The asymptotic dynamics of random unitary operations are linked to algebraic properties of the involved unitary operators applying results about general quantum operations. Then a family of random unitary operations is constructed, which prepares Werner states asymptotically for an arbitrary finite dimensional bipartite qudit system. Finally, this construction is applied in qubit and qudrit systems, where the convergence rate is optimized numerically.
Abstract We analyze the asymptotic dynamics of quantum systems resulting from large numbers of iterations of random unitary operations. Although, in general, these quantum operations cannot be diagonalized it is shown that their resulting asymptotic dynamics is described by a diagonalizable superoperator. We prove that this asymptotic dynamics takes place in a typically low dimensional attractor space which is independent of the probability distribution of the unitary operations applied. This vector space is spanned by all eigenvectors of the unitary operations involved which are associated with eigenvalues of unit modulus. Implications for possible asymptotic dynamics of iterated random unitary operations are presented and exemplified in an example involving random controlled-not operations acting on two qubits.
We investigate the asymptotic dynamics of quantum networks under repeated applications of random unitary operations. It is shown that in the asymptotic limit of large numbers of iterations this dynamics is generally governed by a typically low dimensional attractor space. This space is determined completely by the unitary operations involved and it is independent of the probabilities with which these unitary operations are applied. Based on this general feature analytical results are presented for the asymptotic dynamics of arbitrarily large cyclic qubit networks whose nodes are coupled by randomly applied controlled-NOT operations.
We analyze the complexity of synthesizing random states and unitary operators in a multi-qudit system in two paradigms. In one case, we consider the situation in which we manipulate the system by applying a sequence of one- and two-qudit quantum gates that constitute the elementary, and universal, gate set. The minimum number of gates required to perform the desired operation represents the computational complexity. In the other case, we consider the situation in which we manipulate the physical system using physical fields with optimized control pulses. The minimum time required to perform the desired operation represents the physical complexity. In both cases, we use analytical arguments in combination with optimal-control-theory numerical calculations to determine the complexity of random operations. We show that the computational complexity of random states or unitary operators scales exponentially with the number of qudits. Our numerical results suggest that the physical complexity of preparing random quantum states and unitary operators scales more slowly than the computational complexity. We discuss various implications of our results, especially concerning the relationship between random and pseudorandom states and unitary operators.
Abstract We present two results on multiqubit Werner states, defined to be those states that are invariant under the collective action of any given single-qubit unitary that acts simultaneously on all the qubits. Motivated by the desire to characterize entanglement properties of Werner states, we construct a basis for the real linear vector space of Werner invariant Hermitian operators on the Hilbert space of pure states; it follows that any mixed Werner state can be written as a mixture of these basis operators with unique coefficients. Continuing a study of ‘polygon diagram’ Werner states constructed in earlier work, with a goal to connect diagrams to entanglement properties, we consider a family of multiqubit states that generalize the singlet, and show that their 2-qubit reduced density matrices are separable.
Bipartite qubit entanglement distillation is the process of converting noisy ebits into pure ebits using only local operations and classical communication. This is a core operation for quantum repeaters, enabling such crucial tasks as long-distance quantum communication and distributed quantum computing. In this work, we introduce a method for searching for entanglement distillation protocols and, using this technique, distil qubit Werner states at a higher rate than could be achieved using previously discovered protocols. In particular, we demonstrate the advantage of our new distillation strategy by improving the best-known lower bound for the two-way-assisted quantum capacity of the qubit depolarising channel across a wide range of channel parameters, making progress in one of the long-standing problems of quantum information theory.
The asymptotic dynamics of many-qubit quantum systems is investigated under iteratively and randomly applied unitary transformations. For a one-parameter family of unitary transformations, which entangle pairs of qubits, two main theorems are proved. They characterize completely the dependence of the resulting asymptotic dynamics on the topology of the interaction graph that encodes all possible qubit couplings. These theorems exhibit clearly which aspects of an interaction graph are relevant and which ones are irrelevant to the asymptotic dynamics. On the basis of these theorems, the local entropy transport between an open quantum system and its environment are explored for strong non-Markovian couplings and for different sizes of the environment and different interaction topologies. It is shown that although the randomly applied unitary entanglement operations cannot decrease the overall entropy of such a qubit network, a local entropy decrease or 'cooling' of subsystems is possible for special classes of interaction topologies.