arXiv subjects

Daniel A. Lidar

Publications and source records attributed to Daniel A. Lidar.

At least 145 records · Page 8Linked to original sources

arXiv2007

Optimal control of quantum gates and suppression of decoherence in a system of interacting two-level particles

Methods of optimal control are applied to a model system of interacting two-level particles (e.g., spin-half atomic nuclei or electrons or two-level atoms) to produce high-fidelity quantum gates while simultaneously negating the detrimental effect of decoherence. One set of particles functions as the quantum information processor, whose evolution is controlled by a time-dependent external field. The other particles are not directly controlled and serve as an effective environment, coupling to which is the source of decoherence. The control objective is to generate target one- and two-qubit unitary gates in the presence of strong environmentally-induced decoherence and under physically motivated restrictions on the control field. The quantum-gate fidelity, expressed in terms of a novel state-independent distance measure, is maximized with respect to the control field using combined genetic and gradient algorithms. The resulting high-fidelity gates demonstrate the feasibility of precisely guiding the quantum evolution via optimal control, even when the system complexity is exacerbated by environmental coupling. It is found that the gate duration has an important effect on the control mechanism and resulting fidelity. An analysis of the sensitivity of the gate performance to random variations in the system parameters reveals a significant degree of robustness attained by the optimal control solutions.

quant-ph↗

arXiv2007

Performance of Deterministic Dynamical Decoupling Schemes: Concatenated and Periodic Pulse Sequences

Dynamical decoupling can be used to preserve arbitrary quantum states despite undesired interactions with the environment, using control Hamiltonians affecting the system only. We present a system-independent analysis of dynamical decoupling based on leading order decoupling error estimates, valid for bounded-strength environments. Using as a key tool a renormalization transformation of the effective system-bath coupling Hamiltonian, we delineate the reliability domain of dynamical decoupling used for quantum state preservation, in a general setting for a single qubit. We specifically analyze and compare two deterministic dynamical decoupling schemes -- periodic and concatenated -- and distinguish between two limiting cases of fast versus slow environments. We prove that concatenated decoupling outperforms periodic decoupling over a wide range of parameters. These results are obtained for both ``ideal'' (zero-width) and realistic (finite-width) pulses This work extends and generalizes our earlier work, Phys. Rev. Lett. 95, 180501 (2005).

quant-ph↗

arXiv2007

On the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers

We present an efficient quantum algorithm for the exact evaluation of either the fully ferromagnetic or anti-ferromagnetic q-state Potts partition function Z for a family of graphs related to irreducible cyclic codes. This problem is related to the evaluation of the Jones and Tutte polynomials. We consider the connection between the weight enumerator polynomial from coding theory and Z and exploit the fact that there exists a quantum algorithm for efficiently estimating Gauss sums in order to obtain the weight enumerator for a certain class of linear codes. In this way we demonstrate that for a certain class of sparse graphs, which we call Irreducible Cyclic Cocycle Code (ICCC_ε) graphs, quantum computers provide a polynomial speed up in the difference between the number of edges and vertices of the graph, and an exponential speed up in q, over the best classical algorithms known to date.

quant-ph↗

arXiv2007

Simple proof of equivalence between adiabatic quantum computation and the circuit model

We prove the equivalence between adiabatic quantum computation and quantum computation in the circuit model. An explicit adiabatic computation procedure is given that generates a ground state from which the answer can be extracted. The amount of time needed is evaluated by computing the gap. We show that the procedure is computationally efficient.

quant-ph↗

arXiv2006

Decoherence-induced geometric phase in a multilevel atomic system

We consider the STIRAP process in a three-level atom. Viewed as a closed system, no geometric phase is acquired. But in the presence of spontaneous emission and/or collisional relaxation we show numerically that a non-vanishing, purely real, geometric phase is acquired during STIRAP, whose magnitude grows with the decay rates. Rather than viewing this decoherence-induced geometric phase as a nuisance, it can be considered an example of "beneficial decoherence": the environment provides a mechanism for the generation of geometric phases which would otherwise require an extra experimental control knob.

