Related papers: Finite-time erasing of information stored in fermi…
Masking of data is a method to protect information by shielding it from a third party, however keeping it usable for further usages like application development, building program extensions to name a few. Whereas it is possible for…
Dephasing of one-particle states in closed quantum dots is analyzed within the framework of random matrix theory and Master equation. Combination of this analysis with recent experiments on the magnetoconductance allows for the first time…
Quantum mechanics imposes a fundamental tradeoff between the accuracy of time measurements and the size of the systems used as clocks. When the measurements of different time intervals are combined, the errors due to the finite clock size…
We present our recent studies on thermal field theories using quantum algorithms. We first delve into the representation of quantum fields via qubits on general digital quantum computers alongside the quantum algorithms employed to evaluate…
Simulating the dynamics of electrons and other fermionic particles in quantum chemistry, materials science, and high-energy physics is one of the most promising applications of fault-tolerant quantum computers. However, the overhead in…
Quantum computers are expected to become a powerful tool for studying physical quantum systems. Consequently, a number of quantum algorithms for studying the physical properties of such systems have been developed. While qubit-based quantum…
We propose a quantum absorption refrigerator using the quantum physics of resonant tunneling through quantum dots. The cold and hot reservoirs are fermionic leads, tunnel coupled via quantum dots to a central fermionic cavity, and we…
Recently, much emphasis has been given to genuinely quantum reservoirs generically called fermionic reservoirs. These reservoirs are characterized by having finite levels, as opposed to bosonic reservoirs, which have infinite levels that…
Nuclear spins in quantum dots are promising candidates for fast and scalable quantum memory. By utilizing the hyperfine interaction between the central electron and its surrounding nuclei, quantum information can be transferred to the…
We derive a tight bound between the quality of estimating a quantum state by measurement and the success probability of undoing the measurement in arbitrary dimensional systems, which completely describes the tradeoff relation between the…
Magnetic data storage is pervasive in the preservation of digital information and the rapid pace of computer development requires ever more capacity. Increasing the storage density for magnetic hard disk drives requires a reduced bit size,…
We establish uncertainty relations between information loss in general open quantum systems and the amount of non-ergodicity of the corresponding dynamics. The relations hold for arbitrary quantum systems interacting with an arbitrary…
An estimate of the maximal informational content available to advanced extraterrestrial or future (post)human civilizations is presented. It is shown that the fundamental thermodynamical considerations may lead to a quantitative estimate of…
If the states of spins in solids can be created, manipulated, and measured at the single-quantum level, an entirely new form of information processing, quantum computing, will be possible. We first give an overview of quantum information…
We investigate fractional quantum Hall effect at finite temperature using a fermion Chern-Simons field theoretical approach. In the absence of impurity scattering, the essential aspects of fractional quantum Hall effect, such as the…
In the large fermion mass limit of QCD at finite density the structure of the partition function greatly simplifies and can be studied analytically. We show that, contrary to general wisdom, the phase of the Dirac determinant is relevant…
We obtain an upper bound on the time available for quantum computation for a given quantum computer and decohering environment with quantum error correction implemented. First, we derive an explicit quantum evolution operator for the…
Many quantum algorithms demand a large number of repetitions to obtain reliable statistical results. Thus, at each repetition it is necessary to reset the qubits efficiently and precisely in the shortest possible time, so that quantum…
This thesis addresses whether it is possible to build a robust memory device for quantum information. A three-dimensional gapped lattice spin model is found which demonstrates for the first time that a reliable quantum memory at finite…
Landauer's erasure principle puts a fundamental constraint on the amount of work required to erase information using thermal reservoirs. Recently this bound was improved to include corrections for finite-sized thermal reservoirs. In…