Related papers: Optimisation based algorithm for finding the actio…
We propose a scheme for quantum computation in optical lattices. The qubits are encoded in the spacial wavefunction of the atoms such that spin decoherence does not influence the computation. Quantum operations are steered by shaking the…
Starting from the recently proposed energy-based deviational formulation for solving the Boltzmann equation [J.-P. Peraud and N. G. Hadjiconstantinou, Phys. Rev. B 84, 2011], which provides significant computational speedup compared to…
The standard vacuum bounce formalism suffers from inconsistencies when applied to thermal bubble nucleation, for which ad hoc workarounds are commonly adopted. Identifying the length scales on which nucleation takes place, we demonstrate…
We introduce the "wedge diagram," an intuitive way to illustrate how cosmological models with a classical (non-singular) bounce generically resolve fundamental problems in cosmology. These include the well-known horizon, flatness, and…
Reinforcement learning algorithms commonly seek to optimize policies for solving one particular task. How should we explore an unknown dynamical system such that the estimated model globally approximates the dynamics and allows us to solve…
One approach to the development of quantum search algorithms is the quantum walk. A spatial search can be effected by the continuous-time evolution of a single quantum particle on a graph containing a marked site. In many physical…
In this work we study quantum algorithms for Hopcroft's problem which is a fundamental problem in computational geometry. Given $n$ points and $n$ lines in the plane, the task is to determine whether there is a point-line incidence. The…
An algorithm for planning near time-optimal trajectories for systems with an oscillatory internal dynamics has been developed in previous work. It is based on assembling a complete trajectory from motion primitives called jerk segments,…
We propose and analyze several schemes for cooling bosonic and fermionic atoms in an optical lattice potential close to the ground state of the no-tunnelling regime. Some of the protocols rely on the concept of algorithmic cooling, which…
The computational efficiency of stochastic simulation algorithms is notoriously limited by the kinetic trapping of the simulated trajectories within low energy basins. Here we present a new method that overcomes kinetic trapping while still…
Cooling down a trapped ion into its motional ground state is a central step for trapped ions based quantum information processing. State of the art cooling schemes often work under a set of optimal cooling conditions derived analytically…
Here, we propose a platform based on ultra-cold fermionic molecules trapped in optical lattices to simulate nonadiabatic effects, as they appear in certain molecular dynamical problems. The idea consists of a judicious choice of two…
The nonlinear gyrokinetic equations describe plasma turbulence in laboratory and astrophysical plasmas. To solve these equations, massively parallel codes have been developed and run on present-day supercomputers. This paper describes…
We use an optimal control protocol to cool one mode of the center of mass motion of an optically levitated nanoparticle. The feedback technique relies on exerting a Coulomb force on a charged particle with a pair of electrodes and follows…
As an alternative to the paradigm of slow roll inflation, we propose an extended scenario of the matter bounce cosmology in which the Universe has experienced a quasi-matter contracting phase with a variable background equation of state…
In this article we formulate frictionless atom cooling in harmonic traps as a time-optimal control problem, permitting imaginary values of the trap frequency for trasient time intervals during which the trap becomes an expulsive parabolic…
The effectiveness of the variational approach a la Feynman is proved in the spin-boson model, i.e. the simplest realization of the Caldeira-Leggett model able to reveal the quantum phase transition from delocalized to localized states and…
We introduce a practical method for incorporating equality and inequality constraints in global optimization methods based on stochastic interacting particle systems, specifically consensus-based optimization (CBO) and ensemble Kalman…
We present a family of algorithms for the fast determination of reaction paths and barriers in phase space and the computation of the corresponding rates. The method requires the reaction times be large compared to the microscopic time,…
Quantum-phase-estimation algorithms are critical subroutines in many applications for quantum computers and in quantum-metrology protocols. These algorithms estimate the unknown strength of a unitary evolution. By using coherence or…