Search arXivSearch

arXiv · 1107.3983

The long-term cyclotron dynamics of relativistic wave packets: spontaneous collapse and revival

Abstract

In this work we study the effects of collapse and revival as well as {\it Zitterbewegung} (ZB) phenomenon, for the relativistic electron wave packets, which are a superposition of the states with quantum numbers sharply peaked around some level $n_0$ of the order of few tens. The probability densities as well as average velocities of the packet center and the average spin components were calculated analytically and visualized. Our computations demonstrate that due to dephasing of the states for times larger than the cyclotron period the initial wave packet (which includes the states with the positive energy only) loses the spatial localization so that the evolution can no longer be described classically. However, at the half-revival time $t=T_R/2$ its reshaping takes place firstly. The behavior of the wave packet containing the states of both energy bands (with $E_n>0$ and $E_n<0$) is more complicated. At short times of a few classical periods such packet splits into two parts which rotate with cyclotron frequency in the opposite directions and meet each other every one-half of the cyclotron period. At these moments their wave functions have significant overlap that leads to ZB. At the time of fractional revival each of two sub-packets is decomposed into few packets-fractions. However, at $t=T_R$ each of the two sub-packets (with positive or negative energy) restores at various points of the cyclotron orbit, that makes it impossible reshaping of initial wave packet entirely unlike the wave packet which consists of states with energies $E_n>0$ only. Obtained results can be useful for the description of electromagnetic radiation and absorption in relativistic plasma on astrophysics objects, where super high magnetic field has the value of the order $10^8-10^9$T, as well as for interpretation of experiments with trapped ions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

V. Ya. Demikhovskii, G. M. Maksimova, A. A. Perov, A. V. Telezhnikov. 2011-11-23. The long-term cyclotron dynamics of relativistic wave packets: spontaneous collapse and revival. https://doi.org/10.1103/physreva.85.022105

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

KEEP EXPLORING

Related papers

Fermionic magic resources in disordered quantum spin chains

Fermionic non-Gaussianity quantifies a quantum state's deviation from a classically tractable free-fermionic description, constituting a necessary resource for computational quantum advantage. Here we use fermionic antiflatness (FAF) to measure this deviation across ergodic and many-body localized (MBL) regimes. We focus on the paradigmatic disordered spin-$1\!/2$ XXZ chain and its impurity variant with local interactions. Across highly excited eigenstates, FAF evolves from typical-state behavior at weak disorder to strongly suppressed values deep in the MBL regime, with volume-law scaling in the XXZ chain and an area-law bound in the impurity setting. Rare long-range cat-like eigenstates exhibit a pronounced enhancement of FAF, making it a sensitive diagnostic of mechanisms proposed to destabilize MBL. Starting from product states, we find that in the MBL regime FAF grows slowly in time, approaching saturation via a power-law relaxation. Overall, our results show that MBL suppresses fermionic non-Gaussianity, and the associated complexity beyond free fermions, while ergodicity restores it, motivating explorations of fermionic non-Gaussianity in other ergodicity-breaking phenomena.

quant-ph

Progressive Binarization - Pauli Correlation Encoding: a Continuation Method for Constrained Optimization

Pauli Correlation Encoding (PCE) reduces the qubit requirements of quantum optimization by embedding the problem variables into the expectation values of Pauli observables, so that the number of qubits can be much smaller than the number of variables. PCE has not yet been studied for constrained optimization. We extend it to constrained combinatorial problems, using the budget-constrained MinCut as a case study, and show that the standard formulation fails to reliably enforce the constraint: feasibility hinges on the binarization of the encoded variables, which depends sensitively on hyperparameters that are hard to tune and do not transfer across instances. To address this, we introduce Progressive-Binarization PCE (PB-PCE), an adaptive continuation scheme that progressively increases the binarization parameter while re-optimizing the circuit from the previous solution, driving the variables towards the binary domain. PB-PCE attains near-complete constraint satisfaction (88--100\%) and smaller cut sizes than standard PCE, with a number of stages (10--20) essentially independent of problem size, solving instances of up to 300 variables with only 9-qubit circuits.

quant-ph

A quantum model for synchronizing finite state transition systems

We propose a quantum model for finding a resetting input sequence (RS) which can take a finite state transition system (FA), to particular state independent of its current state. The complexity of finding such sequences for various types of FA can be NP-Hard or even PSPACE-Complete. To this end, we represent the FA states, inputs, and transition function in quantum space. Accordingly, we propose a model to represent the execution of an input sequence of a particular length $l$ starting form an initial FA state. The model is extended considering the application in superposition of all input sequences of length $l$ to an initial state of the FA. The model is further extended considering the application of all input sequences to all initial states of the FA capturing for every input sequence the collection (ordered list) of states reached by applying the sequence to all states of the FA. The amplitude amplification algorithm is then used as it combines similar collections of reached states while preserving all input sequences that reach these collections. A Grover search for a reached collection where its elements correspond to the same FA state provides a RS for the FA. Our approach offers a quadratic gain over the exponential complexity of traditional brute-force method, which is the only method that can be applied to a general FA class.

quant-ph