pith. sign in

arxiv: 2503.17115 · v3 · pith:UNWIODYEnew · submitted 2025-03-21 · 🪐 quant-ph

A quantum wire approach to weighted combinatorial graph optimisation problems

Andr\'e G. de Oliveira , Johannes Kombe , Gerard Pelegr\'i , Paul Schroff , Maximillian T. Wells-Pestell , Daniel M. Walker , Andrew J. Daley , Jonathan D. Pritchard This is my paper

Pith reviewed 2026-05-22 23:14 UTC · model grok-4.3

classification 🪐 quant-ph
keywords approachatomquantumgraphsneutraloptimizationproblemsweighted
0
0 comments X

The pith

Demonstrates a quantum wire encoding using Rydberg atom chains to solve MWIS and QUBO problems on neutral atom arrays with reduced ancilla overhead and experimental validation.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Neutral atom arrays can run quantum annealing to tackle hard combinatorial problems by arranging atoms that interact when excited to Rydberg states. The authors create chains of these atoms called quantum wires that natively represent graph connections and weights using local light shifts. This setup targets maximum weighted independent set problems and quadratic unconstrained binary optimization tasks. For graphs where most connections are short-range, the method uses fewer extra atoms than earlier encodings. Experiments on programmable atom arrays show the system finds correct solutions for graphs of different sizes. The approach aims to make quantum optimization more feasible on hardware available today by lowering the resource cost for certain graph structures.

Core claim

our approach requires a significantly lower overhead in the number of ancilla qubits than previous proposals, facilitating the implementation on currently available hardware... This approach successfully identifies the solutions to the original MWIS and QUBO graph instances.

Load-bearing premise

The graphs have quasi-unit-disk connectivity in which only a few long-range edges are required, as stated in the abstract; if this connectivity assumption fails, the claimed overhead reduction does not hold.

Figures

Figures reproduced from arXiv: 2503.17115 by Andr\'e G. de Oliveira, Andrew J. Daley, Daniel M. Walker, Gerard Pelegr\'i, Johannes Kombe, Jonathan D. Pritchard, Maximillian T. Wells-Pestell, Paul Schroff.

