Hendrik Poulsen Nautrup

Hendrik Poulsen Nautrup

Auto-generated profile, based on publicly available information

Hendrik Poulsen Nautrup

University of Innsbruck

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
18 January 2018 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Closed access
PDF file
Alexey MelnikovAlexey Melnikov
Alexey Melnikov
HNHendrik Poulsen Nautrup
Hendrik Poulsen Nautrup
MKMario Krenn
Mario Krenn
VDVedran Dunjko
Vedran Dunjko
MTMarkus Tiersch
Markus Tiersch
HBHans J. Briegel
Hans J. Briegel
Significance: Quantum experiments push the envelope of our understanding of fundamental concepts in quantum physics. Modern experiments have exhaustively probed the basic notions of quantum theory. Arguably, further breakthroughs require the tackling of complex quantum phenomena and consequently require complex experiments and involved techniques. The designing of such complex experiments is difficult and often clashes with human intuition. We present an autonomous learning model which learns to design such complex experiments, without relying on previous knowledge or often flawed intuition. Our system not only learns how to design desired experiments more efficiently than the best previous approaches, but in the process also discovers nontrivial experimental techniques. Our work demonstrates that learning machines can offer dramatic advances in how experiments are generated.

31 January 2023 in Nature Communications
Verified
Journal Article
Open access
PDF file
SJSofiene Jerbi
Sofiene Jerbi
LFLukas J. Fiderer
Lukas J. Fiderer
HNHendrik Poulsen Nautrup
Hendrik Poulsen Nautrup
JKJonas M. Kübler
Jonas M. Kübler
HBHans J. Briegel
Hans J. Briegel
VDVedran Dunjko
Vedran Dunjko
Machine learning algorithms based on parametrized quantum circuits are prime candidates for near-term applications on noisy quantum computers. In this direction, various types of quantum machine learning models have been introduced and studied extensively. Yet, our understanding of how these models compare, both mutually and to classical models, remains limited. In this work, we identify a constructive framework that captures all standard models based on parametrized quantum circuits: that of linear quantum models. In particular, we show using tools from quantum information theory how data re-uploading circuits, an apparent outlier of this framework, can be efficiently mapped into the simpler picture of linear models in quantum Hilbert spaces. Furthermore, we analyze the experimentally-relevant resource requirements of these models in terms of qubit number and amount of data needed to learn. Based on recent results from classical machine learning, we prove that linear quantum models must utilize exponentially more qubits than data re-uploading models in order to solve certain learning tasks, while kernel methods additionally require exponentially more data points. Our results provide a more comprehensive view of quantum machine learning models as well as insights on the compatibility of different models with NISQ constraints.

16 December 2019 in Quantum
Verified
Journal Article
Open access
PDF file
HNHendrik Poulsen Nautrup
Hendrik Poulsen Nautrup
NDNicolas Delfosse
Nicolas Delfosse
VDVedran Dunjko
Vedran Dunjko
HBHans J. Briegel
Hans J. Briegel
NFNicolai Friis
Nicolai Friis
Quantum error correction is widely thought to be the key to fault-tolerant quantum computation. However, determining the most suited encoding for unknown error channels or specific laboratory setups is highly challenging. Here, we present a reinforcement learning framework for optimizing and fault-tolerantly adapting quantum error correction codes. We consider a reinforcement learning agent tasked with modifying a family of surface code quantum memories until a desired logical error rate is reached. Using efficient simulations with about 70 data qubits with arbitrary connectivity, we demonstrate that such a reinforcement learning agent can determine near-optimal solutions, in terms of the number of data qubits, for various error models of interest. Moreover, we show that agents trained on one setting are able to successfully transfer their experience to different settings. This ability for transfer learning showcases the inherent strengths of reinforcement learning and the applicability of our approach for optimization from off-line simulations to on-line laboratory settings.

20 May 2019 in Quantum
Verified
Journal Article
Open access
DSDavid T. Stephen
David T. Stephen
HNHendrik Poulsen Nautrup
Hendrik Poulsen Nautrup
JBJuani Bermejo-Vega
Juani Bermejo-Vega
JEJens Eisert
Jens Eisert
RRRobert Raussendorf
Robert Raussendorf
Quantum phases of matter are resources for notions of quantum computation. In this work, we establish a new link between concepts of quantum information theory and condensed matter physics by presenting a unified understanding of symmetry-protected topological (SPT) order protected by subsystem symmetries and its relation to measurement-based quantum computation (MBQC). The key unifying ingredient is the concept of quantum cellular automata (QCA) which we use to define subsystem symmetries acting on rigid lower-dimensional lines or fractals on a 2D lattice. Notably, both types of symmetries are treated equivalently in our framework. We show that states within a non-trivial SPT phase protected by these symmetries are indicated by the presence of the same QCA in a tensor network representation of the state, thereby characterizing the structure of entanglement that is uniformly present throughout these phases. By also formulating schemes of MBQC based on these QCA, we are able to prove that most of the phases we construct are computationally universal phases of matter, in which every state is a resource for universal MBQC. Interestingly, our approach allows us to construct computational phases which have practical advantages over previous examples, including a computational speedup. The significance of the approach stems from constructing novel computationally universal phases of matter and showcasing the power of tensor networks and quantum information theory in classifying subsystem SPT order.

22 February 2021 in PRX Quantum
Verified
Journal Article
Open access
PDF file
SJSofiene Jerbi
Sofiene Jerbi
LTLea M. Trenkwalder
Lea M. Trenkwalder
HNHendrik Poulsen Nautrup
Hendrik Poulsen Nautrup
HBHans J. Briegel
Hans J. Briegel
VDVedran Dunjko
Vedran Dunjko
Quantum algorithms have been successfully applied to provide computational speed ups to various machine-learning tasks and methods. A notable exception to this has been deep reinforcement learning (RL). Deep RL combines the power of deep neural networks with reinforcement learning, and has provided some of the most impressive recent artificial-intelligence (AI) results including the famous AlphaGo system—yet, no possibilities for quantum advantages have been identified to date. In this work, we show how quantum computers can enhance the performance of deep RL, especially where the action spaces are large. Specifically, we introduce so-called deep energy-based models, inspired by statistical physics, which we show outperform standard deep RL machinery in learning performance. These models are computationally more demanding, but this can be ameliorated by quantum techniques. Specifically, we provide quantum algorithms, some of which can be run on near-term quantum computers, that can be used to speed up deep energy-based RL. This result opens up a new playing field for quantum enhancements in machine learning and AI.

6 November 2017 in Nature Communications
Verified
Journal Article
Open access
PDF file
HNHendrik Poulsen Nautrup
Hendrik Poulsen Nautrup
NFNicolai Friis
Nicolai Friis
HBHans J. Briegel
Hans J. Briegel
Topological error correction codes are promising candidates to protect quantum computations from the deteriorating effects of noise. While some codes provide high noise thresholds suitable for robust quantum memories, others allow straightforward gate implementation needed for data processing. To exploit the particular advantages of different topological codes for fault-tolerant quantum computation, it is necessary to be able to switch between them. Here we propose a practical solution, subsystem lattice surgery, which requires only two-body nearest-neighbor interactions in a fixed layout in addition to the indispensable error correction. This method can be used for the fault-tolerant transfer of quantum information between arbitrary topological subsystem codes in two dimensions and beyond. In particular, it can be employed to create a simple interface, a quantum bus, between noise resilient surface code memories and flexible color code processors.