arXiv subjects

Igor Jex

Publications and source records attributed to Igor Jex.

67 records · Page 4Linked to original sources

arXiv2010

Entanglement preparation using symmetric multiports

We investigate the entanglement produced by a multi-path interferometer that is composed of two symmetric multiports, with phase shifts applied to the output of the first multiport. Particular attention is paid to the case when we have a single photon entering the interferometer. For this situation we derive a simple condition that characterize the types of entanglement that one can generate. We then show how one can use the results from the single photon case to determine what kinds of multi-photon entangled states one can prepare using the interferometer.

quant-ph↗

arXiv2010

Interference of composite bosons

We investigate multi-boson interference. A Hamiltonian is presented that treats pairs of bosons as a single composite boson. This Hamiltonian allows two pairs of bosons to interact as if they were two single composite bosons. We show that this leads to the composite bosons exhibiting novel interference effects such as Hong-Ou-Mandel interference. We then investigate generalizations of the formalism to the case of interference between two general composite bosons. Finally, we show how one can realize interference between composite bosons in the two atom Dicke model.

quant-ph↗

arXiv2009

Transformation design and nonlinear Hamiltonians

We study a class of nonlinear Hamiltonians, with applications in quantum optics. The interaction terms of these Hamiltonians are generated by taking a linear combination of powers of a simple `beam splitter' Hamiltonian. The entanglement properties of the eigenstates are studied. Finally, we show how to use this class of Hamiltonians to perform special tasks such as conditional state swapping, which can be used to generate optical cat states and to sort photons.

quant-ph↗

arXiv2009

Recurrence of biased quantum walks on a line

The Polya number of a classical random walk on a regular lattice is known to depend solely on the dimension of the lattice. For one and two dimensions it equals one, meaning unit probability to return to the origin. This result is extremely sensitive to the directional symmetry, any deviation from the equal probability to travel in each direction results in a change of the character of the walk from recurrent to transient. Applying our definition of the Polya number to quantum walks on a line we show that the recurrence character of quantum walks is more stable against bias. We determine the range of parameters for which biased quantum walks remain recurrent. We find that there exist genuine biased quantum walks which are recurrent.

quant-ph↗

arXiv2008

Recurrence properties of unbiased coined quantum walks on infinite $d$-dimensional lattices

The Pólya number characterizes the recurrence of a random walk. We apply the generalization of this concept to quantum walks [M. Štefaňák, I. Jex and T. Kiss, Phys. Rev. Lett. \textbf{100}, 020501 (2008)] which is based on a specific measurement scheme. The Pólya number of a quantum walk depends in general on the choice of the coin and the initial coin state, in contrast to classical random walks where the lattice dimension uniquely determines it. We analyze several examples to depict the variety of possible recurrence properties. First, we show that for the class of quantum walks driven by independent coins for all spatial dimensions, the Pólya number is independent of the initial conditions and the actual coin operators, thus resembling the property of the classical walks. We provide an analytical estimation of the Pólya number for this class of quantum walks. Second, we examine the 2-D Grover walk, which exhibits localisation and thus is recurrent, except for a particular initial state for which the walk is transient. We generalize the Grover walk to show that one can construct in arbitrary dimensions a quantum walk which is recurrent. This is in great contrast with the classical walks which are recurrent only for the dimensions $d=1,2$. Finally, we analyze the recurrence of the 2-D Fourier walk. This quantum walk is recurrent except for a two-dimensional subspace of the initial states. We provide an analytical formula of the Pólya number in its dependence on the initial state.

quant-ph↗

arXiv2007

Stabilization of quantum information by combined dynamical decoupling and detected-jump error correction

Two possible applications of random decoupling are discussed. Whereas so far decoupling methods have been considered merely for quantum memories, here it is demonstrated that random decoupling is also a convenient tool for stabilizing quantum algorithms. Furthermore, a decoupling scheme is presented which involves a random decoupling method compatible with detected-jump error correcting quantum codes. With this combined error correcting strategy it is possible to stabilize quantum information against both spontaneous decay and static imperfections of a qubit-based quantum information processor in an efficient way.

quant-ph↗

arXiv2006

Experimentally realizable quantum comparison of coherent states and its applications

When comparing quantum states to each other, it is possible to obtain an unambiguous answer, indicating that the states are definitely different, already after a single measurement. In this paper we investigate comparison of coherent states, which is the simplest example of quantum state comparison for continuous variables. The method we present has a high success probability, and is experimentally feasible to realize as the only required components are beam splitters and photon detectors. An easily realizable method for quantum state comparison could be important for real applications. As examples of such applications we present a "lock and key" scheme and a simple scheme for quantum public key distribution.

quant-ph↗

arXiv2004

Unambiguous comparison of the states of multiple quantum systems

We consider N quantum systems initially prepared in pure states and address the problem of unambiguously comparing them. One may ask whether or not all $N$ systems are in the same state. Alternatively, one may ask whether or not the states of all N systems are different. We investigate the possibility of unambiguously obtaining this kind of information. It is found that some unambiguous comparison tasks are possible only when certain linear independence conditions are satisfied. We also obtain measurement strategies for certain comparison tasks which are optimal under a broad range of circumstances, in particular when the states are completely unknown. Such strategies, which we call universal comparison strategies, are found to have intriguing connections with the problem of quantifying the distinguishability of a set of quantum states and also with unresolved conjectures in linear algebra. We finally investigate a potential generalisation of unambiguous state comparison, which we term unambiguous overlap filtering.

quant-ph↗

arXiv2003

Comparing the states of many quantum systems

We investigate how to determine whether the states of a set of quantum systems are identical or not. This paper treats both error-free comparison, and comparison where errors in the result are allowed. Error-free comparison means that we aim to obtain definite answers, which are known to be correct, as often as possible. In general, we will have to accept also inconclusive results, giving no information. To obtain a definite answer that the states of the systems are not identical is always possible, whereas, in the situation considered here, a definite answer that they are identical will not be possible. The optimal universal error-free comparison strategy is a projection onto the totally symmetric and the different non-symmetric subspaces, invariant under permutations and unitary transformations. We also show how to construct optimal comparison strategies when allowing for some errors in the result, minimising either the error probability, or the average cost of making an error. We point out that it is possible to realise universal error-free comparison strategies using only linear elements and particle detectors, albeit with less than ideal efficiency. Also minimum-error and minimum-cost strategies may sometimes be realised in this way. This is of great significance for practical applications of quantum comparison.

quant-ph↗

arXiv2002

Comparison of two unknown pure quantum states

We investigate the extent to which we can establish whether or not two quantum systems have been prepared in the same state. We investigate the possibility of universal unambiguous state comparison. We show that it is impossible to conclusively identify two pure unknown states as being identical, and construct the optimal measurement for conclusively identifying them as being different. We then derive optimal strategies for state comparison when the state of each system is one of two known states.

quant-ph↗

arXiv2002

Comparison of unitary transforms

We analyze the problem of comparing unitary transformations. The task is to decide, with minimal resources and maximal reliability, whether two given unitary transformations are identical or different. It is possible to make such comparisons without obtaining any information about the individual transformations. Different comparison strategies are presented and compared with respect to their efficiency. With an interferometric setup, it is possible to compare two unitary transforms using only one test particle. Another strategy makes use of a two-particle singlet state. This strategy is more efficient than using a non-entangled two-particle test state, thus demonstrating the benefit of entanglement. Generalisations to higher dimensional transforms and to more than two transformations are made.

quant-ph↗

arXiv2001

Efficient bipartite quantum state purification in arbitrary dimensional Hilbert spaces

A new purification scheme is proposed which applies to arbitrary dimensional bipartite quantum systems. It is based on the repeated application of a special class of nonlinear quantum maps and a single, local unitary operation. This special class of nonlinear quantum maps is generated in a natural way by a hermitian generalized XOR-gate. The proposed purification scheme offers two major advantages, namely it does not require local depolarization operations at each step of the purification procedure and it purifies more efficiently than other know purification schemes.

quant-ph↗

arXiv2000

Generalized quantum XOR-gate for quantum teleportation and state purification in arbitrary dimensional Hilbert spaces

A generalization of the quantum XOR-gate is presented which operates in arbitrary dimensional Hilbert spaces. Together with one-particle Fourier transforms this gate is capable of performing a variety of tasks which are important for quantum information processing in arbitrary dimensional Hilbert spaces. Among these tasks are the preparation of Bell states, quantum teleportation and quantum state purification. A physical realization of this generalized XOR-gate is proposed which is based on non-linear optical elements.

quant-ph↗