Related papers: Quantum battery supercharging via counter-diabatic…
We consider a classical and superadiabatic version of an iterative quantum adiabatic algorithm to solve combinatorial optimization problems. This algorithm is deterministic because it is based on purely classical dynamics, that is, it does…
A method is presented to transfer a system of two-level atoms from a spin coherent state to a maximally spin squeezed Dicke state, relevant for quantum metrology and quantum information processing. The initial state is the ground state of…
Utilizing counterdiabatic (CD) driving - aiming at suppression of diabatic transition - in digitized adiabatic evolution have garnered immense interest in quantum protocols and algorithms. However, improving the approximate CD terms with a…
We consider the dissipative charging process of quantum batteries in terms of a collisional model, where the batteries are coupled to a heat bath using non-energy preserving interactions. First, we show that for low temperatures the…
We present an analysis of the availability and maximum extractable work of quantum batteries in the presence of charge and/or heat steady-state currents. Quantum batteries are modelled as non-interacting open quantum systems (mesoscopic…
We consider a classical harmonic driving field as the energy charger for the quantum batteries, which consist of an ensemble of two-level atoms. The maximum stored energy and the final state are derived analytically with the optimal driving…
Perturbation theory with respect to the kinetic energy of the heavy component of a two-component quantum system is introduced. An effective Hamiltonian that is accurate to second order in the inverse heavy mass is derived. It contains a new…
Within quantum thermodynamics, many tasks are modelled by processes that require work sources represented by out-of-equilibrium quantum systems, often dubbed quantum batteries, in which work can be deposited or from which work can be…
An adiabatic quantum algorithm is essentially given by three elements: An initial Hamiltonian with known ground state, a problem Hamiltonian whose ground state corresponds to the solution of the given problem and an evolution schedule such…
We consider a quantum battery modeled as a set of N independent two-level quantum systems driven by a time dependent classical source. Different figures of merit, such as stored energy, time of charging and energy quantum fluctuations…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…
Quantum simulation has begun to penetrate the field of quantum chemistry in hopes of efficiently calculating ground state energies and approximating real-time evolution. With modern research highlighting nonadiabatic dynamics, tunably…
We study the adiabatic approximation of the dynamics of a bipartite quantum system with respect to one of the components, when the coupling between its two components is perturbative. We show that the density matrix of the considered…
The problem Hamiltonian of the adiabatic quantum algorithm for the maximum-weight independent set problem (MIS) that is based on the reduction to the Ising problem (as described in [Choi08]) has flexible parameters. We show that by choosing…
Recently, there has been an upsurge of interest in quantum thermodynamic devices, notably quantum batteries. Quantum batteries serve as energy storage devices governed by the rules of quantum thermodynamics. Here, we propose a model of a…
We provide rigorous bounds for the error of the adiabatic approximation of quantum mechanics under four sources of experimental error: perturbations in the initial condition, systematic time-dependent perturbations in the Hamiltonian,…
Machine learning offers a promising methodology to tackle complex challenges in quantum physics. In the realm of quantum batteries (QBs), model construction and performance optimization are central tasks. Here, we propose a…
We introduce a quantum charging distance as the minimal time that it takes to reach one state (charged state) from another state (depleted state) via a unitary evolution, assuming limits on the resources invested into the driving…
In his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator…
The preparation of a given quantum state on a quantum computing register is a typically demanding operation, requiring a number of elementary gates that scales exponentially with the size of the problem. Using the adiabatic theorem for…