Arne Hamann

Arne Hamann

Auto-generated profile, based on publicly available information

Arne Hamann

Universität Innsbruck

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 March 2021 in Nature
Verified
Journal Article
Closed access
PDF file
VSV. Saggio
V. Saggio
BAB. E. Asenbeck
B. E. Asenbeck
AHA. Hamann
A. Hamann
TST. Strömberg
T. Strömberg
PSP. Schiansky
P. Schiansky
PWPhilip Walther
Philip Walther

1 April 2020 in New Journal of Physics
Verified
Journal Article
Open access
PDF file
FFFulvio Flamini
Fulvio Flamini
AHArne Hamann
Arne Hamann
SJSofiène Jerbi
Sofiène Jerbi
LTLea M. Trenkwalder
Lea M. Trenkwalder
HNHendrik Poulsen Nautrup
Hendrik Poulsen Nautrup
HBHans J Briegel
Hans J Briegel
The last decade has seen an unprecedented growth in artificial intelligence and photonic technologies, both of which drive the limits of modern-day computing devices. In line with these recent developments, this work brings together the state of the art of both fields within the framework of reinforcement learning. We present the blueprint for a photonic implementation of an active learning machine incorporating contemporary algorithms such as SARSA, Q-learning, and projective simulation. We numerically investigate its performance within typical reinforcement learning environments, showing that realistic levels of experimental noise can be tolerated or even be beneficial for the learning process. Remarkably, the architecture itself enables mechanisms of abstraction and generalization, two features which are often considered key ingredients for artificial intelligence. The proposed architecture, based on single-photon evolution on a mesh of tunable beamsplitters, is simple, scalable, and a first integration in quantum optical experiments appears to be within the reach of near-term technology.

10 January 2022 in Quantum Science and Technology
Verified
Journal Article
Open access
AHArne Hamann
Arne Hamann
PSPavel Sekatski
Pavel Sekatski
WDWolfgang Dür
Wolfgang Dür
We consider the sensing of scalar valued fields with specific spatial dependence using a network of sensors, e.g. multiple atoms located at different positions within a trap. We show how to harness the spatial correlations to sense only a specific signal, and be insensitive to others at different positions or with unequal spatial dependence by constructing a decoherence-free subspace for noise sources at fixed, known positions. This can be extended to noise sources lying on certain surfaces, where we encounter a connection to mirror charges and equipotential surfaces in classical electrostatics. For general situations, we introduce the notion of an approximate decoherence-free subspace, where noise for all sources within some volume is significantly suppressed, at the cost of reducing the signal strength in a controlled way. We show that one can use this approach to maintain Heisenberg-scaling over long times and for a large number of sensors, despite the presence of multiple noise sources in large volumes. We introduce an efficient formalism to construct internal states and sensor configurations, and apply it to several examples to demonstrate the usefulness and wide applicability of our approach.

2 August 2021 in Quantum Machine Intelligence
Verified
Journal Article
Open access
PDF file
AHA. Hamann
A. Hamann
VDV. Dunjko
V. Dunjko
SWS. Wölk
S. Wölk
In recent years, quantum-enhanced machine learning has emerged as a particularly fruitful application of quantum algorithms, covering aspects of supervised, unsupervised and reinforcement learning. Reinforcement learning offers numerous options of how quantum theory can be applied, and is arguably the least explored, from a quantum perspective. Here, an agent explores an environment and tries to find a behavior optimizing some figure of merit. Some of the first approaches investigated settings where this exploration can be sped-up, by considering quantum analogs of classical environments, which can then be queried in superposition. If the environments have a strict periodic structure in time (i.e. are strictly episodic), such environments can be effectively converted to conventional oracles encountered in quantum information. However, in general environments, we obtain scenarios that generalize standard oracle tasks. In this work, we consider one such generalization, where the environment is not strictly episodic, which is mapped to an oracle identification setting with a changing oracle. We analyze this case and show that standard amplitude-amplification techniques can, with minor modifications, still be applied to achieve quadratic speed-ups. In addition, we prove that an algorithm based on Grover iterations is optimal for oracle identification even if the oracle changes over time in a way that the “rewarded space” is monotonically increasing. This result constitutes one of the first generalizations of quantum-accessible reinforcement learning.

1 March 2022 in New Journal of Physics
Verified
Journal Article
Open access
AHArne Hamann
Arne Hamann
SWSabine Wölk
Sabine Wölk
In the last decade quantum machine learning has provided fascinating and fundamental improvements to supervised, unsupervised and reinforcement learning (RL). In RL, a so-called agent is challenged to solve a task given by some environment. The agent learns to solve the task by exploring the environment and exploiting the rewards it gets from the environment. For some classical task environments, an analogue quantum environment can be constructed which allows to find rewards quadratically faster by applying quantum algorithms. In this paper, we analytically analyze the behavior of a hybrid agent which combines this quadratic speedup in exploration with the policy update of a classical agent. This leads to a faster learning of the hybrid agent compared to the classical agent. We demonstrate that if the classical agent needs on average ⟨J⟩ rewards and ⟨T⟩cl epochs to learn how to solve the task, the hybrid agent will take ⟨ T ⟩ q ⩽ α s α o ⟨ T ⟩ c l ⟨ J ⟩ epochs on average. Here, α s and α o denote constants depending on details of the quantum search and are independent of the problem size. Additionally, we prove that if the environment allows for maximally α o k max sequential coherent interactions, e.g. due to noise effects, an improvement given by ⟨T⟩q ≈ α o ⟨T⟩cl/(4k max) is still possible.

8 April 2024 in Quantum Science and Technology
Verified
Journal Article
Open access
AHArne Hamann
Arne Hamann
PSPavel Sekatski
Pavel Sekatski
WDWolfgang Dür
Wolfgang Dür
We consider the task of multiple parameter estimation in the presence of strong correlated noise with a network of distributed sensors. The signals and the noises have different spatial dependence but are encoded with the same local generators. We study how to find and improve noise-insensitive strategies. We show that sequentially probing with GHZ states from the decoherence-free subspace that we identify is asymptotically optimal up to a factor of at most 4 in the limit of many repetitions. The implementation of such strategies only requires local read-out and ‘passive’ resources—an initially entangled state of the sensors and tunable local interaction strength.