Here are some scientific papers that caught our eye this month:
Current designs in neutral-atom quantum computing realize quantum circuits by anticipating the local addressing of individual atoms which has proven tricky to implement. One prominent solution to this is shuttling atoms into entangling zones. This work proposes a new scheme that doesn’t require shuttling nor such addressing, using fixed 1D chains of dual-species atoms acting as logical qubits. An exciting benefit of this scheme is that there is only polynomial overhead in the number of atoms and laser pulses required to execute a given quantum circuit.
Entanglement is a key feature of quantum systems, responsible for much of the envisioned power of quantum computers. Yet, characterizing entanglement for large quantum systems is a difficult problem, often requiring the exact determination of a wave function, a very hard process (tomography). In this work, the Austria-based team demonstrates a sample-efficient method to characterize the entanglement in a quantum system with as many as 51 qubits.
Dynamically Field Programmable Qubit Arrays offer great flexibility for quantum computing, allowing atoms to be moved and entangled with each other with all-to-all connectivity. To bring this architecture to its full fruition, a big question is the optimal way to determine the ideal moving paths, schedule, and rest locations of atoms according to a circuit of interest, while satisfying geometrical and other physical constraints. This is a circuit compilation problem. In this work, the authors present an efficient solution to this problem by first discretizing the time and space for atoms and their interactions (thereby turning them into variables) and then seeking assignments to these variables that satisfy the aforementioned constraints.
.svg){kind=small}
