SearcharxivSearch

arXiv subjects

Igor Jex

Publications and source records attributed to Igor Jex.

At least 19 recordsLinked to original sources

Input phase noise in Gaussian Boson sampling

Gaussian boson sampling is an important protocol for testing the performance of photonic quantum simulators. As such, various noise sources have been investigated that degrade the operation of such devices. In this paper, we examine a situation with phase noise between different modes of the input state leading to dephasing of the system. This models the phase fluctuations which remain even when the mean phase is controlled. We aim to determine whether these phase-noisy input states still form a computationally difficult problem. To do this, we use Matrix Product Operators to model the system, a technique recently used to model boson sampling scenarios. Our investigation finds that the Entanglement entropy grows linearly with the number of input states even for noisy input states. This implies that, unlike boson loss, this form of experimentally relevant noise remains difficult to simulate with tensor networks and may allow for the demonstration of quantum advantage without the need for implementing the challenging task of input-state phase stabilisation.

quant-ph

Quantum metrology in a nonlinear-interferometer with feedback

In this paper, we propose a nonlinear interferometer with feedback loops and explore its efficiency for phase estimation. We analyse two feedback schemes, one where both modes of the interferometer are fed-back into the device and another where only one mode is fed-back. The quantum Fisher information (QFI) for phase estimation in each feedback scheme increases with each feedback loop, and similar to the standard SU(1,1) nonlinear interferometer, phase estimation in this scheme is sensitive to photon loss when the inputs are vacuum state. In terms of resources, we show that, in the low-loss regime, our scheme performs better than standard nonlinear interferometer. The feedback scheme provides the minimum phase variance when the unknown phase is small. We have also provided a special case where feedback scheme provided enhanced QFI even for large phase values. This is achieved by switching between squeezing and anti-squeezing operators after every few loops.

quant-ph

Recurrence in discrete-time quantum stochastic walks

Interplay between quantum interference and classical randomness can enhance performance of various quantum information tasks. In the present paper we analyze recurrence phenomena in the discrete-time quantum stochastic walk on a line, which is a quantum stochastic process that interpolates between quantum and classical walk dynamics. Surprisingly, we find that introducing classical randomness can reduce the recurrence probability -- despite the fact that the classical random walk returns with certainty -- and we identify the conditions under which this intriguing phenomenon occurs. Numerical evaluation of the first-return generating function allows us to investigate the asymptotics of the return probability as the step number approaches infinity. This provides strong evidence that the suppression of recurrence probability is not a transient effect but a robust feature of the underlying quantum-classical interplay in the asymptotic limit. Our results show that for certain tasks discrete-time quantum stochastic walks outperform both classical random walks and unitary quantum walks.

quant-ph

Boson Sampling from Non-Gaussian States

Boson sampling has emerged as an important tool to demonstrate the difference between quantum and classical computers and has attracted the interest of experimentalists and theoreticians. In this work we study Boson sampling from general, single-mode states using a scheme that can generate any such state by combining Gaussian states and photon number measurements. We derive a formula that can be used to calculate the output photon number probabilities of these states after they travel through a linear interferometer. This extends the Boson sampling protocol to the widest array of possible single-mode states and from this we show that the complexity scaling of all such states is similar and hence there is no complexity advantage of using complex input states over simpler ones.

quant-ph

Universal, unambiguous concentration and distillation of Bell pairs

The ability of preparing perfect Bell pairs with a practical scheme is of great relevance for quantum communication as well as distributed quantum computing. We propose a scheme which probabilistically, but unambiguously produces the $\left|\Phi_{+}\right>$ Bell pair from four copies of qubit pairs initially in the same arbitrary pure quantum state. The same scheme, extended to eight qubit pairs initially in the same, moderately mixed quantum state, unambiguously produces the $\left|\Phi_{+}\right>$ Bell pair with quadratically suppressed noise. The core step of the proposed scheme consists of a pair of local two-qubit operations applied at each of the two distant locations, followed by a partial projective measurement and postselection at each party, with results communicated classically. While the scheme resembles standard entanglement distillation protocols, it achieves success within just three iterations, making it attractive for real-world applications.

quant-ph

Robustness of chaotic behavior in iterated quantum protocols

One of the simplest possible quantum circuits, consisting of a CNOT gate, a Hadamard gate and a measurement on one of the outputs is known to lead to chaotic dynamics when applied iteratively on an ensemble of equally prepared qubits. The evolution of pure initial quantum states is characterized by a fractal (in the space of states), formed by the border of different convergence regions. We examine how the ideal evolution is distorted in the presence of both coherent error and incoherent initial noise, which are typical imperfections in current implementations of quantum computers. It is known that under the influence of initial noise only, the fractal is preserved, moreover, its dimension remains constant below a critical noise level. We systematically analyze the effect of coherent Hadamard gate errors by determining fixed points and cycles of the evolution. We combine analytic and numerical methods to explore to what extent the dynamics is altered by coherent errors in the presence of preparation noise as well. We show that the main features of the dynamics, and especially the fractal borders, are robust against the discussed noise, they will only be slightly distorted. We identify a range of error parameters, for which the characteristic properties of the dynamics are not significantly altered. Hence, our results allow to identify reliable regimes of operation of iterative protocols.

