We study effects of static inter-qubit interactions and random errors in quantum gates on the stability of various quantum algorithms including the Grover quantum search algorithm and the quantum chaos maps. For the Grover algorithm our numerical and analytical results show existence of regular and chaotic phases depending on the static imperfection strength $ε$. The critical border $ε_c$ between two phases drops polynomially with the number of qubits $n_q$ as $ε_c \sim n_q^{-3/2}$. In the regular phase $(ε< ε_c)$ the algorithm remains robust against imperfections showing the efficiency gain $ε_c / ε$ for $ε> 2^{-n_q/2}$. In the chaotic phase $(ε> ε_c)$ the algorithm is completely destroyed. The results for the Grover algorithm are compared with the imperfection effects for quantum algorithms of quantum chaos maps where the universal law for the fidelity decay is given by the Random Matrix Theory (RMT). We also discuss a new gyroscopic quantum error correction method which allows to reduce the effect of static imperfections. In spite of this decay GYQEC allows to obtain a significant gain in the accuracy of quantum computations.
We study decoherence of propagating spin-1/2 excitations in generic (non-integrable and/or disordered) spin chains. We find the relevant decoherence times to be shorter in both the near-critical and diffusive regimes (if any), which fact might have important implications for the recently proposed spin chain-based implementations of quantum information processing.
We propose schemes that are efficient when each pair of qubits undergoes some imperfect collective decoherence with different baths. In the proposed scheme, each pair of qubits is first encoded in a decoherence-free subspace composed of two qubits. Leakage out of the encoding space generated by the imperfection is reduced by the quantum Zeno effect. Phase errors in the encoded bits generated by the imperfection are reduced by concatenation of the decoherence-free subspace with either a three-qubit quantum error correcting code that corrects only phase errors or a two-qubit quantum error detect…
Tomography of a quantum state is usually based on positive operator-valued measure (POVM) and on their experimental statistics. Among the available reconstructions, the maximum-likelihood (MaxLike) technique is an efficient one. We propose an extension of this technique when the measurement process cannot be simply described by an instantaneous POVM. Instead, the tomography relies on a set of quantum trajectories and their measurement records. This model includes the fact that, in practice, each measurement could be corrupted by imperfections and decoherence, and could also be associated with …
We study the influence of errors and decoherence on both the performance of Shor's factoring algorithm and Grover's search algorithm, and on the amount of interference in these algorithms using a recently proposed interference measure. We consider systematic unitary errors, random unitary errors, and decoherence processes. We show that unitary errors which destroy the interference destroy the efficiency of the algorithm, too. However, unitary errors may also create useless additional interference. In such a case the total amount of interference can increase, while the efficiency of the quantum…
We present a nonlocal construction of universal gates by means of holonomic (geometric) quantum teleportation. The effect of the errors from imperfect control of the classical parameters, the looping variation of which builds up holonomic gates, is investigated. Additionally, the influence of quantum decoherence on holonomic teleportation used as a computational primitive is studied. Advantages of the holonomic implementation with respect to control errors and dissipation are presented.
Even in the absence of external influences the operability of a quantum computer (QC) is not guaranteed because of the effects of residual one- and two-body imperfections. Here we investigate how these internal flaws affect the performance of a quantum controlled-NOT (CNOT) gate in an isolated flawed QC. First we find that the performance of the CNOT gate is considerably better when the two-body imperfections are strong. Secondly, we find that the largest source of error is due to a coherent shift rather than decoherence or dissipation. Our results suggest that the problem of internal imperfec…
We investigate the quantum-state transfer on spin-chian channels with random imperfections.Through combining the advantages of two known schemes, the dual-rail spin-chain channels[9] and the particular ihhomogenous spin-chain channel[10], we propose a protocol that can avoid the quantum noises introduced by many unnecessary measurements and can enhance the anti-decoherence ability. The results show that our protocol is more efficient to transfer an arbitrary quantum state than the original one. In particular, we discuss the effects of couplings fluctuations and imperfect initialization on both…
Developing quantum technologies requires the control and understanding of the non-equilibrium dynamics of quantum information in many-body systems. Local information propagates in the system by creating complex correlations known as information scrambling, as this process prevents extracting the information from local measurements. In this work, we develop a model adapted from solid-state NMR methods, to quantify the information scrambling. The scrambling is measured via time-reversal Loschmidt echoes (LE) and Multiple Quantum Coherences experiments that intrinsically contain imperfections. Co…
Quantum random walk in a two-dimensional lattice with randomly distributed traps is investigated. Distributions of quantum walkers are evaluated dynamically for the cases of Hadamard, Fourier, and Grover coins, and quantum to classical transition is examined as a function of the density of the traps. It is shown that traps act as a serious and additional source of quantum decoherence. Furthermore, non-trivial temporal dependence of the standard deviation of the probability distribution of the walker is found when the trapping imperfections are introduced.
The inevitable existence of static internal imperfections and residual interactions in some quantum computer architectures result in internal decoherence, dissipation, and destructive unitary shifts of active algorithms. By exact numerical simulations we determine the relative importance and origin of these errors for a Josephson charge qubit quantum computer. In particular we determine that the dynamics of a CNOT gate interacting with its idle neighboring qubits via native residual coupling behaves much like a perturbed kicked top in the exponential decay regime, where fidelity decay is only …
Large scale quantum information processing requires stable and long-lived quantum memories. Here, using atom-photon entanglement, we propose an experimentally feasible scheme to realize decoherence-free quantum memory with atomic ensembles, and show one of its applications, remote transfer of unknown quantum state, based on laser manipulation of atomic ensembles, photonic state operation through optical elements, and single-photon detection with moderate efficiency. The scheme, with inherent fault-tolerance to the practical noise and imperfections, allows one to retrieve the information in the…
Quantum control is an essential tool for the operation of quantum technologies such as quantum computers, simulators, and sensors. Although there are sophisticated theoretical tools for developing quantum control protocols, formulating optimal protocols while incorporating experimental conditions remains a challenge. In this paper, motivated by recent advances in realization of real-time feedback control in circuit quantum electrodynamics systems, we study the effect of experimental imperfections on the optimality of qubit purification protocols. Specifically, we find that the optimal control …
A parity measurement on two qubits, each consisting of a single atom in a cavity, can be realized by measuring the phase shift of a probe beam, which interacts sequentially with the two qubits, but imperfections lead to decoherence within the subspaces of a given parity. We demonstrate that a different setup, where the probe light interacts repeatedly with the qubits, can reduce the rate of decoherence within the odd or the even parity subspace significantly. We consider both the case of a resonant and the case of a nonresonant light-atom interaction and find that the performance is comparable…
We present an all-optical implementation of quantum computation using semiconductor quantum dots. Quantum memory is represented by the spin of an excess electron stored in each dot. Two-qubit gates are realized by switching on trion-trion interactions between different dots. State selectivity is achieved via conditional laser excitation exploiting Pauli exclusion principle. Read-out is performed via a quantum-jump technique. We analyze the effect on our scheme's performance of the main imperfections present in real quantum dots: exciton decay, hole mixing and phonon decoherence. We introduce a…
Using the methods of quantum trajectories we investigate the effects of dissipative decoherence in a quantum computer algorithm simulating dynamics in various regimes of quantum chaos including dynamical localization, quantum ergodic regime and quasi-integrable motion. As an example we use the quantum sawtooth algorithm which can be implemented in a polynomial number of quantum gates. It is shown that the fidelity of quantum computation decays exponentially with time and that the decay rate is proportional to the number of qubits, number of quantum gates and per gate dissipation rate induced b…
This work considers the theory underlying a discrete-time quantum filter recently used in a quantum feedback experiment. It proves that this filter taking into account decoherence and measurement errors is optimal and stable. We present the general framework underlying this filter and show that it corresponds to a recursive expression of the least-square optimal estimation of the density operator in the presence of measurement imperfections. By measurement imperfections, we mean in a very general sense unread measurement performed by the environment (decoherence) and active measurement perform…
We study effects of static inter-qubit interactions on the stability of the Grover quantum search algorithm. Our numerical and analytical results show existence of regular and chaotic phases depending on the imperfection strength $ε$. The critical border $ε_c$ between two phases drops polynomially with the number of qubits $n_q$ as $ε_c \sim n_q^{-3/2}$. In the regular phase $(ε< ε_c)$ the algorithm remains robust against imperfections showing the efficiency gain $ε_c / ε$ for $ε\gtrsim 2^{-n_q/2}$. In the chaotic phase $(ε> ε_c)$ the algorithm is completely destroyed.
We investigate the quantum walk on the line when decoherences are introduced either through simultaneous measurements of the chirality and particle position, or as a result of broken links. Both mechanisms drive the system to a classical diffusive behavior. In the case of measurements, we show that the diffusion coefficient is proportional to the variance of the initially localized quantum random walker just before the first measurement. When links between neighboring sites are randomly broken with probability $p$ per unit time, the evolution becomes decoherent after a characteristic time that…
In the era of quantum computing without full fault-tolerance, it is essential to suppress noise effects via the quantum error mitigation techniques to enhance the computational power of the quantum devices. One of the most effective noise-agnostic error mitigation schemes is the generalized quantum subspace expansion (GSE) method, which unifies various mitigation algorithms under the framework of the quantum subspace expansion. Specifically, the fault-subspace method, a subclass of GSE method, constructs an error-mitigated quantum state with copies of quantum states with different noise levels…
We examine the decoherence of an asymmetric two-qubit system that is coupled via a tunable interaction term to a common bath or two individual baths of harmonic oscillators. The dissipative dynamics are evaluated using the Bloch-Redfield formalism. It is shown that the behaviour of the decoherence effects is affected mostly by different symmetries between the qubit operator which is coupled to the environment and temperature, whereas the differences between the two bath configurations are very small. Moreover, it is elaborated that small imperfections of the qubit parameters do not lead to a d…
We study effects of imperfections induced by residual couplings between qubits on the accuracy of Shor's algorithm using numerical simulations of realistic quantum computations with up to 30 qubits. The factoring of numbers up to N=943 show that the width of peaks, which frequencies allow to determine the factors, grow exponentially with the number of qubits. However, the algorithm remains operational up to a critical coupling strength $ε_c$ which drops only polynomially with $\log_2 N$. The numerical dependence of $ε_c$ on $\log_2 N$ is explained by analytical estimates that allows to obtain …
Nonadiabatic holonomic quantum computation uses non-Abelian geometric phases to implement a universal set of quantum gates that are robust against control imperfections and decoherence. Until now, a number of three-level-based schemes of nonadiabatic holonomic computation have been put forward, and several of them have been experimentally realized. However, all these works are based on the same class of nonadiabatic paths, which originates from the first nonadiabatic holonomic proposal. Here, we propose a universal set of nonadiabatic holonomic gates based on an extended class of nonadiabatic …
Motivated by transitionless quantum driving, we construct shortcuts to adiabatic passage in a three-atom system to create a singlet state with the help of quantum zeno dynamics and non-resonant lasers. The influence of various decoherence processes is discussed by numerical simulation and the results reveal that the scheme is fast and robust against decoherence and operational imperfection. We also investigate how to select the experimental parameters to control the cavity dissipation and atomic spontaneous emission which will have an application value in experiment.
We provide a new efficient adaptive algorithm for performing phase estimation that does not require that the user infer the bits of the eigenphase in reverse order; rather it directly infers the phase and estimates the uncertainty in the phase directly from experimental data. Our method is highly flexible, recovers from failures, and can be run in the presence of substantial decoherence and other experimental imperfections and is as fast or faster than existing algorithms.
Berry's approach on "transitionless quantum driving" shows how to set a Hamiltonian which drives the dynamics of a system along instantaneous eigenstates of a reference Hamiltonian to reproduce the same final result of an adiabatic process in a shorter time. In this paper, motivated by transitionless quantum driving, we construct shortcuts to adiabatic passage in a three-atom system to create the Greenberger-Horne-Zeilinger states with the help of quantum Zeno dynamics and of non-resonant lasers. The influence of various decoherence processes is discussed by numerical simulation and the result…
We study the influence of the environment on an optically induced rotation of a single electron spin in a charged semiconductor quantum dot. We analyze the decoherence mechanisms resulting from the dynamical lattice response to the charge evolution induced in a trion-based optical spin control scheme. Moreover, we study the effect of the finite trion lifetime and of the imperfections of the unitary evolution such as off-resonant excitations and the nonadiabaticity of the driving. We calculate the total error of the operation on a spin-based qubit in an InAs/GaAs quantum dot system and discuss …
We study numerically the effects of static imperfections and residual couplings between qubits for the quantum phase estimation algorithm with two qubits. We show that the success probability of the algorithm is affected significantly more by static imperfections than by random noise errors in quantum gates. An improvement of the algorithm accuracy can be reached by application of the Pauli-random-error-correction method (PAREC).
Experimental observation of the decoherence of macroscopic objects is of fundamental importance to the study of quantum collapse models and the quantum to classical transition. Optomechanics is a promising field for the study of such models because of its fine control and readout of mechanical motion. Nevertheless, it is challenging to monitor a mechanical superposition state for long enough to investigate this transition. We present a scheme for entangling two mechanical resonators in spatial superposition states such that all quantum information is stored in the mechanical resonators. The sc…
Large quantum computers promise to solve some critical problems not solvable otherwise. However, modern quantum technologies suffer various imperfections such as control errors and qubit decoherence, inhibiting their potential utility. The overheads of quantum error correction are too great for near-term quantum computers, whereas error-mitigation strategies that address specific device imperfections may lose relevance as devices improve. To enhance the performance of quantum computers with high-quality qubits, we introduce a strategy based on symmetrization and nonlinear aggregation. On a com…
We study the effects of dissipation or leakage on the time evolution of Grover's algorithm for a quantum computer. We introduce an effective two-level model with dissipation and randomness (imperfections), which is based upon the idea that ideal Grover's algorithm operates in a 2-dimensional Hilbert space. The simulation results of this model and Grover's algorithm with imperfections are compared, and it is found that they are in good agreement for appropriately tuned parameters. It turns out that the main features of Grover's algorithm with imperfections can be understood in terms of two basi…
Obtaining high-fidelity and robust quantum gates is the key for scalable quantum computation, and one of the promising ways is to implement quantum gates using geometric phases, where the influence of local noises can be greatly reduced. To obtain robust quantum gates, we here propose a scheme for quantum manipulation by combining the geometric phase approach with the dynamical correction technique, where the imperfection control induced X-error can be greatly suppressed. Moreover, to be robust against the decoherence effect and the randomized qubit-frequency shift Z-error, our scheme is also …
The possible effect of environment on the efficiency of a quantum algorithm is considered explicitely. It is illustrated through the example of Shor's prime factorization algorithm that this effect may be disastrous. The influence of environment on quantum computation is probed on the basis of its analogy to the problem of wave function collapse in quantum measurement.Techniques from the Hepp-Colemen approach and its generalization are used to deal with decoherence problems in quantum computation including dynamic mechanism of decoherence, quantum error avoiding tricks and calculation of decoh…
The information in quantum computers is often stored in identical two-level systems (spins or pseudo-spins) that are separated by a distance shorter than the characteristic wavelength of a reservoir which is responsible for decoherence. In such a case, the collective spin-reservoir interaction, rather than an individual spin-reservoir interaction, may determine the decoherence characteristics. We use computational basis states, symmetrized spin states and spin coherent states to study collective decoherence in the implementation of various quantum algorithms. A simple method of implementing qu…
Quantum-enhanced metrology infers an unknown quantity with accuracy beyond the standard quantum limit (SQL). Feedback-based metrological techniques are promising for beating the SQL but devising the feedback procedures is difficult and inefficient. Here we introduce an efficient self-learning swarm-intelligence algorithm for devising feedback-based quantum metrological procedures. Our algorithm can be trained with simulated or real-world trials and accommodates experimental imperfections, losses, and decoherence.
We formulate and numerically simulate the single control qubit Shor algorithm for the case of static imperfections induced by residual couplings between qubits. This allows us to study the accuracy of Shor's algorithm with respect to these imperfections using numerical simulations of realistic quantum computations with up to $n_q=18$ computational qubits allowing to factor numbers up to N=205193. We confirm that the algorithm remains operational up to a critical coupling strength $ε_c$ which drops only polynomially with $\log_2 N$. The obtained numerical dependence of $ε_c$ on $\log_2 N$ is in…
Noisy, intermediate-scale quantum computers come with intrinsic limitations in terms of the number of qubits (circuit "width") and decoherence time (circuit "depth") they can have. Here, for the first time, we demonstrate a recently introduced method that breaks a circuit into smaller subcircuits or fragments, and thus makes it possible to run circuits that are either too wide or too deep for a given quantum processor. We investigate the behavior of the method on one of IBM's 20-qubit superconducting quantum processors with various numbers of qubits and fragments. We build noise models that ca…
For a practical quantum computer to operate, it will be essential to properly manage decoherence. One important technique for doing this is the use of "decoherence-free subspaces" (DFSs), which have recently been demonstrated. Here we present the first use of DFSs to improve the performance of a quantum algorithm. An optical implementation of the Deutsch-Jozsa algorithm can be made insensitive to a particular class of phase noise by encoding information in the appropriate subspaces; we observe a reduction of the error rate from 35% to essentially its pre-noise value of 8%.
The realization of devices which harness the laws of quantum mechanics represents an exciting challenge at the interface of modern technology and fundamental science. An exemplary paragon of the power of such quantum primitives is the concept of "quantum money". A dishonest holder of a quantum bank-note will invariably fail in any forging attempts; indeed, under assumptions of ideal measurements and decoherence-free memories such security is guaranteed by the no-cloning theorem. In any practical situation, however, noise, decoherence and operational imperfections abound. Thus, the development …
We discuss the generation of entanglement between electronic states of two atoms in a cavity using direct quantum feedback schemes. We compare the effects of different control Hamiltonians and detection processes in the performance of entanglement production and show that the quantum-jump-based feedback proposed by us in Phys. Rev. A {\bf 76} 010301(R) (2007) can protect highly entangled states against decoherence. We provide analytical results that explain the robustness of jump feedback, and also analyse the perspectives of experimental implementation by scrutinising the effects of imperfect…
In this work we study several models of decoherence and how different quantum maps and algorithms react when perturbed by them. Following closely Ref. [1], generalizations of the three paradigmatic one single qubit quantum channels (these are the depolarizing channel, the phase damping channel and the amplitude damping channel) for the case of an arbitrarily-sized finite-dimensional Hilbert space are presented, as well as other types of noise in phase space. More specifically, Grover's search algorithm's response to decoherence is analyzed; together with those of a family of quantum versions o…
Quantum network protocols offer new functionalities such as enhanced security to communication and computational systems. Despite the rapid progress in quantum hardware, it has not yet reached a level of maturity that enables execution of many quantum protocols in practical settings. To develop quantum protocols in real world, it is necessary to examine their performance considering the imperfections in their practical implementation using simulation platforms. In this paper, we consider several quantum protocols that enable promising functionalities and services in near-future quantum network…
The desire to understand the interaction between light and matter has stimulated centuries of research, leading to technological achievements that have shaped our world. One contemporary frontier of research into light-matter interaction considers regimes where quantum effects dominate. By understanding and manipulating these quantum effects, a vast array of new quantum-enhanced technologies become accessible. In this thesis, I explore and analyze fundamental components and processes for quantum optical devices with a focus on solid-state quantum systems. This includes indistinguishable single…
The interplay of unitary evolution and local measurements in many-body systems gives rise to a stochastic state evolution and to measurement-induced phase transitions in the pure state entanglement. In realistic settings, however, this dynamics may be spoiled by decoherence, e.g., dephasing, due to coupling to an environment or measurement imperfections. We investigate the impact of dephasing and the inevitable evolution into a non-Gaussian, mixed state, on the dynamics of monitored fermions. We approach it from three complementary perspectives: (i) the exact solution of the conditional master…
The stabilizing properties of one-error correcting jump codes are explored under realistic non-ideal conditions. For this purpose the quantum algorithm of the tent-map is decomposed into a universal set of Hamiltonian quantum gates which ensure perfect correction of spontaneous decay processes under ideal circumstances even if they occur during a gate operation. An entanglement gate is presented which is capable of entangling any two logical qubits of different one-error correcting code spaces. With the help of this gate simultaneous spontaneous decay processes affecting physical qubits of dif…
We report on the effects of a simple decoherence model on the quantum search algorithm. Despite its simplicity, the decoherence model is an instructive model that can genuinely imitate realistic noisy environment in many situations. As one would expect, as the size of the database gets larger, the effects of decoherence on the efficiency of the quantum search algorithm cannot be ignored. Moreover, with decoherence, it may not be useful to iterate beyond the first maxima in the probability distribution of the search entry. Surprisingly, we also find that the number of iterations for maximum pro…
The environment -- external or internal degrees of freedom coupled to the system -- can, in effect, monitor some of its observables. As a result, the eigenstates of these observables decohere and behave like classical states: Continuous destruction of superpositions leads to environment-induced superselection (einselection). Here I investigate it in the context of quantum chaos (i. e., quantum dynamics of systems which are classically chaotic).
We report the realization, using nuclear magnetic resonance techniques, of the first quantum computer that reliably executes an algorithm in the presence of strong decoherence. The computer is based on a quantum error avoidance code that protects against a class of multiple-qubit errors. The code stores two decoherence-free logical qubits in four noisy physical qubits. The computer successfully executes Grover's search algorithm in the presence of arbitrarily strong engineered decoherence. A control computer with no decoherence protection consistently fails under the same conditions.
In this work, inspired by the study of semidefinite programming for block-diagonalizing matrix *-algebras, we propose an algorithm that can find the algebraic structure of decoherence-free subspaces (DFS's) for a given noisy quantum channel. We prove that this algorithm will work for all cases with probability one, and it is more efficient than the algorithm proposed by Holbrook, Kribs, and Laflamme [Quant. Inf. Proc. 80, 381 (2003)]. In fact, our results reveal that this previous algorithm only works for special cases. As an application, we discuss how this method can be applied to increase t…
