Depth-Optimal Addressing of 2D Qubit Array with 1D Controls Based on Exact Binary Matrix Factorization

Abstract

Reducing control complexity is essential for achieving large-scale quantum computing. However, reducing control knobs may compromise the ability to independently address each qubit. Recent progress in neutral atom-based platforms suggests that rectangular (row-column) addressing may strike a balance between control granularity and flexibility for 2D qubit arrays. This scheme allows addressing qubits on the intersections of a set of rows and columns each time. While quadratically reducing controls, it may necessitate more depth. We formulate the depth-optimal rectangular addressing problem as exact binary matrix factorization, an NP-hard problem also appearing in communication complexity and combinatorial optimization. We introduce a satisfiability modulo theories-based solver for this problem, and a heuristic, row packing, performing close to the optimal solver on various benchmarks. Furthermore, we discuss rectangular addressing in the context of fault-tolerant quantum computing, leveraging a natural two-level structure.

References in corpus (10)

• Surface codes: Towards practical large-scale quantum computation
• Logical quantum processor based on reconfigurable atom arrays
• Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator
• Demonstration of multi-qubit entanglement and algorithms on a programmable neutral atom quantum computer
• Cryogenic Control Architecture for Large-Scale Quantum Computing
• Scalable quantum circuit and control for a superconducting surface code
• NIMFA: A Python Library for Nonnegative Matrix Factorization
• Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors
• Nonnegative Rank vs. Binary Rank
• A divide-and-conquer algorithm for binary matrix completion

Cited by in corpus (4)

• Computational Capabilities and Compiler Development for Neutral Atom Quantum Processors: Connecting Tool Developers and Hardware Experts
• Compilation for Dynamically Field-Programmable Qubit Arrays with Efficient and Provably Near-Optimal Scheduling
• Reuse-Aware Compilation for Zoned Quantum Architectures Based on Neutral Atoms
• Routing-Aware Placement for Zoned Neutral Atom-based Quantum Computing