Zobrazeno 1 - 10
of 361
pro vyhledávání: '"Lechner, Wolfgang"'
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
Publikováno v:
Phys. Rev. Research 6, 023026 (2024)
An important aspect that strongly impacts the experimental feasibility of quantum circuits is the ratio of gate times and typical error time scales. Algorithms with circuit depths that significantly exceed the error time scales will result in faulty
Externí odkaz:
http://arxiv.org/abs/2304.01756
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
Autor:
Dominguez, Federico, Unger, Josua, Traube, Matthias, Mant, Barry, Ertler, Christian, Lechner, Wolfgang
Publikováno v:
Front. Quantum. Sci. Technol. 2 (2023)
We present an encoding and hardware-independent formulation of optimization problems for quantum computing. Using this generalized approach, we present an extensive library of optimization problems and their various derived spin encodings. Common bui
Externí odkaz:
http://arxiv.org/abs/2302.03711