Entropy generation in a model of reversible computation
Diego de Falco, Dario Tamascelli
Abstract
We present a model in which, due to the quantum nature of the signals controlling the implementation time of successive unitary computational steps, physical irreversibility appears in the execution of a logically reversible computation.
Create a lesson
Related papers
Pseudodeterminism and MA != NPBPP in Communication Complexity
Thomas Watson
Group Isomorphism and the Polylogarithmic-Time Hierarchy: Depth-212 Circuits and Lower Bounds
Joshua A. Grochow, Gülce Kardeş, Michael Levet
Continuous Computational Social Choice: A Case Study in Bribery
Martin Koutecký, Nikolaos Melissinos, Tung Anh Vu et al.
Pseudorandom Functions in NC1 from LWE/LPN/CDH (Or: How to Build PRFs in NC1, Generically)
Youlong Ding, Aayush Jain, Ilan Komargodski
Parameterized Complexity of Lp-Lipschitz Constants for Input Convex Neural Networks and Lp-Norm Maximization over Zonotopes
Aritra Das, Vincent Froese, Moritz Grillo et al.
Exact CVP Is NP-Complete for Principal Cyclotomic Ideals
Jiaqi Liu, Yansong Feng, Yanbin Pan