Scalable parity architecture with a shuttling-based spin qubit processor

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. We present sequences of spin shuttling and quantum gates that implement the parity quantum approximate optimization algorithm (QAOA) on a lattice constructed of identical unit cells, such that the circuit depth is always constant. We further develop a detailed error model for a hardware-specific analysis of the parity architecture, and we estimate the errors during one round of parity QAOA. The model includes a general description of the shuttling errors as a function of the probability distribution function of the valley splitting, which is the main limitation for the performance. We compare our approach to a superconducting transmon qubit chip, and we find that with high-fidelity spin shuttling the performance of the spin qubits is competitive or even exceeds the results of the transmons. Finally, we discuss the possibility of decoding the logical quantum state and of quantum error mitigation. We find that already with near-term spin qubit devices, a sufficiently low physical error probability can be expected to reliably perform parity QAOA with a short depth in a regime where the success probability compares favorably to standard QAOA.

Authors

Institutions

Publication Details

Journal
Physical review. B./Physical review. B
Published
2024-08-05
DOI
https://doi.org/10.1103/physrevb.110.075302
Citations
2
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.69

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Scalable parity architecture with a shuttling-based spin qubit processor

Hendrik Bluhm, Wolfgang Lechner, Florian Ginzel, Lars R. Schreiber et al.
2 citations
Physical review. B./Physical review. B
Quantum Computing Algorithms and Architecture
0.69
article

Scalable parity architecture with a shuttling-based spin qubit processor

Hendrik Bluhm, Wolfgang Lechner, Florian Ginzel, Lars R. Schreiber, Michael Fellner, Christian Ertler
article en
2 citations

Abstract

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. We present sequences of spin shuttling and quantum gates that implement the parity quantum approximate optimization algorithm (QAOA) on a lattice constructed of identical unit cells, such that the circuit depth is always constant. We further develop a detailed error model for a hardware-specific analysis of the parity architecture, and we estimate the errors during one round of parity QAOA. The model includes a general description of the shuttling errors as a function of the probability distribution function of the valley splitting, which is the main limitation for the performance. We compare our approach to a superconducting transmon qubit chip, and we find that with high-fidelity spin shuttling the performance of the spin qubits is competitive or even exceeds the results of the transmons. Finally, we discuss the possibility of decoding the logical quantum state and of quantum error mitigation. We find that already with near-term spin qubit devices, a sufficiently low physical error probability can be expected to reliably perform parity QAOA with a short depth in a regime where the success probability compares favorably to standard QAOA.

Physical review. B./Physical review. BVol. 110(7)
Universität Innsbruck (AT), Quantum Design (Germany) (DE)
Deutsche Forschungsgemeinschaft, Bundesministerium für Bildung und Forschung, Austrian Science Fund, Österreichische Forschungsförderungsgesellschaft, Horizon 2020
Affordable and clean energy
Openalex Percentile: Top 25%
Quantum Computing Algorithms and Architecture
0.69
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.