Generation of quantum phases of matter and finding a maximum-weight independent set of unit-disk graphs using Rydberg atoms

被引:0
|
作者
Farouk, Ahmed M. [1 ,2 ,3 ]
Beterov, I. I. [2 ,4 ,5 ,6 ]
Xu, Peng [7 ,8 ]
Ryabtsev, I. I. [2 ,4 ]
机构
[1] Novosibirsk State Univ, Fac Math & Mech, Novosibirsk 630090, Russia
[2] RAS, Rzhanov Inst Semicond Phys, SB, Lab Nonlinear Resonant Proc & Laser Diagnost, Novosibirsk 630090, Russia
[3] Al Azhar Univ, Fac Sci, Dept Math, Cairo 11884, Egypt
[4] Novosibirsk State Univ, Fac Phys, Novosibirsk 630090, Russia
[5] RAS, Inst Laser Phys, Dept Laser Phys, SB, Novosibirsk 630090, Russia
[6] Novosibirsk State Tech Univ, Fac Phys Engn, Novosibirsk 630073, Russia
[7] Chinese Acad Sci, Innovat Acad Precis Measurement Sci & Technol, State Key Lab Magnet Resonance & Atom & Mol Phys, Wuhan 430071, Peoples R China
[8] Wuhan Inst Quantum Technol, Dept Quantum Comp, Wuhan 430206, Peoples R China
基金
俄罗斯科学基金会; 中国国家自然科学基金;
关键词
D O I
10.1103/PhysRevA.110.022442
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
Recent progress in quantum computing and quantum simulation of many-body systems with arrays of neutral atoms using Rydberg excitation has provided unforeseen opportunities towards computational advantage in solving various optimization problems. The problem of a maximum-weight independent set of unit-disk graphs is an example of an NP-hard optimization problem. It involves finding the largest set of vertices with the maximum sum of their weights for a graph which has edges connecting all pairs of vertices within a unit distance. This problem can be solved using quantum annealing with an array of interacting Rydberg atoms. For a particular graph, a spatial arrangement of atoms represents vertices of the graph, while the detuning from resonance at Rydberg excitation defines the weights of these vertices. The edges of the graph can be drawn according to the unit-disk criterion. Maximum-weight independent sets can be obtained by applying a variational quantum adiabatic algorithm. We consider driving the quantum system of interacting atoms to the many-body ground state using a nonlinear quasiadiabatic profile for sweeping the Rydberg detuning. We also propose using a quantum wire, which is a set of auxiliary atoms of a different chemical element, to mediate strong coupling between the remote vertices of the graph. We investigate this effect for different lengths of the quantum wire. We also investigate the quantum phases of matter realizing commensurate and incommensurate phases in oneand two-dimensional spatial arrangements of the atomic array.
引用
收藏
页数:13
相关论文
共 22 条
  • [1] Hardness of the maximum-independent-set problem on unit-disk graphs and prospects for quantum speedups
    Andrist, Ruben S.
    Schuetz, Martin J. A.
    Minssen, Pierre
    Yalovetzky, Romina
    Chakrabarti, Shouvanik
    Herman, Dylan
    Kumar, Niraj
    Salton, Grant
    Shaydulin, Ruslan
    Sun, Yue
    Pistoia, Marco
    Katzgraber, Helmut G.
    PHYSICAL REVIEW RESEARCH, 2023, 5 (04):
  • [2] Quantum imaginary time evolution and the unit-disk maximum independent set problem
    Penas, Victor A.
    Losada, Marcelo
    Lamberti, Pedro W.
    PHYSICAL REVIEW A, 2025, 111 (04)
  • [3] Finding the Maximum Independent Sets of Platonic Graphs Using Rydberg Atoms
    Byun, Andrew
    Kim, Minhyuk
    Ahn, Jaewook
    PRX QUANTUM, 2022, 3 (03):
  • [4] An efficient pram algorithm for maximum-weight independent set on permutation graphs
    Saha A.
    Pal M.
    Pal T.K.
    Journal of Applied Mathematics and Computing, 2005, 19 (1-2) : 77 - 92
  • [5] A new simple algorithm for the maximum-weight independent set problem on circle graphs
    Valiente, G
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, 2906 : 129 - 137
  • [6] SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE MAXIMUM-WEIGHT INDEPENDENT SET PROBLEM ON PERMUTATION GRAPHS
    YU, MS
    TSENG, LY
    CHANG, SJ
    INFORMATION PROCESSING LETTERS, 1993, 46 (01) : 7 - 11
  • [7] A convex-hull based algorithm to connect the maximal independent set in unit-disk graphs
    Chen, Dechang
    Mao, Xilong
    Fei, Xia
    Xing, Kai
    Liu, Fang
    Song, Min
    WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, PROCEEDINGS, 2006, 4138 : 363 - 370
  • [8] A robust PTAS for maximum weight independent sets in unit disk graphs
    Nieberg, T
    Hurink, J
    Kern, W
    GRAPH -THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2004, 3353 : 214 - 221
  • [9] The Maximum Distance-d Independent Set Problem on Unit Disk Graphs
    Jena, Sangram K.
    Jallu, Ramesh K.
    Das, Gautam K.
    Nandy, Subhas C.
    FRONTIERS IN ALGORITHMICS (FAW 2018), 2018, 10823 : 68 - 80
  • [10] A new bound on maximum independent set and minimum connected dominating set in unit disk graphs
    Yingfan L. Du
    Hongmin W. Du
    Journal of Combinatorial Optimization, 2015, 30 : 1173 - 1179