SearcharxivSearch

arXiv subjects

Jiangwei Shang

Publications and source records attributed to Jiangwei Shang.

At least 19 recordsLinked to original sources

Error-mitigated quantum state tomography using neural networks

The reliable characterization of quantum states is a fundamental task in quantum information science. For this purpose, quantum state tomography provides a standard framework for reconstructing quantum states from measurement data, yet it is often degraded by experimental noise. Mitigating such noise is therefore essential for the accurate estimation of the states in realistic settings. In this work, we propose a scalable tomography method based on multilayer perceptron networks that mitigate unknown noise through supervised learning. This approach is data-driven and thus does not rely on explicit assumptions about the noise model or measurement, making it readily extendable to general quantum systems. Numerical simulations, ranging from special pure states to random mixed states, demonstrate that the proposed method effectively mitigates noise across a broad range of scenarios, compared with the case without mitigation.

quant-ph

Simultaneous reconstruction of quantum process and noise via corrupted sensing

Quantum processes, including quantum gates and channels, are integral to various quantum information tasks, making the efficient characterization of these processes and their underlying noise critically important. Here, we propose a framework for quantum process tomography in the presence of corrupted noise that is able to simultaneously reconstruct the process and corrupted noise. Firstly, within the Choi-state representation, we derive the corresponding generalized restricted isometry property and demonstrate the simultaneous reconstruction of various quantum gates under sparse noise. Moreover, in comparison with the Choi-state scheme, the process-matrix representation is employed to simultaneously reconstruct sparse noise and a broader range of target quantum gates. Our results demonstrate that significant reduction in experimental configurations is achievable even under corrupted noise.

quant-ph

Prescriptive preparation and verification of nonstabilizer states

High-fidelity quantum state preparation is a central task in quantum information science. In practice, it is commonly guided either by full quantum state tomography, which becomes prohibitively resource-intensive as system size grows, or by empirically chosen measurement settings that lack principled optimality. Here we show that quantum state verification (QSV) can be elevated from a purely diagnostic tool to a prescriptive framework for quantum state preparation, directly specifying experimentally optimal measurements and quantitative fidelity indicators without full state reconstruction. We experimentally realize this prescriptive paradigm using a three-qubit nonstabilizer $W$ state and a modified homogeneous QSV protocol. The verification measurements not only certify the prepared state with high confidence but also serve as a tomography-free indicator that systematically informs the preparation procedure. Using only nine measurement settings and $10^4$ samples, we achieve high-fidelity state preparation consistent with full tomography that requires orders of magnitude more resources. Beyond the present implementation, the prescriptive structure of QSV is naturally compatible with closed-loop feedback control, outlining a pathway toward genuine real-time quantum state preparation in future low-latency platforms.

quant-ph

Beating the Optimal Verification of Entangled States via Collective Strategies

In the realm of quantum information processing, the efficient characterization of entangled states poses an overwhelming challenge, rendering the traditional methods including quantum tomography unfeasible and impractical. To tackle this problem, we propose a new verification scheme using collective strategies, showcasing arbitrarily high efficiency that beats the optimal verification with global measurements. Our collective scheme can be implemented in various experimental platforms and scalable for large systems with a linear scaling on hardware requirement, and distributed operations are allowed. Notably, larger ensembles can always improve the efficiency further, but without increasing the quantum memory. More importantly, the approach consumes only a few copies of the entangled states, while ensuring the preservation of unmeasured ones, and even boosting their fidelity for any subsequent tasks. Furthermore, our protocol provides additional insight into the specific types of noise affecting the system, thereby facilitating potential targeted improvements. These advancements hold promise for a wide range of applications, offering a pathway towards more robust and efficient quantum information processing.

quant-ph

Verification of entangled states under noisy measurements

Entanglement plays an indispensable role in numerous quantum information and quantum computation tasks, underscoring the need for efficiently verifying entangled states. In recent years, quantum state verification has received increasing attention, yet the challenge of addressing noise effects in implementing this approach remains unsolved. In this work, we provide a systematic assessment of the performance of quantum state verification protocols in the presence of measurement noise. Based on the analysis, a necessary and sufficient condition is provided to uniquely identify the target state under noisy measurements. Moreover, we propose a symmetric hypothesis testing verification algorithm with noisy measurements. Subsequently, using a noisy nonadaptive verification strategy of GHZ and stabilizer states, the noise effects on the verification efficiency are illustrated. From both analytical and numerical perspectives, we demonstrate that the noisy verification protocol exhibits a negative quadratic relationship between the sample complexity and the infidelity. Our method can be easily applied to real experimental settings, thereby demonstrating its promising prospects.

quant-ph

Corrupted sensing quantum state tomography

