• Corpus ID: 52270644

Computational complexity of the Rydberg blockade in two dimensions

@article{Pichler2018ComputationalCO,
  title={Computational complexity of the Rydberg blockade in two dimensions},
  author={Hannes Pichler and Sheng-Tao Wang and Leo Zhou and Soonwon Choi and Mikhail D. Lukin},
  journal={ArXiv},
  year={2018},
  volume={abs/1809.04954}
}
We discuss the computational complexity of finding the ground state of the two-dimensional array of quantum bits that interact via strong van der Waals interactions. Specifically, we focus on systems where the interaction strength between two spins depends only on their relative distance $x$ and decays as $1/x^6$ that have been realized with individually trapped homogeneously excited neutral atoms interacting via the so-called Rydberg blockade mechanism. We show that the solution to NP-complete… 

Figures from this paper

Quantum simulation of Ising spins on Platonic graphs

We present quantum simulation experiments of Ising-like spins on Platonic graphs, which are performed with two-dimensional arrays of Rydberg atoms and quantum-wire couplings. The quantum wires are

Rydberg atom quantum technologies

This topical review addresses how Rydberg atoms can serve as building blocks for emerging quantum technologies. Whereas the fabrication of large numbers of artificial quantum systems with the

Programmable Quantum Annealing Architectures with Ising Quantum Wires

Quantum annealing aims at solving optimization problems efficiently by preparing the ground state of an Ising spin-Hamiltonian quantum mechanically. A prerequisite of building a quantum annealer is

Industry applications of neutral-atom quantum computing solving independent set problems

TLDR
A pedagogical introduction of basic graph theory concepts of relevance and the major classes of independent set problems are outlined and include associated example applications with industry and social relevance to explore the ubiquity and utility ofindependent set problems.

Two‐dimensional confined hydrogen: An entropy and complexity approach

TLDR
These entropy and complexity quantities reflect the rich properties of the electron confinement extent in the two conjugated spaces and are found to reflect the Shannon entropy and the Fisher information.

Algorithms and Platforms for Quantum Science and Technology

TLDR
It is demonstrated that optical resonances in ordered arrays of atoms and atomically thin semiconductors offer a powerful tool to control and manipulate light at both the classical and single-photon level and the robustness of adiabatic quantum algorithms are investigated, placing stringent requirements on noise induced by the environment.

Robust Mølmer-Sørensen gate for neutral atoms using rapid adiabatic Rydberg dressing

The Rydberg blockade mechanism is now routinely considered for entangling qubits encoded in clock states of neutral atoms. Challenges towards implementing entangling gates with high fidelity include

Bulk and boundary quantum phase transitions in a square Rydberg atom array

Marcin Kalinowski,1, ∗ Rhine Samajdar,1 Roger G. Melko,2, 3 Mikhail D. Lukin,1 Subir Sachdev,1, 4 and Soonwon Choi5 Department of Physics, Harvard University, Cambridge, MA 02138, USA Department of

Quantum Sampling Algorithms for Near-Term Devices.

TLDR
This work introduces a family of quantum algorithms that provide unbiased samples by preparing a state that encodes the entire Gibbs distribution, and shows that this approach leads to a speedup over a classical Markov chain for several examples including the Ising model and sampling from weighted, independent sets of two different graphs.

Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach

TLDR
This work considers a neutral atom quantum computer and proposes a full stack approach for correlation clustering, including Hamiltonian formulation of the algorithm, analysis of its performance, identification of a suitable level structure for 87Sr and specific gate design and shows the qudit implementation is superior to the qubit encoding as quantified by the gate count.

References

SHOWING 1-10 OF 22 REFERENCES

Computers and Intractability: A Guide to the Theory of NP-Completeness

TLDR
The experiences, understandings, and beliefs that guide the professional practices of teacher educators are explored, and the book paints a picture of a profession that offers huge rewards, alongside challenges and frustrations.

Physical Review A 98

  • 1151
  • 2018

Discrete Mathematics 86

  • 165
  • 1990

and s

Reviews of Modern Physics at 90

Physical Review X 8

  • 021069
  • 2018

Nature 473

  • 194
  • 2011

Science 295

  • 2427
  • 2002

Any choice of q works, as long as we choose 2φ < 2q ≤ k/4 and q ∼ O(k)

    Science 354

    • 1024
    • 2016