Stefan Woerner
Auto-generated profile, based on publicly available information

Stefan Woerner

IBM Quantum, IBM Research Europe—Zurich, Rueschlikon, Switzerland

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
24 June 2021 in Nature Computational Science
Verified
Journal Article
Closed access
PDF file
AAAmira Abbas
Amira Abbas
DSDavid Sutter
David Sutter
CZChrista Zoufal
Christa Zoufal
ALAurelien Lucchi
Aurelien Lucchi
AFAlessio Figalli
Alessio Figalli
SWStefan Woerner
Stefan Woerner

22 November 2019 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
CZChrista Zoufal
Christa Zoufal
ALAurélien Lucchi
Aurélien Lucchi
SWStefan Woerner
Stefan Woerner
Quantum algorithms have the potential to outperform their classical counterparts in a variety of tasks. The realization of the advantage often requires the ability to load classical data efficiently into quantum states. However, the best known methods require $${\mathcal{O}}\left({2}^{n}\right)$$O2n gates to load an exact representation of a generic data structure into an $$n$$n -qubit state. This scaling can easily predominate the complexity of a quantum algorithm and, thereby, impair potential quantum advantage. Our work presents a hybrid quantum-classical algorithm for efficient, approximate quantum state loading. More precisely, we use quantum Generative Adversarial Networks (qGANs) to facilitate efficient learning and loading of generic probability distributions - implicitly given by data samples - into quantum states. Through the interplay of a quantum channel, such as a variational quantum circuit, and a classical neural network, the qGAN can learn a representation of the probability distribution underlying the data samples and load it into a quantum state. The loading requires $${\mathcal{O}}\left(poly\left(n\right)\right)$$Opolyn gates and can thus enable the use of potentially advantageous quantum algorithms, such as Quantum Amplitude Estimation. We implement the qGAN distribution learning and loading method with Qiskit and test it using a quantum simulation as well as actual quantum processors provided by the IBM Q Experience. Furthermore, we employ quantum simulation to demonstrate the use of the trained quantum channel in a quantum finance application.

13 October 2020 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
DEDaniel J. Egger
Daniel J. Egger
CGClaudio Gambella
Claudio Gambella
JMJakub Marecek
Jakub Marecek
SMScott McFaddin
Scott McFaddin
MMMartin Mevissen
Martin Mevissen
EYElena Yndurain
Elena Yndurain
This article outlines our point of view regarding the applicability, state-of-the-art, and potential of quantum computing for problems in finance. We provide an introduction to quantum computing as well as a survey on problem classes in finance that are computationally challenging classically and for which quantum computing algorithms are promising. In the main part, we describe in detail quantum algorithms for specific applications arising in financial services, such as those involving simulation, optimization, and machine learning problems. In addition, we include demonstrations of quantum algorithms on IBM Quantum back-ends and discuss the potential benefits of quantum algorithms for problems in financial services. We conclude with a summary of technical challenges and future prospects.

8 February 2019 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
SWStefan Woerner
Stefan Woerner
DEDaniel J. Egger
Daniel J. Egger
We present a quantum algorithm that analyzes risk more efficiently than Monte Carlo simulations traditionally used on classical computers. We employ quantum amplitude estimation to price securities and evaluate risk measures such as Value at Risk and Conditional Value at Risk on a gate-based quantum computer. Additionally, we show how to implement this algorithm and how to trade-off the convergence rate of the algorithm and the circuit depth. The shortest possible circuit depth—growing polynomially in the number of qubits representing the uncertainty—leads to a convergence rate of O(M−2/3), where M is the number of samples. This is already faster than classical Monte Carlo simulations which converge at a rate of O(M−1/2). If we allow the circuit depth to grow faster, but still polynomially, the convergence rate quickly approaches the optimum of O(M−1). Thus, for slowly increasing circuit depths our algorithm provides a near quadratic speed-up compared to Monte Carlo methods. We demonstrate our algorithm using two toy models. In the first model we use real hardware, such as the IBM Q Experience, to price a Treasury-bill (T-bill) faced by a possible interest rate increase. In the second model, we simulate our algorithm to illustrate how a quantum computer can determine financial risk for a two-asset portfolio made up of government debt with different maturity dates. Both models confirm the improved convergence rate over Monte Carlo methods. Using simulations, we also evaluate the impact of cross-talk and energy relaxation errors.

6 July 2020 in Quantum
Verified
Journal Article
Open access
PDF file
NSNikitas Stamatopoulos
Nikitas Stamatopoulos
DEDaniel J Egger
Daniel J Egger
YSYue Sun
Yue Sun
CZChrista Zoufal
Christa Zoufal
RIRaban Iten
Raban Iten
SWStefan Woerner
Stefan Woerner
We present a methodology to price options and portfolios of options on a gate-based quantum computer using amplitude estimation, an algorithm which provides a quadratic speedup compared to classical Monte Carlo methods. The options that we cover include vanilla options, multi-asset options and path-dependent options such as barrier options. We put an emphasis on the implementation of the quantum circuits required to build the input states and operators needed by amplitude estimation to price the different option types. Additionally, we show simulation results to highlight how the circuits that we implement price the different option contracts. Finally, we examine the performance of option pricing circuits on quantum hardware using the IBM Q Tokyo quantum device. We employ a simple, yet effective, error mitigation scheme that allows us to significantly reduce the errors arising from noisy two-qubit gates.

28 October 2024 in Nature Reviews Physics
Verified
Journal Article
Closed access
PDF file
AAAmira Abbas
Amira Abbas
AAAndris Ambainis
Andris Ambainis
BABrandon Augustino
Brandon Augustino
ABAndreas Bärtschi
Andreas Bärtschi
HBHarry Buhrman
Harry Buhrman
CZChrista Zoufal
Christa Zoufal