The reliable characterization of quantum states as well as any potential noise in various quantum systems is crucial for advancing quantum technologies. In this work we propose the concept of corrupted sensing quantum state tomography which enables the simultaneous reconstruction of quantum states and structured noise with the aid of simple Pauli measurements only. Without additional prior information, we investigate the reliability and robustness of the framework. The power of our algorithm is demonstrated by assuming Gaussian and Poisson sparse noise for low-rank state tomography. In particular, our approach is able to achieve a high quality of the recovery with incomplete sets of measurements and is also suitable for performance improvement of large quantum systems. It is envisaged that the techniques can become a practical tool to greatly reduce the cost and computational effort for quantum tomography in noisy quantum systems.

quant-ph

Multipartite entanglement measures: a review

Quantum entanglement, a fundamental aspect of quantum mechanics, has captured significant attention in the era of quantum information science. In multipartite quantum systems, entanglement plays a crucial role in facilitating various quantum information processing tasks, such as quantum teleportation and dense coding. In this article, we review the theory of multipartite entanglement measures, with a particular focus on the genuine as well as the operational meaning of multipartite entanglement measures. By providing a thorough and valuable insight on this field, we hope that this review would inspire and guide researchers in their endeavors to further develop novel approaches for characterizing multipartite entanglement.

quant-ph

Algorithm for evaluating distance-based entanglement measures

Quantifying entanglement in quantum systems is an important yet challenging task due to its NP-hard nature. In this work, we propose an efficient algorithm for evaluating distance-based entanglement measures. Our approach builds on Gilbert's algorithm for convex optimization, providing a reliable upper bound on the entanglement of a given arbitrary state. We demonstrate the effectiveness of our algorithm by applying it to various examples, such as calculating the squared Bures metric of entanglement as well as the relative entropy of entanglement for GHZ states, $W$ states, Horodecki states, and chessboard states. These results demonstrate that our algorithm is a versatile and accurate tool that can quickly provide reliable upper bounds for entanglement measures.

quant-ph

Efficient verification of arbitrary entangled states with homogeneous local measurements

Quantum state verification (QSV) is the task of relying on local measurements only to verify that a given quantum device does produce the desired target state. Up to now, certain types of entangled states can be verified efficiently or even optimally by QSV. However, given an arbitrary entangled state, how to design its verification protocol remains an open problem. In this work, we present a systematic strategy to tackle this problem by considering the locality of what we initiate as the choice-independent measurement protocols, whose operators can be directly achieved when they are homogeneous. Taking several typical entangled states as examples, we show the explicit procedures of the protocol design using standard Pauli projections, demonstrating the superiority of our method for attaining better QSV strategies. Moreover, our framework can be naturally extended to other tasks such as the construction of entanglement witness, and even parameter estimation.

quant-ph

Estimating many properties of a quantum state via quantum reservoir processing

Estimating properties of a quantum state is an indispensable task in various applications of quantum information processing. To predict properties in the post-processing stage, it is inherent to first perceive the quantum state with a measurement protocol and store the information acquired. In this work, we propose a general framework for constructing classical approximations of arbitrary quantum states with quantum reservoirs. A key advantage of our method is that only a single local measurement setting is required for estimating arbitrary properties, while most of the previous methods need exponentially increasing number of measurement settings. To estimate $M$ properties simultaneously, the size of the classical approximation scales as $\ln M$ . Moreover, this estimation scheme is extendable to higher-dimensional systems and hybrid systems with non-identical local dimensions, which makes it exceptionally generic. We support our theoretical findings with extensive numerical simulations.

quant-ph

Reliable optimization of arbitrary functions over quantum measurements

As the connection between classical and quantum worlds, quantum measurements play a unique role in the era of quantum information processing. Given an arbitrary function of quantum measurements, how to obtain its optimal value is often considered as a basic yet important problem in various applications. Typical examples include but not limited to optimizing the likelihood functions in quantum measurement tomography, searching the Bell parameters in Bell-test experiments, and calculating the capacities of quantum channels. In this work, we propose reliable algorithms for optimizing arbitrary functions over the space of quantum measurements by combining the so-called Gilbert's algorithm for convex optimization with certain gradient algorithms. With extensive applications, we demonstrate the efficacy of our algorithms with both convex and nonconvex functions.

quant-ph

Statistical Methods for Quantum State Verification and Fidelity Estimation

The efficient and reliable certification of quantum states is essential for various quantum information processing tasks as well as for the general progress on the implementation of quantum technologies. In the last few years several methods have been introduced which use advanced statistical methods to certify quantum states in a resource-efficient manner. In this article we present a review of the recent progress in this field. We first explain how the verification and fidelity estimation of a quantum state can be discussed in the language of hypothesis testing. Then, we explain in detail various strategies for the verification of entangled states with local measurements or measurements assisted by local operations and classical communication. Finally, we discuss several extensions of the problem, such as the certification of quantum channels and the verification of entanglement.

quant-ph

Geometric mean of bipartite concurrences as a genuine multipartite entanglement measure

