Related papers: Random Quantum Batteries
Drawing independent samples from high-dimensional probability distributions represents the major computational bottleneck for modern algorithms, including powerful machine learning frameworks such as deep learning. The quest for discovering…
The charging of a quantum battery by a four-stroke quantum machine that works either as an engine or a refrigerator is investigated. The presented analysis provides the energetic behavior of the combined system in terms of the heat and…
Quantum computing has quickly emerged as a revolutionary paradigm that holds the potential for greatly enhanced computational capability and algorithmic efficiency, in a wide range of areas. Among the various hardware platforms, neutral…
The non-equilibrium dynamics of quantum many-body systems is one of the most fascinating problems in physics. Open questions range from how they relax to equilibrium to how to extract useful work from them. A critical point lies in…
Random numbers are a valuable commodity in gaming and gambling, simulation, conventional and quantum cryptography, and in non-conventional computing schemes such as stochastic computing. We propose to generate a random bit using a position…
We propose a gradient-based general computational framework for optimizing model-dependent parameters in quantum batteries (QB). We apply this method to two different charging scenarios in the micromaser QB and we discover a charging…
We study the physics of quantum phase transitions from the perspective of non-equilibrium thermodynamics. For first order quantum phase transitions, we find that the average work done per quench in crossing the critical point is…
Motivated by the recent interest in thermodynamics of micro- and mesoscopic quantum systems we study the maximal amount of work that can be reversibly extracted from a quantum system used to store temporarily energy. Guided by the notion of…
In this work we initiate the question of whether quantum devices can provide us with an almost perfect source of classical randomness, and more generally, suffice for classical cryptographic tasks, such as encryption. Indeed, it is well…
Fluctuation Theorems are central in stochastic thermodynamics, as they allow for quantifying the irreversibility of single trajectories. Although they have been experimentally checked in the classical regime, a practical demonstration in…
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…
Quantum computers are hypothetical devices, based on quantum physics, that would enable us to perform certain computations hundreds of orders of magnitude faster than digital computers. This feature is coined as "quantum supremacy" and one…
Quantum coherence is a fundamental resource that quantum technologies exploit to achieve performance beyond that of classical devices. A necessary prerequisite to achieve this advantage is the ability of measurement devices to detect…
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum…
We study the full distribution of quantum work in generic, noninteracting, disordered fermionic nanosystems at finite temperature. We derive an analytical determinant formula for the characteristic function of work statistics for quantum…
The challenge of storing energy efficiently and sustainably is highly prominent within modern scientific investigations. Due to the ongoing trend of miniaturization, the design of expressly quantum storage devices is itself a crucial task…
Quantum computing, with its potential to enhance various machine learning tasks, allows significant advancements in kernel calculation and model precision. Utilizing the one-class Support Vector Machine alongside a quantum kernel, known for…
We study the problem of charging a quantum battery in finite time. We demonstrate an analytical optimal protocol for the case of a single qubit. Extending this analysis to an array of N qubits, we demonstrate that an N-fold advantage in…
We propose quantum engines powered entirely by the quantum measurement process. Our theoretical construction of the engine requires no work from the system Hamiltonian, and takes energy only from the process of observation to move a…
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…