Related papers: Detecting Entanglement by Pure Bosonic Extension

Related papers

Analytical Series Expansion for Efficient Gradient Evaluation in Multi-Qubit Optimal Control [42.97938764966747]
We present a unifying framework for gradient-based quantum optimal control.<n>For the case of unitary propagators, we derive a series expansion involving time-independent commutators and time-dependent coefficients.<n>The method is particularly suited for simulating optimal control tasks in quantum systems with local interactions.
arXiv Detail & Related papers (2026-07-29T12:50:52Z)
Entanglement Quantification via Symmetric Extensions: A Resource Theory Hierarchy [3.662037602213926]
We introduce a hierarchy of entanglement measures Ek based on k-symmetric PPT extensions.<n>Each Ek, defined via a minimal eigenvalue shift, is faithful, convex, and monotone under free operations.<n>The hierarchy strictly refines PPT-robustness at k = 1, detects bound entanglement at k = 2, and converges exactly to the separability measure as k -> infinity.
arXiv Detail & Related papers (2026-07-18T20:39:35Z)
Efficient Fourier-Based Linear Combination of Unitaries and Applications in Quantum Optimization [0.7009487789080343]
We investigate ancilla-free linear combination of unitaries (LCU) as a framework for approximating complex quantum circuits.<n>We show that Fourier-based LCU constructions efficiently decompose broad classes of diagonal and non-diagonal unitaries.
arXiv Detail & Related papers (2026-05-18T18:05:08Z)
EQE-QAOA: An Equivalence-Preserving Qubit Efficient Framework for Combinatorial Optimization [54.05451096499336]
Existing techniques rely on qubit reduction at the cost of information loss, leading to degraded computational performance.<n>We propose the Equivalence-preserving Qubit Efficient QAOA, which significantly reduces the required number of qubits without degrading performance.<n>We show that it is broadly applicable to large-scale optimization problems, excluding only unconstrained problems with completely independent variables.
arXiv Detail & Related papers (2026-04-20T13:57:49Z)
A Posteriori Certification Framework for Generalized Quantum Arimoto-Blahut Algorithms [41.15017547767954]
We introduce an a posteriori certification viewpoint for the generalized quantum Arimoto-Blahut (QAB) algorithm.<n>We prove a global convergence theorem showing that, under convexity and a substantially weaker numerically verifiable condition, the QAB iteration converges to the global minimizer.<n>As an application, we develop a certified iterative scheme for computing the quantum relative entropy of channels.
arXiv Detail & Related papers (2026-01-14T09:10:41Z)
Decentralized Optimization on Compact Submanifolds by Quantized Riemannian Gradient Tracking [45.147301546565316]
This paper considers the problem of decentralized optimization on compact submanifolds.<n>We propose an algorithm where agents update variables using quantized variables.<n>To the best of our knowledge, this is the first algorithm to achieve an $mathcalO (1/K)$ convergence rate in the presence of quantization.
arXiv Detail & Related papers (2025-06-09T01:57:25Z)
Noise-reduction of multimode Gaussian Boson Sampling circuits via Unitary Averaging [41.94295877935867]
We improve Gaussian Boson Sampling (GBS) circuits by integrating the unitary averaging protocol.<n>We mitigate arbitrary interferometric noise, including beam-splitter and phase-shifter imperfections.<n>We derive a power-law formula predicting performance gains in large-scale systems.
arXiv Detail & Related papers (2025-06-06T04:28:06Z)
Unifying adiabatic state-transfer protocols with $(α, β)$-hypergeometries [0.9188951403098383]
We provide a unifying framework, called $(alpha,beta)$-hypergeometries, that allows for flexible, noise-resistant, and easy-to-use implementation of enforced adiabatic dynamics. We derive precise expressions for infidelity resonances and establish performance guarantees in the adiabatic limit for any choice of $(alpha,beta)$.
arXiv Detail & Related papers (2025-04-10T18:00:01Z)
Tensor Cross Interpolation of Purities in Quantum Many-Body Systems [0.0]
In quantum many-body systems the exponential scaling of the Hilbert space with the number of degrees of freedom renders a complete state characterization. Recently, a compact way of storing subregions' purities by encoding them as amplitudes of a fictitious quantum wave function, known as entanglement feature, was proposed. In this work, we demonstrate that the entanglement feature can be efficiently defining using only a amount of samples in the number of degrees of freedom.
arXiv Detail & Related papers (2025-03-21T15:33:00Z)
Sample-Efficient Estimation of Nonlinear Quantum State Functions [5.641998714611475]
We introduce the quantum state function (QSF) framework by extending the SWAP test via linear combination of unitaries and parameterized quantum circuits.<n>Our framework enables the implementation of arbitrarily normalized degree-$n$ functions of quantum states with precision.<n>We apply QSF for developing quantum algorithms for fundamental tasks, including entropy, fidelity, and eigenvalue estimations.
arXiv Detail & Related papers (2024-12-02T16:40:17Z)
Optimising the relative entropy under semidefinite constraints [0.0]
Finding the minimal relative entropy of two quantum states under semidefinite constraints is a pivotal problem in quantum information theory.<n>We build on a recently introduced integral representation of quantum relative entropy by [Frenkel, Quantum 7, 1102 (2023) and provide reliable bounds as a sequence of semidefinite programs (SDPs)<n>Our approach ensures provable sublinear convergence in the discretization, while also maintaining resource efficiency in terms of SDP matrix dimensions.
arXiv Detail & Related papers (2024-04-25T20:19:47Z)
Efficiently Escaping Saddle Points for Non-Convex Policy Optimization [40.0986936439803]
Policy gradient (PG) is widely used in reinforcement learning due to its scalability and good performance. We propose a variance-reduced second-order method that uses second-order information in the form of Hessian vector products (HVP) and converges to an approximate second-order stationary point (SOSP) with sample complexity of $tildeO(epsilon-3)$.
arXiv Detail & Related papers (2023-11-15T12:36:45Z)
From barren plateaus through fertile valleys: Conic extensions of parameterised quantum circuits [0.0]
We introduce an approach that favours jumps out of a barren plateau into a fertile valley. These operations are constructed from conic extensions of parameterised unitary quantum circuits. We further reduce the problem of finding optimal jump directions to a low-dimensional generalised eigenvalue problem.
arXiv Detail & Related papers (2023-10-06T13:56:42Z)
Tapping into Permutation Symmetry for Improved Detection of k-Symmetric Extensions [3.501108734684888]
In this study, we introduce an approach that adeptly leverages permutation symmetry. By fine-tuning the SDP problem for detecting ( k )-symmetric extensions, our method markedly diminishes the searching space dimensionality. This leads to an algorithmic enhancement, reducing the complexity from ( O(d2k) ) to ( O(kd2) ) in the qudit ( k )-symmetric extension scenario.
arXiv Detail & Related papers (2023-09-08T06:05:56Z)
Computationally Efficient PAC RL in POMDPs with Latent Determinism and Conditional Embeddings [97.12538243736705]
We study reinforcement learning with function approximation for large-scale Partially Observable Decision Processes (POMDPs) Our algorithm provably scales to large-scale POMDPs.
arXiv Detail & Related papers (2022-06-24T05:13:35Z)
Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency [111.83670279016599]
We study reinforcement learning for partially observed decision processes (POMDPs) with infinite observation and state spaces. We make the first attempt at partial observability and function approximation for a class of POMDPs with a linear structure.
arXiv Detail & Related papers (2022-04-20T21:15:38Z)
Modular Parity Quantum Approximate Optimization [0.0]
parity transformation encodes spin models in the low-energy subspace of a larger Hilbert-space with constraints on a planar lattice. Applying the Quantum Approximate Optimization Algorithm (QAOA), the constraints can either be enforced explicitly, by energy penalties, or implicitly, by restricting the dynamics to the low-energy subspace via the driver Hamiltonian. Here we combine the two approaches in order to improve the QAOA performance while keeping the circuit parallelizable. In particular, we introduce a modular parallelization method that partitions the circuit into clusters of subcircuits with fixed maximal circuit depth, relevant for scaling up to large system sizes
arXiv Detail & Related papers (2022-03-08T19:02:55Z)
Robust preparation of Wigner-negative states with optimized SNAP-displacement sequences [41.42601188771239]
We create non-classical states of light in three-dimensional microwave cavities. These states are useful for quantum computation. We show that this way of creating non-classical states is robust to fluctuations of the system parameters.
arXiv Detail & Related papers (2021-11-15T18:20:38Z)
Bosonic field digitization for quantum computers [62.997667081978825]
We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
arXiv Detail & Related papers (2021-08-24T15:30:04Z)
Debiasing a First-order Heuristic for Approximate Bi-level Optimization [38.068090269482425]
Approximate bi-level optimization (ABLO) consists of (outer-level) optimization problems, involving numerical (inner-level) optimization loops. There is a lack of theoretical understanding of FOM's convergence properties. We propose an unbiased FOM enjoying constant memory complexity as a function of $r$.
arXiv Detail & Related papers (2021-06-04T13:46:48Z)
Improving the accuracy and efficiency of quantum connected moments expansions [4.9834612867114965]
In quantum chemistry, the variational quantum eigensolver (VQE) algorithm has become ubiquitous. Here we use the ADAPT-VQE algorithm to test shallow circuit construction strategies.
arXiv Detail & Related papers (2021-03-16T15:13:40Z)
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)
Entanglement distance for arbitrary $M$-qudit hybrid systems [0.0]
We propose a measure of entanglement which can be computed for pure and mixed states of a $M$-qudit hybrid system. We quantify the robustness of entanglement of a state through the eigenvalues analysis of the metric tensor associated with it.
arXiv Detail & Related papers (2020-03-11T15:16:36Z)

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