142 citations · 159 across the 18 of their papers we have counts for
17 papers · 1 filter
Quantum Optimisation for Protein-Protein Interaction Network Alignment
Merle Stahl, Robert J. Banks, Matthias Traube +4
Protein-protein interaction (PPI) network alignment combines topological and sequence information to identify conserved modules across species, but global alignment remains challen…
Qudit extension of parameterized IQP circuits: A generative quantum machine learning approach to integer data
Robert J. Banks, Arianna Crippa, Matthias Traube +3
Parameterized Instantaneous Quantum Polynomial (IQP) circuits have proven useful in quantum generative learning models, particularly for binary distributions. However, when applied…
Parity-unfolded distillation architecture for noise-biased platforms
Konstantin Tiurev, Christoph Fleckenstein, Christophe Goeller +6
We introduce the parity-unfolded architecture, a fault-tolerant quantum computing scheme that relies on direct preparation and teleportation of small-angle rotations …
Fault-tolerant multi-qubit gates in Parity Codes
Anette Messinger, Christophe Goeller, Wolfgang Lechner
We present a set of efficiently implementable logical multi-qubit gates in concatenated quantum error correction codes using parity qubits. In particular, we show how fault-toleran…
Bundling of bipartite entanglement
Maike Drieb-Schön, Florian Dreier, Wolfgang Lechner
We investigate bipartite entanglement and prove that in constrained energy subspaces, the entanglement spectra of multiple bipartitions are the same across the whole subspace. We s…
The Parity Flow Formalism: Tracking Quantum Information Throughout Computation
Berend Klaver, Katharina Ludwig, Anette Messinger +4
We propose the Parity Flow formalism, a method for tracking the information flow in quantum circuits. This method adds labels to quantum circuit diagrams such that the action of Cl…
Optimal Decoder for the Error Correcting Parity Code
Konstantin Tiurev, Christophe Goeller, Leo Stenzel +4
We present a two-step decoder for the parity code and evaluate its performance in code-capacity and faulty-measurement settings. For noiseless measurements, we find that the decodi…
Minimally Universal Parity Quantum Computing
Isaac D. Smith, Berend Klaver, Hendrik Poulsen Nautrup +2
In parity quantum computing, multi-qubit logical gates are implemented by single-qubit rotations on a suitably encoded state involving auxiliary qubits. Consequently, there is a co…
Improving success probability in the LHZ parity embedding by computing with quantum walks
Jemma Bennett, Nicholas Chancellor, Viv Kendon +1
The LHZ parity embedding is one of the front-running methods for implementing difficult-to-engineer long-range interactions in quantum optimisation problems. Continuous-time quantu…
Connectivity-aware Synthesis of Quantum Algorithms
Florian Dreier, Christoph Fleckenstein, Gregor Aigner +5
We present a general method for the implementation of quantum algorithms that optimizes both gate count and circuit depth. Our approach introduces connectivity-adapted CNOT-based b…
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…
Quantum optimization with globally driven neutral atom arrays
Martin Lanthaler, Kilian Ender, Davit Khachatryan +5
Neutral atoms trapped in configurable tweezer arrays are a promising platform for solving hard optimization problems. While such platforms natively embed unit-disk maximum weight i…
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).…
On the uniqueness of compiling graphs under the parity transformation
Florian Dreier, Wolfgang Lechner
In this article, we establish a mathematical framework that utilizes concepts from graph theory to formalize the parity transformation, an encoding strategy for compiling optimizat…