Extracting GHZ states from linear cluster states

• URL: http://arxiv.org/abs/2211.16758v3
• Date: Mon, 15 May 2023 10:47:47 GMT
• Title: Extracting GHZ states from linear cluster states
• Authors: Jarn de Jong, Frederik Hahn, Nikolay Tcholtchev, Manfred Hauswirth, and Anna Pappa
• Abstract summary: We show how to obtain GHZ states between nodes in a network connected in a straight line. We prove a strict upper bound of $lfloor (n+3)/2 rfloor$ on the size of the set of nodes sharing a GHZ state. We characterize all selections of nodes below this threshold that can share a GHZ state obtained within this setting.
• Score: 1.1091582432763736
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Quantum information processing architectures typically only allow for nearest-neighbour entanglement creation. In many cases, this prevents the direct generation of GHZ states, which are commonly used for many communication and computation tasks. Here, we show how to obtain GHZ states between nodes in a network that are connected in a straight line, naturally allowing them to initially share linear cluster states. We prove a strict upper bound of $\lfloor (n+3)/2 \rfloor$ on the size of the set of nodes sharing a GHZ state that can be obtained from a linear cluster state of $n$ qubits, using local Clifford unitaries, local Pauli measurements, and classical communication. Furthermore, we completely characterize all selections of nodes below this threshold that can share a GHZ state obtained within this setting. Finally, we demonstrate these transformations on the IBMQ Montreal quantum device for linear cluster states of up to $n=19$ qubits.

Related papers

• Quantum sensor network metrology with bright solitons [39.58317527488534]
  General Heisenberg Limit (GHL) characterizes fundamental limitations for unknown parameter measurement and estimation accuracy.<n>Three-mode soliton Josephson junction (TMSJJ) system as a three mode extension for the soliton Josephson junction (SJJ) bosonic model.<n>Our findings open new prospects for quantum network sensorics with atomtronic circuits.
  arXiv  Detail & Related papers  (2025-07-21T08:01:36Z)
• Graph state extraction from two-dimensional cluster states [39.58317527488534]
  We introduce graph state manipulation tools that allow one to increase the local degree and to merge subgraphs.<n>We show how to minimize overheads by avoiding multiple edges, and compare with a local manipulation strategy based on measurement-based quantum computation together with transport.<n>These schemes have direct applications in entanglement-based quantum networks, sensor networks, and distributed quantum computing in general.
  arXiv  Detail & Related papers  (2025-05-13T09:49:54Z)
• Pauli measurements are not optimal for single-copy tomography [34.83118849281207]
  We prove a stronger upper bound of $O(frac10Nepsilon2)$ and a lower bound of $Omega(frac9.118Nepsilon2)$. This demonstrates the first known separation between Pauli measurements and structured POVMs.
  arXiv  Detail & Related papers  (2025-02-25T13:03:45Z)
• Entanglement-Assisted Coding for Arbitrary Linear Computations Over a Quantum MAC [34.32444379837011]
  We study a linear computation problem over a quantum multiple access channel (LC-QMAC) We propose an achievable scheme for LC-QMAC based on the stabilizer formalism and the ideas from entanglement-assisted quantum error-correcting codes (EAQECC)
  arXiv  Detail & Related papers  (2025-01-27T18:35:33Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Scalable High-Dimensional Multipartite Entanglement with Trapped Ions [0.0]
  We generalize the celebrated one-axis twisting (OAT) Hamiltonian for $N$ qubits to qudits. We find that starting from a product state of an arbitrary number of atoms $N$, dynamics under BOAT leads to the formation of GHZ states for qutrits and ququarts. Our results open a path for the scalable generation and certification of high-dimensional multipartite entanglement on current atom-based quantum hardware.
  arXiv  Detail & Related papers  (2024-07-29T06:54:50Z)
• Scalable Graph Compressed Convolutions [68.85227170390864]
  We propose a differentiable method that applies permutations to calibrate input graphs for Euclidean convolution. Based on the graph calibration, we propose the Compressed Convolution Network (CoCN) for hierarchical graph representation learning.
  arXiv  Detail & Related papers  (2024-07-26T03:14:13Z)
• Predicting Ground State Properties: Constant Sample Complexity and Deep Learning Algorithms [48.869199703062606]
  A fundamental problem in quantum many-body physics is that of finding ground states of local Hamiltonians. We introduce two approaches that achieve a constant sample complexity, independent of system size $n$, for learning ground state properties.
  arXiv  Detail & Related papers  (2024-05-28T18:00:32Z)
• Distributing Arbitrary Quantum Cluster States by Graph Transformation [3.3288564690349554]
  Quantum cluster state is a special class of nonlocal state among quantum particles. We develop an algorithm to establish arbitrary quantum cluster states of strong entanglement structures at a much lower cost than the state of the art.
  arXiv  Detail & Related papers  (2024-04-08T14:06:42Z)
• Continuously Distributing Entanglement in Quantum Networks with Regular Topologies [0.0]
  Small interconnected quantum processors can collaborate to tackle quantum computational problems. We analyze a protocol where entanglement is continuously distributed among nodes. We investigate how nodes can optimize the frequency of attempting entanglement swaps.
  arXiv  Detail & Related papers  (2024-02-02T16:14:50Z)
• High--N00N State Generation: N00N State Output of Floquet Engineering [0.0]
  The N00N state is a bipartite maximally entangled state crucial in quantum metrology applications. We show that this state can be generated as a superposition of modes of quantum light, a combination of light and motion, or a superposition of two spin ensembles. The approach discussed here can generate mesoscopic and macroscopic entangled states, such as entangled coherent and squeezed states.
  arXiv  Detail & Related papers  (2023-12-30T01:27:06Z)
• 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)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• Deterministic multi-qubit entanglement in a quantum network [0.06546249968484792]
  Scaling to large quantum communication or computation networks requires the deterministic generation of multi-qubit entanglement. We report a quantum network comprising two separate superconducting quantum nodes connected by a 1 meter-long superconducting coaxial cable.
  arXiv  Detail & Related papers  (2020-11-26T03:32:03Z)
• Generating W states with braiding operators [0.0]
  Braiding operators can be used to create entangled states out of product states. We present a unitary Yang-Baxter operator that embeds the W$_n$ state in a $(2n-1)$-qubit space.
  arXiv  Detail & Related papers  (2020-07-11T01:40:31Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.