Zobrazeno 1 - 10
of 110
pro vyhledávání: '"Fellner, Michael"'
The practical implementation of quantum optimization algorithms on noisy intermediate-scale quantum devices requires accounting for their limited connectivity. As such, the Parity architecture was introduced to overcome this limitation by encoding bi
Externí odkaz:
http://arxiv.org/abs/2409.14786
Autor:
Klaver, Berend, Rombouts, Stefan, Fellner, Michael, Messinger, Anette, Ender, Kilian, Ludwig, Katharina, Lechner, Wolfgang
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 or shuttling. Instead, we leverage the fact that entangling gates not
Externí odkaz:
http://arxiv.org/abs/2408.10907
We present a fault-tolerant universal quantum computing architecture based on a code concatenation of noise-biased qubits and the parity architecture. The parity architecture can be understood as a LDPC code tailored specifically to obtain any desire
Externí odkaz:
http://arxiv.org/abs/2404.11332
Autor:
Ginzel, Florian, Fellner, Michael, Ertler, Christian, Schreiber, Lars R., Bluhm, Hendrik, Lechner, Wolfgang
Publikováno v:
Physical Review B 110, 075302 (2024)
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). We present sequences of spin shuttling and quantum gates that impleme
Externí odkaz:
http://arxiv.org/abs/2403.09574
Publikováno v:
2023 IEEE International Conference on Quantum Computing and Engineering (QCE)
We present a protocol to encode and decode arbitrary quantum states in the parity architecture with constant circuit depth using measurements, local nearest-neighbor and single-qubit operations only. While this procedure typically requires a quadrati
Externí odkaz:
http://arxiv.org/abs/2303.08602
We present a construction for circuits with low gate count and depth, implementing three- and four-body Pauli-Z product operators as they appear in the form of plaquette-shaped constraints in QAOA when using the parity mapping. The circuits can be im
Externí odkaz:
http://arxiv.org/abs/2211.11287
Publikováno v:
Phys. Rev. A 106, 042442 (2022)
We demonstrate the applicability of a universal gate set in the parity encoding, which is a dual to the standard gate model, by exploring several quantum gate algorithms such as the quantum Fourier transform and quantum addition. Embedding these algo
Externí odkaz:
http://arxiv.org/abs/2205.09517
Publikováno v:
Phys. Rev. Lett. 129, 180503 (2022)
We propose a universal gate set for quantum computing with all-to-all connectivity and intrinsic robustness to bit-flip errors based on parity encoding. We show that logical controlled phase gate and $R_z$ rotations can be implemented in parity encod
Externí odkaz:
http://arxiv.org/abs/2205.09505
The parity transformation encodes spin models in the low-energy subspace of a larger Hilbert-space with constraints on a planar lattice. Applying the Quantum Approximate Optimization Algorithm (QAOA), the constraints can either be enforced explicitly
Externí odkaz:
http://arxiv.org/abs/2203.04340