2020
DOI: 10.22331/q-2020-09-21-327
|View full text |Cite
|
Sign up to set email alerts
|

Quantum computing with neutral atoms

Abstract: The manipulation of neutral atoms by light is at the heart of countless scientific discoveries in the field of quantum physics in the last three decades. The level of control that has been achieved at the single particle level within arrays of optical traps, while preserving the fundamental properties of quantum matter (coherence, entanglement, superposition), makes these technologies prime candidates to implement disruptive computation paradigms. In this paper, we review the main characteristics of these devi… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
160
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 274 publications
(160 citation statements)
references
References 87 publications
(108 reference statements)
0
160
0
Order By: Relevance
“…While D-Wave machines use superconducting quantum circuits, setups based on ultracold Rydberg atom arrays 42 – 44 and trapped ions 45 , 46 can be also used for the efficient implementation of quantum annealing and other quantum optimization algorithms. Specifically, the system of Rydberg atom arrays has been studied in the context of solving the maximum independent set problem 43 , 44 , which is NP-hard. For longer sequences, as we have demonstrated, it is possible to use quantum-inspired algorithms that are capable of solving more complex problems using classical hardware.…”
Section: Discussionmentioning
confidence: 99%
“…While D-Wave machines use superconducting quantum circuits, setups based on ultracold Rydberg atom arrays 42 – 44 and trapped ions 45 , 46 can be also used for the efficient implementation of quantum annealing and other quantum optimization algorithms. Specifically, the system of Rydberg atom arrays has been studied in the context of solving the maximum independent set problem 43 , 44 , which is NP-hard. For longer sequences, as we have demonstrated, it is possible to use quantum-inspired algorithms that are capable of solving more complex problems using classical hardware.…”
Section: Discussionmentioning
confidence: 99%
“…These results, obtained through a rigorous protocol, are very encouraging. Future works will involve testing the quantum approaches on the real Rydberg atoms quantum processor developed by Pasqal in the 100-1000 qubits range [16]; making the smart-charging problems more realistic by incorporating new constraints (e.g maximal available power on the load station), a real challenge as this should make the associated Hamiltonians to be implemented on the processor more complex; more specifically from an application viewpoint, looking for efficient heuristics to transform general graphs in unit-disk ones, which would drastically simplify the procedure for quantum solving of MIS. On this latter point, another interesting option is to explore smart-charging problems which are "naturally" two dimensional-e.g.…”
Section: Discussionmentioning
confidence: 99%
“…Moreover, improving these ratios is proved to be NP-Hard, unless some highly-believed conjectures of Complexity Theory would be false. In the case of Max-Cut, improving the approximation ratio from 0.878567 up to ( 16 17 = 0.941176) is NP-Hard [26] and thus out of reach of any polynomial classical algorithms unless P = NP, as it is to increase the ratio upon 1 -1/34k for Max-k-Cut [27]. Likewise, both problems are APX-Hard and thus, unless P = NP, they have no PTAS [24,28].…”
Section: Minimization Of Total Weighted Load Completion Time (Sc1) and Max-k-cutmentioning
confidence: 99%
See 2 more Smart Citations