arXiv subjects

K. G. H. Vollbrecht

Publications and source records attributed to K. G. H. Vollbrecht.

16 recordsLinked to original sources

arXiv2010

Quantum state engineering, purification, and number resolved photon detection with high finesse optical cavities

We propose and analyze a multi-functional setup consisting of high finesse optical cavities, beam splitters, and phase shifters. The basic scheme projects arbitrary photonic two-mode input states onto the subspace spanned by the product of Fock states |n>|n> with n=0,1,2,.... This protocol does not only provide the possibility to conditionally generate highly entangled photon number states as resource for quantum information protocols but also allows one to test and hence purify this type of quantum states in a communication scenario, which is of great practical importance. The scheme is especially attractive as a generalization to many modes allows for distribution and purification of entanglement in networks. In an alternative working mode, the setup allows of quantum non demolition number resolved photodetection in the optical domain.

quant-ph↗

arXiv2008

Quantum simulations based on measurements and feedback control

We propose a scheme for performing quantum simulations with atoms in cavities based on a photon detection feedback loop that requires only linear optical elements. Atoms can be stored individually without the need of directly interacting with one another. The scheme is able to simulate any time evolution that can be written as a sum of two-qubit Hamiltonians, .e.g., any next neighbor interaction on a lattice. It can also be made robust against photon losses.

quant-ph↗

arXiv2008

One-shot entanglement generation over long distances in noisy quantum networks

We consider the problem of creating a long-distance entangled state between two stations of a network, where neighboring nodes are connected by noisy quantum channels. We show that any two stations can share an entangled pair if the effective probability for the quantum errors is below a certain threshold, which is achieved by using local redundant encoding to preserve the global phase and network-based correction for the bit-flip errors. In contrast to the convensional quantum repeater schemes we are not limited by the memory coherence time, because all quantum operations only use one-way classical communication and can be done in one shot. Meanwhile, the overhead of local resources only increases logarithmically with the size of the network, making our proposal favorable to practical applications of long-distance quantum communication.

quant-ph↗

arXiv2007

Quantum simulators, continuous-time automata, and translationally invariant systems

The general problem of finding the ground state energy of lattice Hamiltonians is known to be very hard, even for a quantum computer. We show here that this is the case even for translationally invariant systems. We also show that a quantum computer can be built in a 1D chain with a fixed, translationally invariant Hamitonian consisting of nearest--neighbor interactions only. The result of the computation is obtained after a prescribed time with high probability.

quant-ph↗

arXiv2006

Delocalized Entanglement of Atoms in optical Lattices

We show how to detect and quantify entanglement of atoms in optical lattices in terms of correlations functions of the momentum distribution. These distributions can be measured directly in the experiments. We introduce two kinds of entanglement measures related to the position and the spin of the atoms.

quant-ph↗

arXiv2006

Cooling toolbox for atoms in optical lattices

We propose and analyze several schemes for cooling bosonic and fermionic atoms in an optical lattice potential close to the ground state of the no-tunnelling regime. Some of the protocols rely on the concept of algorithmic cooling, which combines occupation number filtering with ideas from ensemble quantum computation. We also design algorithms that create an ensemble of defect-free quantum registers. We study the efficiency of our protocols for realistic temperatures and in the presence of a harmonic confinement. We also propose an incoherent physical implementation of filtering which can be operated in a continuous way.

cond-mat.other↗

arXiv2006

Ground state cooling of atoms in optical lattices

We propose two schemes for cooling bosonic and fermionic atoms that are trapped in a deep optical lattice. The first scheme is a quantum algorithm based on particle number filtering and state dependent lattice shifts. The second protocol alternates filtering with a redistribution of particles by means of quantum tunnelling. We provide a complete theoretical analysis of both schemes and characterize the cooling efficiency in terms of the entropy. Our schemes do not require addressing of single lattice sites and use a novel method, which is based on coherent laser control, to perform very fast filtering.

cond-mat.stat-mech↗

arXiv2005

Reversible universal quantum computation within translation invariant systems

We show how to perform reversible universal quantum computation on a translationally invariant pure state, using only global operations based on next-neighbor interactions. We do not need not to break the translational symmetry of the state at any time during the computation. Since the proposed scheme fulfills the locality condition of a quantum cellular automata, we present a reversible quantum cellular automaton capable of universal quantum computation.

