Searcharxiv⌕ Search

arXiv subjects

Bang-Hai Wang

Publications and source records attributed to Bang-Hai Wang.

13 recordsLinked to original sources
arXiv2026

Multiple fidelities and joint numerical range

We investigate the effectiveness of entanglement detection based on multiple fidelities via the geometry of the joint separable numerical range. When all reference states are product states, we derive a necessary and sufficient criterion for such detection: either some pair of reference states has nontrivial moduli of the local inner products on both subsystems, or the orthogonal complement of the span of the reference states is completely entangled. We further show that there exist sets of reference product states for which no proper subset is effective for entanglement detection, whereas the full set is. A typical example of this phenomenon is provided by unextendible product bases. Moreover, for a pair of reference product states on a bipartite system with arbitrary local dimensions, we characterize both the joint numerical range and the joint separable numerical range, showing that the joint separable numerical range is determined solely by their local fidelities, as illustrated by a representative two-qubit example. Our results offer a systematic approach to designing effective entanglement witnesses and lay the groundwork for extensions to higher-dimensional and multipartite scenarios.

quant-ph↗
arXiv2024

Internal Boundary between Entanglement and Separability Within a Quantum State

Quantum states are the key mathematical objects in quantum mechanics, and entanglement lies at the heart of the nascent fields of quantum information processing and computation. However, there has not been a general, necessary and sufficient, and operational separability condition to determine whether an arbitrary quantum state is entangled or separable. In this paper, we show that whether a quantum state is entangled or not is determined by a threshold within the quantum state. We first introduce the concept of \emph{finer} and \emph{optimal} separable states based on the properties of separable states in the role of higher-level witnesses. Then we show that any bipartite quantum state can be decomposed into a convex mixture of its optimal entangled state and its optimal separable state. Furthermore, we show that whether an arbitrary quantum state is entangled or separable, as well as positive partial transposition (PPT) or not, is determined by the robustness of its optimal entangled state to its optimal separable state with reference to a crucial threshold. Moreover, for an arbitrary quantum state, we provide operational algorithms to obtain its optimal entangled state, its optimal separable state, its best separable approximation (BSA) decomposition, and its best PPT approximation decomposition while it was an open question that how to calculate the BSA in high-dimension systems.

quant-ph↗
arXiv2024

An RNN-policy gradient approach for quantum architecture search

Variational quantum circuits are one of the promising ways to exploit the advantages of quantum computing in the noisy intermediate-scale quantum technology era. The design of the quantum circuit architecture might greatly affect the performance capability of the quantum algorithms. The quantum architecture search is the process of automatically designing quantum circuit architecture, aiming at finding the optimal quantum circuit composition architecture by the algorithm for a given task, so that the algorithm can learn to design the circuit architecture. Compared to manual design, quantum architecture search algorithms are more effective in finding quantum circuits with better performance capabilities. In this paper, based on the deep reinforcement learning, we propose an approach for quantum circuit architecture search. The sampling of the circuit architecture is learnt through reinforcement learning based controller. Layer-based search is also used to accelerate the computational efficiency of the search algorithm. Applying to data classification tasks we show that the method can search for quantum circuit architectures with better accuracies. Moreover, the circuit has a smaller number of quantum gates and parameters.

quant-ph↗
arXiv2021

Universal Single-Server Blind Quantum Computation for Classical Clients

Blind quantum computation allows a client without enough quantum technologies to delegate her quantum computation to a remote quantum server, while keeping her input, output and algorithm secure. In this paper, we propose a universal single-server and almost-classical-client blind quantum computation protocol. In this protocol, the client interfaces with only one server and the only ability of the client required is to get particles from the trusted center and forward them to the server. We present an analysis of this protocol and modify it to a universal single-server and fully-classical-client blind quantum computation protocol by improving the ability of the trusted center. Based on our protocols and recent works, a new "Cloud + Certificate Authority (CA)" style is proposed for the blind quantum computation.

quant-ph↗
arXiv2021

Common Coherence Witnesses and Common Coherent States

We show the properties and characterization of coherence witnesses. We show methods for constructing coherence witnesses for an arbitrary coherent state. We investigate the problem of finding common coherence witnesses for certain class of states. We show that finitely many different witnesses $W_1, W_2, \cdots, W_n$ can detect some common coherent states if and only if $\sum_{i=1}^nt_iW_i$ is still a witnesses for any nonnegative numbers $t_i(i=1,2,\cdots,n)$. We show coherent states play the role of high-level witnesses. Thus, the common state problem is changed into the question of when different high-level witnesses (coherent states) can detect the same coherence witnesses. Moreover, we show a coherent state and its robust state have no common coherence witness and give a general way to construct optimal coherence witnesses for any comparable states.

quant-ph↗
arXiv2021

Tomographic Witnessing and Holographic Quantifying of Coherence