quant-ph

Jaynes principle for quantum Markov processes: Generalized Gibbs - von Neumann states rule

We prove that any asymptotics of a finite-dimensional quantum Markov processes can be formulated in the form of a generalized Jaynes principle in the discrete as well as in the continuous case. Surprisingly, we find that the open system dynamics does not require maximization of von Neumannentropy. In fact, the natural functional to be extremized is the quantum relative entropy and the resulting asymptotic states or trajectories are always of the exponential Gibbs-like form. Three versions of the principle are presented for different settings, each treating different prior knowledge: for asymptotic trajectories of fully known initial states, for asymptotic trajectories incompletely determined by known expectation values of some constants of motion and for stationary states incompletely determined by expectation values of some integrals of motion. All versions are based on the knowledge of the underlying dynamics. Hence our principle is primarily rooted in the inherent physics and it is not solely an information construct. The found principle coincides with the MaxEnt principle in the special case of unital quantum Markov processes. We discuss how the generalized principle modifies fundamental relations of statistical physics.

quant-ph

Asymptotic phase-locking and synchronization in two-qubit systems

The paper concerns spontaneous asymptotic phase-locking and synchronization in two-qubit systems undergoing continuous Markovian evolution described by Lindbladian dynamics with normal Lindblad operators. Using analytic methods, all phase-locking-enforcing mechanisms within the given framework are obtained and classified. Detailed structures of their respective attractor spaces are provided and used to explore their properties from various perspectives. Amid phase-locking processes those additionally enforcing identical stationary parts of both qubits are identified, including as a special case the strictest form of synchronization conceivable. A prominent basis is presented which reveals that from a physical point of view two main types of phase-locking mechanisms exist. The ability to preserve information about the initial state is explored and an upper bound on the amplitude of oscillations of the resulting phase-locked dynamics is established. Permutation symmetry of both asymptotic states and phase-locking mechanisms is discussed. Lastly, the possibility of entanglement production playing the role of a phase-locking witness is rebutted by three analytically treatable examples.

quant-ph

Key graph properties affecting transport efficiency of flip-flop Grover percolated quantum walks

Quantum walks exhibit properties without classical analogues. One of those is the phenomenon of asymptotic trapping -- there can be non-zero probability of the quantum walker being localised in a finite part of the underlying graph indefinitely even though locally all directions of movement are assigned non-zero amplitudes at each step. We study quantum walks with the flip-flop shift operator and the Grover coin, where this effect has been identified previously. For the version of the walk further modified by a random dynamical disruption of the graph (percolated quantum walks) we provide a recipe for the construction of a complete basis of the subspace of trapped states allowing to determine the asymptotic probability of trapping for arbitrary finite connected simple graphs, thus significantly generalizing the previously known result restricted to planar 3-regular graphs. We show how the position of the source and sink together with the graph geometry and its modifications affect the excitation transport. This gives us a deep insight into processes where elongation or addition of dead-end subgraphs may surprisingly result in enhanced transport and we design graphs exhibiting this pronounced behavior. In some cases this even provides closed-form formulas for the asymptotic transport probability in dependence on some structure parameters of the graphs.

quant-ph

Relaxation to Equilibrium in a Quantum Network

The approach to equilibrium of quantum mechanical systems is a topic as old as quantum mechanics itself, but has recently seen a surge of interest due to applications in quantum technologies, including, but not limited to, quantum computation and sensing. The mechanisms by which a quantum system approaches its long-time, limiting stationary state are fascinating and, sometimes, quite different from their classical counterparts. In this respect, quantum networks represent a mesoscopic quantum systems of interest. In such a case, the graph encodes the elementary quantum systems (say qubits) at its vertices, while the links define the interactions between them. We study here the relaxation to equilibrium for a fully connected quantum network with CNOT gates representing the interaction between the constituting qubits. We give a number of results for the equilibration in these systems, including analytic estimates. The results are checked using numerical methods for systems with up to 15-16 qubits. It is emphasized in which way the size of the network controls the convergency.

quant-ph

Local versus Global Two-Photon Interference in Quantum Networks

We devise an approach to characterizing the intricate interplay between classical and quantum interference of two-photon states in a network, which comprises multiple time-bin modes. By controlling the phases of delocalized single photons, we manipulate the global mode structure, resulting in distinct two-photon interference phenomena for time-bin resolved (local) and time-bucket (global) coincidence detection. This coherent control over the photons' mode structure allows for synthesizing two-photon interference patterns, where local measurements yield standard Hong-Ou-Mandel dips while the global two-photon visibility is governed by the overlap of the delocalized single-photon states. Thus, our experiment introduces a method for engineering distributed quantum interferences in networks.

quant-ph

Complete classification of trapping coins for quantum walks on the 2D square lattice

