Searcharxiv⌕ Search

arXiv subjects

Fenzhuo Guo

Publications and source records attributed to Fenzhuo Guo.

17 recordsLinked to original sources
arXiv2026

Semidefinite-programming hierarchies for classically simulable state families

Identifying whether a state family admits an irreducible quantum advantage is a fundamental task in quantum resource theory and quantum information processing. Here we study classically simulable state families, namely those residing within the convex hull of pairwise commuting families and therefore admitting a classical explanation. We develop a complete semidefinite-programming (SDP) hierarchy characterizing the set of classically simulable state families in arbitrary finite dimension. The key step is to reformulate classical simulability as a feasibility problem over deterministic response functions and auxiliary positive-operator-valued measures (POVMs) simulable by rank-one projective measurements. We establish a complete SDP hierarchy for rank-one projectively simulable POVMs and transfer the resulting characterization to state families, yielding both primal feasibility tests and dual affine witnesses certifying failure of classical simulability. Applying the hierarchy to state families mixed with depolarizing noise gives computable upper bounds on the critical classical visibility, which are matched by explicit classical simulations in several symmetric examples. These results provide a systematic convex-optimization framework for certifying classical simulability of quantum state families.

quant-ph↗
arXiv2026

Geometric Construction of Optimal Teleportation Witnesses

Not all entangled states are useful for quantum teleportation. We present a geometric method to construct optimal teleportation witnesses, which provide operational necessary and sufficient criteria for identifying the teleportation usefulness of arbitrary two-qudit entangled states. Specifically, by developing a two-layer iterative cutting-plane algorithm to solve the shortest distance problem from the target state $ρ$ to the convex set $S$ of useless states, we obtain the projection point $σ^* \in S$ and then construct the optimal teleportation witness from the projection geometry. Moreover, the shortest distance $D(ρ)$ obtained during this construction also serves as a necessary and sufficient criterion for usefulness. We apply our method to identify the teleportation usefulness of three classes of entangled states.

quant-ph↗
arXiv2026

Auxiliary-qubit-free quantum approximate optimization algorithm for the minimum dominating set problem

Quantum Approximate Optimization Algorithm (QAOA) is a promising framework for solving combinatorial optimization problems on near-term quantum devices. One such problem is the Minimum Dominating Set (MDS), which is known to be NP-hard. Existing QAOA algorithms for this problem typically require numerous auxiliary qubits, which increases circuit overhead and hardware requirements. In this paper, we propose an auxiliary-qubit-free QAOA algorithm based on Hamiltonian evolution (AQFH-QAOA) for the MDS problem. Unlike previous studies that require numerous auxiliary qubits, our algorithm eliminates the need for auxiliary qubits, thus significantly reducing circuit overhead. In addition, we present an auxiliary-qubit-free optimized implementation of the previously proposed Guerrero's QAOA algorithm (AQFG-QAOA) by utilizing gate decomposition techniques. Through a detailed analysis of gate complexity, we evaluate the applicability of these two algorithms. Numerical experiments demonstrate that our proposed algorithm achieves competitive solution quality compared to existing QAOA algorithms, making it a promising candidate for implementation on near-term quantum devices.

quant-ph↗
arXiv2026

Semi-device-independent certification of high-dimensional quantum channels

Certifying high-dimensional quantum channels is essential for ensuring the reliability of quantum communication protocols. Existing certification schemes often rely on fully trusted internal devices, which is difficult to achieve in realistic scenarios. Here, we propose a semi-device-independent framework for certifying channel properties directly from observed statistics, assuming only that the system dimension is known. By explicitly incorporating the full set of structural constraints inherent to Choi states, our approach exploits the Choi-Jamio{\l}kowski isomorphism for rigorous certification of quantum channels. The entanglement dimensionality of quantum channels is first certified by introducing a witness and numerically determining its Schmidt-number-dependent bounds. This certification method reproduces known analytical benchmarks and is applied to dephasing and depolarizing noise channels, thereby confirming its validity. To provide a more complete assessment of channel performance, the entanglement fidelity of quantum channels is also certified using a hierarchy of semidefinite programming relaxations based on localizing matrices. Lower bounds on the entanglement fidelity are obtained that are compatible with either the full set of observed statistics or a single witness value.

quant-ph↗
arXiv2025

A General Framework for Constructing Local Hidden-state Models to Determine the Steerability

