Zobrazeno 1 - 10
of 386
pro vyhledávání: '"Lechner, Wolfgang"'
Autor:
Domínguez, Federico, Fellner, Michael, Klaver, Berend, Rombouts, Stefan, Ertler, Christian, Lechner, Wolfgang
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. This has a significant impact on the execution time of quantum circuits
Externí odkaz:
http://arxiv.org/abs/2410.16382
We propose a scalable encoding of combinatorial optimization problems with arbitrary connectivity, including higher-order terms, on arrays of trapped neutral atoms requiring only a global laser drive. Our approach relies on modular arrangements of a
Externí odkaz:
http://arxiv.org/abs/2410.03902
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
One of the main bottlenecks in solving combinatorial optimization problems with quantum annealers is the qubit connectivity in the hardware. A possible solution for larger connectivty is minor embedding. This techniques makes the geometrical properti
Externí odkaz:
http://arxiv.org/abs/2405.14746
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
Autor:
Dreier, Florian, Lechner, Wolfgang
In this article, we establish a mathematical framework that utilizes concepts from graph theory to define the parity transformation as a mapping that encompasses all possible compiled hypergraphs, and investigate uniqueness properties of this mapping
Externí odkaz:
http://arxiv.org/abs/2401.11980
Parity compilation is the challenge of laying out the required constraints for the parity mapping in a local way. We present the first constructive compilation algorithm for the parity architecture using plaquettes for arbitrary higher-order optimiza
Externí odkaz:
http://arxiv.org/abs/2307.10626
We present tools and methods to generalize parity compilation to digital quantum computing devices with arbitrary connectivity graphs and construct circuit implementations for the constraint Hamiltonian of higher-order constrained binary optimization
Externí odkaz:
http://arxiv.org/abs/2304.12879