quant-ph↗

arXiv2006

Quantum Error Correction via Convex Optimization

We show that the problem of designing a quantum information error correcting procedure can be cast as a bi-convex optimization problem, iterating between encoding and recovery, each being a semidefinite program. For a given encoding operator the problem is convex in the recovery operator. For a given method of recovery, the problem is convex in the encoding scheme. This allows us to derive new codes that are locally optimal. We present examples of such codes that can handle errors which are too strong for codes derived by analogy to classical error correction techniques.

quant-ph↗

arXiv2006

Robust transmission of non-Gaussian entanglement over optical fibers

We show how the entanglement in a wide range of continuous variable non-Gaussian states can be preserved against decoherence for long-range quantum communication through an optical fiber. We apply protection via decoherence-free subspaces and quantum dynamical decoupling to this end. The latter is implemented by inserting phase shifters at regular intervals $Δ$ inside the fiber, where $Δ$ is roughly the ratio of the speed of light in the fiber to the bath high-frequency cutoff. Detailed estimates of relevant parameters are provided using the boson-boson model of system-bath interaction for silica fibers, and $Δ$ is found to be on the order of a millimeter.

quant-ph↗

arXiv2006

Quantum Malware

When quantum communication networks proliferate they will likely be subject to a new type of attack: by hackers, virus makers, and other malicious intruders. Here we introduce the concept of "quantum malware" to describe such human-made intrusions. We offer a simple solution for storage of quantum information in a manner which protects quantum networks from quantum malware. This solution involves swapping the quantum information at random times between the network and isolated, distributed ancillas. It applies to arbitrary attack types, provided the protective operations are themselves not compromised.

quant-ph↗

arXiv2005

Robustness of multi-qubit entanglement in the independent decoherence model

We study the robustness of the GHZ (or ``cat'') class of multi-partite states under decoherence. The noise model is described by a general completely positive map for qubits independently coupled to the environment. In particular, the robustness of N-party entanglement is studied in the large N limit when (a) the number of spatially separated subsystems is fixed but the size of each subsystem becomes large (b) the size of the subsystems is fixed while their number becomes arbitrarily large. We obtain conditions for entanglement in these two cases. Among our other results, we show that the parity of an entangled state (i.e., whether it contains an even or odd number of qubits) can lead to qualitatively different robustness of entanglement under certain conditions.

quant-ph↗

arXiv2005

Few-body spin couplings and their implications for universal quantum computation

Electron spins in semiconductor quantum dots are promising candidates for the experimental realization of solid-state qubits. We analyze the dynamics of a system of three qubits arranged in a linear geometry and a system of four qubits arranged in a square geometry. Calculations are performed for several quantum dot confining potentials. In the three-qubit case, three-body effects are identified that have an important quantitative influence upon quantum computation. In the four-qubit case, the full Hamiltonian is found to include both three-body and four-body interactions that significantly influence the dynamics in physically relevant parameter regimes. We consider the implications of these results for the encoded universality paradigm applied to the four-electron qubit code; in particular, we consider what is required to circumvent the four-body effects in an encoded system (four spins per encoded qubit) by the appropriate tuning of experimental parameters.

quant-ph↗

arXiv2004

Quantum Phase Transitions and Bipartite Entanglement

We develop a general theory of the relation between quantum phase transitions (QPTs) characterized by nonanalyticities in the energy and bipartite entanglement. We derive a functional relation between the matrix elements of two-particle reduced density matrices and the eigenvalues of general two-body Hamiltonians of $d$-level systems. The ground state energy eigenvalue and its derivatives, whose non-analyticity characterizes a QPT, are directly tied to bipartite entanglement measures. We show that first-order QPTs are signalled by density matrix elements themselves and second-order QPTs by the first derivative of density matrix elements. Our general conclusions are illustrated via several quantum spin models.

quant-ph↗

arXiv2004

Completely Positive Post-Markovian Master Equation via a Measurement Approach

