XZXiaoqian Zhang

Xiaoqian Zhang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Xiaoqian Zhang has a total of 26 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Efficient evaluation of optical quantum modules via two-photon high-dimensional interference

    by Xiaoqian Zhang, Maolin Luo, Xiaoqi Zhou

    The rapid advancement of quantum information technology has increased the demand for precise testing and calibration of quantum modules, especially in optical quantum circuits where module reliability directly impacts system performance. To address this need, we propose a two-photon quantum module evaluation method based on high-dimensional Hong–Ou–Mandel interference. Our method uses multi-degree-of-freedom photon encoding to enable rapid and accurate evaluation of optical quantum modules. Compared to traditional methods such as quantum process tomography and direct fidelity estimation, our method not only simplifies implementation but also significantly minimizes the measurement resources required. Notably, the resource demands remain invariant as the system dimensionality scales, ensuring efficient evaluation even in high-dimensional quantum systems. We validated this method on a programmable silicon photonic chip, demonstrating its ability to accurately evaluate optical quantum module performance while significantly reducing resource consumption. This quantum module evaluation method holds promise for broader applications in the field of optical quantum information technologies.

  • Experimental discrimination of two-qubit orthogonal states via local operations and classical communication

    by Xiaoqian Zhang, Maolin Luo, Guifang Yu, Xiaoqi Zhou

    Quantum nonlocality, a form of nonclassicality, serves as a crucial resource in quantum information processing. Nonlocality in quantum systems is exemplified by the perfect discrimination of orthogonal quantum states through single joint measurements, which is unattainable using local operations and classical communication (LOCC). Bandyopadhyay [S. Bandyopadhyay, Phys. Rev. Lett. 106, 210402 (2011)] established that, with LOCC alone, at most N−1 copies of N orthogonal quantum states are required for perfect discrimination. Here, we present the experimental verification of orthogonal quantum state discrimination employing LOCC. Our results demonstrate that up to three copies suffice for the perfect distinction of four orthogonal two-qubit states via LOCC. The verified method of perfectly distinguishing orthogonal quantum state sets offers potential applications in quantum information processes, including quantum secret sharing and quantum teleportation.


  • Open Access

    Global martingale and pathwise solutions and infinite regularity of invariant measures for a stochastic modified Swift-Hohenberg equation

    by Jintao Wang, Xiaoqian Zhang, Chunqiu Li

    We consider a 2D stochastic modified Swift-Hohenberg equations with multiplicative noise and periodic boundary. First, we establish the existence of local and global martingale and pathwise solutions in the regular Sobolev space $H^{2m}$ for each $m\geqslant1$. Associated with the unique global pathwise solution, we obtain a Markovian transition semigroup. Then, we show the existence of invariant measures and ergodic invariant measures for this Markovian semigroup on $H^{2m}$. At last, we improve the regularity of the obtained invariant measures to $H^{2(m+1)}$. With appropriate conditions on the diffusion coefficient, we can deduce the infinite regularity of the invariant measures, which was conjectured by Glatt-Holtz \textit{et al.} in their situation.

  • Open Access

    Proof-of-principle experimental demonstration of quantum gate verification

    by Maolin Luo, Xiaoqian Zhang, Xiaoqi Zhou

    To employ a quantum device, the performance of the quantum gates in the device needs to be evaluated first. Since the dimensionality of a quantum gate grows exponentially with the number of qubits, evaluating the performance of a quantum gate is a challenging task. Recently, a scheme called quantum gate verification (QGV) has been proposed, which can verifies quantum gates with near-optimal efficiency. In this paper, we implement a proof-of-principle optical experiment to demonstrate this QGV scheme. We show that for a single-qubit quantum gate, only $\sim300$ samples are needed to confirm the fidelity of the quantum gate to be at least $97\%$ with a $99\%$ confidence level using the QGV method, whereas, at least $\sim3000$ samples are needed to achieve the same result using the standard quantum process tomography method. The QGV method validated by this paper has the potential to be widely used for the evaluation of quantum devices in various quantum information applications.

  • Proof-of-principle experimental demonstration of quantum gate verification

    by Maolin Luo, Xiaoqian Zhang, Xiaoqi Zhou

    To employ a quantum device, the performance of the quantum gates in the device needs to be evaluated first. Since the dimensionality of a quantum gate grows exponentially with the number of qubits, evaluating the performance of a quantum gate is a challenging task. Recently, a scheme called quantum gate verification (QGV) has been proposed, which can verifies quantum gates with near-optimal efficiency. In this paper, we implement a proof-of-principle optical experiment to demonstrate this QGV scheme. We show that for a single-qubit quantum gate, only ∼300 samples are needed to confirm the fidelity of the quantum gate to be, at least, 97% with a 99% confidence level using the QGV method, whereas, at least, ∼3000 samples are needed to achieve the same result using the standard quantum process tomography method. The QGV method validated by this paper has the potential to be widely used for the evaluation of quantum devices in various quantum information applications.


  • Open Access

    Gate Teleportation-based Universal Blind Quantum Computation

    by Xiaoqian Zhang

    Blind quantum computation (BQC) allows that a client who has limited quantum abilities can delegate quantum computation to a server who has advanced quantum technologies but learns nothing about the client's private information. However, it still remains a challenge to directly encrypt quantum algorithms in circuits model. To solve the problem, we propose GTUBQC, the first gate teleportation-based universal BQC protocol. In this paper, we consider a scenario where a trusted center is responsible for preparing initial states, a client with the ability to perform X, Z does not require any quantum memory, and two servers conducting UBQC (universal BQC) and Bell measurements. GTUBQC can hide the universal quantum gates by encrypting the rotation angles, because arbitrary unitary operation can be decomposed into a combination of arbitrary rotation operators. We prove the blindness and correctness of GTUBQC, and apply our approach to other types of computational tasks, such as quantum Fourier transform.

  • Open Access

    Measurement-based universal blind quantum computation with minor resources

    by Xiaoqian Zhang

    Blind quantum computation (BQC) enables a client with less quantum computational ability to delegate her quantum computation to a server with strong quantum computational power while preserving the client's privacy. Generally, many-qubit entangled states are often used to complete BQC tasks. But for a large-scale entangled state, it is difficult to be described since its Hilbert space dimension is increasing exponentially. Furthermore, the number of entangled qubits is limited in experiment of existing works. To tackle this problem, in this paper we propose a universal BQC protocol based on measurement with minor resources, where the trap technology is adopted to verify correctness of the server's measurement outcomes during computation and testing process. In our model there are two participants, a client who prepares initial single-qubit states and a server that performs universal quantum computation. The client is almost classical since she does not require any quantum computational power, quantum memory. To realize the client's universal BQC, we construct an $m\times n$ latticed state composed of six-qubit cluster states and eight-qubit cluster states, which needs less qubits than the brickwork state. Finally, we analyze and prove the blindness, correctness, universality and verifiability of our proposed BQC protocol.

  • Direct Fidelity Estimation of Quantum States Using Machine Learning

    by Xiaoqian Zhang, Maolin Luo, Zhaodi Wen, Qin Feng, Shengshi Pang, Weiqi Luo, Xiaoqi Zhou

    In almost all quantum applications, one of the key steps is to verify that the fidelity of the prepared quantum state meets expectations. In this Letter, we propose a new approach solving this problem using machine-learning techniques. Compared to other fidelity estimation methods, our method is applicable to arbitrary quantum states, the number of required measurement settings is small, and this number does not increase with the size of the system. For example, for a general five-qubit quantum state, only four measurement settings are required to predict its fidelity with ±1% precision in a nonadversarial scenario. This machine-learning-based approach for estimating quantum state fidelity has the potential to be widely used in the field of quantum information.