BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Patryk Lipka-Bartosik

Patryk Lipka-Bartosik contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
quant-phcond-mat.stat-mechBiological PhysicsEmerging TechnologiesHardware ArchitectureNeural and Evolutionary Computing

Trust snapshot

Quick read

Trust 19 - UnverifiedVerification L1Unclaimed author
5works
0followers
6topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

5 published item(s)

preprint2026arXiv

Energy-Time-Accuracy Tradeoffs in Thermodynamic Computing

In the paradigm of thermodynamic computing, instead of behaving deterministically, hardware undergoes a stochastic process in order to sample from a distribution of interest. While it has been hypothesized that thermodynamic computers may achieve better energy efficiency and performance, a theoretical characterization of the resource cost of thermodynamic computations is still lacking. Here, we analyze the fundamental trade-offs between computational accuracy, energy dissipation, and time in thermodynamic computing. Using geometric bounds on entropy production, we derive general limits on the energy-delay-deficiency product (EDDP), a stochastic generalization of the traditional energy-delay product (EDP). While these limits can in principle be saturated, the corresponding optimal driving protocols require full knowledge of the final equilibrium distribution, i.e., the solution itself. To overcome this limitation, we develop quasi-optimal control schemes that require no prior information of the solution and demonstrate their performance for matrix inversion in overdamped quadratic systems. The derived bounds extend beyond this setting to more general potentials, being directly relevant to recent proposals based on non-equilibrium Langevin dynamics.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Thermodynamic Networks: Harnessing Non-Equilibrium Steady States for Computation

We introduce thermodynamic networks, a general framework for autonomous, physics-based computation using non-equilibrium steady states. These networks are modeled as a collection of finite-size reservoirs that exchange conserved quantities--such as electric charge or molecular number--while relaxing to a non-equilibrium steady state, which encodes the solution of a computational problem. We identify Negative Differential Conductance (NDC) as the critical physical property governing the computational expressivity of the thermodynamic network. While networks lacking NDC are restricted to computing monotonic functions, the presence of NDC enables universal function approximation. For the training of the network, we use protocols that take advantage of the natural tendency of the system to equilibrate. We illustrate the versatility of our approach via two different platforms: quantum dot networks and enzymatic reaction networks. Both systems can be engineered to have NDC, enabling high performance in standard benchmarks, including sine function approximation and MNIST digit classification. Overall, our work establishes a rigorous link between non-equilibrium steady states and computational expressivity.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Second law of thermodynamics for batteries with vacuum state

In stochastic thermodynamics work is a random variable whose average is bounded by the change in the free energy of the system. In most treatments, however, the work reservoir that absorbs this change is either tacitly assumed or modelled using unphysical systems with unbounded Hamiltonians (i.e. the ideal weight). In this work we describe the consequences of introducing the ground state of the battery and hence -- of breaking its translational symmetry. The most striking consequence of this shift is the fact that the Jarzynski identity is replaced by a family of inequalities. Using these inequalities we obtain corrections to the second law of thermodynamics which vanish exponentially with the distance of the initial state of the battery to the bottom of its spectrum. Finally, we study an exemplary thermal operation which realizes the approximate Landauer erasure and demonstrate the consequences which arise when the ground state of the battery is explicitly introduced. In particular, we show that occupation of the vacuum state of any physical battery sets a lower bound on fluctuations of work, while batteries without vacuum state allow for fluctuation-free erasure.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Multi-object operational tasks for convex quantum resource theories

The prevalent modus operandi within the framework of quantum resource theories has been to characterise and harness the resources within single objects, in what we can call \emph{single-object} quantum resource theories. One can wonder however, whether the resources contained within multiple different types of objects, now in a \emph{multi-object} quantum resource theory, can simultaneously be exploited for the benefit of an operational task. In this work, we introduce examples of such multi-object operational tasks in the form of subchannel discrimination and subchannel exclusion games, in which the player harnesses the resources contained within a state-measurement pair. We prove that for any state-measurement pair in which either of them is resourceful, there exist discrimination and exclusion games for which such a pair outperforms any possible free state-measurement pair. These results hold for arbitrary convex resources of states, and arbitrary convex resources of measurements for which classical post-processing is a free operation. Furthermore, we prove that the advantage in these multi-object operational tasks is determined, in a multiplicative manner, by the resource quantifiers of: \emph{generalised robustness of resource} of both state and measurement for discrimination games and \emph{weight of resource} of both state and measurement for exclusion games.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

The operational advantages provided by non-classical teleportation

The standard benchmark for teleportation is the average fidelity of teleportation and according to this benchmark not all states are useful for teleportation. It was recently shown however that all entangled states lead to non-classical teleportation, with there being no classical scheme able to reproduce the states teleported to Bob. Here we study the operational significance of this result. On the one hand we demonstrate that every entangled state is useful for teleportation if a generalization of the average fidelity of teleportation is considered which concerns teleporting quantum correlations. On the other hand, we show the strength of a particular entangled state and entangled measurement for teleportation -- as quantified by the robustness of teleportation -- precisely characterizes their ability to offer an advantage in the task of subchannel discrimination with side information. This connection allows us to prove that every entangled state outperforms all separable states when acting as a quantum memory in this discrimination task. Finally, within the context of a resource theory of teleportation, we show that the two operational tasks considered provide complete sets of monotones for two partial orders based upon the notion of teleportation simulation, one classical, and one quantum.

0 citations0 reviewsNo code linkedOpen access