Search arXivSearch

arXiv · quant-ph/0607048

Nonlinear coherent dynamics of an atom in an optical lattice

Abstract

We consider a simple model of lossless interaction between a two-level single atom and a standing-wave single-mode laser field which creates a one-dimensional optical lattice. Internal dynamics of the atom is governed by the laser field which is treated to be classical with a large number of photons. Center-of-mass classical atomic motion is governed by the optical potential and the internal atomic degree of freedom. The resulting Hamilton-Schr\"odinger equations of motion are a five-dimensional nonlinear dynamical system with two integrals of motion. The main focus of the paper is chaotic atomic motion that may be quantified strictly by positive values of the maximal Lyapunov exponent. It is shown that atom, depending on the value of its total energy, can either oscillate chaotically in a well of the optical potential or fly ballistically with weak chaotic oscillations of its momentum or wander in the optical lattice changing the direction of motion in a chaotic way. In the regime of chaotic wandering atomic motion is shown to have fractal properties. We find a useful tool to visualize complicated atomic motion -- Poincar\'e mapping of atomic trajectories in an effective three-dimensional phase space onto planes of atomic internal variables and momentum. We find common features with typical non-hyperbolic Hamiltonian systems -- chains of resonant islands of different sizes embedded in a stochastic sea, stochastic layers, bifurcations, and so on. The phenomenon of sticking of atomic trajectories to boundaries of regular islands, that should have a great influence to atomic transport in optical lattices, is found and demonstrated numerically.

Explore related subjects

Keep this discovery

BibTeXRIS

V. Yu. Argonov, S. V. Prants. 2006-07-06. Nonlinear coherent dynamics of an atom in an optical lattice. https://arxiv.org/abs/quant-ph/0607048

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph