Near-Term Spin-Qubit Architecture Design via Multipartite Maximally-Entangled States

Abstract

The design and benchmarking of quantum computer architectures traditionally rely on practical hardware restrictions, such as gate fidelities, control, and cooling. At the theoretical and software levels, numerous approaches have been proposed for benchmarking quantum devices, ranging from, inter alia, quantum volume to randomized benchmarking. In this work, we utilize the quantum information-theoretic properties of multipartite maximally-entangled quantum states, in addition to their correspondence with quantum error correction codes, permitting us to quantify the entanglement generated on near-term bilinear spin-qubit architectures. For this aim, we introduce four metrics which ascertain the quality of genuine multipartite quantum entanglement, along with circuit-level fidelity measures. As part of the task of executing a quantum circuit on a device, we devise simulations which combine expected hardware characteristics of spin-qubit devices with appropriate compilation techniques; we then analyze three different architectural choices of varying lattice sizes for bilinear arrays, under three increasingly realistic noise models. We find that if the use of a compiler is assumed, sparsely-connected spin-qubit lattices can approach comparable values of our metrics to those of the most highly-connected device architecture. Even more surprisingly, by incorporating crosstalk into our last noise model, we find that, as error rates for crosstalk approach realistic values, the benefits of utilizing a bilinear array with advanced connectivity vanish. Our results highlight the limitations of adding local connectivity to near-term spin-qubit devices, and can be readily adapted to other qubit technologies. The framework developed here can be used for analyzing quantum entanglement on a device before fabrication, informing experimentalists on concomitant realistic expectations.

References in corpus (17)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Surface codes: Towards practical large-scale quantum computation
• Entanglement detection
• Sudden Death of Entanglement
• Multi-party entanglement in graph states
• Robust randomized benchmarking of quantum processes
• Experimental Comparison of Two Quantum Computing Architectures
• Critical properties of the measurement-induced transition in random quantum circuits
• Low-distance Surface Codes under Realistic Quantum Noise
• Bell Inequalities for Graph States
• Multi-Qubit Systems: Highly Entangled States and Entanglement Distribution
• A Reconfigurable Gate Architecture for Si/SiGe Quantum Dots
• Early Fault-Tolerant Quantum Computing
• Towards early fault tolerance on a 2$\times$N array of qubits equipped with shuttling
• beSnake: A routing algorithm for scalable spin-qubit architectures
• Lift-Connected Surface Codes
• Lightcone Bounds for Quantum Circuit Mapping via Uncomplexity

Cited by in corpus (5)

• Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes
• Quantum Circuits for High-Dimensional Absolutely Maximally Entangled States
• Absolutely maximally entangled pure states of multipartite quantum systems
• Scalable and fault-tolerant preparation of encoded k-uniform states
• Exploring Entanglement Spectrum and Phase Diagram in multi-electron Quantum Dot Chains