25 citations · 107 across the 17 of their papers we have counts for
5 papers · 1 filter
Runtime Reduction in Linear Quantum Charge-Coupled Devices using the Parity Flow Formalism
Federico Domínguez, Michael Fellner, Berend Klaver +3
Using the Parity Flow formalism, we show that physical SWAP gates can be eliminated in linear hardware architectures, without increasing the total number of two-qubit operations. T…
Performance of Parity QAOA for the Signed Max-Cut Problem
Anita Weidinger, Glen Bigan Mbeng, Michael Fellner +2
The practical implementation of quantum optimization algorithms on noisy intermediate-scale quantum devices requires accounting for their limited connectivity. As such, the Parity…
SWAP-less Implementation of Quantum Algorithms
Berend Klaver, Stefan Rombouts, Michael Fellner +4
We present a formalism based on tracking the flow of parity quantum information to implement algorithms on devices with limited connectivity without qubit overhead, SWAP operations…
Fault-tolerant quantum computing with the parity code and noise-biased qubits
Anette Messinger, Valentin Torggler, Berend Klaver +2
We present a fault-tolerant universal quantum computing architecture based on a code concatenation of biased-noise qubits and the parity architecture. The parity architecture can b…
Scalable Parity Architecture With a Shuttling-Based Spin Qubit Processor
Florian Ginzel, Michael Fellner, Christian Ertler +3
Motivated by the prospect of a two-dimensional square-lattice geometry for semiconductor spin qubits, we explore the realization of the Parity Architecture with quantum dots (QDs).…