arXiv subjects

Frank Wilhelm-Mauch

Publications and source records attributed to Frank Wilhelm-Mauch.

5 recordsLinked to original sources

arXiv2026

Parametric two-qubit gates via Landau-Zener interference

We propose and demonstrate gates between two superconducting qubits based on quantum interference of consecutive Landau-Zener (LZ) transitions. This gate mechanism bridges between baseband and parametric two-qubit control, enabling in situ tuning of the control frequency across a continuous interval up to hundreds of MHz. Another advantage compared to dispersive couplers is that the speed of the LZ gate is on the order of the full coupling strength. We experimentally demonstrate the gate on two platforms, a modular chiplet architecture of coupled generalized flux qubits, and on a monolithic transmon architecture. The combination of tunability and gate speed establishes the LZ gate as a unique tool for multiplexing control pulses and interconnecting superconducting chiplet architectures.

quant-ph↗

arXiv2025

The EU Quantum Flagship's Key Performance Indicators for Quantum Computing

As quantum processors continue to scale in size and complexity, the need for well-defined, reproducible, and technology-agnostic performance metrics becomes increasingly critical. Here we present a suite of scalable quantum computing benchmarks developed as key performance indicators (KPIs) within the EU Quantum Flagship. These proposed benchmarks are designed to assess holistic system performance rather than isolated components, and to remain applicable across both noisy intermediate-scale quantum (NISQ) devices and future fault-tolerant architectures. We introduce four core benchmarks addressing complementary aspects of quantum computing capability: large multi-qubit circuit execution via a Clifford Volume benchmark, scalable multipartite entanglement generation through GHZ-state preparation, a benchmark based on the application of Shor's period-finding subroutine to simple functions, and a protocol quantifying the benefit of quantum error correction using Bell states. Each benchmark is accompanied by clearly specified protocols, reporting standards, and scalable evaluation methods. Together, these KPIs provide a coherent framework for transparent and fair performance assessment across quantum hardware platforms and for tracking progress late-NISQ toward early fault-tolerant quantum computation.

quant-ph↗

arXiv2021

Using gradient-based algorithms to determine ground state energies on a quantum computer

Variational algorithms are promising candidates to be implemented on near-term quantum computers. The variational quantum eigensolver (VQE) is a prominent example, where a parametrized trial state of the quantum mechanical wave function is optimized to obtain the ground state energy. In our work, we investigate the variational Hamiltonian Ansatz (VHA), where the trial state is given by a non-interacting reference state modified by unitary rotations using generators that are part of the Hamiltonian describing the system. The lowest energy is obtained by optimizing the angles of those unitary rotations. A standard procedure to optimize the variational parameters is to use gradient-based algorithms. However, shot noise and the intrinsic noise of the quantum device affect the evaluation of the required gradients. We studied how different methods for obtaining the gradient, specifically the finite-difference and the parameter-shift rule, are affected by shot noise and noise of the quantum computer. To this end, we simulated a simple quantum circuit, as well as the 2-site and 6-site Hubbard model.

quant-ph↗

arXiv2019

Finding the ground state of the Hubbard model by variational methods on a quantum computer with gate errors

A key goal of digital quantum computing is the simulation of fermionic systems such as molecules or the Hubbard model. Unfortunately, for present and near-future quantum computers the use of quantum error correction schemes is still out of reach. Hence, the finite error rate limits the use of quantum computers to algorithms with a low number of gates. The variational Hamiltonian ansatz (VHA) has been shown to produce the ground state in good approximation in a manageable number of steps. Here we study explicitly the effect of gate errors on its performance. The VHA is inspired by the adiabatic quantum evolution under the influence of a time-dependent Hamiltonian, where the - ideally short - fixed Trotter time steps are replaced by variational parameters. The method profits substantially from quantum variational error suppression, e.g., unitary quasi-static errors are mitigated within the algorithm. We test the performance of the VHA when applied to the Hubbard model in the presence of unitary control errors on quantum computers with realistic gate fidelities.

quant-ph↗

arXiv2018

Effects of gate errors in digital quantum simulations of fermionic systems

Digital quantum simulations offer exciting perspectives for the study of fermionic systems such as molecules or lattice models. However, with quantum error correction still being out of reach with present-day technology, a non-vanishing error rate is inevitable. We study the influence of gate errors on simulations of the Trotterized time evolution of the quantum system with focus on the fermionic Hubbard model. Specifically, we consider the effect of stochastic over-rotations in the applied gates. Depending on the particular algorithm implemented such gate errors may lead to a time evolution that corresponds to a disordered fermionic system, or they may correspond to unphysical errors, e.g., violate particle number conservation. We substantiate our analysis by numerical simulations of model systems. In addition we establish the relation between the gate fidelity and the strength of the over-rotations in a Trotterized quantum simulation. Based on this we provide estimates for the maximum number of Trotter steps which can be performed with sufficient accuracy for a given algorithm. This in turn implies, apart from obvious limitations on the maximum time of the simulation, also limits on the system size which can be handled.

quant-ph↗