Autonomous quantum machines
For a specified autonomous machine with bounded dimension, energy and interaction strength, derive tight trade-offs for its chosen clock, battery or heat-engine task, including auxiliary preparation, repeated-use degradation and control costs.
Problem statement
For a specified autonomous machine with bounded dimension, energy and interaction strength, derive tight trade-offs for its chosen clock, battery or heat-engine task, including auxiliary preparation, repeated-use degradation and control costs.
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
An autonomous quantum machine runs on a time-independent Hamiltonian, without external time-dependent control — so the 'clock' or driving that a controlled protocol assumes must itself be part of the quantum system. This sharpens thermodynamic limits by charging for control.
What is known: Autonomous clock models exhibit accuracy–resolution–dissipation trade-offs and finite-dimensional quantum-clock scaling advantages; entropy–accuracy inequalities depend on the clock and readout assumptions and are not one universal law. Battery power and extractable-work bounds depend on the allowed interactions and their norm. Engine and refrigerator efficiencies must be compared at specified reservoirs, coupling and output-power conventions.
This programme has distinct child targets: for clocks, repeated-tick accuracy and timing-induced channel error at bounded energy and size; for batteries, charging power and retained work at fixed interaction norm/locality; for engines and refrigerators, efficiency–power–fluctuation frontiers at specified baths. Include the cost and degradation of the finite clock or controller rather than supplying an ideal external drive for free. Relational clock formalism from archived F11 is tracked in F8; its finite-resource performance questions belong here. Related: O6, O8, F8.
Progress & source assessment
Source catalogue review: 4 September 2026. Improved indicates partial progress, including qualified preprint claims.
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.