arXiv subjects

Jaroslav Novotny

Publications and source records attributed to Jaroslav Novotny.

4 recordsLinked to original sources

arXiv2019

Deterministic Twirling with Low Resources

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)\otimes U(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.

quant-ph↗

arXiv2016

Percolation assisted excitation transport in discrete-time quantum walks

Coherent transport of excitations along chains of coupled quantum systems represents an interesting problem with a number of applications ranging from quantum optics to solar cell technology. A convenient tool for studying such processes are quantum walks. They allow to determine in a quantitative way all the process features. We study the survival probability and the transport efficiency on a simple, highly symmetric graph represented by a ring. The propagation of excitation is modeled by a discrete-time (coined) quantum walk. For a two-state quantum walk, where the excitation (walker) has to leave its actual position to the neighboring sites, the survival probability decays exponentially and the transport efficiency is unity. The decay rate of the survival probability can be estimated using the leading eigenvalue of the evolution operator. However, if the excitation is allowed to stay at its present position, i.e. the propagation is modeled by a lazy quantum walk, then part of the wave-packet can be trapped in the vicinity of the origin and never reaches the sink. In such a case, the survival probability does not vanish and the excitation transport is not efficient. The dependency of the transport efficiency on the initial state is determined. Nevertheless, we show that for some lazy quantum walks dynamical percolations of the ring eliminate the trapping effect and efficient excitation transport can be achieved.

quant-ph↗

arXiv2012

Asymptotic properties of quantum Markov chains

The asymptotic dynamics of quantum Markov chains generated by the most general physically relevant quantum operations is investigated. It is shown that it is confined to an attractor space on which the resulting quantum Markov chain is diagonalizable. A construction procedure of a basis of this attractor space and its associated dual basis is presented. It applies whenever a strictly positive quantum state exists which is contracted or left invariant by the generating quantum operation. Moreover, algebraic relations between the attractor space and Kraus operators involved in the definition of a quantum Markov chain are derived. This construction is not only expected to offer significant computational advantages in cases in which the dimension of the Hilbert space is large and the dimension of the attractor space is small but it also sheds new light onto the relation between the asymptotic dynamics of quantum Markov chains and fixed points of their generating quantum operations.

math-ph↗

arXiv2003

Controlling bi-partite entanglement in multi-qubit systems

Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper we utilize a concept of entangled graphs with weighted edges in order to analyze pure quantum states of multi-qubit systems. Here qubits are represented by vertexes of the graph while the presence of bi-partite entanglement is represented by an edge between corresponding vertexes. The weight of each edge is defined to be the entanglement between the two qubits connected by the edge, as measured by the concurrence. We prove that each entangled graph with entanglement bounded by a specific value of the concurrence can be represented by a pure multi-qubit state. In addition we present a logic network with O(N2) elementary gates that can be used for preparation of the weighted entangled graphs of N qubits.

quant-ph↗