A quantum mechanical transition path time probability distribution is formulated and its properties are studied using a parabolic barrier potential model. The average transit time is well defined and readily calculated. It is smaller than the analogous classical mechanical average transit time, vanishing at the crossover temperature. It provides a direct route for determining tunneling times. The average time may be also used to define a coarse grained momentum of the system for the passage from one side of the barrier to the other. The product of the uncertainty in this coarse grained momentum with the uncertainty in the location of the particle is shown under certain conditions to be smaller than the $\hslash /2$ formal uncertainty limit. The model is generalized to include friction in the form of a bilinear interaction with a harmonic bath. Using an Ohmic friction model one finds that increasing the friction, increases the transition time. Only moderate values of the reduced friction coefficient are needed for the quantum transition time and coarse grained uncertainty to approach the classical limit which is smaller than $\hslash /2$ when the friction is not too small. These results show how one obtains classical dynamics from a pure quantum system without invoking any further assumptions, approximations, or postulates.

Every imaging system has a resolution limit, typically defined by Rayleigh’s criterion. Given a fixed number of photons, the amount of information one can gain from an image about the separation between two sources falls to zero as the separation drops below this limit, an effect dubbed “Rayleigh’s curse.” Recently, in a quantum-information–inspired proposal, Tsang and co-workers found that there is, in principle, infinitely more information present in the full electromagnetic field in the image plane than in the intensity alone, and suggested methods for extracting this information and beating the Rayleigh limit. In this Letter, we experimentally demonstrate a simple scheme that captures most of this information, and show that it has a greatly improved ability to estimate the distance between a pair of closely separated sources, achieving near-quantum-limited performance and immunity to Rayleigh’s curse.

Weak value amplification (WVA) is a technique by which one can magnify the apparent strength of a measurement signal. Some have claimed that WVA can outperform more conventional measurement schemes in parameter estimation. Nonetheless, a significant body of theoretical work has challenged this perspective, suggesting WVA to be fundamentally suboptimal. Optimal measurements may not be practical, however. Two practical considerations that have been conjectured to afford a benefit to WVA over conventional measurement are certain types of noise and detector saturation. Here, we report a theoretical study of the role of saturation and pixel noise in WVA-based measurement, in which we carry out a Bayesian analysis of the Fisher information available using a saturable, pixelated, digitized, and/or noisy detector. We draw two conclusions: first, that saturation alone does not confer an advantage to the WVA approach over conventional measurement, and second, that WVA can outperform conventional measurement when saturation is combined with intrinsic pixel noise and/or digitization.

We experimentally study tunneling of Bose-condensed ${}^{87}\mathrm{Rb}$ atoms prepared in a quasibound state and observe a nonexponential decay caused by interatomic interactions. A combination of a magnetic quadrupole trap and a thin $1.3\mu \mathrm{m}$ barrier created using a blue-detuned sheet of light is used to tailor traps with controllable depth and tunneling rate. The escape dynamics strongly depend on the mean-field energy, which gives rise to three distinct regimes—classical spilling over the barrier, quantum tunneling, and decay dominated by background losses. We show that the tunneling rate depends exponentially on the chemical potential. Our results show good agreement with numerical solutions of the 3D Gross-Pitaevskii equation.

The leading paradigm for performing a computation on quantum memories can be encapsulated as distill-then-synthesize. Initially, one performs several rounds of distillation to create high-fidelity magic states that provide one good $T$ gate, an essential quantum logic gate. Subsequently, gate synthesis intersperses many $T$ gates with Clifford gates to realize a desired circuit. We introduce a unified framework that implements one round of distillation and multiquibit gate synthesis in a single step. Typically, our method uses the same number of $T$ gates as conventional synthesis but with the added benefit of quadratic error suppression. Because of this, one less round of magic state distillation needs to be performed, leading to significant resource savings.

According to Landauer’s principle, erasing one bit of information incurs a minimum energy cost. Recently, Vaccaro and Barnett (VB) explored information erasure within the context of generalized Gibbs ensembles and demonstrated that for energy-degenerate spin reservoirs the cost of erasure can be solely in terms of a minimum amount of spin angular momentum and no energy. As opposed to the Landauer case, the cost of erasure in this case is associated with an intrinsically discrete degree of freedom. Here we study the discrete fluctuations in this cost and the probability of violation of the VB bound. We also obtain a Jarzynski-like equality for the VB erasure protocol. We find that the fluctuations below the VB bound are exponentially suppressed at a far greater rate and more tightly than for an equivalent Jarzynski expression for VB erasure. We expose a trade-off between the size of the fluctuations and the cost of erasure. We find that the discrete nature of the fluctuations is pronounced in the regime where reservoir spins are maximally polarized. We also state the first laws of thermodynamics corresponding to the conservation of spin angular momentum for this particular erasure protocol. Our work will be important for novel heat engines based on information erasure schemes that do not incur an energy cost.