Not all entangled states can exhibit quantum steering, and determining whether a given entangled state is steerable is a crucial problem in quantum information theory. The main challenge lies in verifying the existence of a local hidden-state (LHS) model capable of reproducing all post-measurement assemblages generated by arbitrary measurements. To address this, we propose a machine learning-based framework that employs batch sampling of measurements and gradient-based optimization to construct an optimal LHS model. We validate our method by analyzing the steerability of two-qubit Werner and two-qutrit isotropic states. For Werner states, our approach saturates the analytical visibility bounds under three Pauli measurements, arbitrary projective measurements (PVMs), and arbitrary positive operator-valued measurements (POVMs). For isotropic states, we achieve the known analytical bounds under arbitrary PVMs. We further investigate the steerability of this class of states under arbitrary POVMs, and our results suggest that POVMs can offer an advantage over PVMs in revealing the steerability of such states.

quant-ph↗
arXiv2025

Unbounded-input explicit Bell inequalities for general quantum networks

Quantum nonlocality in networks featuring multiple independent sources underpins large-scale quantum communication and poses fundamental challenges for its characterization. In this work, we construct a family of explicit nonlinear Bell inequalities to verify the nonlocality across the general multi-input quantum networks. The construction of these inequalities relies on the number of leaf nodes, a network parameter that can be identified by a linear-time algorithm. Our approach establishes a structural connection between bipartite full-correlation Bell inequalities and network Bell inequalities, enabling the analytical derivation of optimal quantum violations and the conditions under which they occur. We further quantify the upper bound on maximal violations achievable by arbitrary two-qubit mixed states in such networks, under separable measurements, and evaluate the noise robustness of the proposed inequalities via the visibilities of Werner states. Finally, we demonstrate that these inequalities can, in a device-independent manner, distinguish between network topologies of equal size that differ in the number of leaf nodes.

quant-ph↗
arXiv2025

Measuring network quantum steerability utilizing artificial neural networks

Network quantum steering plays a pivotal role in quantum information science, enabling robust certification of quantum correlations in scenarios with asymmetric trust assumptions among network parties. The intricate nature of quantum networks, however, poses significant challenges for the detection and quantification of steering. In this work, we develop a neural network-based method for measuring network quantum steerability, which can be generalized to arbitrary quantum networks and naturally applied to standard steering scenarios. Our method provides an effective framework for steerability analysis, demonstrating remarkable accuracy and efficiency in standard bipartite and multipartite steering scenarios. Numerical simulations involving isotropic states and noisy GHZ states yield results that are consistent with established findings in these respective scenarios. Furthermore, we demonstrate its utility in the bilocal network steering scenario, where an untrusted central party shares two-qubit isotropic states of different visibilities, $ν$ and $ω$, with trusted endpoint parties and performs a single Bell state measurement. Through explicit construction of a network local hidden state model derived from numerical results and incorporation of the entanglement properties of network assemblages, we analytically demonstrate that the network steering thresholds are determined by the curve $νω= {1}/{3}$ under the corresponding configuration.

quant-ph↗
arXiv2024

Self-Testing Positive Operator-Valued Measurements and Certifying Randomness

In the device-independent scenario, positive operator-valued measurements (POVMs) can certify more randomness than projective measurements. This paper self-tests a three-outcome extremal qubit POVM in the X-Z plane of the Bloch sphere by achieving the maximal quantum violation of a newly constructed Bell expression C'3, adapted from the chained inequality C3. Using this POVM, approximately 1.58 bits of local randomness can be certified, which is the maximum amount of local randomness achievable by an extremal qubit POVM in this plane. Further modifications of C'3 produce C''3, enabling the self-testing of another three-outcome extremal qubit POVM. Together, these POVMs certify about 2.27 bits of global randomness. Both local and global randomness surpass the limitations certified from projective measurements. Additionally, the Navascués-Pironio-Acín hierarchy is employed to compare the lower bounds on global randomness certified by C3 and several other inequalities. As the extent of violation increases, C3 demonstrates superior performance in randomness certification.

quant-ph↗
arXiv2024

Characterizing the set of quantum correlations in prepare-and-measure quantum chain-shaped networks

We introduce a hierarchy of tests satisfied by any probability distribution $P$ that represents the quantum correlations generated in prepare-and-measure (P\&M) quantum chain-shaped networks, assuming only the inner-product information of the non-orthogonal quantum states. The P\&M quantum chain-shaped networks involve multiple measurement parties, each measurement party potentially having multiple sequential receivers. Specifically, we adapt the original NPA-hierarchy by incorporating a finite number of linear and positive semi-definite constraints to characterize the quantum correlations in P\&M quantum chain-shaped networks. These constraints in each hierarchy are derived from sequential measurement operators and the inner-product matrix of the non-orthogonal quantum states. We apply the adapted NPA-hierarchy to tackle some quantum information tasks, including sequential quantum random access codes (QRACs) and randomness certification. First, we derive the optimal trade-off between the two sequential receivers in the $2 \to 1$ sequential QRACs. Furthermore, we have investigated semi-device-independent randomness certification in the double violation region of $2 \to 1$ sequential QRACs. Second, considering the presence of eavesdropper (Eve) in actual communication, we show how much global and local randomness can be certified using the optimal trade-off of $2 \to 1$ sequential QRACs. Additionally, we quantify the amount of local and global randomness that can be certified from the complete probabilities generated by the two sequential receivers. We conclude that utilizing the complete set of probabilities certifies more local and global randomness than relying solely on the optimal trade-off relationship.

