arXiv subjects

I. Jex

Publications and source records attributed to I. Jex.

At least 19 recordsLinked to original sources

arXiv2018

Quantum state identification of qutrits via a nonlinear protocol

We propose a probabilistic quantum protocol to realize a nonlinear transformation of qutrit states, which by iterative applications on ensembles can be used to distinguish two types of pure states. The protocol involves single-qutrit and two-qutrit unitary operations as well as post-selection according to the results obtained in intermediate measurements. We utilize the nonlinear transformation in an algorithm to identify a quantum state provided it belongs to an arbitrary known finite set. The algorithm is based on dividing the known set of states into two appropriately designed subsets which can be distinguished by the nonlinear protocol. In most cases this is accompanied by the application of some properly defined physical (unitary) operation on the unknown state. Then, by the application of the nonlinear protocol one can decide which of the two subsets the unknown state belongs to thus reducing the number of possible candidates. By iteratively continuing this procedure until a single possible candidate remains, one can identify the unknown state.

quant-ph↗

arXiv2015

Conditional generation of optical Schrödinger cat states

Given a source of two coherent state superpositions with small separation in a traveling wave optical setting, we show that by interference and balanced homodyne measurement it is possible to conditionally prepare a symmetrically placed superposition of coherent states around the origo of the phase space. The separation of the coherent states in the superposition will be amplified during the process.

quant-ph↗

arXiv2014

Stability of point spectrum for three-state quantum walks on a line

Evolution operators of certain quantum walks possess, apart from the continuous part, also point spectrum. The existence of eigenvalues and the corresponding stationary states lead to partial trapping of the walker in the vicinity of the origin. We analyze the stability of this feature for three-state quantum walks on a line subject to homogenous coin deformations. We find two classes of coin operators that preserve the point spectrum. These new classes of coins are generalizations of coins found previously by different methods and shed light on the rich spectrum of coins that can drive discrete-time quantum walks.

quant-ph↗

arXiv2012

Analysis and minimization of bending losses in discrete quantum networks

We study theoretically the transfer of quantum information along bends in two-dimensional discrete lattices. Our analysis shows that the fidelity of the transfer decreases considerably, as a result of interactions in the neighbourhood of the bend. It is also demonstrated that such losses can be controlled efficiently by the inclusion of a defect. The present results are of relevance to various physical implementations of quantum networks, where geometric imperfections with finite spatial extent may arise as a result of bending, residual stress, etc.

quant-ph↗

arXiv2011

Perfect transfer of multiple excitations in quantum networks

We present a general formalism to the problem of perfect state-transfer (PST), where the state involves multiple excitations of the quantum network. A key feature of our formalism is that it allows for inclusion of nontrivial interactions between the excitations. Hence, it is perfectly suited to addressing the problem of PST in the context of various types of physical realizations. The general formalism is also flexible enough to account for situations where multiple excitations are "focused" onto the same site.

quant-ph↗

arXiv2011

Measurement induced chaos with entangled states

The dynamics of an ensemble of identically prepared two-qubit systems is investigated which is subjected to the iteratively applied measurements and conditional selection of a typical entanglement purification protocol. It is shown that the resulting measurement-induced non-linear dynamics of the two-qubit state exhibits strong sensitivity to initial conditions and also true chaos. For a special class of initially prepared two-qubit states two types of islands characterize the asymptotic limit. They correspond to a separable and a maximally entangled two-qubit state, respectively, and their boundaries form fractal-like structures. In the presence of incoherent noise an additional stable asymptotic cycle appears.

quant-ph↗

arXiv2011

Quantum Walk with Jumps

We analyze a special class of 1-D quantum walks (QWs) realized using optical multi-ports. We assume non-perfect multi-ports showing errors in the connectivity, i.e. with a small probability the multi- ports can connect not to their nearest neighbor but to another multi-port at a fixed distance - we call this a jump. We study two cases of QW with jumps where multiple displacements can emerge at one timestep. The first case assumes time-correlated jumps (static disorder). In the second case, we choose the positions of jumps randomly in time (dynamic disorder). The probability distributions of position of the QW walker in both instances differ significantly: dynamic disorder leads to a Gaussian-like distribution, while for static disorder we find two distinct behaviors depending on the parity of jump size. In the case of even-sized jumps, the distribution exhibits a three-peak profile around the position of the initial excitation, whereas the probability distribution in the odd case follows a Laplace-like discrete distribution modulated by additional (exponential) peaks for long times. Finally, our numerical results indicate that by an appropriate mapping an universal functional behavior of the variance of the long-time probability distribution can be revealed with respect to the scaled average of jump size.

quant-ph↗

arXiv2011

Directional correlations in quantum walks with two particles

Quantum walks on the line with a single particle possess a classical analog. Involving more walkers opens up the possibility to study collective quantum effects, such as many particle correlations. In this context, entangled initial states and indistinguishability of the particles play a role. We consider directional correlations between two particles performing a quantum walk on a line. For non-interacting particles we find analytic asymptotic expressions and give the limits of directional correlations. We show that introducing $δ$-interaction between the particles, one can exceed the limits for non-interacting particles.