One of the unique features of discrete-time quantum walks is called trapping, meaning the inability of the quantum walker to completely escape from its initial position, albeit the system is translationally invariant. The effect is dependent on the dimension and the explicit form of the local coin. A four state discrete-time quantum walk on a square lattice is defined by its unitary coin operator, acting on the four dimensional coin Hilbert space. The well known example of the Grover coin leads to a partial trapping, i.e., there exists some escaping initial state for which the probability of staying at the initial position vanishes. On the other hand, some other coins are known to exhibit strong trapping, where such escaping state does not exist. We present a systematic study of coins leading to trapping, explicitly construct all such coins for discrete-time quantum walks on the 2D square lattice, and classify them according to the structure of the operator and the manifestation of the trapping effect. We distinguish three types of trapping coins exhibiting distinct dynamical properties, as exemplified by the existence or non-existence of the escaping state and the area covered by the spreading wave-packet.

quant-ph

Quantum walk transport on carbon nanotube structures

We study source-to-sink excitation transport on carbon nanotubes using the concept of quantum walks. In particular, we focus on transport properties of Grover coined quantum walks on ideal and percolation perturbed nanotubes with zig-zag and armchair chiralities. Using analytic and numerical methods we identify how geometric properties of nanotubes and different types of a sink altogether control the structure of trapped states and, as a result, the overall source-to-sink transport efficiency. It is shown that chirality of nanotubes splits behavior of the transport efficiency into a few typically well separated quantitative branches. Based on that we uncover interesting quantum transport phenomena, e.g. increasing the length of the tube can enhance the transport and the highest transport efficiency is achieved for the thinnest tube. We also demonstrate, that the transport efficiency of the quantum walk on ideal nanotubes may exhibit even oscillatory behavior dependent on length and chirality.

quant-ph

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

A counterintuitive role of geometry in transport by quantum walks

Quantum walks are accepted as a generic model for quantum transport. The character of the transport crucially depends on the properties of the walk like its geometry and the driving coin. We demonstrate that increasing transport distance between source and target or adding redundant branches to the actual graph may surprisingly result in a significant enhancement of transport efficiency. We explain analytically the observed non-classical effects using the concept of trapped states for several intriguing geometries including the ladder graph, the Cayley tree and its modifications.

quant-ph

Percolated quantum walks with a general shift operator: From trapping to transport

We present a generalized definition of discrete-time quantum walks convenient for capturing a rather broad spectrum of walker's behavior on arbitrary graphs. It includes and covers both: the geometry of possible walker's positions with interconnecting links and the prescribed rule in which directions the walker will move at each vertex. While the former allows for the analysis of inhomogeneous quantum walks on graphs with vertices of varying degree, the latter offers us to choose, investigate, and compare quantum walks with different shift operators. The synthesis of both key ingredients constitutes a well-suited playground for analyzing percolated quantum walks on a quite general class of graphs. Analytical treatment of the asymptotic behavior of percolated quantum walks is presented and worked out in details for the Grover walk on graphs with maximal degree 3. We find, that for these walks with cyclic shift operators the existence of an edge-3-coloring of the graph allows for non-stationary asymptotic behavior of the walk. For different shift operators the general structure of localized attractors is investigated, which determines the overall efficiency of a source-to-sink quantum transport across a dynamically changing medium. As a simple nontrivial example of the theory we treat a single excitation transport on a percolated cube.

quant-ph

Photonic quantum walks with four-dimensional coins

The dimensionality of the internal coin space of discrete-time quantum walks has a strong impact on the complexity and richness of the dynamics of quantum walkers. While two-dimensional coin operators are sufficient to define a certain range of dynamics on complex graphs, higher dimensional coins are necessary to unleash the full potential of discrete-time quantum walks. In this work we present an experimental realization of a discrete-time quantum walk on a line graph that, instead of two-dimensional, exhibits a four-dimensional coin space. Making use of the extra degree of freedom we observe multiple ballistic propagation speeds specific to higher dimensional coin operators. By implementing a scalable technique, we demonstrate quantum walks on circles of various sizes, as well as on an example of a Husimi cactus graph. The quantum walks are realized via time-multiplexing in a Michelson interferometer loop architecture, employing as the coin degrees of freedom the polarization and the traveling direction of the pulses in the loop. Our theoretical analysis shows that the platform supports implementations of quantum walks with arbitrary $4 \times 4$ unitary coin operations, and usual quantum walks on a line with various periodic and twisted boundary conditions.

quant-ph

Phase Transition in Iterated Quantum Protocols for Noisy Inputs

Quantum information processing exploits all the features quantum mechanics offers. Among them there is the possibility to induce nonlinear maps on a quantum system by involving two or more identical copies of the given system in the same state. Such maps play a central role in distillation protocols used for quantum key distribution. We determine that such protocols may exhibit sensitive, quasi-chaotic evolution not only for pure initial states but also for mixed states, i.e. the complex dynamical behavior is not destroyed by small initial uncertainty. We show that the appearance of sensitive, complex dynamics associated with a fractal structure in the parameter space of the system has the character of a first order phase transition. The purity of the initial state plays the role of the control parameter and the dimension of the fractal structure is independent of the purity value after passing the phase transition point. The critical purity coincides with the purity of a repelling fixed point of the dynamics and we show that all the pre-images of states from the close neighborhood of pure chaotic initial states have purity larger than this. Initial states from this set can be considered as quasi-chaotic.

quant-ph