Stefan Woerner
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Stefan Woerner has a total of 152 co-authors. Here are the top co-authors by number of shared publications:
- Daniel J. Egger
IBM Quantum, IBM Research Europe—Zurich, Rueschlikon, Switzerland
15 shared publications - Christa Zoufal
IBM Quantum, IBM Research Europe-Zurich, Zurich, Switzerland.
10 shared publications Christa Zoufal
IBM Quantum IBM Research -Zurich CH-8803 Rüschlikon Switzerland
6 shared publicationsDaniel J. Egger
IBM Quantum IBM Research Europe -Zurich
5 shared publications- Almudena Carrera Vazquez
IBM Research, Rüschlikon, Switzerland
4 shared publications Aurélien Lucchi
ETH Zurich, Zurich, Switzerland
4 shared publications
Latest Publications
- Top Cited PapersOpen Access
- 23 June 2026
- Published by Springer Nature in Nature Computational Science
- Vol. 6 (6) , 653-671
The Quantum Optimization Benchmarking Library
Recent progress has brought benchmarking of (heuristic) quantum algorithms at scale within reach. Particularly in combinatorial optimization, it is key to empirically analyze and track progress towards quantum advantage. This work introduces a systematic, fair and comparable benchmarking framework for quantum optimization methods by presenting ten model-independent problem classes that are challenging for classical methods. Track records of specific instances and solutions are given in an accompanying open-source repository. While the individual properties of the problem classes vary, they all become challenging from less than 100 to, at most, an order of 100,000 decision variables. We reference results from state-of-the-art solvers for instances across all problem classes and demonstrate exemplary baseline results obtained with quantum solvers for selected problems, which illustrate standardized benchmark reporting. The presented problem instances may be approached with classical or quantum algorithms executed on varying hardware platforms to drive the field towards quantum advantage.
- 23 June 2026
- Published by Springer Nature in Nature Computational Science
- Vol. 6 (6) , 653-671
Top Cited PapersOpen AccessThe Quantum Optimization Benchmarking Library
Recent progress has brought benchmarking of (heuristic) quantum algorithms at scale within reach. Particularly in combinatorial optimization, it is key to empirically analyze and track progress towards quantum advantage. This work introduces a systematic, fair and comparable benchmarking framework for quantum optimization methods by presenting ten model-independent problem classes that are challenging for classical methods. Track records of specific instances and solutions are given in an accompanying open-source repository. While the individual properties of the problem classes vary, they all become challenging from less than 100 to, at most, an order of 100,000 decision variables. We reference results from state-of-the-art solvers for instances across all problem classes and demonstrate exemplary baseline results obtained with quantum solvers for selected problems, which illustrate standardized benchmark reporting. The presented problem instances may be approached with classical or quantum algorithms executed on varying hardware platforms to drive the field towards quantum advantage.
- Open Access
- 25 February 2026
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 25 (2)
Mitigating errors in state preparation and measurement with noncomputational states
Error mitigation has enabled quantum computing applications with more than a hundred qubits and deep circuits. Many error mitigation methods are noise-aware, relying on a faithful characterization of the noise channels of the hardware. However, fundamental limitations lead to unlearnable degrees of freedom of the underlying noise models when considering qubits. Here, we show how to leverage noncomputational states as an additional resource to learn state-preparation errors in superconducting qubits. This allows one to fully constrain the noise models. We can thus independently and accurately mitigate state-preparation errors, gate errors, and measurement errors. Our proposed method is also applicable to dynamic circuits with midcircuit measurements. This work opens the door to improved error mitigation for measurements, both at the end of the circuit and midcircuit.
- 25 February 2026
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 25 (2)
Open AccessMitigating errors in state preparation and measurement with noncomputational states
Error mitigation has enabled quantum computing applications with more than a hundred qubits and deep circuits. Many error mitigation methods are noise-aware, relying on a faithful characterization of the noise channels of the hardware. However, fundamental limitations lead to unlearnable degrees of freedom of the underlying noise models when considering qubits. Here, we show how to leverage noncomputational states as an additional resource to learn state-preparation errors in superconducting qubits. This allows one to fully constrain the noise models. We can thus independently and accurately mitigate state-preparation errors, gate errors, and measurement errors. Our proposed method is also applicable to dynamic circuits with midcircuit measurements. This work opens the door to improved error mitigation for measurements, both at the end of the circuit and midcircuit.
- Open Access
- 2 December 2025
- Published by Springer Nature
- p. 57-64
Quantum Optimization
Quantum computing is a new computational paradigm with the prospect of outperforming classical computing on many tasks. Optimization is frequently mentioned as a promising area for achieving a quantum advantage, i.e., solving a problem faster, more accurately, or more efficiently than classical computers. This chapter gives a brief summary of the potential benefits the state of the art and recommends possible directions to further progress.
- 2 December 2025
- Published by Springer Nature
- p. 57-64
Open AccessQuantum Optimization
Quantum computing is a new computational paradigm with the prospect of outperforming classical computing on many tasks. Optimization is frequently mentioned as a promising area for achieving a quantum advantage, i.e., solving a problem faster, more accurately, or more efficiently than classical computers. This chapter gives a brief summary of the potential benefits the state of the art and recommends possible directions to further progress.
- Top Cited PapersOpen Access
- 24 October 2025
- Published by Springer Nature in Nature Computational Science
- Vol. 5 (12) , 1168-1177
Quantum approximate multi-objective optimization
The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches.
- 24 October 2025
- Published by Springer Nature in Nature Computational Science
- Vol. 5 (12) , 1168-1177
Top Cited PapersOpen AccessQuantum approximate multi-objective optimization
The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches.
- Top Cited PapersOpen Access
- 6 May 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (2)
Measurement-based long-range entangling gates in constant depth
The depth of quantum circuits is a critical factor when running them on state-of-the-art quantum devices owing to their limited coherence times. Reducing circuit depth decreases noise in near-term quantum computations and reduces overall computation time. This also benefits fault-tolerant quantum computations. Here, we show how to reduce the depth of quantum subroutines that typically scale linearly with the number of qubits, such as quantum fan-out and long-range CNOT gates, to a constant depth using mid-circuit measurements and feedforward operations, while only requiring a 1D line topology. We compare our protocols with existing ones to highlight their advantages. Additionally, we verify the feasibility by implementing the measurement-based quantum fan-out gate and long-range CNOT gate on real quantum hardware, demonstrating significant improvements over their unitary implementations.
- 6 May 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (2)
Top Cited PapersOpen AccessMeasurement-based long-range entangling gates in constant depth
The depth of quantum circuits is a critical factor when running them on state-of-the-art quantum devices owing to their limited coherence times. Reducing circuit depth decreases noise in near-term quantum computations and reduces overall computation time. This also benefits fault-tolerant quantum computations. Here, we show how to reduce the depth of quantum subroutines that typically scale linearly with the number of qubits, such as quantum fan-out and long-range CNOT gates, to a constant depth using mid-circuit measurements and feedforward operations, while only requiring a 1D line topology. We compare our protocols with existing ones to highlight their advantages. Additionally, we verify the feasibility by implementing the measurement-based quantum fan-out gate and long-range CNOT gate on real quantum hardware, demonstrating significant improvements over their unitary implementations.
- Top Cited PapersOpen Access
- 20 November 2024
- Published by Springer Nature in Nature
- Vol. 636 (8041) , 75-79
Combining quantum processors with real-time classical communication
Quantum computers process information with the laws of quantum mechanics. Current quantum hardware is noisy, can only store information for a short time and is limited to a few quantum bits, that is, qubits, typically arranged in a planar connectivity1. However, many applications of quantum computing require more connectivity than the planar lattice offered by the hardware on more qubits than is available on a single quantum processing unit (QPU). The community hopes to tackle these limitations by connecting QPUs using classical communication, which has not yet been proven experimentally. Here we experimentally realize error-mitigated dynamic circuits and circuit cutting to create quantum states requiring periodic connectivity using up to 142 qubits spanning two QPUs with 127 qubits each connected in real time with a classical link. In a dynamic circuit, quantum gates can be classically controlled by the outcomes of mid-circuit measurements within run-time, that is, within a fraction of the coherence time of the qubits. Our real-time classical link enables us to apply a quantum gate on one QPU conditioned on the outcome of a measurement on another QPU. Furthermore, the error-mitigated control flow enhances qubit connectivity and the instruction set of the hardware thus increasing the versatility of our quantum computers. Our work demonstrates that we can use several quantum processors as one with error-mitigated dynamic circuits enabled by a real-time classical link.
- 20 November 2024
- Published by Springer Nature in Nature
- Vol. 636 (8041) , 75-79
Top Cited PapersOpen AccessCombining quantum processors with real-time classical communication
Quantum computers process information with the laws of quantum mechanics. Current quantum hardware is noisy, can only store information for a short time and is limited to a few quantum bits, that is, qubits, typically arranged in a planar connectivity1. However, many applications of quantum computing require more connectivity than the planar lattice offered by the hardware on more qubits than is available on a single quantum processing unit (QPU). The community hopes to tackle these limitations by connecting QPUs using classical communication, which has not yet been proven experimentally. Here we experimentally realize error-mitigated dynamic circuits and circuit cutting to create quantum states requiring periodic connectivity using up to 142 qubits spanning two QPUs with 127 qubits each connected in real time with a classical link. In a dynamic circuit, quantum gates can be classically controlled by the outcomes of mid-circuit measurements within run-time, that is, within a fraction of the coherence time of the qubits. Our real-time classical link enables us to apply a quantum gate on one QPU conditioned on the outcome of a measurement on another QPU. Furthermore, the error-mitigated control flow enhances qubit connectivity and the instruction set of the hardware thus increasing the versatility of our quantum computers. Our work demonstrates that we can use several quantum processors as one with error-mitigated dynamic circuits enabled by a real-time classical link.
- Open Access
- 1 November 2024
- Published by Springer Nature in Nature Computational Science
- Vol. 4 (11) , 865-875
Provable bounds for noise-free expectation values computed from noisy samples
Quantum computing has emerged as a powerful computational paradigm capable of solving problems beyond the reach of classical computers. However, today’s quantum computers are noisy, posing challenges to obtaining accurate results. Here, we explore the impact of noise on quantum computing, focusing on the challenges in sampling bit strings from noisy quantum computers and the implications for optimization and machine learning. We formally quantify the sampling overhead to extract good samples from noisy quantum computers and relate it to the layer fidelity, a metric to determine the performance of noisy quantum processors. Further, we show how this allows us to use the conditional value at risk of noisy samples to determine provable bounds on noise-free expectation values. We discuss how to leverage these bounds for different algorithms and demonstrate our findings through experiments on real quantum computers involving up to 127 qubits. The results show strong alignment with theoretical predictions.
- 1 November 2024
- Published by Springer Nature in Nature Computational Science
- Vol. 4 (11) , 865-875
Open AccessProvable bounds for noise-free expectation values computed from noisy samples
Quantum computing has emerged as a powerful computational paradigm capable of solving problems beyond the reach of classical computers. However, today’s quantum computers are noisy, posing challenges to obtaining accurate results. Here, we explore the impact of noise on quantum computing, focusing on the challenges in sampling bit strings from noisy quantum computers and the implications for optimization and machine learning. We formally quantify the sampling overhead to extract good samples from noisy quantum computers and relate it to the layer fidelity, a metric to determine the performance of noisy quantum processors. Further, we show how this allows us to use the conditional value at risk of noisy samples to determine provable bounds on noise-free expectation values. We discuss how to leverage these bounds for different algorithms and demonstrate our findings through experiments on real quantum computers involving up to 127 qubits. The results show strong alignment with theoretical predictions.
- Top Cited Papers
- 28 October 2024
- Published by Springer Nature in Nature Reviews Physics
- Vol. 6 (12) , 718-735
Challenges and opportunities in quantum optimization
- 28 October 2024
- Published by Springer Nature in Nature Reviews Physics
- Vol. 6 (12) , 718-735
Top Cited PapersChallenges and opportunities in quantum optimization
- Open Access
- 5 February 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (1) , 013143
Variational quantum time evolution without the quantum geometric tensor
Real- and imaginary-time quantum state evolutions are crucial in physics and chemistry for exploring quantum dynamics, preparing ground states, and computing thermodynamic observables. On near-term devices, variational quantum time evolution is a promising candidate for these tasks, as the required circuit model can be tailored to the available devices' capabilities. Due to the evaluation of the quantum geometric tensor (QGT), however, this approach quickly becomes infeasible for relevant system sizes. Here, we propose a dual formulation for variational time evolution, which replaces the calculation of the QGT by solving a fidelity-based optimization to compute updates to the dynamics in each time step. We demonstrate our algorithm for the time evolution of the Heisenberg Hamiltonian and show that it accurately reproduces the system dynamics at a fraction of the cost of standard variational quantum time evolution algorithms. Published by the American Physical Society 2024
- 5 February 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (1) , 013143
Open AccessVariational quantum time evolution without the quantum geometric tensor
Real- and imaginary-time quantum state evolutions are crucial in physics and chemistry for exploring quantum dynamics, preparing ground states, and computing thermodynamic observables. On near-term devices, variational quantum time evolution is a promising candidate for these tasks, as the required circuit model can be tailored to the available devices' capabilities. Due to the evaluation of the quantum geometric tensor (QGT), however, this approach quickly becomes infeasible for relevant system sizes. Here, we propose a dual formulation for variational time evolution, which replaces the calculation of the QGT by solving a fidelity-based optimization to compute updates to the dynamics in each time step. We demonstrate our algorithm for the time evolution of the Heisenberg Hamiltonian and show that it accurately reproduces the system dynamics at a fraction of the cost of standard variational quantum time evolution algorithms. Published by the American Physical Society 2024
- Open Access
Provable bounds for noise-free expectation values computed from noisy samples
In this paper, we explore the impact of noise on quantum computing, particularly focusing on the challenges when sampling bit strings from noisy quantum computers as well as the implications for optimization and machine learning applications. We formally quantify the sampling overhead to extract good samples from noisy quantum computers and relate it to the layer fidelity, a metric to determine the performance of noisy quantum processors. Further, we show how this allows us to use the Conditional Value at Risk of noisy samples to determine provable bounds on noise-free expectation values. We discuss how to leverage these bounds for different algorithms and demonstrate our findings through experiments on a real quantum computer involving up to 127 qubits. The results show a strong alignment with theoretical predictions.
Open AccessProvable bounds for noise-free expectation values computed from noisy samples
In this paper, we explore the impact of noise on quantum computing, particularly focusing on the challenges when sampling bit strings from noisy quantum computers as well as the implications for optimization and machine learning applications. We formally quantify the sampling overhead to extract good samples from noisy quantum computers and relate it to the layer fidelity, a metric to determine the performance of noisy quantum processors. Further, we show how this allows us to use the Conditional Value at Risk of noisy samples to determine provable bounds on noise-free expectation values. We discuss how to leverage these bounds for different algorithms and demonstrate our findings through experiments on a real quantum computer involving up to 127 qubits. The results show a strong alignment with theoretical predictions.