arXiv subjects

Verena Feulner

Publications and source records attributed to Verena Feulner.

4 recordsLinked to original sources

arXiv2026

Quantum gates with parametrically driven multi-qubit couplers

Superconducting quantum processors could significantly profit from enhanced connectivity together with precise control of interactions and gates between qubits. Here we investigate plaquettes of four qubits that are coupled via a central tunable coupling circuit, so that not only gates between qubits connected by an edge of the plaquette can be executed but also between qubits across the diagonal. By numerically and analytically analyzing parametrically driven processes, we explore $\sqrt{\text{iSWAP}}$-gates between any pair of qubits, also across the diagonal, as well as three-qubit interactions and gates. For experimentally available circuit parameters, we for example find $\sqrt{\text{iSWAP}}$-gates with a gate time of 50 ns and 99.9\% fidelity, which is decreased to 99.4\% if two such gates are executed in parallel on disjoint qubit pairs in the plaquette. For three-qubit gates we find fidelities of 95\% fidelity at a gate time of 200 ns.

quant-ph↗

arXiv2025

Scalable Fluxonium-Transmon Architecture for Error Corrected Quantum Processors

We propose a hybrid quantum computing architecture composed of alternating fluxonium and transmon qubits, that are coupled via transmon tunable couplers. We show that this system offers excellent scaling properties, characterized by engineered zero $ZZ$-crosstalk in the idle regime, a substantial reduction of level-crowding challenges through the alternating arrangement of different qubit types within the lattice, and parameter regimes that circumvent the capacitive loading problem commonly associated with fluxoniums. In numerical simulations, we show a parametrically driven CZ-gate that achieves a closed-system infidelity that is orders of magnitude below the coherence limit for gate durations $\gtrsim 30\,\rm{ns}$ using a two-tone flux pulse on the tunable coupler. Furthermore, we show that this gate scheme retains its fidelity in the presence of spectator qubits, making it a scalable solution for large lattices. Moreover, for the implementation of error correcting codes, our approach can leverage the long coherence times and large non-linearities of fluxoniums as data qubits, while fixed-frequency transmons with established readout techniques can serve as measurement ancillas.

quant-ph↗

arXiv2025

Optimizing Superconducting Three-Qubit Gates for Surface-Code Error Correction

Quantum error correction (QEC) is one of the crucial building blocks for developing quantum computers that have significant potential for reaching a quantum advantage in applications. Prominent candidates for QEC are stabilizer codes for which periodic readout of stabilizer operators is typically implemented via successive two-qubit entangling gates, and is repeated many times during a computation. To improve QEC performance, it is thus beneficial to make the stabilizer readout faster and less prone to fault-tolerance-breaking errors. Here we design a 3-qubit CZZ gate for superconducting transmon qubits that maps the parity of two data qubits onto one measurement qubit in a single step. We find that the gate can be executed in a duration of $35\,$ns with a fidelity of F$=99.96 \, \%$. To optimize the gate, we use an error model obtained from the microscopic gate simulation to systematically suppress Pauli errors that are particularly harmful to the QEC protocol. Using this error model, we investigate the implementation of this 3-qubit gate in a surface code syndrome readout schedule. We find that for the rotated surface code, the implementation of CZZ gates increases the error threshold by nearly 50\% to $\approx 1.2\,\%$ and decreases the logical error rate, in the experimental relevant regime, by up to one order of magnitude, compared to the standard CZ readout protocol. We also show that for the unrotated surface code, strictly fault-tolerant readout schedules can be found. This opens a new perspective for below-threshold surface-code error correction, where it can be advantageous to use multi-qubit gates instead of two-qubit gates to obtain a better QEC performance.

quant-ph↗

arXiv2022

Variational Quantum Eigensolver Ansatz for the $J_1$-$J_2$-model

The ground state properties of the two-dimensional $J_1-J_2$-model are very challenging to analyze via classical numerical methods due to the high level of frustration. This makes the model a promising candidate where quantum computers could be helpful and possibly explore regimes that classical computers cannot reach. The $J_1-J_2$-model is a quantum spin model composed of Heisenberg interactions along the rectangular lattice edges and along diagonal edges between next-nearest neighbor spins. We propose an ansatz for the Variational Quantum Eigensolver (VQE) to approximate the ground state of an antiferromagnetic $J_1-J_2$-Hamiltonian for different lattice sizes and different ratios of $J_1$ and $J_2$. Moreover, we demonstrate that this ansatz can work without the need for gates along the diagonal next-nearest neighbor interactions. This simplification is of great importance for solid state based hardware with qubits on a rectangular grid, where it eliminates the need for SWAP gates. In addition, we provide an extrapolation for the number of gates and parameters needed for larger lattice sizes, showing that these are expected to grow less than quadratically in the qubit number up to lattice sizes which eventually can no longer be treated with classical computers.

quant-ph↗