In this work we propose the geometric mean of bipartite concurrences as a genuine multipartite entanglement measure. This measure achieves the maximum value for absolutely maximally entangled states and has desirable properties for quantifying potential quantum resources. The simplicity and symmetry in the definition facilitates its computation for various multipartite entangled states including the GHZ states and the $W$ states. With explicit examples we show that our measure results in distinct entanglement orderings from other measures, and can detect differences in certain types of genuine multipartite entanglement while other measures cannot. These results justify the practical application of our measure for tasks involving genuine multipartite entanglement.

quant-ph

Operational detection of entanglement via quantum designs

From an operational point of view, we propose several new entanglement detection criteria using quantum designs. These criteria are constructed by considering the correlations defined with quantum designs. Counter-intuitively, the criteria with more settings are exactly equivalent to the corresponding ones with the minimal number of settings, namely the symmetric informationally complete positive operator-valued measures (SIC POVMs). Fundamentally, this observation highlights the potentially unique role played by SIC POVMs in quantum information processing. Experimentally, this provides the minimal number of settings that one should choose for detecting entanglement. Furthermore, we find that nonlinear criteria are not always better than linear ones for the task of entanglement detection.

quant-ph

Universal classical optical computing inspired by quantum information process

Quantum computing has attracted much attention in recent decades, since it is believed to solve certain problems substantially faster than traditional computing methods. Theoretically, such an advance can be obtained by networks of the quantum operators in universal gate sets, one famous example of which is formed by CNOT gate and single qubit gates. However, realizing a device that performs practical quantum computing is tricky. This is because it requires a scalable qubit system with long coherence time and good controls, which is harsh for most current platforms. Here, we demonstrate that the information process based on a relatively stable system -- classical optical system, can be considered as an analogy of universal quantum computing. By encoding the information via the polarization state of classical beams, the optical computing elements that corresponds to the universal gate set are presented and their combination for a general information process are theoretically illustrated. Taking the analogy of two-qubit processor as an example, we experimentally verify that our proposal works well. Considering the potential of optical system for reliable and low-energy-consuming computation, our results open a new way towards advanced information processing with high quality and efficiency.

physics.optics

Reliable experimental certification of one-way Einstein-Podolsky-Rosen steering

Quantum steering is a recently-defined form of quantum correlation which lies at the heart of quantum mechanics. In difference from other types of quantum correlations, quantum steering is inherently asymmetric, which implies that it could manifest in one direction but not in the opposite direction. This rather peculiar phenomenon, known as one-way steering, have been demonstrated in several experiments, but subtlety remains. In fact all experiments were shown to be ambiguous until a very recent conclusive one, which however made a crucial use of a high dimensional embedding to get around assumptions. This leaves the question open whether the one-way steering phenomenon can be reliably demonstrated in the genuine two-qubit system. Here, we report such an experimental demonstration of one-way steering for a family of two-qubit states. Our experimental setup and results thus resolve the subtlety caused by fidelity assumption in previous experiments without the need of higher dimensional embedding. Moreover, our work provides a universal method to characterize one-way steering phenomenon for generic two-qubit states.

quant-ph

Efficient verification of entangled continuous-variable quantum states with local measurements

Continuous-variable quantum states are of particular importance in various quantum information processing tasks including quantum communication and quantum sensing. However, a bottleneck has emerged with the fast increasing in size of the quantum systems which severely hinders their efficient characterization. In this work, we establish a systematic framework for verifying entangled continuous-variable quantum states by employing local measurements only. Our protocol is able to achieve the unconditionally high verification efficiency which is quadratically better than quantum tomography as well as other nontomographic methods. Specifically, we demonstrate the power of our protocol by showing the efficient verification of entangled two-mode and multimode coherent states with local measurements.

quant-ph

Sampling quantum states with inequality constraints

Random samples of quantum states with specific properties are useful for various applications, such as Monte Carlo integration over the state space. In the high-dimensional situations that one encounters already for a few qubits, the quantum state space has a very complicated boundary, and it is challenging to incorporate the specific properties into the sampling algorithm. In this paper, we present the Sequentially Constrained Monte Carlo (SCMC) algorithm as a powerful and versatile method for sampling quantum states in accordance with any desired properties that can be stated as inequalities. We apply the SCMC algorithm to the generation of samples of bound entangled states; for example, we obtain nearly ten thousand bound entangled two-qutrit states in a few minutes -- a colossal speed-up over independence sampling, which yields less than ten such states per day. In the second application, we draw samples of high-dimensional quantum states from a narrowly peaked target distribution and observe that SCMC sampling remains efficient as the dimension grows. In yet another application, the SCMC algorithm produces uniformly distributed quantum states in regions bounded by values of the problem-specific target distribution; such samples are needed when estimating parameters from the probabilistic data acquired in quantum experiments.

quant-ph