quant-ph↗
arXiv2024

Sharing tripartite nonlocality sequentially using only projective measurements

Bell nonlocality is a valuable resource in quantum information processing tasks. Scientists are interested in whether a single entangled state can generate a long sequence of nonlocal correlations. Previous work has accomplished sequential tripartite nonlocality sharing through unsharp measurements. In this paper, we investigate the sharing of tripartite nonlocality using only projective measurements and sharing classical randomness. For the generalized GHZ state, we have demonstrated that using unbiased measurement choices, two Charlies can share the standard tripartite nonlocality with a single Alice and a single Bob, while at most one Charlie can share the genuine tripartite nonlocality with a single Alice and a single Bob. However, with biased measurement choices, the number of Charlies sharing the genuine tripartite nonlocality can be increased to two. Nonetheless, we find that using biased measurements does not increase the number of sequential observers sharing the standard tripartite nonlocality. Moreover, we provide the feasible range of double violation for the parameters of the measurement combination probability with respect to the state.

quant-ph↗
arXiv2021

Certification of three black boxes with unsharp measurements using $3 \rightarrow 1 $ sequential quantum random access codes

Unsharp measurements play an increasingly important role in quantum information theory. In this paper, we study a three-party prepare-transform-measure experiment with unsharp measurements based on $ 3 \rightarrow 1 $ sequential random access codes (RACs). We derive optimal trade-off between the two correlation witnesses in $ 3 \rightarrow 1 $ sequential quantum random access codes (QRACs), and use the result to complete the self-testing of quantum preparations, instruments and measurements for three sequential parties. We also give the upper and lower bounds of the sharpness parameter to complete the robustness analysis of the self-testing scheme. In addition, we find that classical correlation witness violation based on $3 \rightarrow 1 $ sequential RACs cannot be obtained by both correlation witnesses simultaneously. This means that if the second party uses strong unsharp measurements to overcome the classical upper bound, the third party cannot do so even with sharp measurements. Finally, we give the analysis and comparison of the random number generation efficiency under different sharpness parameters based on the determinant value, $2 \rightarrow 1 $ and $3 \rightarrow 1 $ QRACs separately. This letter sheds new light on generating random numbers among multi-party in semi-device independent framework.

quant-ph↗
arXiv2019

Spin image of an atomic vapor cell with a resolution smaller than the diffusion crosstalk free distance

The diffusion crosstalk free distance is an important parameter for spin images in atomic vapor cells and is also regarded as a limit on the spatial resolution. However, by modulating the pumping light both spatially and temporally using a digital micromirror device, a spin image of a vapor cell has been obtained with a distinguishable stripe width of 13.7~$μ$m, which is much smaller than the corresponding diffusion crosstalk free distance of $\sim$138~$μ$m. The fundamental limit on the spatial resolution as determined by diffusion and the uncertainty principle is analyzed.

physics.atom-ph↗
arXiv2005

Quantum key distribution without alternative measurements and rotations

A quantum key distribution protocol based on entanglement swapping is proposed. Through choosing particles by twos from the sequence and performing Bell measurements, two communicators can detect eavesdropping and obtain the secure key. Because the two particles measured together are selected out randomly, we need neither alternative measurements nor rotations of the Bell states to obtain security.

quant-ph↗
arXiv2005

On the information-splitting essence of two types of quantum key distribution protocols

With the help of a simple quantum key distribution (QKD) scheme, we discuss the relation between BB84-type protocols and two-step-type ones. It is shown that they have the same essence, i.e., information-splitting. More specifically, the similarity between them includes (1) the carrier state is split into two parts which will be sent one by one; (2) the possible states of each quantum part are indistinguishable; (3) anyone who obtains both parts can recover the initial carrier state and then distinguish it from several possible states. This result is useful for related scheme designing and security analyzing.

quant-ph↗
arXiv2004

A quantum key distribution and identification protocol based on entanglement swapping

A quantum key distribution and identification protocol is proposed, which is based on entanglement swapping. Through choosing particles by twos from the sequence and performing Bell measurements, two communicators can detect eavesdropping, identify each other and obtain the secure key according to the measurement results. Because the two particles measured together are selected out randomly, we need neither alternative measurements nor rotation of the Bell states. Furthermore, less Bell measurements are needed in our protocol than in the previous similar ones.

quant-ph↗