Scaling of Computational Order Parameters in Rydberg Atom Graph States

• URL: http://arxiv.org/abs/2409.05941v2
• Date: Mon, 21 Apr 2025 16:24:17 GMT
• Title: Scaling of Computational Order Parameters in Rydberg Atom Graph States
• Abstract summary: We show how an always-on interaction can be used to simultaneously entangle all Rydberg atoms into a graph state.<n>We construct and implement many-body computational order parameters for graph states using non-local measurement-based logic operations.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph states are computationally powerful quantum states with many applications including use as resource states for measurement-based quantum computing (MBQC). We demonstrate construction of graph states on a Rydberg atom quantum analogue simulator. We show how an always-on interaction can be used to simultaneously entangle all Rydberg atoms into a graph state. We construct and implement many-body computational order parameters for graph states using non-local measurement-based logic operations in the Clifford group. The order parameters measure the efficacy of entanglement to allow MBQC on graph states of any size. We parameterize finite-size scaling of these order parameters. Our results define a route to efficiently test computational power in quantum devices.

Related papers

• Properties of multiqubit variational quantum states representing weighted graphs and their computing with quantum programming [0.0]
  We study multiqubit variational quantum states that can be considered as weighted quantum graph states.<n>We derive the geometric measure of entanglement and evaluate quantum correlators.
  arXiv  Detail & Related papers  (2026-04-01T14:33:09Z)
• Fermionic Insights into Measurement-Based Quantum Computation: Circle Graph States Are Not Universal Resources [5.552495672853301]
  Measurement-based quantum computation (MBQC) is a strong contender for realizing quantum computers.<n>A critical question for MBQC is the identification of resource graph states that can enable universal quantum computation.<n>We show that, in spite of their expressivity, circle graph states are not efficiently universal for MBQC.
  arXiv  Detail & Related papers  (2025-10-07T04:05:02Z)
• Studies of properties of bipartite graphs with quantum programming [0.0]
  Multi-qubit quantum states corresponding to bipartite graphs $G(U,V,E)$ are examined.<n>The entanglement distance of the resulting states is derived analytically for an arbitrary bipartite graph structure.
  arXiv  Detail & Related papers  (2025-07-22T14:49:57Z)
• Measurement-Based Quantum Compiling via Gauge Invariance [1.1510009152620668]
  We introduce a new paradigm for quantum compiling directly converting any quantum circuit to a class of graph states, independently from its size. The graph state can be rebuilt from the circuit and the input by employing a set of graphical rules similar to the Feynman's ones. Compared to Measurement Calculus, the ancillary qubits are reduced by 50% on QFT and 75% on QAOA.
  arXiv  Detail & Related papers  (2024-11-19T13:09:49Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Generation of quantum phases of matter and finding a maximum-weight independent set of unit-disk graphs using Rydberg atoms [4.619601221994331]
  We study the problem of a maximum-weight independent set of unit-disk graphs using Rydberg excitation. We consider driving the quantum system of interacting atoms to the many-body ground state using a non-linear quasi-adiabatic profile for sweeping the Rydberg detuning. We also investigate the quantum phases of matter realizing commensurate and incommensurate phases in one- and two-dimensional spatial arrangements of the atomic array.
  arXiv  Detail & Related papers  (2024-05-16T04:23:17Z)
• Geometric measure of entanglement of quantum graph states prepared with controlled phase shift operators [0.0]
  We consider graph states generated by the action of controlled phase shift operators on a separable state of a multi-qubit system. For two-qubit graph states, the geometric measure of entanglement is also quantified on IBM's simulator Qiskit Aer and quantum processor ibmq lima.
  arXiv  Detail & Related papers  (2024-01-26T16:52:22Z)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
  We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions. For its practicability and wide-applicability, we give a brief review of typical graph learning techniques. We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
  arXiv  Detail & Related papers  (2022-02-19T02:56:47Z)
• Towards Quantum Graph Neural Networks: An Ego-Graph Learning Approach [47.19265172105025]
  We propose a novel hybrid quantum-classical algorithm for graph-structured data, which we refer to as the Ego-graph based Quantum Graph Neural Network (egoQGNN) egoQGNN implements the GNN theoretical framework using the tensor product and unity matrix representation, which greatly reduces the number of model parameters required. The architecture is based on a novel mapping from real-world data to Hilbert space.
  arXiv  Detail & Related papers  (2022-01-13T16:35:45Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• Geometric measure of entanglement of multi-qubit graph states and its detection on a quantum computer [0.0]
  The entanglement of a qubit with other qubits is found for the graph states represented by arbitrary graphs. The geometric measure of entanglement of the graph states is quantified on the quantum computer.
  arXiv  Detail & Related papers  (2021-06-20T12:47:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.