Related papers: Non-Markovian Momentum Computing: Universal and Ef…
Digital computers implement computations using circuits, as do many naturally occurring systems (e.g., gene regulatory networks). The topology of any such circuit restricts which variables may be physically coupled during the operation of a…
By analyzing the key properties of black holes from the point of view of quantum information, we derive a model-independent picture of black hole quantum computing. It has been noticed that this picture exhibits striking similarities with…
We introduce a numerical method to sample the distributions of charge, heat, and entropy production in open quantum systems coupled strongly to macroscopic reservoirs, with both temporal and energy resolution and beyond the linear-response…
The dynamical behavior of open quantum systems plays a key role in many applications of quantum mechanics, examples ranging from fundamental problems, such as the environment-induced decay of quantum coherence and relaxation in many-body…
If the 20th century was known for the computational revolution, what will the 21st be known for? Perhaps the recent strides in the nascent fields of molecular programming and biological computation will help bring about the 'Coming Era of…
The erasure of information is fundamentally an irreversible logical operation, carrying profound consequences for the energetics of computation and information processing. We investigate the thermodynamic costs associated with erasing (and…
We derive geometrical bounds on the irreversibility in both quantum and classical Markovian open systems that satisfy the detailed balance condition. Using information geometry, we prove that irreversible entropy production is bounded from…
Probabilistic computers replace logic gates with networks of interacting random variables, creating bidirectional systems that can back-derive inputs from outputs. Such architectures enable efficient generation of random samples,…
Determining the Markovianity and non-Markovianity of a quantum process is a critical problem in the theory of open quantum systems, as their behaviors differ significantly in terms of complexity. It is well recognized that a quantum process…
Accurate information processing is crucial both in technology and in nature. To achieve it, any information processing system needs an initial supply of resources away from thermal equilibrium. Here we establish a fundamental limit on the…
Thermodynamics is a macroscopic physical theory whose two very general laws are independent of any underlying dynamical laws and structures. Nevertheless, its generality enables us to understand a broad spectrum of phenomena in physics,…
Quantum resource theory formulations of thermodynamics offer a versatile tool for the study of fundamental limitations to the efficiency of physical processes, independently of the microscopic details governing their dynamics. Despite the…
We introduce a thermodynamically consistent, minimal stochastic model for complementary logic gates built with field-effect transistors. We characterize the performance of such gates with tools from information theory and study the…
During the last ten years, the studies on non-Markovian open system dynamics has become increasingly popular and having contributions from diverse set of research communities. This interest has arisen due to fundamental problematics how to…
We present a general formalism for the construction of thermodynamically consistent stochastic models of non-linear electronic circuits. The devices constituting the circuit can have arbitrary I-V curves and may include tunnel junctions,…
We aim to give a pedagogic presentation of the open system dynamics of a periodically driven qubit in contact with a temperature bath. We are specifically interested in the thermodynamics of the qubit. It is well known that by combining the…
For a countable-state Markov decision process we introduce an embedding which produces a finite-state Markov decision process. The finite-state embedded process has the same optimal cost, and moreover, it has the same dynamics as the…
Reversible algorithms play a crucial role both in classical and quantum computation. While for a classical bit the only nontrivial reversible operation is the bit-flip, nature is far more versatile in what it allows to do to a quantum bit.…
We prove classical simulation hardness, under the generalized $\mathsf{P}\neq\mathsf{NP}$ conjecture, for quantum circuit families with applications in near-term chemical ground state estimation. The proof exploits a connection to particle…
Topological quantum computation by way of braiding of Majorana fermions is not universal quantum computation. There are several attempts to make universal quantum computation by introducing some additional quantum gates or quantum states.…