Decoherence suppression for oscillator-assisted geometric quantum gates via symmetrization

We propose a novel symmetrization procedure to beat decoherence for oscillator-assisted quantum gate operations. The enacted symmetry is related to the global geometric features of qubits transformation based on ancillary oscillator modes, e.g. phonons in an ion-trap system. It is shown that the devised multi-circuit symmetrized evolution endows the system with a two-fold resilience against decoherence: insensitivity to thermal fluctuations and quantum dissipation.Comment: 4 pages, 2 figure

Virtual Quantum Subsystems

The physical resources available to access and manipulate the degrees of freedom of a quantum system define the set $\cal A$ of operationally relevant observables. The algebraic structure of $\cal A$ selects a preferred tensor product structure i.e., a partition into subsystems. The notion of compoundness for quantum system is accordingly relativized. Universal control over virtual subsystems can be achieved by using quantum noncommutative holonomiesComment: Presentation improved, to appear in PRL. 4 Pages, RevTe

Computation on a Noiseless Quantum Code and Symmetrization

Let ${\cal H}$ be the state-space of a quantum computer coupled with the environment by a set of error operators spanning a Lie algebra ${\cal L}.$ Suppose ${\cal L}$ admits a noiseless quantum code i.e., a subspace ${\cal C}\subset{\cal H}$ annihilated by ${\cal L}.$ We show that a universal set of gates over $\cal C$ is obtained by any generic pair of ${\cal L}$-invariant gates. Such gates - if not available from the outset - can be obtained by resorting to a symmetrization with respect to the group generated by ${\cal L}.$ Any computation can then be performed completely within the coding decoherence-free subspace.Comment: One result added, to appear in Phys. Rev. A (RC) 4 pages LaTeX, no figure

Universal control of quantum subspaces and subsystems

We describe a broad dynamical-algebraic framework for analyzing the quantum control properties of a set of naturally available interactions. General conditions under which universal control is achieved over a set of subspaces/subsystems are found. All known physical examples of universal control on subspaces/systems are related to the framework developed here.Comment: 4 Pages RevTeX, Some typos fixed, references adde

Ground-State Entanglement in Interacting Bosonic Graphs

We consider a collection of bosonic modes corresponding to the vertices of a graph $\Gamma.$ Quantum tunneling can occur only along the edges of $\Gamma$ and a local self-interaction term is present. Quantum entanglement of one vertex with respect the rest of the graph is analyzed in the ground-state of the system as a function of the tunneling amplitude $\tau.$ The topology of $\Gamma$ plays a major role in determining the tunneling amplitude $\tau^*$ which leads to the maximum ground-state entanglement. Whereas in most of the cases one finds the intuitively expected result $\tau^*=\infty$ we show that it there exists a family of graphs for which the optimal value of$\tau$ is pushed down to a finite value. We also show that, for complete graphs, our bi-partite entanglement provides useful insights in the analysis of the cross-over between insulating and superfluid ground statesComment: 5 pages (LaTeX) 5 eps figures include

Quantum tensor product structures are observable-induced

It is argued that the partition of a quantum system into subsystems is dictated by the set of operationally accessible interactions and measurements. The emergence of a multi-partite tensor product structure of the state-space and the associated notion of quantum entanglement are then relative and observable-induced. We develop a general algebraic framework aimed to formalize this concept. We discuss several cases relevant to quantum information processing and decoherence control.Comment: 5 Pages LaTe

Subdecoherent Information Encoding in a Quantum-Dot Array

A potential implementation of quantum-information schemes in semiconductor nanostructures is studied. To this end, the formal theory of quantum encoding for avoiding errors is recalled and the existence of noiseless states for model systems is discussed. Based on this theoretical framework, we analyze the possibility of designing noiseless quantum codes in realistic semiconductor structures. In the specific implementation considered, information is encoded in the lowest energy sector of charge excitations of a linear array of quantum dots. The decoherence channel considered is electron-phonon coupling We show that besides the well-known phonon bottleneck, reducing single-qubit decoherence, suitable many-qubit initial preparation as well as register design may enhance the decoherence time by several orders of magnitude. This behaviour stems from the effective one-dimensional character of the phononic environment in the relevant region of physical parameters.Comment: 12 pages LaTeX, 5 postscript figures. Final version accepted by PR

Refocusing schemes for holonomic quantum computation in presence of dissipation

The effects of dissipation on a holonomic quantum computation scheme are analyzed within the quantum-jump approach. We extend to the non-Abelian case the refocusing strategies formerly introduced for (Abelian) geometric computation. We show how double loop symmetrization schemes allow one to get rid of the unwanted influence of dissipation in the no-jump trajectory.Comment: 4 pages, revtex