arXiv subjects

Christian Koller

Publications and source records attributed to Christian Koller.

11 recordsLinked to original sources

arXiv2022

Casimir-Polder interactions of Rydberg atoms with graphene-based van der Waals heterostructures

We investigate the thermal Casimir-Polder (CP) potential of \textsuperscript{87}Rb atoms in Rydberg $n$S-states near single- and double-layer graphene. The dependence of the CP potential on parameters such as atom-surface distance, temperature, principal quantum number $n$ and graphene Fermi energy are explored. Through large scale numerical simulations, we show that, in the non-retarded regime, the CP potential is dominated by the non-resonant and evanescent-wave terms which are monotonic, and that, in the retarded regime, the CP potential exhibits spatial oscillations. We identify that the most important contributions to the resonant component of the CP potential come from the $n$S-$n$P and $n$S-$(n-1)$P transitions. Scaling of the CP potential as a function of the principal quantum number and temperature is obtained. A heterostructure comprising hexagonal boron nitride layers sandwiched between two graphene layers is also studied. When the boron nitride layer is sufficiently thin, the CP potential can be weakened by changing the Fermi energy of the top graphene layer. Our study provides insights for understanding and controlling CP potentials experienced by Rydberg atoms near single and multi-layer graphene-based van der Waals heterostructures.

quant-ph↗

arXiv2014

Magnetic conveyor belt transport of ultracold atoms to a superconducting atomchip

We report the realization of a robust magnetic transport scheme to bring 3x10^8 ultracold 87Rb atoms into a cryostat. The sequence starts with standard laser cooling and trapping of 87Rb atoms, transporting first horizontally and then vertically through the radiation shields into a cryostat by a series of normal- and superconducting magnetic coils. Loading the atoms in a superconducting microtrap paves the way for studying the interaction of ultracold atoms with superconducting surfaces and quantum devices requiring cryogenic temperatures.

quant-ph↗

arXiv2013

Joint Design of Channel and Network Coding for Star Networks

Channel coding alone is not sufficient to reliably transmit a message of finite length $K$ from a source to one or more destinations as in, e.g., file transfer. To ensure that no data is lost, it must be combined with rateless erasure correcting schemes on a higher layer, such as a time-division multiple access (TDMA) system paired with automatic repeat request (ARQ) or random linear network coding (RLNC). We consider binary channel coding on a binary symmetric channel (BSC) and q-ary RLNC for erasure correction in a star network, where Y sources send messages to each other with the help of a central relay. In this scenario RLNC has been shown to have a throughput advantage over TDMA schemes as K and q tend to infinity. In this paper we focus on finite block lengths and compare the expected throughputs of RLNC and TDMA. For a total message length of K bits, which can be subdivided into blocks of smaller size prior to channel coding, we obtain the channel coding rate and the number of blocks that maximize the expected throughput of both RLNC and TDMA, and we find that TDMA is more throughput-efficient for small message lengths K and small q.

cs.IT↗

arXiv2012

Twin-atom beams

We present highly efficient emission of twin-atom beams into a single transversal mode of a waveguide potential. The source is a one-dimensional degenerate Bose gas in the first radially excited state. We directly measure a suppression of fluctuations in the atom number difference between the beams to 0.37(3) with respect to the classical expectation, equivalent to 0.11(2) after correcting for detection noise. Our results underline the high potential of ultracold atomic gases as sources for quantum matter wave optics and will enable the implementation of schemes previously unattainable with massive particles

cond-mat.quant-gas↗

arXiv2012

Hanbury Brown and Twiss correlations across the Bose-Einstein condensation threshold

Hanbury Brown and Twiss (HBT) correlations, i.e. correlations in far-field intensity fluctuations, yield fundamental information on the quantum statistics of light sources, as highlighted after the discovery of photon bunching. Drawing on the analogy between photons and atoms, similar measurements have been performed for matter-wave sources, probing density fluctuations of expanding ultracold Bose gases. Here we use two-point density correlations to study how coherence is gradually established when crossing the Bose-Einstein condensation (BEC) threshold. Our experiments reveal a persistent multimode character of the emerging matter-wave as seen in the non-trivial spatial shape of the correlation functions for all probed source geometries from nearly isotropic to quasi-one-dimensional (quasi-1D), and for all probed temperatures. The qualitative features of our observations are captured by ideal Bose gas theory, the quantitative differences illustrate the role of particle interactions.

cond-mat.quant-gas↗

arXiv2012