Resource theory is a widely applicable framework for analyzing the physical resources required for given tasks, such as computation, communication, and energy extraction. In this Letter, we propose a general scheme for analyzing resource theories based on resource destroying maps, which leave resource-free states unchanged but erase the resource stored in all other states. We introduce a group of general conditions that determine whether a quantum operation exhibits typical resource-free properties in relation to a given resource destroying map. Our theory reveals fundamental connections among basic elements of resource theories, in particular, free states, free operations, and resource measures. In particular, we define a class of simple resource measures that can be calculated without optimization, and that are monotone nonincreasing under operations that commute with the resource destroying map. We apply our theory to the resources of coherence and quantum correlations (e.g., discord), two prominent features of nonclassicality.

Secure random numbers are a fundamental element of many applications in science, statistics, cryptography and more in general in security protocols. We present a method that enables the generation of high-speed unpredictable random numbers from the quadratures of an electromagnetic field without any assumption on the input state. The method allows us to eliminate the numbers that can be predicted due to the presence of classical and quantum side information. In particular, we introduce a procedure to estimate a bound on the conditional min-entropy based on the entropic uncertainty principle for position and momentum observables of infinite dimensional quantum systems. By the above method, we experimentally demonstrated the generation of secure true random bits at a rate greater than $1.7\mathrm{Gbit}/\mathrm{s}$.

The inclusion of the factor $\ln (1/N!)$ in the thermodynamic entropy proposed by Gibbs is shown to be equivalent to the validity of the fluctuation theorem with absolute irreversibility for gas mixing.

The nonequilibrium short-time critical behaviors of driven and undriven lattice gases are investigated via Monte Carlo simulations in two spatial dimensions starting from a fully disordered initial configuration. In particular, we study the time evolution of suitably defined order parameters, which account for the strong anisotropy introduced by the homogeneous drive. We demonstrate that, at short times, the dynamics of all these models is unexpectedly described by an effective continuum theory in which transverse fluctuations, i.e., fluctuations averaged along the drive, are Gaussian, irrespective of this being actually the case in the stationary state. Strong numerical evidence is provided, in remarkable agreement with that theory, both for the driven and undriven lattice gases, which therefore turn out to display the same short-time dynamics.

We show that placing a quantum system in contact with an environment can enhance non-Fermi-liquid correlations, rather than destroy quantum effects, as is typical. The system consists of two quantum dots in series with two leads; the highly resistive leads couple charge flow through the dots to the electromagnetic environment, the source of quantum noise. While the charge transport inhibits a quantum phase transition, the quantum noise reduces charge transport and restores the transition. We find a non-Fermi-liquid intermediate fixed point for all strengths of the noise. For strong noise, it is similar to the intermediate fixed point of the two-impurity Kondo model.

We investigate the dynamics of Gaussian states of continuous variable systems under Gaussianity-preserving channels. We introduce a hierarchy of such evolutions encompassing Markovian and weakly and strongly non-Markovian processes and provide simple criteria to distinguish between the classes, based on the degree of positivity of intermediate Gaussian maps. We present an intuitive classification of all one-mode Gaussian channels according to their non-Markovianity degree and show that weak non-Markovianity has an operational significance, as it leads to a temporary phase-insensitive amplification of Gaussian inputs beyond the fundamental quantum limit. Explicit examples and applications are discussed.

Information theory quantifies the optimal rates of resource interconversions, usually in terms of entropies. However, nonadditivity often makes evaluating entropic formulas intractable. In a few auspicious cases, additivity allows a full characterization of optimal rates. We study uniform additivity of formulas, which is easily evaluated and captures all known additive quantum formulas. Our complete characterization of uniform additivity exposes an intriguing new additive quantity and identifies a remarkable coincidence—the classical and quantum uniformly additive functions with one auxiliary variable are identical.

We introduce an intermediate quantum computing model built from translation-invariant Ising-interacting spins. Despite being nonuniversal, the model cannot be classically efficiently simulated unless the polynomial hierarchy collapses. Equipped with the intrinsic single-instance-hardness property, a single fixed unitary evolution in our model is sufficient to produce classically intractable results, compared to several other models that rely on implementation of an ensemble of different unitaries (instances). We propose a feasible experimental scheme to implement our Hamiltonian model using cold atoms trapped in a square optical lattice. We formulate a procedure to certify the correct functioning of this quantum machine. The certification requires only a polynomial number of local measurements assuming measurement imperfections are sufficiently small.

We consider generic pure $n$-qubit states and a general class of pure states of arbitrary dimensions and arbitrarily many subsystems. We characterize those states which can be reached from some other state via local operations assisted by finitely many rounds of classical communication (${\mathrm{LOCC}}_{\mathbb{N}}$). For $n$ qubits with $n>3$, we show that this set of states is of measure zero, which implies that the maximally entangled set is generically of full measure if restricted to the practical scenario of ${\mathrm{LOCC}}_{\mathbb{N}}$. Moreover, we identify a class of states for which any ${\mathrm{LOCC}}_{\mathbb{N}}$ protocol can be realized via a concatenation of deterministic steps. We show, however, that in general there exist state transformations which require a probabilistic step within the protocol, which highlights the difference between bipartite and multipartite LOCC.