Search arXivSearch

arXiv · 1306.3377

Suppression of quantum-mechanical reflection by environmental decoherence

Abstract

In quantum mechanics an incoming particle wave packet with sufficient energy will undergo both transmission and reflection when encountering a barrier of lower energy, but in classical mechanics there is no reflection, only transmission. In this paper we seek to explain the disappearance of quantum-mechanical reflection in the quasi-classical limit, using standard methods of decoherence through environmental interaction. We consider two models. In the first, the incoming particle is classicalized by coupling it to an environment described by a standard Lindblad master equation diagonalizing in position. We find, however, that suppression of reflection is achieved only for environmental interaction so strong that large fluctuations in momentum are generated which blurs the distinction between incoming and reflected wave packets. This negative conclusion also holds for a complex potential which has similar implications for attempts to understand the suppression of the Zeno effect using the same mechanism (discussed in more detail in another paper). A different Lindblad master diagonalizing in momentum is shown to be successful in suppressing reflection without large fluctuations but such a master equation is unphysical. We consider a second model in which the barrier is modelled quantum-mechanically by a massive target particle coupled to an environment to maintain it in a quasi-classical state. This avoids the fluctuations problem since the incoming particle is not coupled to the environment directly. We find that reflection is significantly suppressed as long as the decoherence timescale of the target particle is much smaller than certain characteristic scattering timescales of the incoming particle, or equivalently, as long as the velocity fluctuations in the target are larger than the velocity of the incoming particle.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

D. J. Bedingham, J. J. Halliwell. 2013-08-14. Suppression of quantum-mechanical reflection by environmental decoherence. https://doi.org/10.1103/physreva.88.022128

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