Matthias Rosenkranz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Matthias Rosenkranz has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Marcello Benedetti
Quantinuum Partnership House Carlisle Place SW1P 1BX London United Kingdom
8 shared publications - Mattia Fiorentini
Rigetti Computing, 775 Heinz Ave, Berkeley, CA 94710, USA
4 shared publications - Michael Lubasch
Quantinuum
4 shared publications - David Amaro
Quantinuum, Partnership House, Carlisle Place, London SW1P 1BX, United Kingdom
3 shared publications - Yuta Kikuchi
Quantinuum K.K.
3 shared publications Benjamin Obert
2 shared publications
Latest Publications
- Open Access
- 5 September 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1) , 10557
Unconditional and exponentially large violation of classicality
Testing the predictions of quantum mechanics has been one of the main experimental endeavors for decades. Recent advancements in technology have led to a number of demonstrations that test non-classicality via specific computational tasks. Limitations of these experiments include dependence on complexity theory assumptions, susceptibility to hardware noise, and inefficient verification, raising questions about their scalability. We propose to test non-classicality using a game based on complement sampling, an efficiently verifiable problem that achieves the largest possible separation between quantum and classical computation when both input and output represent samples from probability distributions. When restricting the input to instances inspired by the Bernstein-Vazirani problem, our game admits an exponentially large violation of classicality unconditionally, i.e., without relying on computational hardness assumptions. We demonstrate the game on Quantinuum System Model H2 trapped-ion quantum computers, with experiments consisting of thousands of different circuits on up to 55 qubits. The observed scores can be explained by a systematic adoption of a quantum strategy, further corroborating the quantum nature of the hardware in an efficient and scalable way.
- 5 September 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1) , 10557
Open AccessUnconditional and exponentially large violation of classicality
Testing the predictions of quantum mechanics has been one of the main experimental endeavors for decades. Recent advancements in technology have led to a number of demonstrations that test non-classicality via specific computational tasks. Limitations of these experiments include dependence on complexity theory assumptions, susceptibility to hardware noise, and inefficient verification, raising questions about their scalability. We propose to test non-classicality using a game based on complement sampling, an efficiently verifiable problem that achieves the largest possible separation between quantum and classical computation when both input and output represent samples from probability distributions. When restricting the input to instances inspired by the Bernstein-Vazirani problem, our game admits an exponentially large violation of classicality unconditionally, i.e., without relying on computational hardness assumptions. We demonstrate the game on Quantinuum System Model H2 trapped-ion quantum computers, with experiments consisting of thousands of different circuits on up to 55 qubits. The observed scores can be explained by a systematic adoption of a quantum strategy, further corroborating the quantum nature of the hardware in an efficient and scalable way.
- Open Access
- 4 August 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (3) , 035063
Sparsity-dependent complexity lower bound of quantum linear system solvers
Quantum linear system (QLS) solvers are a fundamental class of quantum algorithms used in many potential quantum computing applications, including machine learning and solving differential equations. The performance of quantum algorithms is often measured by their query complexity, which quantifies the number of oracle calls required to access the input. The main parameters determining the complexity of QLS solvers are the condition number κ and sparsity s of the linear system, and the target error ϵ . To date, the best known query-complexity lower bound is Ω ( κ log ( 1 / ϵ ) ) , which establishes the optimality of the most recent QLS solvers. The original proof of this lower bound is attributed to Harrow and Kothari, but their result is unpublished. Furthermore, when discussing a more general lower bound including the sparsity s of the linear system, it has become folklore that it should read as Ω ( κ s log ( 1 / ϵ ) ) . In this work, we establish the rigorous lower bound capturing the sparsity dependence of QLS. We prove the lower bound of Ω ( κ s ) for any quantum algorithm that solves QLS with constant error via a reduction of the bounded-error PARITY ∘ OR problem. While the dependence on all parameters κ , s , ϵ remains an open problem, our result provides a crucial stepping stone toward the complete characterization of QLS complexity.
- 4 August 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (3) , 035063
Open AccessSparsity-dependent complexity lower bound of quantum linear system solvers
Quantum linear system (QLS) solvers are a fundamental class of quantum algorithms used in many potential quantum computing applications, including machine learning and solving differential equations. The performance of quantum algorithms is often measured by their query complexity, which quantifies the number of oracle calls required to access the input. The main parameters determining the complexity of QLS solvers are the condition number κ and sparsity s of the linear system, and the target error ϵ . To date, the best known query-complexity lower bound is Ω ( κ log ( 1 / ϵ ) ) , which establishes the optimality of the most recent QLS solvers. The original proof of this lower bound is attributed to Harrow and Kothari, but their result is unpublished. Furthermore, when discussing a more general lower bound including the sparsity s of the linear system, it has become folklore that it should read as Ω ( κ s log ( 1 / ϵ ) ) . In this work, we establish the rigorous lower bound capturing the sparsity dependence of QLS. We prove the lower bound of Ω ( κ s ) for any quantum algorithm that solves QLS with constant error via a reduction of the bounded-error PARITY ∘ OR problem. While the dependence on all parameters κ , s , ϵ remains an open problem, our result provides a crucial stepping stone toward the complete characterization of QLS complexity.
- Open Access
- 16 April 2026
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 25 (4)
Probabilistic quantum algorithm for Lyapunov equations and matrix inversion
We present a probabilistic quantum algorithm for preparing mixed states which, in expectation, are proportional to the solutions of Lyapunov equations—linear matrix equations ubiquitous in the analysis of classical and quantum dynamical systems. Building on previous results by Zhang , , at each step the algorithm can (i) return the current state, (ii) apply a trace nonincreasing completely positive map, or (iii) restart. We introduce a deterministic stopping rule, which leads to an efficient algorithm with a bounded expected number of calls to oracles representing the two input matrices of the Lyapunov equations. We also consider preparing a mixed state that approximates the normalized inverse of a positive definite matrix A . In its most general form, the algorithm generates mixed states, which approximate matrix-valued weighted sums and integrals. It can be shown that block encodings and states yield two incomparable computational resources even when they represent the same piece of data. While block encodings of functions have received much attention in the literature, our work takes a step toward the less explored problem of encoding functions into mixed states.
- 16 April 2026
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 25 (4)
Open AccessProbabilistic quantum algorithm for Lyapunov equations and matrix inversion
We present a probabilistic quantum algorithm for preparing mixed states which, in expectation, are proportional to the solutions of Lyapunov equations—linear matrix equations ubiquitous in the analysis of classical and quantum dynamical systems. Building on previous results by Zhang , , at each step the algorithm can (i) return the current state, (ii) apply a trace nonincreasing completely positive map, or (iii) restart. We introduce a deterministic stopping rule, which leads to an efficient algorithm with a bounded expected number of calls to oracles representing the two input matrices of the Lyapunov equations. We also consider preparing a mixed state that approximates the normalized inverse of a positive definite matrix A . In its most general form, the algorithm generates mixed states, which approximate matrix-valued weighted sums and integrals. It can be shown that block encodings and states yield two incomparable computational resources even when they represent the same piece of data. While block encodings of functions have received much attention in the literature, our work takes a step toward the less explored problem of encoding functions into mixed states.
- Open Access
- 29 August 2025
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 9, 1843
Lindblad engineering for quantum Gibbs state preparation under the eigenstate thermalization hypothesis
Building upon recent progress in Lindblad engineering for quantum Gibbs state preparation algorithms, we propose a simplified protocol that is shown to be efficient under the eigenstate thermalization hypothesis (ETH). The ETH reduces circuit overheads of the Lindblad simulation algorithm and ensures a fast convergence toward the target Gibbs state. Moreover, we show that the realized Lindblad dynamics exhibits an inherent resilience against stochastic noise, opening up the path to a first demonstration on quantum computers. We complement our claims with numerical studies of the algorithm's convergence in various regimes of the mixed-field Ising model. In line with our predictions, we observe a mixing time scaling polynomially with system size when the ETH is satisfied. In addition, we assess the impact of algorithmic and hardware-induced errors on the algorithm's performance by carrying out quantum circuit simulations of our Lindblad simulation protocol with a local depolarizing noise model. This work bridges the gap between recent theoretical advances in dissipative Gibbs state preparation algorithms and their eventual quantum hardware implementation.
- 29 August 2025
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 9, 1843
Open AccessLindblad engineering for quantum Gibbs state preparation under the eigenstate thermalization hypothesis
Building upon recent progress in Lindblad engineering for quantum Gibbs state preparation algorithms, we propose a simplified protocol that is shown to be efficient under the eigenstate thermalization hypothesis (ETH). The ETH reduces circuit overheads of the Lindblad simulation algorithm and ensures a fast convergence toward the target Gibbs state. Moreover, we show that the realized Lindblad dynamics exhibits an inherent resilience against stochastic noise, opening up the path to a first demonstration on quantum computers. We complement our claims with numerical studies of the algorithm's convergence in various regimes of the mixed-field Ising model. In line with our predictions, we observe a mixing time scaling polynomially with system size when the ETH is satisfied. In addition, we assess the impact of algorithmic and hardware-induced errors on the algorithm's performance by carrying out quantum circuit simulations of our Lindblad simulation protocol with a local depolarizing noise model. This work bridges the gap between recent theoretical advances in dissipative Gibbs state preparation algorithms and their eventual quantum hardware implementation.
- Open Access
- 9 April 2025
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 9, 1703
Quantum state preparation for multivariate functions
A fundamental step of any quantum algorithm is the preparation of qubit registers in a suitable initial state. Often qubit registers represent a discretization of continuous variables and the initial state is defined by a multivariate function. We develop protocols for preparing quantum states whose amplitudes encode multivariate functions by linearly combining block-encodings of Fourier and Chebyshev basis functions. Without relying on arithmetic circuits, quantum Fourier transforms, or multivariate quantum signal processing, our algorithms are simpler and more effective than previous proposals. We analyze requirements both asymptotically and pragmatically in terms of near/medium-term resources. Numerically, we prepare bivariate Student's t-distributions, 2D Ricker wavelets and electron wavefunctions in a 3D Coulomb potential, which are initial states with potential applications in finance, physics and chemistry simulations. Finally, we prepare bivariate Gaussian distributions on the Quantinuum H2-1 trapped-ion quantum processor using 24 qubits and up to 237 two-qubit gates.
- 9 April 2025
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 9, 1703
Open AccessQuantum state preparation for multivariate functions
A fundamental step of any quantum algorithm is the preparation of qubit registers in a suitable initial state. Often qubit registers represent a discretization of continuous variables and the initial state is defined by a multivariate function. We develop protocols for preparing quantum states whose amplitudes encode multivariate functions by linearly combining block-encodings of Fourier and Chebyshev basis functions. Without relying on arithmetic circuits, quantum Fourier transforms, or multivariate quantum signal processing, our algorithms are simpler and more effective than previous proposals. We analyze requirements both asymptotically and pragmatically in terms of near/medium-term resources. Numerically, we prepare bivariate Student's t-distributions, 2D Ricker wavelets and electron wavefunctions in a 3D Coulomb potential, which are initial states with potential applications in finance, physics and chemistry simulations. Finally, we prepare bivariate Gaussian distributions on the Quantinuum H2-1 trapped-ion quantum processor using 24 qubits and up to 237 two-qubit gates.
- Open Access
- 19 November 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (4)
Noisy intermediate-scale quantum simulation of the one-dimensional wave equation
We design and implement quantum circuits for the simulation of the one-dimensional wave equation on the Quantinuum H1-1 quantum computer. The circuit depth of our approach scales as O ( n 2 ) for n qubits representing the solution on 2 n grid points, and leads to infidelities of O ( 2 − 4 n t 2 ) for simulation time t assuming smooth initial conditions. By varying the qubit count we study the interplay between the algorithmic and physical gate errors to identify the optimal working point of minimum total error. Our approach to simulating the wave equation can be used with appropriate state preparation algorithms across different quantum processors and serve as an application-oriented benchmark. Published by the American Physical Society 2024
- 19 November 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (4)
Open AccessNoisy intermediate-scale quantum simulation of the one-dimensional wave equation
We design and implement quantum circuits for the simulation of the one-dimensional wave equation on the Quantinuum H1-1 quantum computer. The circuit depth of our approach scales as O ( n 2 ) for n qubits representing the solution on 2 n grid points, and leads to infidelities of O ( 2 − 4 n t 2 ) for simulation time t assuming smooth initial conditions. By varying the qubit count we study the interplay between the algorithmic and physical gate errors to identify the optimal working point of minimum total error. Our approach to simulating the wave equation can be used with appropriate state preparation algorithms across different quantum processors and serve as an application-oriented benchmark. Published by the American Physical Society 2024
- Open Access
- 12 April 2023
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 4 (2) , 025007
Bayesian learning of parameterised quantum circuits
Currently available quantum computers suffer from constraints including hardware noise and a limited number of qubits. As such, variational quantum algorithms that utilise a classical optimiser in order to train a parameterised quantum circuit have drawn significant attention for near-term practical applications of quantum technology. In this work, we take a probabilistic point of view and reformulate the classical optimisation as an approximation of a Bayesian posterior. The posterior is induced by combining the cost function to be minimised with a prior distribution over the parameters of the quantum circuit. We describe a dimension reduction strategy based on a maximum a posteriori point estimate with a Laplace prior. Experiments on the Quantinuum H1-2 computer show that the resulting circuits are faster to execute and less noisy than the circuits trained without the dimension reduction strategy. We subsequently describe a posterior sampling strategy based on stochastic gradient Langevin dynamics. Numerical simulations on three different problems show that the strategy is capable of generating samples from the full posterior and avoiding local optima.
- 12 April 2023
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 4 (2) , 025007
Open AccessBayesian learning of parameterised quantum circuits
Currently available quantum computers suffer from constraints including hardware noise and a limited number of qubits. As such, variational quantum algorithms that utilise a classical optimiser in order to train a parameterised quantum circuit have drawn significant attention for near-term practical applications of quantum technology. In this work, we take a probabilistic point of view and reformulate the classical optimisation as an approximation of a Bayesian posterior. The posterior is induced by combining the cost function to be minimised with a prior distribution over the parameters of the quantum circuit. We describe a dimension reduction strategy based on a maximum a posteriori point estimate with a Laplace prior. Experiments on the Quantinuum H1-2 computer show that the resulting circuits are faster to execute and less noisy than the circuits trained without the dimension reduction strategy. We subsequently describe a posterior sampling strategy based on stochastic gradient Langevin dynamics. Numerical simulations on three different problems show that the strategy is capable of generating samples from the full posterior and avoiding local optima.
- Open Access
- 17 March 2022
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 6, 670
Variational quantum amplitude estimation
We propose to perform amplitude estimation with the help of constant-depth quantum circuits that variationally approximate states during amplitude amplification. In the context of Monte Carlo (MC) integration, we numerically show that shallow circuits can accurately approximate many amplitude amplification steps. We combine the variational approach with maximum likelihood amplitude estimation [Y. Suzuki et al., Quantum Inf. Process. 19, 75 (2020)] in variational quantum amplitude estimation (VQAE). VQAE typically has larger computational requirements than classical MC sampling. To reduce the variational cost, we propose adaptive VQAE and numerically show in 6 to 12 qubit simulations that it can outperform classical MC sampling.
- 17 March 2022
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 6, 670
Open AccessVariational quantum amplitude estimation
We propose to perform amplitude estimation with the help of constant-depth quantum circuits that variationally approximate states during amplitude amplification. In the context of Monte Carlo (MC) integration, we numerically show that shallow circuits can accurately approximate many amplitude amplification steps. We combine the variational approach with maximum likelihood amplitude estimation [Y. Suzuki et al., Quantum Inf. Process. 19, 75 (2020)] in variational quantum amplitude estimation (VQAE). VQAE typically has larger computational requirements than classical MC sampling. To reduce the variational cost, we propose adaptive VQAE and numerically show in 6 to 12 qubit simulations that it can outperform classical MC sampling.
- Open Access
A case study of variational quantum algorithms for a job shop scheduling problem
Combinatorial optimization models a vast range of industrial processes aiming at improving their efficiency. In general, solving this type of problem exactly is computationally intractable. Therefore, practitioners rely on heuristic solution approaches. Variational quantum algorithms are optimization heuristics that can be demonstrated with available quantum hardware. In this case study, we apply four variational quantum heuristics running on IBM's superconducting quantum processors to the job shop scheduling problem. Our problem optimizes a steel manufacturing process. A comparison on 5 qubits shows that the recent filtering variational quantum eigensolver (F-VQE) converges faster and samples the global optimum more frequently than the quantum approximate optimization algorithm (QAOA), the standard variational quantum eigensolver (VQE), and variational quantum imaginary time evolution (VarQITE). Furthermore, F-VQE readily solves problem sizes of up to 23 qubits on hardware without error mitigation post processing.
Open AccessA case study of variational quantum algorithms for a job shop scheduling problem
Combinatorial optimization models a vast range of industrial processes aiming at improving their efficiency. In general, solving this type of problem exactly is computationally intractable. Therefore, practitioners rely on heuristic solution approaches. Variational quantum algorithms are optimization heuristics that can be demonstrated with available quantum hardware. In this case study, we apply four variational quantum heuristics running on IBM's superconducting quantum processors to the job shop scheduling problem. Our problem optimizes a steel manufacturing process. A comparison on 5 qubits shows that the recent filtering variational quantum eigensolver (F-VQE) converges faster and samples the global optimum more frequently than the quantum approximate optimization algorithm (QAOA), the standard variational quantum eigensolver (VQE), and variational quantum imaginary time evolution (VarQITE). Furthermore, F-VQE readily solves problem sizes of up to 23 qubits on hardware without error mitigation post processing.
- Open Access
- 10 February 2022
- Published by Springer Nature in EPJ Quantum Technology
- Vol. 9 (1) , 1-20
A case study of variational quantum algorithms for a job shop scheduling problem
Combinatorial optimization models a vast range of industrial processes aiming at improving their efficiency. In general, solving this type of problem exactly is computationally intractable. Therefore, practitioners rely on heuristic solution approaches. Variational quantum algorithms are optimization heuristics that can be demonstrated with available quantum hardware. In this case study, we apply four variational quantum heuristics running on IBM’s superconducting quantum processors to the job shop scheduling problem. Our problem optimizes a steel manufacturing process. A comparison on 5 qubits shows that the recent filtering variational quantum eigensolver (F-VQE) converges faster and samples the global optimum more frequently than the quantum approximate optimization algorithm (QAOA), the standard variational quantum eigensolver (VQE), and variational quantum imaginary time evolution (VarQITE). Furthermore, F-VQE readily solves problem sizes of up to 23 qubits on hardware without error mitigation post processing.
- 10 February 2022
- Published by Springer Nature in EPJ Quantum Technology
- Vol. 9 (1) , 1-20
Open AccessA case study of variational quantum algorithms for a job shop scheduling problem
Combinatorial optimization models a vast range of industrial processes aiming at improving their efficiency. In general, solving this type of problem exactly is computationally intractable. Therefore, practitioners rely on heuristic solution approaches. Variational quantum algorithms are optimization heuristics that can be demonstrated with available quantum hardware. In this case study, we apply four variational quantum heuristics running on IBM’s superconducting quantum processors to the job shop scheduling problem. Our problem optimizes a steel manufacturing process. A comparison on 5 qubits shows that the recent filtering variational quantum eigensolver (F-VQE) converges faster and samples the global optimum more frequently than the quantum approximate optimization algorithm (QAOA), the standard variational quantum eigensolver (VQE), and variational quantum imaginary time evolution (VarQITE). Furthermore, F-VQE readily solves problem sizes of up to 23 qubits on hardware without error mitigation post processing.