Variational toolbox-based separability detection of multiqubit states

• URL: http://arxiv.org/abs/2506.04674v1
• Date: Thu, 05 Jun 2025 06:40:57 GMT
• Title: Variational toolbox-based separability detection of multiqubit states
• Authors: Jin-Min Liang, Shao-Ming Fei, Qiongyi He,
• Abstract summary: We propose variational toolboxes to identify the $k$-separability of pure states, with or without preparation noise.<n>We also introduce adaptive optimization strategies to detect the $k$-separability of mixed states.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Parametrized quantum circuits (PQCs) are crucial in variational quantum algorithms. While it is commonly believed that the optimal PQC is solely used to reproduce the target state, we here reveal that the optimal PQC can also provide valuable insights into the state's properties. We propose variational toolboxes to identify the $k$-separability of pure states, with or without preparation noise, by checking the structure within the optimal PQCs. Additionally, we introduce adaptive optimization strategies to detect the $k$-separability of mixed states. Compared to fixed PQCs, our approach controls fewer parameters for low-rank states. Finally, we validate our methods through numerical demonstrations for various states.

Related papers

• Gate Freezing Method for Gradient-Free Variational Quantum Algorithms in Circuit Optimization [0.0]
  Quantum circuits (PQCs) are key components of variational quantum algorithms (VQAs)<n>PQCs enable flexible encoding of quantum information through quantum gates and have been successfully applied across domains such as quantum chemistry, optimization, and quantum machine learning.<n>Despite their potential, PQC performance on NISQ hardware is hindered by noise, decoherence, and the presence of barren plateaus, which can impede gradient-based optimization.
  arXiv  Detail & Related papers  (2025-07-10T13:22:31Z)
• Optimization Strategies for Variational Quantum Algorithms in Noisy Landscapes [0.196629787330046]
  Variational Quantum Eigensolver (VQE) approximates molecular ground-state energies by minimizing a Hamiltonian.<n>VQE contributes to condensed matter physics by exploring quantum phase transitions and exotic states.<n>This study systematically evaluates over 50 meta-heuristic optimization algorithms including evolution-based, swarm-based, and music-inspired methods.
  arXiv  Detail & Related papers  (2025-06-02T14:22:30Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [39.58317527488534]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Variational quantum state preparation for quantum-enhanced metrology in noisy systems [0.7652747219811168]
  We simulate a low-depth variational quantum circuit (VQC) composed of a sequence of global rotations and entangling operations applied to a chain of qubits subject to dephasing noise. We find that regardless of the details of the entangling operation implemented in the VQC, the optimal quantum states can be broadly classified into a trio of qualitative regimes. Our findings are relevant for designing optimal state-preparation strategies for next-generation quantum sensors exploiting entanglement.
  arXiv  Detail & Related papers  (2024-06-04T00:09:05Z)
• Benchmarking Optimizers for Qumode State Preparation with Variational Quantum Algorithms [10.941053143198092]
  There has been a growing interest in qumodes due to advancements in the field and their potential applications. This paper aims to bridge this gap by providing performance benchmarks of various parameters used in state preparation with Variational Quantum Algorithms.
  arXiv  Detail & Related papers  (2024-05-07T17:15:58Z)
• Equivalence Checking of Parameterised Quantum Circuits [13.796569260568939]
  We propose a novel compact representation for PQCs based on tensor decision diagrams. We present an algorithm for verifying PQC equivalence without the need for instantiation.
  arXiv  Detail & Related papers  (2024-04-29T06:25:00Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Dynamical learning of a photonics quantum-state engineering process [48.7576911714538]
  Experimentally engineering high-dimensional quantum states is a crucial task for several quantum information protocols. We implement an automated adaptive optimization protocol to engineer photonic Orbital Angular Momentum (OAM) states. This approach represents a powerful tool for automated optimizations of noisy experimental tasks for quantum information protocols and technologies.
  arXiv  Detail & Related papers  (2022-01-14T19:24:31Z)
• FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuits [105.54048699217668]
  We propose a FLexible Initializer for arbitrarily-sized Parametrized quantum circuits. FLIP can be applied to any family of PQCs, and instead of relying on a generic set of initial parameters, it is tailored to learn the structure of successful parameters. We illustrate the advantage of using FLIP in three scenarios: a family of problems with proven barren plateaus, PQC training to solve max-cut problem instances, and PQC training for finding the ground state energies of 1D Fermi-Hubbard models.
  arXiv  Detail & Related papers  (2021-03-15T17:38:33Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)
• Adaptive quantum state tomography with iterative particle filtering [7.943024117353315]
  We present an adaptive particle filter based QST protocol which improves the scaling of fidelity compared to nonadaptive Bayesian schemes for arbitrary multi-qubit states. Numerical examples and implementation on IBM quantum devices demonstrate improved performance for arbitrary quantum states.
  arXiv  Detail & Related papers  (2020-10-24T11:00:33Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)

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.