Landauer’s principle asserts that any computation has an unavoidable energy cost that grows proportionally to its degree of logical irreversibility. But even a logically reversible operation, when run on a physical processor that operates on different energy levels, requires energy. Here we quantify this energy requirement, providing upper and lower bounds that coincide up to a constant factor. We derive these bounds from a general quantum resource-theoretic argument, which implies that the initial resource requirement for implementing a unitary operation within an error ε grows like 1/√ε times the amount of resource generated by the operation. Applying these results to quantum circuits, we find that their energy requirement can, by an appr...
Modularity dissipation identifies how locally implemented computation entails costs beyond those req...
In quantum computing the decoherence time of the qubits determines the computation time available, a...
International audienceThe threshold theorem is a fundamental result in the theory of fault-tolerant ...
The amount of heat generated by computers is rapidly becoming one of the main problems for developin...
While recent breakthroughs in quantum computing promise the nascence of the quantum information age,...
The reversible computation paradigm aims to provide a new foundation for general classical digital c...
International audienceFault-tolerant schemes can use error correction to make a quantum computation ...
We offer well-motivated and basis-independent definitions for the total amount of change occurring a...
It has long been known that to minimise the heat emitted by a deterministic computer during it's ope...
Landauer's principle imposes a fundamental limit on the energy cost to perfectly initialize a classi...
We identify and explore the intriguing property of resource resonance arising within resource theori...
We identify and explore the intriguing property of resource resonance arising within resource theori...
It has long been known that to minimise the heat emitted by a deterministic computer during it's ope...
Modularity dissipation identifies how locally implemented computation entails costs beyond those req...
Modularity dissipation identifies how locally implemented computation entails costs beyond those req...
Modularity dissipation identifies how locally implemented computation entails costs beyond those req...
In quantum computing the decoherence time of the qubits determines the computation time available, a...
International audienceThe threshold theorem is a fundamental result in the theory of fault-tolerant ...
The amount of heat generated by computers is rapidly becoming one of the main problems for developin...
While recent breakthroughs in quantum computing promise the nascence of the quantum information age,...
The reversible computation paradigm aims to provide a new foundation for general classical digital c...
International audienceFault-tolerant schemes can use error correction to make a quantum computation ...
We offer well-motivated and basis-independent definitions for the total amount of change occurring a...
It has long been known that to minimise the heat emitted by a deterministic computer during it's ope...
Landauer's principle imposes a fundamental limit on the energy cost to perfectly initialize a classi...
We identify and explore the intriguing property of resource resonance arising within resource theori...
We identify and explore the intriguing property of resource resonance arising within resource theori...
It has long been known that to minimise the heat emitted by a deterministic computer during it's ope...
Modularity dissipation identifies how locally implemented computation entails costs beyond those req...
Modularity dissipation identifies how locally implemented computation entails costs beyond those req...
Modularity dissipation identifies how locally implemented computation entails costs beyond those req...
In quantum computing the decoherence time of the qubits determines the computation time available, a...
International audienceThe threshold theorem is a fundamental result in the theory of fault-tolerant ...