Analysis and Design of Tuned Turbo Codes

It has been widely observed that there exists a fundamental trade-off between the minimum (Hamming) distance properties and the iterative decoding convergence behavior of turbo-like codes. While capacity achieving code ensembles typically are asymptotically bad in the sense that their minimum distance does not grow linearly with block length, and they therefore exhibit an error floor at moderate-to-high signal to noise ratios, asymptotically good codes usually converge further away from channel capacity. In this paper, we introduce the concept of tuned turbo codes, a family of asymptotically good hybrid concatenated code ensembles, where asymptotic minimum distance growth rates, convergence thresholds, and code rates can be traded-off using two tuning parameters, λ and μ. By decreasing λ, the asymptotic minimum distance growth rate is reduced in exchange for improved iterative decoding convergence behavior, while increasing λ raises the asymptotic minimum distance growth rate at the expense of worse convergence behavior, and thus the code performance can be tuned to fit the desired application. By decreasing μ, a similar tuning behavior can be achieved for higher rate code ensembles.

cs.IT↗

arXiv2011

Cavity QED with magnetically coupled collective spin states

We report strong coupling between an ensemble of nitrogen-vacancy center electron spins in diamond and a superconducting microwave coplanar waveguide resonator. The characteristic scaling of the collective coupling strength with the square root of the number of emitters is observed directly. Additionally, we measure hyperfine coupling to 13C nuclear spins, which is a first step towards a nuclear ensemble quantum memory. Using the dispersive shift of the cavity resonance frequency, we measure the relaxation time T1 of the NV center at millikelvin temperatures in a non-destructive way.

cond-mat.mes-hall↗

arXiv2011

Two-point phase correlations of a one-dimensional bosonic Josephson junction

We realize a one-dimensional Josephson junction using quantum degenerate Bose gases in a tunable double well potential on an atom chip. Matter wave interferometry gives direct access to the relative phase field, which reflects the interplay of thermally driven fluctuations and phase locking due to tunneling. The thermal equilibrium state is characterized by probing the full statistical distribution function of the two-point phase correlation. Comparison to a stochastic model allows to measure the coupling strength and temperature and hence a full characterization of the system.

cond-mat.quant-gas↗

arXiv2009

Trapping Set Enumerators for Repeat Multiple Accumulate Code Ensembles

The serial concatenation of a repetition code with two or more accumulators has the advantage of a simple encoder structure. Furthermore, the resulting ensemble is asymptotically good and exhibits minimum distance growing linearly with block length. However, in practice these codes cannot be decoded by a maximum likelihood decoder, and iterative decoding schemes must be employed. For low-density parity-check codes, the notion of trapping sets has been introduced to estimate the performance of these codes under iterative message passing decoding. In this paper, we present a closed form finite length ensemble trapping set enumerator for repeat multiple accumulate codes by creating a trellis representation of trapping sets. We also obtain the asymptotic expressions when the block length tends to infinity and evaluate them numerically.

cs.IT↗

arXiv2009

Stochastic optimization of a cold atom experiment using a genetic algorithm

We employ an evolutionary algorithm to automatically optimize different stages of a cold atom experiment without human intervention. This approach closes the loop between computer based experimental control systems and automatic real time analysis and can be applied to a wide range of experimental situations. The genetic algorithm quickly and reliably converges to the most performing parameter set independent of the starting population. Especially in many-dimensional or connected parameter spaces the automatic optimization outperforms a manual search.

physics.atom-ph↗

arXiv2008

Coding Theorems for Repeat Multiple Accumulate Codes

In this paper the ensemble of codes formed by a serial concatenation of a repetition code with multiple accumulators connected through random interleavers is considered. Based on finite length weight enumerators for these codes, asymptotic expressions for the minimum distance and an arbitrary number of accumulators larger than one are derived using the uniform interleaver approach. In accordance with earlier results in the literature, it is first shown that the minimum distance of repeat-accumulate codes can grow, at best, sublinearly with block length. Then, for repeat-accumulate-accumulate codes and rates of 1/3 or less, it is proved that these codes exhibit asymptotically linear distance growth with block length, where the gap to the Gilbert-Varshamov bound can be made vanishingly small by increasing the number of accumulators beyond two. In order to address larger rates, random puncturing of a low-rate mother code is introduced. It is shown that in this case the resulting ensemble of repeat-accumulate-accumulate codes asymptotically achieves linear distance growth close to the Gilbert-Varshamov bound. This holds even for very high rate codes.

cs.IT↗