quant-ph↗

arXiv2005

Ensemble Quantum Computation with atoms in periodic potentials

We show how to perform universal quantum computation with atoms confined in optical lattices which works both in the presence of defects and without individual addressing. The method is based on using the defects in the lattice, wherever they are, both to ``mark'' different copies on which ensemble quantum computation is carried out and to define pointer atoms which perform the quantum gates. We also show how to overcome the problem of scalability on this system.

quant-ph↗

arXiv2003

On the irreversibility of entanglement distillation

We investigate the irreversibility of entanglement distillation for a symmetric d-1 parameter family of mixed bipartite quantum states acting on Hilbert spaces of arbitrary dimension d x d. We prove that in this family the entanglement cost is generically strictly larger than the distillable entanglement, such that the set of states for which the distillation process is asymptotically reversible is of measure zero. This remains true even if the distillation process is catalytically assisted by pure state entanglement and every operation is allowed, which preserves the positivity of the partial transpose. It is shown, that reversibility occurs only in cases where the state is quasi-pure in the sense that all its pure state entanglement can be revealed by a simple operation on a single copy. The reversible cases are shown to be completely characterized by minimal uncertainty vectors for entropic uncertainty relations.

quant-ph↗

arXiv2002

Efficient distillation beyond qubits

We provide generalizations of known two-qubit entanglement distillation protocols for arbitrary Hilbert space dimensions. The protocols, which are analogues of the hashing and breeding procedures, are adapted to bipartite quantum states which are diagonal in a basis of maximally entangled states. We show that the obtained rates are optimal, and thus equal to the distillable entanglement, for a (d-1) parameter family of rank deficient states. Methods to improve the rates for other states are discussed. In particular, for isotropic states it is shown that the rate can be improved such that it approaches the relative entropy of entanglement in the limit of large dimensions.

quant-ph↗

arXiv2002

Asymptotic Relative Entropy of Entanglement for Orthogonally Invariant States

For a special class of bipartite states we calculate explicitly the asymptotic relative entropy of entanglement $E_R^\infty$ with respect to states having a positive partial transpose (PPT). This quantity is an upper bound to distillable entanglement. The states considered are invariant under rotations of the form $O\otimes O$, where $O$ is any orthogonal matrix. We show that in this case $E_R^\infty$ is equal to another upper bound on distillable entanglement, constructed by Rains. To perform these calculations, we have introduced a number of new results that are interesting in their own right: (i) the Rains bound is convex and continuous; (ii) under some weak assumption, the Rains bound is an upper bound to $E_R^\infty$; (iii) for states for which the relative entropy of entanglement $E_R$ is additive, the Rains bound is equal to $E_R$.

quant-ph↗

arXiv2001

Comment on: Necessary and sufficient condition of separability of any system

In a recent paper (quant-ph/0102133) Chen, Liang, Li and Huang suggest a necessary and sufficient separability criterion, which is supposedly practical in judging the separability of any mixed state. In this note we briefly recapitulate their main result and show that it is a reformulation of the problem rather than a practical criterion.

quant-ph↗

arXiv2001

Entanglement Measures under Symmetry

We show how to simplify the computation of the entanglement of formation and the relative entropy of entanglement for states, which are invariant under a group of local symmetries. For several examples of groups we characterize the state spaces, which are invariant under these groups. For specific examples we calculate the entanglement measures. In particular, we derive an explicit formula for the entanglement of formation for UU-invariant states, and we find a counterexample to the additivity conjecture for the relative entropy of entanglement.

quant-ph↗

arXiv2000

A counterexample to a conjectured entanglement inequality

We give an explicit counterexample to an entanglement inequality suggested in a recent paper [quant-ph/0005126] by Benatti and Narnhofer. The inequality would have had far-reaching consequences, including the additivity of the entanglement of formation.

quant-ph↗

arXiv1999

Why Two Qubits Are Special

We analyze some special properties of a system of two qubits, and in particular of the so-called Bell basis for this system, which have played an important role in recent papers on entanglement of qubits. In particular, we show which of these properties may be generalized to higher dimension. We give a general construction for bases of maximally entangled vectors in any dimension, but show that none of the properties related to complex conjugation in Bell basis can be realized for higher dimensional analogs.

quant-ph↗