The detection and quantification of quantum coherence play significant roles in quantum information processing. We present an efficient way of tomographic witnessing for both theoretical and experimental detection of coherence. We prove that a coherence witness is optimal if and only if all of its diagonal elements are zero. Naturally, we obtain a bona fide homographic measure of coherence given by the sum of the absolute values of the real and the imaginary parts of the non-diagonal entries of a density matrix, together with its interesting relations with other coherence measures like $l_1$ norm coherence and robust of coherence.

quant-ph↗
arXiv2016

The hierarchies of "witnesses" and the properties and characterization of entangled states as super entanglement witnesses

Quantum entanglement lies at the heart of quantum mechanical and quantum information processing. Following the question who \emph{witnesses} entanglement witnesses, we show entangled states play as the role of super entanglement witnesses. We show separable states play the role of "super super entanglement witnesses" and "witness" other observables than entanglement witnesses. We show that there exists a hierarchy structure of witnesses and there exist "witnesses" everywhere. Furthermore, we show the properties and characterization of entangled states as super entanglement witnesses. By the role of super witnesses of entangled states, we immediately find the question when different entanglement witnesses can detect the same entangled states [{\it Phys. Lett. A }{\bf 356} 402 (2006)] is the same as the question when different entangled states can be detected by the same entanglement witnesses [{\it Phys. Rev. A} {\bf 75} 052333 (2007)]. By the role of "witnesses", we define finer entangled states and optimal entangled states. The definition gives a nonnumeric measurement of entanglement and an unambiguous discrimination of entangled states, and the procedure of optimization for a general entangled state $ρ$ is just finding the best separable approximation (BSA) to $ρ$ in [ {\it Phys. Rev. Lett.} {\bf 80} 2261 (1998)].}

quant-ph↗
arXiv2015

Characterization and properties of weakly optimal entanglement witnesses

We present an analysis of the properties and characteristics of weakly optimal entanglement witnesses, that is witnesses whose expectation value vanishes on at least one product vector. Any weakly optimal entanglement witness can be written as the form of $W^{wopt}=σ-c_σ^{max} I$, where $c_σ^{max}$ is a non-negative number and $I$ is the identity matrix. We show the relation between the weakly optimal witness $W^{wopt}$ and the eigenvalues of the separable states $σ$. Further we give an application of weakly optimal witnesses for constructing entanglement witnesses in a larger Hilbert space by extending the result of [P. Badzicag {\it et al}, Phys. Rev. A {\bf 88}, 010301(R) (2013)], and we examine their geometric properties.

quant-ph↗
arXiv2014

Universal methods for extending any entanglement witness from the bipartite to the multipartite case

Any bipartite entanglement witness $W$ can be written as $W=c_σI-σ$, where $σ$ is a quantum state, $I$ is the identity matrix, and $c_σ$ is a non-negative number. We present a general method to extend the given entanglement witness to multipartite cases via purification, partial purification, and direct tensor of the quantum state $σ$. Our methods extend $σ$ but leave the parameter $c_σ$ untouched. This is very valuable since the parameter is generally not easy to compute.

quant-ph↗
arXiv2013

Structural physical approximations and entanglement witnesses

The structural physical approximation (SPA) to a positive map is considered to be one of the most important method to detect entanglement in the real physical world. We first show that an arbitrary entanglement witness (EW) $W$ can be constructed from a separable density matrix $σ$ in the form of $W=σ-c_σ I$, where $c_σ$ is a non-negative number and $I$ is the identity matrix. Following the general form of EWs from separable states, we show a sufficient condition and a sufficient and necessary condition in low dimensions of that SPAs to positive maps do not define entanglement-breaking channels. We show that either the SPA of an EW or the SPA of the partial transposition of the EW in low dimensions is an entanglement-breaking channel. We give sufficient conditions of violating the SPA conjecture [\emph{Phys. Rev. A}{\bf 78,} 062105 (2008)]. Our results indicate that the SPA conjecture is independent of whether or not positive maps are optimal.

quant-ph↗
arXiv2012

A sufficient condition of violating the SPA conjecture

Based on the general form of entanglement witnesses constructed from separable states, we first show a sufficient condition of violating the structural physical approximation (SPA) conjecture [Phys. Rev. A 78, 062105 (2008)]. Then we discuss the SPA conjecture for decomposable entanglement witnesses. Moreover, we make geometric illustrations of the connection between entanglement witnesses and the sets of quantum states, separable states, and entangled states comparing with planes and vectors in Euclidean space.

quant-ph↗
arXiv2011

Constructing all entanglement witnesses from density matrices

We demonstrate a general procedure to construct entanglement witnesses for any entangled state. This procedure is based on the trace inequality and a general form of entanglement witnesses, which is in the form $W=ρ-c_ρ I$, where $ρ$ is a density matrix, $c_ρ$ is a non-negative number related to $ρ$, and $I$ is the identity matrix. The general form of entanglement witnesses is deduced from Choi-Jamiołkowski isomorphism, that can be reinterpreted as that all quantum states can be obtained by a maximally quantum entangled state pass through certain completely positive maps. Furthermore, we provide the necessary and sufficient condition of the entanglement witness $W=ρ-c_ρI$ in operation, as well as in theory.

quant-ph↗