Defect-free atomic array formation using the Hungarian matching algorithm
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Deterministic loading of single atoms onto arbitrary two-dimensional lattice points has recently been demonstrated, where by dynamically controlling the optical-dipole potential, atoms from a probabilistically loaded lattice were relocated to target lattice points to form a zero-entropy atomic lattice. In this atom rearrangement, how to pair atoms with the target sites is a combinatorial optimization problem: brute-force methods search all possible combinations so the process is slow, while heuristic methods are time efficient but optimal solutions are not guaranteed. Here, we use the Hungarian matching algorithm as a fast and rigorous alternative to this problem of defect-free atomic lattice formation. Our approach utilizes an optimization cost function that restricts collision-free guiding paths so that atom loss due to collision is minimized during rearrangement. Experiments were performed with cold rubidium atoms that were trapped and guided with holographically controlled optical-dipole traps. The result of atom relocation from a partially filled $7\ifmmode\times\else\texttimes\fi{}7$ lattice to a $3\ifmmode\times\else\texttimes\fi{}3$ target lattice strongly agrees with the theoretical analysis: using the Hungarian algorithm minimizes the collisional and trespassing paths and results in improved performance, with over 50% higher success probability than the heuristic shortest-move method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Atom-by-atom assembly of defect-free one-dimensional cold atom arrays
Endres, M., Bernien, H., Keesling, A., Levine, H., Anschuetz, E. R., Krajenbrink, A., Senko, C., Vuletic, V., Greiner, M., & Lukin, M. D. (2016) · Science · doi:10.1126/science.aah3752 · Cited by 863
Demonstration of a Neutral Atom Controlled-NOT Quantum Gate
Isenhower, L., Urban, E., Zhang, X. L., Gill, A. T., Henage, T., Johnson, T. A., Walker, T. G., & Saffman, M. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.010503 · Cited by 848
Entanglement of Two Individual Neutral Atoms Using Rydberg Blockade
Wilk, T., Gaëtan, A., Evellin, C., Wolters, J., Miroshnychenko, Y., Grangier, P., & Browaeys, A. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.010502 · Cited by 730
Two-dimensional transport and transfer of a single atomic qubit in optical tweezers
Beugnon, J., Tuchendler, C., Marion, H., Gaëtan, A., Miroshnychenko, Y., Sortais, Y. R. P., Lance, A. M., Jones, M. P. A., Messin, G., Browaeys, A., et al. (2007) · Nature Physics · doi:10.1038/nphys698 · Cited by 189
Cited by
Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator
Ebadi, S., Wang, T. T., Levine, H., Keesling, A., Semeghini, G., Omran, A., Bluvstein, D., Samajdar, R., Pichler, H., Ho, W. W., et al. (2020) · arXiv · doi:10.48550/arxiv.2012.12281 · Cited by 995
Quantum phases of matter on a 256-atom programmable quantum simulator
Ebadi, S., Wang, T. T., Levine, H., Keesling, A., Semeghini, G., Omran, A., Bluvstein, D., Samajdar, R., Pichler, H., Ho, W. W., et al. (2021) · Nature · doi:10.1038/s41586-021-03582-4 · Cited by 995
Gray-Molasses Optical-Tweezer Loading: Controlling Collisions for Scaling Atom-Array Assembly
Brown, M. O., Thiele, T., Kiehl, C., Hsu, T.-W., & Regal, C. A. (2019) · Physical Review X · doi:10.1103/physrevx.9.011057 · Cited by 99
Enhanced atom-by-atom assembly of arbitrary tweezer arrays
Schymik, K.-N., Lienhard, V., Barredo, D., Scholl, P., Williams, H., Browaeys, A., & Lahaye, T. (2020) · Physical Review A · doi:10.1103/physreva.102.063107 · Cited by 94
“Using the Hungarian algorithm (as in [20]) then minimizes the assembly time.”
BackgroundMethod
Metadata
- Authors
- Lee, W., Kim, H., & Ahn, J.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2017-05-31
- Volume
- 95
- Issue
- 5
- ISSN
- 0556-2791 (ISSN-L)
- 2469-9926
- 2469-9934
- OpenAlex
- W2609521486
- Cited by
- 51
- References
- 5
- FWCI
- 2.02
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Defect-free atomic array formation using the Hungarian matching algorithm. https://app.cochat.ai/papers/10.1103/physreva.95.053424
- The paper
- Lee, W., Kim, H., & Ahn, J. (2017). Defect-free atomic array formation using the Hungarian matching algorithm. Physical Review A. https://doi.org/10.1103/physreva.95.053424
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.