SearcharxivSearch

arXiv subjects

K. Khodjasteh

Publications and source records attributed to K. Khodjasteh.

5 recordsLinked to original sources

Rigorous Bounds on the Performance of a Hybrid Dynamical Decoupling-Quantum Computing Scheme

We study dynamical decoupling in a multi-qubit setting, where it is combined with quantum logic gates. This is illustrated in terms of computation using Heisenberg interactions only, where global decoupling pulses commute with the computation. We derive a rigorous error bound on the trace distance or fidelity between the desired computational state and the actual time-evolved state, for a system subject to coupling to a bounded-strength bath. The bound is expressed in terms of the operator norm of the effective Hamiltonian generating the evolution in the presence of decoupling and logic operations. We apply the bound to the case of periodic pulse sequences and find that in order maintain a constant trace distance or fidelity, the number of cycles -- at fixed pulse interval and width -- scales in inverse proportion to the square of the number of qubits. This sets a scalability limit on the protection of quantum computation using periodic dynamical decoupling.

quant-ph

Distance Bounds on Quantum Dynamics

We derive rigorous upper bounds on the distance between quantum states in an open system setting, in terms of the operator norm between the Hamiltonians describing their evolution. We illustrate our results with an example taken from protection against decoherence using dynamical decoupling.

quant-ph

Fault-Tolerant Quantum Dynamical Decoupling

Dynamical decoupling pulse sequences have been used to extend coherence times in quantum systems ever since the discovery of the spin-echo effect. Here we introduce a method of recursively concatenated dynamical decoupling pulses, designed to overcome both decoherence and operational errors. This is important for coherent control of quantum systems such as quantum computers. For bounded-strength, non-Markovian environments, such as for the spin-bath that arises in electron- and nuclear-spin based solid-state quantum computer proposals, we show that it is strictly advantageous to use concatenated, as opposed to standard periodic dynamical decoupling pulse sequences. Namely, the concatenated scheme is both fault-tolerant and super-polynomially more efficient, at equal cost. We derive a condition on the pulse noise level below which concatenated is guaranteed to reduce decoherence.

quant-ph

Quantum Computing in the Presence of Detected Spontaneous Emission

A new method for quantum computation in the presence of detected spontaneous emission is proposed. The method combines strong and fast (dynamical decoupling) pulses and a quantum error correcting code that encodes $n$ logical qubits into only $n+1$ physical qubits. Universal fault-tolerant quantum computation is shown to be possible in this scheme using Hamiltonians relevant to a range of promising proposals for the physical implementation of quantum computers.

quant-ph

A Dynamical Approach to a Self-similar Universe

We write a non-relativistic Lagrangian for a hierarchical universe. The equations of motion are solved numerically and the evolution of the fractal dimension is obtained for different initial conditions. We show that our model is homogeneous at the time of the last scattering, but evolves into a self-similar universe with a remarkably constant fractal dimension. We also show that the Hubble law is implied by this model and make an estimate for the age of the universe.

astro-ph