quant-ph↗

arXiv2011

Decoherence and disorder in quantum walks: From ballistic spread to localization

We investigate the impact of decoherence and static disorder on the dynamics of quantum particles moving in a periodic lattice. Our experiment relies on the photonic implementation of a one-dimensional quantum walk. The pure quantum evolution is characterized by a ballistic spread of a photon's wave packet along 28 steps. By applying controlled time-dependent operations we simulate three different environmental influences on the system, resulting in a fast ballistic spread, a diffusive classical walk and the first Anderson localization in a discrete quantum walk architecture.

quant-ph↗

arXiv2010

Full-revivals in 2-D Quantum Walks

Recurrence of a random walk is described by the Polya number. For quantum walks, recurrence is understood as the return of the walker to the origin, rather than the full-revival of its quantum state. Localization for two dimensional quantum walks is known to exist in the sense of non-vanishing probability distribution in the asymptotic limit. We show on the example of the 2-D Grover walk that one can exploit the effect of localization to construct stationary solutions. Moreover, we find full-revivals of a quantum state with a period of two steps. We prove that there cannot be longer cycles for a four-state quantum walk. Stationary states and revivals result from interference which has no counterpart in classical random walks.

quant-ph↗

arXiv2010

Recurrences in three-state quantum walks on a plane

We analyze the role of dimensionality in the time evolution of discrete time quantum walks through the example of the three-state walk on a two-dimensional, triangular lattice. We show that the three-state Grover walk does not lead to trapping (localization) or recurrence to the origin, in sharp contrast to the Grover walk on the two dimensional square lattice. We determine the power law scaling of the probability at the origin with the method of stationary phase. We prove that only a special subclass of coin operators can lead to recurrence and there are no coins leading to localization. The propagation for the recurrent subclass of coins is quasi one-dimensional.

quant-ph↗

arXiv2010

Photons Walking the Line: A quantum walk with adjustable coin operations

We present the first robust implementation of a coined quantum walk over five steps using only passive optical elements. By employing a fiber network loop we keep the amount of required resources constant as the walker's position Hilbert space is increased. We observed a non-Gaussian distribution of the walker's final position, thus characterizing a faster spread of the photon wave-packet in comparison to the classical random walk. The walk is realized for many different coin settings and initial states, which opens the way for the implementation of a quantum walk-based search algorithm.

quant-ph↗

arXiv2009

Communication in quantum networks of logical bus topology

Perfect state transfer (PST) is discussed in the context of passive quantum networks with logical bus topology, where many logical nodes communicate using the same shared media, without any external control. The conditions under which, a number of point-to-point PST links may serve as building blocks for the design of such multi-node networks are investigated. The implications of our results are discussed in the context of various Hamiltonians that act on the entire network, and are capable of providing PST between the logical nodes of a prescribed set in a deterministic manner.

quant-ph↗

arXiv2009

Asymptotic Evolution of Random Unitary Operations

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.

quant-ph↗

arXiv2009

Random unitary dynamics of quantum networks

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.

quant-ph↗

arXiv2008

Optimized quantum random-walk search algorithms

Shenvi, Kempe and Whaley's quantum random-walk search (SKW) algorithm [Phys. Rev. A 67, 052307 (2003)] is known to require $O(\sqrt N)$ number of oracle queries to find the marked element, where $N$ is the size of the search space. The overall time complexity of the SKW algorithm differs from the best achievable on a quantum computer only by a constant factor. We present improvements to the SKW algorithm which yield significant increase in success probability, and an improvement on query complexity such that the theoretical limit of a search algorithm succeeding with probability close to one is reached. We point out which improvement can be applied if there is more than one marked element to find.

quant-ph↗

arXiv2008

Experimental and theoretical challenges for the trapped electron quantum computer

We discuss quantum information processing with trapped electrons. After recalling the operation principle of planar Penning traps we sketch the experimental conditions to load, cool and detect single electrons. Here we present a detailed investigation of a scalable scheme including feasibility studies and the analysis of all important elements, relevant for the experimental stage. On the theoretical side, we discuss different methods to couple electron qubits. We estimate the relevant qubit coherence times and draw implications for the experimental setting. A critical assessment of quantum information processing with trapped electrons is concluding the article.

quant-ph↗

arXiv2007

Recurrence and Pólya number of quantum walks

We analyze the recurrence probability (Pólya number) for d-dimensional unbiased quantum walks. A sufficient condition for a quantum walk to be recurrent is derived. As a by-product we find a simple criterion for localisation of quantum walks. In contrast to classical walks, where the Pólya number is characteristic for the given dimension, the recurrence probability of a quantum walk depends in general on the topology of the walk, choice of the coin and the initial state. This allows to change the character of the quantum walk from recurrent to transient by altering the initial state.

quant-ph↗