415 citations
- Universitat Autònoma de BarcelonaES11 papers
- Institute for Solid State Physics and OpticsHU7 papers
- Max Planck Institute for InformaticsDE7 papers
- Częstochowa University of TechnologyPL5 papers
- Universität HamburgDE5 papers
- Universität UlmDE5 papers
- University of StuttgartDE5 papers
- Karlsruhe Institute of TechnologyDE4 papers
- Max Planck SocietyDE4 papers
- University of KaiserslauternDE4 papers
- University of SzegedHU4 papers
- Centre National de la Recherche ScientifiqueFR3 papers
29 papers · 1 filter
Quantum structural phase transition in chains of interacting atoms
Efrat Shimshoni, Giovanna Morigi, Shmuel Fishman
A quasi one--dimensional system of trapped, repulsively interacting atoms (e.g., an ion chain) exhibits a structural phase transition from a linear chain to a zigzag structure, tun…
Fast and robust quantum computation with ionic Wigner crystals
J. D. Baltrusch, A. Negretti, J. M. Taylor +1
We present a detailed analysis of the modulated-carrier quantum phase gate implemented with Wigner crystals of ions confined in Penning traps. We elaborate on a recent scheme, prop…
Quantum relaxation after a quench in systems with boundaries
Ferenc Iglói, Heiko Rieger
We study the time-dependence of the magnetization profile, m_l(t), of a large finite open quantum Ising chain after a quench. We observe a cyclic variation, in which starting with…
Quantum-noise quenching in atomic tweezers
Stefano Zippilli, Bernd Mohring, Eric Lutz +2
The efficiency of extracting single atoms or molecules from an ultracold bosonic reservoir is theoretically investigated for a protocol based on lasers, coupling the hyperfine stat…
Approximating a geometric fractional Brownian motion and related processes via discrete Wick calculus
Christian Bender, Peter Parczewski
We approximate the solution of some linear systems of SDEs driven by a fractional Brownian motion with Hurst parameter in the Wick--Itô sense, including…
Faster Polynomial Multiplication via Discrete Fourier Transforms
Alexey Pospelov
We study the complexity of polynomial multiplication over arbitrary fields. We present a unified approach that generalizes all known asymptotically fastest algorithms for this prob…