Figure 1
Figure 1. Figure 1: FIG. 1 [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: (a) illustrates a basic wire construction to realize an MWIS constraint between two physically separated vertices with weights α and β (with α > β in this ex￾ample). The allowed configurations in the logical MWIS problem are ∣α, β⟩ = {∣10⟩, ∣01⟩, ∣00⟩}, with corresponding energies {−α,−β, 0}. The wire (highlighted in red) con￾sists of an even number of atoms L with a uniform weight c, arranged in such a wa… view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3 [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. Solving non-UDG MWIS problems using quantum [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5. Block-wise decomposition of a QUBO problem. (a) A [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6. Solving a fully connected QUBO problem via UDG [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: FIG. 7. The left two plots show the spectral gap along the annealing path ∆ [PITH_FULL_IMAGE:figures/full_fig_p011_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: FIG. 8. Probability of successfully encoding the ground state [PITH_FULL_IMAGE:figures/full_fig_p012_8.png] view at source ↗
Figure 10
Figure 10. Figure 10: FIG. 10. Overview of experimental setup. The tweezer trap [PITH_FULL_IMAGE:figures/full_fig_p013_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: FIG. 11. Weighted graphs. (a) Graph of Fig. [PITH_FULL_IMAGE:figures/full_fig_p013_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: FIG. 12 [PITH_FULL_IMAGE:figures/full_fig_p014_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: FIG. 13. Performance comparison between QPU-generated [PITH_FULL_IMAGE:figures/full_fig_p015_13.png] view at source ↗
read the original abstract

Neutral atom arrays provide a versatile platform to implement coherent quantum annealing as an approach to solving hard combinatorial optimization problems. Here we present and experimentally demonstrate an efficient encoding scheme based on chains of Rydberg-blockaded atoms, which we call quantum wires, to natively embed maximum weighted independent set (MWIS) and quadratic unconstrained binary optimization (QUBO) problems on a neutral atom architecture. For graphs with quasi-unit-disk connectivity, in which only a few long-range edges are required, our approach requires a significantly lower overhead in the number of ancilla qubits than previous proposals, facilitating the implementation on currently available hardware. To demonstrate the approach, we perform annealing of weighted graphs on a programmable atom array using local light-shifts to encode problem-specific weights across graphs of varying sizes. This approach successfully identifies the solutions to the original MWIS and QUBO graph instances. Our work expands the operational toolkit of near-term neutral atom arrays, enhancing their potential for scalable quantum optimization.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper proposes a quantum-wire encoding based on chains of Rydberg-blockaded atoms to natively embed MWIS and QUBO instances on neutral-atom arrays. It claims that, for graphs with quasi-unit-disk connectivity requiring only a few long-range edges, the scheme incurs significantly lower ancilla-qubit overhead than prior encodings and reports experimental annealing on programmable atom arrays that identifies the solutions to the original weighted instances.

Significance. If the overhead reduction and experimental fidelity hold under the stated connectivity assumption, the work would meaningfully expand the set of combinatorial problems directly addressable on current neutral-atom hardware without prohibitive ancilla costs. The experimental component on graphs of varying sizes supplies concrete evidence of feasibility that strengthens the practical claim.

major comments (2)
  1. [Abstract / overhead discussion] Abstract and § on overhead comparison: the central claim of 'significantly lower overhead in the number of ancilla qubits' is explicitly conditioned on quasi-unit-disk graphs with only a few long-range edges; no quantitative overhead table or counter-example for general graphs is supplied, which is load-bearing for the advantage asserted over previous proposals.
  2. [Experimental results] Experimental results section: the statement that the approach 'successfully identifies the solutions' is presented without reported success probabilities, error bars, raw measurement counts, or comparison to classical solvers, preventing verification that the observed outcomes support the claim beyond the abstract assertion.
minor comments (2)
  1. [Methods] Notation for the quantum-wire Hamiltonian and the mapping from graph weights to local light shifts should be defined once in a dedicated subsection rather than introduced piecemeal.
  2. [Figures] Figure captions for the atom-array layouts should explicitly state the number of ancilla atoms used per instance so readers can directly compare overhead.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their thoughtful review and constructive comments. We address each major comment below and have updated the manuscript accordingly to strengthen the presentation.

read point-by-point responses

  1. Referee: [Abstract / overhead discussion] Abstract and § on overhead comparison: the central claim of 'significantly lower overhead in the number of ancilla qubits' is explicitly conditioned on quasi-unit-disk graphs with only a few long-range edges; no quantitative overhead table or counter-example for general graphs is supplied, which is load-bearing for the advantage asserted over previous proposals.

    Authors: The manuscript explicitly conditions the overhead reduction on quasi-unit-disk graphs with few long-range edges, as noted in the abstract and relevant section. To address the request for quantitative support, we have added a table in the revised manuscript that compares the ancilla qubit overhead of our encoding against prior methods for several example graphs in this class. We maintain that a counter-example for general graphs is not required, as the advantage is not claimed outside the stated connectivity regime; however, we have clarified this point in the text. revision: yes

  2. Referee: [Experimental results] Experimental results section: the statement that the approach 'successfully identifies the solutions' is presented without reported success probabilities, error bars, raw measurement counts, or comparison to classical solvers, preventing verification that the observed outcomes support the claim beyond the abstract assertion.

    Authors: We agree that more detailed experimental statistics are needed to fully substantiate the claims. In the revised manuscript, we now report success probabilities with error bars, include raw measurement counts, and provide comparisons to classical solvers for the MWIS and QUBO instances tested. revision: yes

Circularity Check

0 steps flagged

No circularity detected; experimental encoding and demonstration are self-contained

full rationale

The paper proposes a quantum-wire encoding for MWIS/QUBO problems on neutral-atom arrays and demonstrates it experimentally on quasi-unit-disk graphs. No derivation chain is present that reduces a claimed prediction or result to a fitted parameter or self-citation by construction. The overhead-reduction claim is explicitly conditioned on the stated connectivity assumption rather than derived from prior self-referential steps. The work is an encoding proposal plus hardware demonstration, with no equations or uniqueness theorems that collapse to the inputs. This is the normal non-circular outcome for an experimental methods paper.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract-only review provides insufficient detail to enumerate free parameters, axioms, or invented entities; the central approach rests on domain assumptions about Rydberg blockade behavior in chains and graph connectivity.

axioms (1)
  • domain assumption Rydberg blockade in atom chains accurately encodes graph edges and weights via local light shifts
    Invoked as the basis for the quantum wire encoding in the abstract.

pith-pipeline@v0.9.0 · 5728 in / 1020 out tokens · 71829 ms · 2026-05-22T23:14:46.615467+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum Spin Liquid State of a Dual-Species Atomic Array on Kagome Lattice

    quant-ph 2026-05 unverdicted novelty 5.0

    A dual-species Rydberg atom array on a Kagome lattice can be driven into a quantum spin liquid state with topological order using a controlled sweep-quench-sweep protocol.

Reference graph

Works this paper leans on

56 extracted references · 56 canonical work pages · cited by 1 Pith paper · 3 internal anchors

  1. [1]

    Another possibility to encode problems beyond UDG- MIS in neutral atom hardware is to use local control fields [31]

    and general combinatorial optimization [30] prob- lems onto the UDG-MIS problem using ancillary atoms and requiring only global control. Another possibility to encode problems beyond UDG- MIS in neutral atom hardware is to use local control fields [31]. This enables the realization of differential weights in the vertices represented by the atoms, permitti...

    work page

  2. [2]

    V. T. Paschos,Applications of combinatorial optimiza- tion, Vol. 3 (John Wiley & Sons, 2014)

    work page 2014

  3. [3]

    Abbas, A

    A. Abbas, A. Ambainis, B. Augustino, A. B¨ artschi, H. Buhrman, C. Coffrin, G. Cortiana, V. Dunjko, D. J. Egger, B. G. Elmegreen, N. Franco, F. Fratini, B. Fuller, J. Gacon, C. Gonciulea, S. Gribling, S. Gupta, S. Had- field, R. Heese, G. Kircher, T. Kleinert, T. Koch, G. Ko- rpas, S. Lenk, J. Marecek, V. Markov, G. Mazzola, S. Mensa, N. Mohseni, G. Nanni...

    work page 2024

  4. [4]

    Hauke, H

    P. Hauke, H. G. Katzgraber, W. Lechner, H. Nishimori, and W. D. Oliver, Perspectives of quantum annealing: methods and implementations, Reports on Progress in Physics83, 054401 (2020)

    work page 2020

  5. [5]

    Rajak, S

    A. Rajak, S. Suzuki, A. Dutta, and B. K. Chakrabarti, Quantum annealing: An overview, Philosophical Trans- actions of the Royal Society A381, 20210417 (2023)

    work page 2023

  6. [6]

    Cerezo, A

    M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, and P. J. Coles, Variational quantum algo- rithms, Nature Reviews Physics3, 625 (2021)

    work page 2021

  7. [7]

    Astrakhantsev, G

    N. Astrakhantsev, G. Mazzola, I. Tavernelli, and G. Car- leo, Phenomenological theory of variational quantum ground-state preparation, Phys. Rev. Res.5, 033225 (2023)

    work page 2023

  8. [8]

    Peruzzo, J

    A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’Brien, A variational eigenvalue solver on a photonic quantum processor, Nature Communications5, 4213 (2014)

    work page 2014

  9. [9]

    Kandala, A

    A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J. M. Chow, and J. M. Gambetta, Hardware- efficient variational quantum eigensolver for small molecules and quantum magnets, Nature549, 242 (2017)

    work page 2017

  10. [10]

    Hempel, C

    C. Hempel, C. Maier, J. Romero, J. McClean, T. Monz, H. Shen, P. Jurcevic, B. P. Lanyon, P. Love, R. Babbush, A. Aspuru-Guzik, R. Blatt, and C. F. Roos, Quantum chemistry calculations on a trapped-ion quantum simu- lator, Phys. Rev. X8, 031022 (2018)

    work page 2018

  11. [11]

    Kokail, C

    C. Kokail, C. Maier, R. van Bijnen, T. Brydges, M. K. Joshi, P. Jurcevic, C. A. Muschik, P. Silvi, R. Blatt, C. F. Roos, and P. Zoller, Self-verifying variational quantum simulation of lattice models, Nature569, 355 (2019)

    work page 2019

  12. [12]

    A Quantum Approximate Optimization Algorithm

    E. Farhi, J. Goldstone, and S. Gutmann, A quan- tum approximate optimization algorithm (2014), arXiv:1411.4028 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2014

  13. [13]

    Wecker, M

    D. Wecker, M. B. Hastings, and M. Troyer, Progress to- wards practical quantum variational algorithms, Phys. Rev. A92, 042303 (2015)

    work page 2015

  14. [14]

    Wurtz and P

    J. Wurtz and P. Love, Maxcut quantum approximate op- timization algorithm performance guarantees forp>1, Phys. Rev. A103, 042612 (2021)

    work page 2021

  15. [15]

    Farhi, J

    E. Farhi, J. Goldstone, S. Gutmann, and L. Zhou, The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size, Quantum 6, 759 (2022)

    work page 2022

  16. [16]

    Blekos, D

    K. Blekos, D. Brand, A. Ceschini, C.-H. Chou, R.-H. Li, K. Pandya, and A. Summer, A review on Quantum Approximate Optimization Algorithm and its variants, Physics Reports1068, 1 (2024)

    work page 2024

  17. [17]

    Lucas, Ising formulations of many np problems, Fron- tiers in physics2, 5 (2014)

    A. Lucas, Ising formulations of many np problems, Fron- tiers in physics2, 5 (2014)

    work page 2014

  18. [18]

    Henriet, L

    L. Henriet, L. Beguin, A. Signoles, T. Lahaye, A. Browaeys, G.-O. Reymond, and C. Jurczak, Quantum computing with neutral atoms, Quantum4, 327 (2020)

    work page 2020

  19. [19]

    Morgado and S

    M. Morgado and S. Whitlock, Quantum simulation and computing with rydberg-interacting qubits, AVS Quan- tum Science3, 10.1116/5.0036562 (2021)

    work page doi:10.1116/5.0036562 2021

  20. [20]

    Quantum Optimization for Maximum Independent Set Using Rydberg Atom Arrays

    H. Pichler, S.-T. Wang, L. Zhou, S. Choi, and M. D. Lukin, Quantum Optimization for Maximum Indepen- dent Set Using Rydberg Atom Arrays, 1808.10816 [quant-ph] (2018)

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  21. [21]

    Computational complexity of the Rydberg blockade in two dimensions

    H. Pichler, S.-T. Wang, L. Zhou, S. Choi, and M. D. Lukin, Computational complexity of the Rydberg block- ade in two dimensions, 1809.04954 [quant-ph] (2018)

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  22. [22]

    Ebadi, A

    S. Ebadi, A. Keesling, M. Cain, T. T. Wang, H. Levine, D. Bluvstein, G. Semeghini, A. Omran, J.-G. Liu, R. Samajdar, X.-Z. Luo, B. Nash, X. Gao, B. Barak, E. Farhi, S. Sachdev, N. Gemelke, L. Zhou, S. Choi, H. Pichler, S.-T. Wang, M. Greiner, V. Vuleti` c, and M. D. Lukin, Quantum Optimization of Maximum Inde- pendent Set using Rydberg Atom Arrays, Scienc...

    work page 2022

  23. [23]

    K. Kim, M. Kim, J. Park, A. Byun, and J. Ahn, Quantum computing dataset of maximum independent set problem on king lattice of over hundred Rydberg atoms, Scientific Data11, 111 (2024)

    work page 2024

  24. [24]

    R. S. Andrist, M. J. Schuetz, P. Minssen, R. Yalovet- zky, S. Chakrabarti, D. Herman, N. Kumar, G. Salton, R. Shaydulin, Y. Sun,et al., Hardness of the maximum-independent-set problem on unit-disk graphs and prospects for quantum speedups, Physical Review Research5, 043277 (2023)

    work page 2023

  25. [25]

    M. Kim, K. Kim, J. Hwang, E.-G. Moon, and J. Ahn, Rydberg quantum wires for maximum independent set problems, Nature Phys.18, 755 (2022)

    work page 2022

  26. [26]

    A. Byun, M. Kim, and J. Ahn, Finding the maximum independent sets of platonic graphs using rydberg atoms, PRX Quantum3, 030305 (2022)

    work page 2022

  27. [27]

    Dalyac, L.-P

    C. Dalyac, L.-P. Henry, M. Kim, J. Ahn, and L. Hen- 9 riet, Exploring the impact of graph locality for the resolution of mis with neutral atom devices (2023), arXiv:2306.13373 [quant-ph]

    work page arXiv 2023

  28. [28]

    A. Byun, J. Jung, K. Kim, M. Kim, S. Jeong, H. Jeong, and J. Ahn, Rydberg-atom graphs for quadratic uncon- strained binary optimization problems, Advanced Quan- tum Technologies7, 2300398 (2024)

    work page 2024

  29. [29]

    A. Byun, S. Jeong, and J. Ahn, Programming higher- order interactions of rydberg atoms, Physical Review A 110, 042612 (2024)

    work page 2024

  30. [30]

    Jeong, M

    S. Jeong, M. Kim, M. Hhan, J. Park, and J. Ahn, Quan- tum programming of the satisfiability problem with ryd- berg atom graphs, Phys. Rev. Res.5, 043037 (2023)

    work page 2023

  31. [31]

    Lanthaler, K

    M. Lanthaler, K. Ender, C. Dlaska, and W. Lechner, Quantum optimization with globally driven neutral atom arrays (2024), arXiv:2410.03902 [quant-ph]

    work page arXiv 2024

  32. [32]

    Goswami, R

    K. Goswami, R. Mukherjee, H. Ott, and P. Schmelcher, Solving optimization problems with local light-shift en- coding on Rydberg quantum annealers, Phys. Rev. Res. 6, 023031 (2024)

    work page 2024

  33. [33]

    A. G. de Oliveira, E. Diamond-Hitchcock, D. M. Walker, M. T. Wells-Pestell, G. Pelegr´ ı, C. J. Picken, G. P. A. Malcolm, A. J. Daley, J. Bass, and J. D. Pritchard, Demonstration of weighted-graph optimization on a rydberg-atom array using local light shifts, PRX Quan- tum6, 010301 (2025)

    work page 2025

  34. [34]

    Nguyen, J.-G

    M.-T. Nguyen, J.-G. Liu, J. Wurtz, M. D. Lukin, S.- T. Wang, and H. Pichler, Quantum optimization with arbitrary connectivity using Rydberg atom arrays, PRX Quantum4, 010316 (2023)

    work page 2023

  35. [35]

    Bombieri, Z

    L. Bombieri, Z. Zeng, R. Tricarico, R. Lin, S. Notarni- cola, M. Cain, M. D. Lukin, and H. Pichler, Quantum Adiabatic Optimization with Rydberg Arrays: Localiza- tion Phenomena and Encoding Strategies, PRX Quan- tum6, 020306 (2025)

    work page 2025

  36. [36]

    Lechner, P

    W. Lechner, P. Hauke, and P. Zoller, A quantum anneal- ing architecture with all-to-all connectivity from local in- teractions, Science Advances1, e1500838 (2015)

    work page 2015

  37. [37]

    Lanthaler, C

    M. Lanthaler, C. Dlaska, K. Ender, and W. Lechner, Rydberg-Blockade-Based Parity Quantum Optimization, Phys. Rev. Lett.130, 220601 (2023)

    work page 2023

  38. [38]

    J. Park, S. Jeong, M. Kim, K. Kim, A. Byun, L. Vig- noli, L.-P. Henry, L. Henriet, and J. Ahn, Rydberg-atom experiment for the integer factorization problem, Phys. Rev. Res.6, 023241 (2024)

    work page 2024

  39. [39]

    M. J. A. Schuetz, R. S. Andrist, G. Salton, R. Yalovet- zky, R. Raymond, Y. Sun, A. Acharya, S. Chakrabarti, M. Pistoia, and H. G. Katzgraber, Quantum Compila- tion Toolkit for Rydberg Atom Arrays with Implications for Problem Hardness and Quantum Speedups (2025), arXiv:2412.14976 [quant-ph]

    work page arXiv 2025

  40. [40]

    X. Qiu, P. Zoller, and X. Li, Programmable quantum annealing architectures with ising quantum wires, PRX Quantum1, 020311 (2020)

    work page 2020

  41. [41]

    Kochenberger, J.-K

    G. Kochenberger, J.-K. Hao, F. Glover, M. Lewis, Z. L¨ u, H. Wang, and Y. Wang, The unconstrained binary quadratic programming problem: a survey, Journal of Combinatorial Optimization28, 58 (2014)

    work page 2014

  42. [42]

    M. J. A. Schuetz, R. Yalovetzky, R. S. Andrist, G. Salton, Y. Sun, R. Raymond, S. Chakrabarti, A. Acharya, R. Shaydulin, M. Pistoia, and H. G. Katzgraber, qReduMIS: A Quantum-Informed Reduction Algorithm for the Maximum Independent Set Problem (2025), arXiv:2503.12551 [quant-ph]

    work page arXiv 2025

  43. [43]

    T. Koch, D. E. B. Neira, Y. Chen, G. Cortiana, D. J. Eg- ger, R. Heese, N. N. Hegade, A. G. Cadavid, R. Huang, T. Itoko, T. Kleinert, P. M. Xavier, N. Mohseni, J. A. Montanez-Barrera, K. Nakano, G. Nannicini, C. O’Meara, J. Pauckert, M. Proissl, A. Ramesh, M. Schicker, N. Shimada, M. Takeori, V. Valls, D. V. Bulck, S. Woerner, and C. Zoufal, Quantum optim...

    work page arXiv 2025

  44. [44]

    S. R. White, Density matrix formulation for quantum renormalization groups, Phys. Rev. Lett.69, 2863 (1992)

    work page 1992

  45. [45]

    S. R. White, Density-matrix algorithms for quantum renormalization groups, Phys. Rev. B48, 10345 (1993)

    work page 1993

  46. [46]

    Schollw¨ ock, The density-matrix renormalization group in the age of matrix product states, Annals of Physics 326, 96 (2011), january 2011 Special Issue

    U. Schollw¨ ock, The density-matrix renormalization group in the age of matrix product states, Annals of Physics 326, 96 (2011), january 2011 Special Issue

    work page 2011

  47. [47]

    Fishman, S

    M. Fishman, S. R. White, and E. M. Stoudenmire, The ITensor Software Library for Tensor Network Calcula- tions, SciPost Phys. Codebases , 4 (2022)

    work page 2022

  48. [48]

    Fishman, S

    M. Fishman, S. R. White, and E. M. Stoudenmire, Code- base release 0.3 for ITensor, SciPost Phys. Codebases , 4 (2022)

    work page 2022

  49. [49]

    Schroff, A

    P. Schroff, A. La Rooij, E. Haller, and S. Kuhr, Accurate holographic light potentials using pixel crosstalk mod- elling, Scientific Reports13, 3252 (2023)

    work page 2023

  50. [50]

    ˘Sibali´ c, J

    N. ˘Sibali´ c, J. D. Pritchard, C. S. Adams, and K. J. Weatherill, ARC: An open-source library for calculating properties of alkali Rydberg atoms, Comp. Phys. Comm. 220, 319 (2017)

    work page 2017

  51. [51]

    D. Kim, A. Keesling, A. Omran, H. Levine, H. Bernien, M. Greiner, M. D. Lukin, and D. R. Englund, Large-Scale Uniform Optical Focus Array Generation with a Phase Spatial Light Modulator, Opt. Lett.44, 3178 (2019). 10 Appendix A: Robustness of the wire architecture While the proposed wire architecture is guaranteed to give the correct ground state solution...

    work page 2019

  52. [52]

    The annealing protocol As indicated by the results discussed above, the quan- tum wire approach presented here allows for a flexible and robust encoding of combinatorial optimization prob- lems that are close to UDG connectivity. In order to better understand the reason for this robustness, we nu- merically compute the spectral gap of the basic build- ing...

    work page

  53. [53]

    Robustness of a single quantum wire In order to evaluate how robust the embedding scheme is to shot-to-shot fluctuations in the applied local light shifts, we isolate a single wire module, and vary the local detunings randomly. For concreteness we draw the ran- dom weights from a normal distribution centred around the ideal detuning value, and study how t...

    work page

  54. [54]

    As before, we sample the weights{α, β, γ, δ, c}of the crossing gadget shown in Fig

    Robustness of the crossing gadget To complete the analysis of the robustness of the differ- ent building blocks involved in our architecture, we also test the performance of the crossing gadget in the pres- ence of random shot-to-shot fluctuations in the values of the weights and compare it with that of the quantum wires. As before, we sample the weights{...

    work page

  55. [55]

    This algorithm is implemented by first counting the number of edge-violations on each vertex, and se- lecting the vertex with the highest number to be flipped from 1 to 0

    V ertex reduction For experimental bitstrings featuring edge (or equiv- alently blockade) violations, whereby pairs of edge- connected vertices are both selected, we can recover valid independent set (IS) bitstrings by applyingvertex reduc- tion. This algorithm is implemented by first counting the number of edge-violations on each vertex, and se- lecting ...

    work page

  56. [56]

    V ertex addition Following the application of vertex reduction to the MWIS bitstrings we recover a valid IS but it may not be maximal, meaning it may be possible to select one or more additional vertices to recover a lower cost solu- tion. Avertex additionalgorithm is implemented using a constant overhead greedy algorithm, whereby for a fixed number of it...

    work page