Variational M-Partite Geometric Entanglement Algorithm

• URL: http://arxiv.org/abs/2503.20056v1
• Date: Tue, 25 Mar 2025 20:33:44 GMT
• Title: Variational M-Partite Geometric Entanglement Algorithm
• Authors: Vahid Azimi-Mousolou, Prashant Singh,
• Abstract summary: We propose a variational quantum algorithm to evaluate entanglement across arbitrary partitions of an $N$-qubit system into $M$ parties.<n>Our results establish the versatility of the variational approach in capturing different types of entanglement in various quantum systems.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a variational quantum algorithm to evaluate the $M$-partite geometric entanglement across arbitrary partitions of an $N$-qubit system into $M$ parties. By constructing tailored variational ansatz circuits for both single- and multi-qubit parties, we optimize the overlap between a target quantum state and an $M$-partite variational separable state. This method provides a flexible and scalable approach for characterizing arbitrary $M$-partite entanglement in complex quantum systems of a given dimension. We assess the accuracy of the proposed method by reproducing known analytical results and demonstrate its capability to evaluate entanglement among $M$ parties for any given conventional or unconventional partitions of one- and two-dimensional spin systems, both near and at a quantum critical point. Our results establish the versatility of the variational approach in capturing different types of entanglement in various quantum systems, surpassing the capabilities of existing methods. Our approach offers a powerful methodology for advancing research in quantum information science, condensed matter physics, and quantum field theory. Additionally, we discuss its advantages, highlighting its adaptability to diverse system architectures in the context of near-term quantum devices.

Related papers

• Genuine Multipartite Entanglement in Quantum Optimization [0.3495246564946556]
  We show that multipartite entanglement provides an upper bound to the overlap of the instantaneous state with an exact solution.<n>Our results help to shed light on how complex quantum correlations come to bear as a resource in quantum optimization.
  arXiv  Detail & Related papers  (2024-11-12T19:00:16Z)
• Benchmarking Variational Quantum Eigensolvers for Entanglement Detection in Many-Body Hamiltonian Ground States [37.69303106863453]
  Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. We use a specific class of VQA named variational quantum eigensolvers (VQEs) to benchmark them at entanglement witnessing and entangled ground state detection. Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.
  arXiv  Detail & Related papers  (2024-07-05T12:06:40Z)
• Open quantum dynamics with variational non-Gaussian states and the truncated Wigner approximation [0.0]
  We present a framework for simulating the open dynamics of spin-boson systems by combining variational non-Gaussian states with a quantum trajectories approach. We discuss how the recently developed truncated Wigner approximation for open quantum systems can be applied to the same Hamiltonian.
  arXiv  Detail & Related papers  (2024-07-02T19:10:03Z)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Enhanced Entanglement in the Measurement-Altered Quantum Ising Chain [43.80709028066351]
  Local quantum measurements do not simply disentangle degrees of freedom, but may actually strengthen the entanglement in the system.<n>This paper explores how a finite density of local measurement modifies a given state's entanglement structure.
  arXiv  Detail & Related papers  (2023-10-04T09:51:00Z)
• Implicit differentiation of variational quantum algorithms [0.8594140167290096]
  We show how to leverage implicit differentiation for computation through variational quantum algorithms. We explore applications in condensed matter physics, quantum machine learning, and quantum information.
  arXiv  Detail & Related papers  (2022-11-24T19:00:19Z)
• Certifying Quantum Separability with Adaptive Polytopes [1.085294773316861]
  We propose a method to certify quantum separability of two- and multiparticle quantum systems. For multiparticle systems, the approach allows to characterise full separability for up to five qubits or three qutrits. Our methods allow to identify systematically quantum states with interesting entanglement properties.
  arXiv  Detail & Related papers  (2022-10-18T18:00:00Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
  We investigate properties of entanglement and its role for quantum communication. For transformations between bipartite pure states, we prove the existence of a universal catalyst. We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
  arXiv  Detail & Related papers  (2022-02-10T18:36:25Z)
• Adaptive variational quantum eigensolvers for highly excited states [4.038971004196936]
  Highly excited states of quantum many-body systems are central objects in the study of quantum dynamics and thermalization. We propose an adaptive variational algorithm, adaptive VQE-X, that self-generates a variational ansatz for arbitrary eigenstates of a many-body Hamiltonian $H$.
  arXiv  Detail & Related papers  (2021-04-26T15:03:51Z)

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.