SearcharxivSearch

arXiv subjects

Wanchen Zhang

Publications and source records attributed to Wanchen Zhang.

6 recordsLinked to original sources

Robust Quantum Extremal Numbers

Absolutely maximally entangled states require every reduction of at most half of the parties to be maximally mixed, a condition that is both rigid and often impossible for qubit systems. Previous work introduced the quantum extremal number, which maximizes the number of exactly maximally mixed half-body marginals, and determined the exact value Qex(8,4)=56. The present work develops a robust extension of this extremal problem. For a subsystem $A$, the marginal maximal-mixing defect is defined by \[ D_A=2^{|A|}\operatorname{Tr}(ρ_A^2)-1 =2^{|A|}\left\|ρ_A-\frac{I_A}{2^{|A|}}\right\|_2^2, \] and $Q_{\mathrm{ex},\varepsilon}^{D}(n,k)$ is defined as the maximum number of $k$-body marginals satisfying $D_A\leq\varepsilon$ in an $n$-qubit pure state. This counting problem differs from approximate $k$-uniformity, which requires all $k$-body marginals to obey a common error bound. For pure states on $4m$ qubits, the following local stability inequality is established: \[ \sum_{i\in T}D_{T\setminus\{i\}}\geq1 \qquad (|T|=2m+1). \] It follows that, whenever $\varepsilon<1/(2m+1)$, the hypergraph of $\varepsilon$-good $2m$-subsets is $K_{2m+1}^{(2m)}$-free. Combined with the known exact eight-qubit construction, this yields the stability plateau \[ Q_{\mathrm{ex},\varepsilon}^{D}(8,4)=56, \qquad 0\leq\varepsilon<\frac15. \] For odd systems of $2k+1$ qubits, the exact forbidden hypergraph $H_k$ is used to derive explicit finite-error stability radii. In particular, $Q_{\mathrm{ex},\varepsilon}^{D}(9,4)\leq120$ for $0\leq\varepsilon<1/17$. These results turn exact quantum Turán obstructions into quantitative robustness statements and identify intervals on which quantum extremal numbers are stable under imperfect marginal mixedness.

quant-ph

Automated Construction and Verification of Unextendible Product Bases

Unextendible product bases (UPBs) are important structures in quantum information theory, with applications to completely entangled subspaces, bound entanglement, and local indistinguishability. Since many properties and applications of UPBs are closely related to their cardinalities, one of the central problems in the study of UPBs is to determine whether UPBs of prescribed sizes exist in a given multipartite system. In this paper, we introduce a SAT-assisted framework based on decompositions of the \(N\)-dimensional hypercube. We define \(O_N\)-tile decompositions and prove a tile-to-UPB theorem: every \(O_N\)-tile decomposition induces a UPB through a construction based on tile-wise Fourier product bases and a global stopper state. We then encode the search for such decompositions as a Boolean satisfiability (SAT) problem and use SAT solvers to generate explicit instances. In terms of verification, we also implement a UPB verification algorithm based on local orthogonality graphs and unsaturated subspaces. The algorithm can be used to determine whether an arbitrary finite set of product states forms a UPB. Using this framework, we obtain UPBs of several sizes in some tripartite and quadripartite systems, including sizes \(13,14,\ldots,23\) in \(\mathbb C^3\otimes\mathbb C^3\otimes\mathbb C^3\). Moreover, the small-dimensional instances obtained here can serve as seed UPBs for recursive constructions, leading to further examples in larger multipartite systems.

quant-ph

A five-qubit 1-resistant graph state and stabilizer marginal certificates

We study particle-loss resistant entanglement within the framework of stabilizer and graph states. A pure state is \(m\)-resistant if it remains entangled after the loss of any \(m\) particles and becomes fully separable after the loss of any \(m+1\) particles. The smallest previously unresolved qubit case was the existence of a five-qubit \(1\)-resistant pure state, which is resolved here by the five-cycle graph state \(\ket{C_5}\). A stabilizer-subgroup method is also developed for verifying \(m\)-resistance in graph states, using local stabilizers to certify full separability and exact negative partial transpose~(NPT) witnesses to certify entanglement. Applying this to all graph states associated with non-isomorphic graphs on five, six, and seven vertices, we obtain a graph state classification up to local Clifford equivalence, which also classifies stabilizer states up to local Clifford equivalence. Thus, the five-qubit \(1\)-resistant stabilizer states are exactly the local Clifford class of \(C_5\). Six-qubit \(2\)-resistant stabilizer states exist in three distinct local Clifford classes, whereas no seven-qubit stabilizer state is \(m\)-resistant for any nonzero admissible \(m\). Finally, we prove that the cycle graph states \(\ket{C_N}\) with \(N\ge 7\) are not \(m\)-resistant for any \(0\le m\le N-2\).

quant-ph

New constructions of multipartite entanglement resistant to particle loss

An entangled state is called m-resistant if it remains entangled after losing an arbitrary subset of mparticles but becomes fully separable after losing any number of particles larger than m. Quinta et al. [Phys. Rev. A (2019)] conjectured that for any N-particle systems, there always exists an m-resistant pure state. In this paper, we give two general constructions of m-resistant pure states. One is from the mixtures of Dicke states, which provides strong (N - k)-resistant pure N-qubit states with k = 4 or 5. The other is from classical error correcting codes, which provides new m-resistant qudit states for certain m < N/2.

quant-ph

Extremal Maximal Entanglement

A pure multipartite quantum state is called absolutely maximally entangled if all reductions of no more than half of the parties are maximally mixed. However, an $n$-qubit absolutely maximally entangled state only exists when $n$ equals $2$, $3$, $5$, and $6$. A natural question arises when it does not exist: which $n$-qubit pure state has the largest number of maximally mixed $\lfloor n/2 \rfloor$-party reductions? Denote this number by $Qex(n)$. It was shown that $Qex(4)=4$ in [Higuchi et al.Phys. Lett. A (2000)] and $Qex(7)=32$ in [Huber et al.Phys. Rev. Lett. (2017)]. In this paper, we give a general upper bound of $Qex(n)$ by linking the well-known Turán's problem in graph theory, and provide lower bounds by constructive and probabilistic methods. In particular, we show that $Qex(8)=56$, which is the third known value for this problem.

quant-ph

Almost all even-particle pure states are determined by their half-body marginals

Determining whether the original global state is uniquely determined by its local marginals is a prerequisite for some efficient tools for characterizing quantum states. This paper shows that almost all generic pure states of even $N$-particle with equal local dimension are uniquely determined among all other pure states (UDP) by four of their half-body marginals. Furthermore, we give a graphical description of the marginals for determining genuinely multipartite entangled states, which leads to several lower bounds on the number of required marginals. Finally, we present a construction of N-qudit states obtained from certain combinatorial structures that cannot be UDP by its k-body marginals for some k>N/2-1.

quant-ph