A new post-Markovian quantum master equation is derived, that includes bath memory effects via a phenomenologically introduced memory kernel k(t). The derivation uses as a formal tool a probabilistic single-shot bath-measurement process performed during the coupled system-bath evolution. The resulting analytically solvable master equation interpolates between the exact Nakajima-Zwanzig equation and the Markovian Lindblad equation. A necessary and sufficient condition for complete positivity in terms of properties of k(t) is presented, in addition to a prescription for the experimental determination of k(t). The formalism is illustrated with examples.

quant-ph↗

arXiv2004

Stabilizing qubit coherence via tracking-control

We consider the problem of stabilizing the coherence of a single qubit subject to Markovian decoherence, via the application of a control Hamiltonian, without any additional resources. In this case neither quantum error correction/avoidance, nor dynamical decoupling applies. We show that using tracking-control, i.e., the conditioning of the control field on the state of the qubit, it is possible to maintain coherence for finite time durations, until the control field diverges.

quant-ph↗

arXiv2004

Universal Leakage Elimination

``Leakage'' errors are particularly serious errors which couple states within a code subspace to states outside of that subspace thus destroying the error protection benefit afforded by an encoded state. We generalize an earlier method for producing leakage elimination decoupling operations and examine the effects of the leakage eliminating operations on decoherence-free or noiseless subsystems which encode one logical, or protected qubit into three or four qubits. We find that by eliminating the large class of leakage errors, under some circumstances, we can create the conditions for a decoherence free evolution. In other cases we identify a combination decoherence-free and quantum error correcting code which could eliminate errors in solid-state qubits with anisotropic exchange interaction Hamiltonians and enable universal quantum computing with only these interactions.

quant-ph↗

arXiv2004

On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants

It is shown that the canonical problem of classical statistical thermodynamics, the computation of the partition function, is in the case of +/-J Ising spin glasses a particular instance of certain simple sums known as quadratically signed weight enumerators (QWGTs). On the other hand it is known that quantum computing is polynomially equivalent to classical probabilistic computing with an oracle for estimating QWGTs. This suggests a connection between the partition function estimation problem for spin glasses and quantum computation. This connection extends to knots and graph theory via the equivalence of the Kauffman polynomial and the partition function for the Potts model.

quant-ph↗

arXiv2004

Entangling capacities of noisy two-qubit Hamiltonians

We show that intrinsic fluctuations in system control parameters impose limits on the ability of two-qubit (exchange) Hamiltonians to generate entanglement starting from mixed initial states. We find three classes for Gaussian and Laplacian fluctuations. For the Ising and XYZ models there are qualitatively distinct sharp entanglement-generation transitions, while the class of Heisenberg, XY, and XXZ Hamiltonians is capable of generating entanglement for any finite noise level. Our findings imply that exchange Hamiltonians are surprisingly robust in their ability to generate entanglement in the presence of noise, thus potentially reducing the need for quantum error correction.

quant-ph↗

arXiv2004

Overcoming Quantum Noise in Optical Fibers

Noise in optical Telecom fibers is an important limitation on optical quantum data transmission. Unfortunately, the classically successful amplifiers (such as EDFA) cannot be used in quantum communication because of the no-cloning theorem. We propose a simple method to reduce quantum noise: the insertion of phase-shifters and/or beam-splitters at regular distance intervals into a fiber. We analyze in detail the case of qubits encoded into polarization states of low-intensity light, which is of central importance to various quantum information tasks, such as quantum cryptography and communication. We discuss the experimental feasibility of our scheme and propose a simple experiment to test our method.

quant-ph↗

arXiv2004

One-spin quantum logic gates from exchange interactions and a global magnetic field

It has been widely assumed that one-qubit gates in spin-based quantum computers suffer from severe technical difficulties. We show that one-qubit gates can in fact be generated using only modest and presently feasible technological requirements. Our solution uses only global magnetic fields and controllable Heisenberg exchange interactions, thus circumventing the need for single-spin addressing.

quant-ph↗