Engineering Papers⌕ Search

Engineering topics

Saffman, M. (ORCID:0000000163982097)

Publications and source records attributed to Saffman, M. (ORCID:0000000163982097).

Benchmarking a neutral-atom quantum computer

In this study, we simulated the algorithmic performance of a small neutral atom quantum computer and compared its performance when operating with all-to-all versus nearest-neighbor connectivity. This comparison was made using a suite of algorithmic benchmarks developed by the Quantum Economic Development Consortium. Circuits were simulated with a noise model consistent with experimental data from [Nature 604, 457 (2022)]. We find that all-to-all connectivity improves simulated circuit fidelity by [Formula: see text]–[Formula: see text], compared to nearest-neighbor connectivity.

Computer Science↗

Multiscale architecture for fast optical addressing and control of large-scale qubit arrays

This paper presents a technique for rapid site-selective control of the quantum state of particles in a large array using the combination of a fast deflector (e.g., an acousto-optic deflector) and a relatively slow spatial light modulator (SLM). The use of SLMs for site-selective quantum state manipulation has been limited due to slow transition times that prevent rapid, consecutive quantum gates. By partitioning the SLM into multiple segments and using a fast deflector to transition between them, it is possible to substantially reduce the average time increment between scanner transitions by increasing the number of gates that can be performed for a single SLM full-frame setting. We analyzed the performance of this device in two different configurations: In configuration 1, each SLM segment addresses the full qubit array; in configuration 2, each SLM segment addresses a subarray and an additional fast deflector positions that subarray with respect to the full qubit array. With these hybrid scanners, we calculated qubit addressing rates that are tens to hundreds of times faster than using an SLM alone.

Graham, T. M.↗