Researcher profile

Clemens Müller

Clemens Müller contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 17 - UnverifiedVerification L1Unclaimed author
4works
0followers
2topics
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

4 published item(s)

preprint2026arXiv

Cattle Trade: A Multi-Agent Benchmark for LLM Bluffing, Bidding, and Bargaining

We introduce \textsc{Cattle Trade, a multi-agent benchmark for evaluating large language models (LLMs) as agents in strategic reasoning under imperfect information, adversarial interaction, and resource constraints. The benchmark combines auctions, hidden-offer trade challenges (TCs), bargaining, bluffing, opponent modeling, and resource allocation within a single long-horizon game lasting 50--60 turns. Unlike prior agent benchmarks that test these abilities in isolation, \textsc{Cattle Trade} evaluates whether agents integrate them across a competitive, multi-agent economic game with conflicting incentives. The benchmark logs every bid, TC offer, counteroffer, and card selection, enabling behavioural analysis beyond final scores or win rates. We evaluate seven cost-efficient language models and three deterministic code agents across 242 games. Strategic coherence, in particular spending efficiency, resource discipline, and phase-adaptive bidding, is associated with rank more strongly than spending volume or any single subskill. Two heuristic code agents outperform most tested LLMs, and behavioural traces surface recurring LLM failure modes including overbidding, self-bidding, bankrupt TC initiation, and weak opponent-state adaptation. Evaluating agentic competence requires benchmarks that test the joint deployment of multiple capabilities in multi-agent environments with conflicting incentives, uncertainty, and economic dynamics.

preprint2020arXiv

Dissipative Rabi model in the dispersive regime

The dispersive regime of circuit QED is the main workhorse for todays quantum computing prototypes based on superconducting qubits. Analytic descriptions of this model typically rely on the rotating wave approximation of the interaction between the qubits and resonators, using the Jaynes-Cummings model as starting point for the dispersive transformation. Here we present analytic results on the dispersive regime of the dissipative Rabi model, without taking the rotating wave approximation of the underlying Hamiltonian. Using a recently developed hybrid perturbation theory based on the expansion of the time evolution on the Keldysh contour [Phys. Rev. A 95, 013847 (2017)], we derive simple analytic expressions for all experimentally relevant dynamical parameters like dispersive shift and resonator induced Purcell decay rate, focussing our analysis on a generic multi-level qubit. The analytical equations are easily tractable and reduce to the known Jaynes-Cummings results in the relevant limit. They however show qualitative differences at intermediate and large detuning, allowing for more accurate modelling of the interaction between superconducting qubits and resonators. In the limit of strong resonator driving, our results additionally predict new types of drive induced qubit dissipation and dephasing, not present in previous theories.

preprint2020arXiv

Doubly Nonlinear Superconducting Qubit

We describe a superconducting circuit consisting of a Josephson junction in parallel with a quantum phase slip wire, which implements a Hamiltonian that is periodic in both charge and flux. This Hamiltonian is exactly diagonalisable in a double-Bloch band, and the eigenstates are shown to be code states of the Gottesman-Kitaev-Preskill quantum error correcting code. The eigenspectrum has several critical points, where the linear sensitivity to external charge and flux noise vanishes. The states at these critical points thus hold promise as qubit states that are insensitive to external noise sources.

preprint2020arXiv

Quantum rifling: protecting a qubit from measurement back-action

Quantum mechanics postulates that measuring the qubit's wave function results in its collapse, with the recorded discrete outcome designating the particular eigenstate that the qubit collapsed into. We show that this picture breaks down when the qubit is strongly driven during measurement. More specifically, for a fast evolving qubit the measurement returns the time-averaged expectation value of the measurement operator, erasing information about the initial state of the qubit, while completely suppressing the measurement back-action. We call this regime `quantum rifling', as the fast spinning of the Bloch vector protects it from deflection into either of its eigenstates. We study this phenomenon with two superconducting qubits coupled to the same probe field and demonstrate that quantum rifling allows us to measure either one of the qubits on demand while protecting the state of the other from measurement back-action. Our results allow for the implementation of selective read out multiplexing of several qubits, contributing to the efficient scaling up of quantum processors for future quantum technologies.