Fei Shi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Fei Shi has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
- Xiande Zhang
School of Mathematical Sciences, University of Science and Technology of China, Hefei, China
21 shared publications - Lin Chen
Beihang University
10 shared publications - Qi Zhao
The University of Hong Kong
6 shared publications - Mao-Sheng Li
South China University of Technology
4 shared publications Giulio Chiribella
The University of Hong Kong
3 shared publicationsLin Chen
Beihang University
2 shared publications
Latest Publications
- 15 September 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (3) , 032435
Imaginarity of quantum superpositions
Quantum imaginarity is an important resource in quantum information theory, associated with the operational role of complex numbers in quantum mechanics. Here we investigate how imaginarity behaves under coherent superposition of orthogonal pure states. For orthonormal components, we express the geometric imaginarity in terms of a conjugation-overlap matrix. We characterize these matrices as complex symmetric contractions and determine the minimum dimension required for their realization. In the two-component setting, we derive the exact feasible region of the off-diagonal conjugation overlap and a sharp bound on its modulus. Moreover, the conjugation-overlap matrix of an orthonormal qubit pair is unitary, yielding the full range attainable by varying the relative phase. For multicomponent superpositions, we identify the exact condition for attaining maximal imaginarity in superpositions of real components and show that pairwise compatibility is insufficient for global realizability, although pairwise constraints still yield lower bounds. When only the diagonal conjugation overlaps are specified, the attainable imaginarity values form a closed interval whose end points can be determined by convex optimization. Our results show that the imaginarity of a superposition depends not only on the imaginarities of its components but also on their relative phases and the global compatibility of their conjugation overlaps.
- 15 September 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (3) , 032435
Imaginarity of quantum superpositions
Quantum imaginarity is an important resource in quantum information theory, associated with the operational role of complex numbers in quantum mechanics. Here we investigate how imaginarity behaves under coherent superposition of orthogonal pure states. For orthonormal components, we express the geometric imaginarity in terms of a conjugation-overlap matrix. We characterize these matrices as complex symmetric contractions and determine the minimum dimension required for their realization. In the two-component setting, we derive the exact feasible region of the off-diagonal conjugation overlap and a sharp bound on its modulus. Moreover, the conjugation-overlap matrix of an orthonormal qubit pair is unitary, yielding the full range attainable by varying the relative phase. For multicomponent superpositions, we identify the exact condition for attaining maximal imaginarity in superpositions of real components and show that pairwise compatibility is insufficient for global realizability, although pairwise constraints still yield lower bounds. When only the diagonal conjugation overlaps are specified, the attainable imaginarity values form a closed interval whose end points can be determined by convex optimization. Our results show that the imaginarity of a superposition depends not only on the imaginarities of its components but also on their relative phases and the global compatibility of their conjugation overlaps.
- 22 June 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (6)
Quantum states supported by matroids
- 22 June 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (6)
Quantum states supported by matroids
- 9 June 2026
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 137 (10)
Experimental multipartite entanglement detection with minimal-size correlations
- 9 June 2026
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 137 (10)
Experimental multipartite entanglement detection with minimal-size correlations
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (9) , 1
Linear Programming Bounds on k -Uniform States
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (9) , 1
Linear Programming Bounds on k -Uniform States
- 18 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (2) , 1220-1231
Exploring Quantum Weight Enumerators From the n -Qubit Parallelized SWAP Test
Quantum weight enumerators are fundamental tools for analyzing quantum error-correcting codes and multipartite entanglement, offering insights into the existence of quantum error-correcting codes and $k$ -uniform states. In this work, we establish a connection between quantum weight enumerators and the $n$ -qubit parallelized SWAP test. We demonstrate that each shadow enumerator corresponds to a probability derived from this test, providing a physical interpretation for the shadow enumerators. Leveraging the non-negativity of these probabilities, we present an elegant proof for the shadow inequalities. Additionally, we show that the Shor-Laflamme weight enumerators and the Rains unitary enumerators can be calculated using the $n$ -qubit parallelized SWAP test. For applications, we utilize this test to compute the distances of quantum error-correcting codes, determine the $k$ -uniformity of pure states, and evaluate multipartite entanglement measures. Our results indicate that quantum weight enumerators can be efficiently estimated on quantum computers, opening a path to calculate and verify the distances of quantum error-correcting codes.
- 18 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (2) , 1220-1231
Exploring Quantum Weight Enumerators From the n -Qubit Parallelized SWAP Test
Quantum weight enumerators are fundamental tools for analyzing quantum error-correcting codes and multipartite entanglement, offering insights into the existence of quantum error-correcting codes and $k$ -uniform states. In this work, we establish a connection between quantum weight enumerators and the $n$ -qubit parallelized SWAP test. We demonstrate that each shadow enumerator corresponds to a probability derived from this test, providing a physical interpretation for the shadow enumerators. Leveraging the non-negativity of these probabilities, we present an elegant proof for the shadow inequalities. Additionally, we show that the Shor-Laflamme weight enumerators and the Rains unitary enumerators can be calculated using the $n$ -qubit parallelized SWAP test. For applications, we utilize this test to compute the distances of quantum error-correcting codes, determine the $k$ -uniformity of pure states, and evaluate multipartite entanglement measures. Our results indicate that quantum weight enumerators can be efficiently estimated on quantum computers, opening a path to calculate and verify the distances of quantum error-correcting codes.
- Open Access
- 1 September 2025
- Published by IOP Publishing in New Journal of Physics
- Vol. 27 (9) , 094503
Detecting entanglement and nonlocality with minimum observable length
Quantum entanglement and nonlocality are foundational to quantum technologies, driving quantum computation, communication, and cryptography innovations. To benchmark the capabilities of these quantum techniques, efficient detection and accurate quantification methods are indispensable. This paper examines the concept ‘detection length’—a metric that quantifies the minimum number of simultaneously measured particles required to detect entanglement or nonlocality. We extend the detection length framework to encompass various entanglement categories and nonlocality phenomena, providing a comprehensive analytical model to determine detection lengths for specified forms of entanglement. Furthermore, we exploit semidefinite programming techniques to design entanglement witnesses and Bell’s inequalities tailored to specific minimal detection lengths, offering an upper bound for detection lengths in given states. By assessing the noise robustness of these witnesses, we demonstrate that witnesses with shorter detection lengths can exhibit superior performance under certain conditions.
- 1 September 2025
- Published by IOP Publishing in New Journal of Physics
- Vol. 27 (9) , 094503
Open AccessDetecting entanglement and nonlocality with minimum observable length
Quantum entanglement and nonlocality are foundational to quantum technologies, driving quantum computation, communication, and cryptography innovations. To benchmark the capabilities of these quantum techniques, efficient detection and accurate quantification methods are indispensable. This paper examines the concept ‘detection length’—a metric that quantifies the minimum number of simultaneously measured particles required to detect entanglement or nonlocality. We extend the detection length framework to encompass various entanglement categories and nonlocality phenomena, providing a comprehensive analytical model to determine detection lengths for specified forms of entanglement. Furthermore, we exploit semidefinite programming techniques to design entanglement witnesses and Bell’s inequalities tailored to specific minimal detection lengths, offering an upper bound for detection lengths in given states. By assessing the noise robustness of these witnesses, we demonstrate that witnesses with shorter detection lengths can exhibit superior performance under certain conditions.
- 4 August 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (2)
Constructions of multipartite entanglement resistant to particle loss
- 4 August 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (2)
Constructions of multipartite entanglement resistant to particle loss
- Open Access
Linear Programming Bounds on $k$-Uniform States
The existence of $k$-uniform states has been a widely studied problem due to their applications in several quantum information tasks and their close relation to combinatorial objects like Latin squares and orthogonal arrays. With the machinery of quantum enumerators and linear programming, we establish several improved non-existence results and bounds on $k$-uniform states. 1. First, for any fixed $l\geq 1$ and $q\geq 2$, we show that there exists a constant $c$ such that $(\left\lfloor{n/2}\right\rfloor-l)$-uniform states in $(\mathbb{C}^q)^{\otimes n}$ do not exist when $n\geq cq^2+o(q^2)$. The constant $c$ equals $4$ when $l=1$ and $6$ when $l=2$, which generalizes Scott's bound (2004) for $l=0$. 2. Second, when $n$ is sufficiently large, we show that there exists a constant $θ<1/2$ for each $q \le 9$, such that $k$-uniform states in $(\mathbb{C}^q)^{\otimes n}$ exist only when $k\leq θn$. In particular, this provides the first bound (to the best of our knowledge) of $k$ for $4\leq q\leq 9$ and confirms a conjecture posed by Shi et al. (2023) when $q=5$ in a stronger form. 3. Finally, we improve the shadow bounds given by Shi et al. (2023) by a constant for $q = 3,4,5$ and small $n$. When $q=4$, our results can update some bounds listed in the code tables maintained by Grassl (2007--2024).Open AccessLinear Programming Bounds on $k$-Uniform States
The existence of $k$-uniform states has been a widely studied problem due to their applications in several quantum information tasks and their close relation to combinatorial objects like Latin squares and orthogonal arrays. With the machinery of quantum enumerators and linear programming, we establish several improved non-existence results and bounds on $k$-uniform states. 1. First, for any fixed $l\geq 1$ and $q\geq 2$, we show that there exists a constant $c$ such that $(\left\lfloor{n/2}\right\rfloor-l)$-uniform states in $(\mathbb{C}^q)^{\otimes n}$ do not exist when $n\geq cq^2+o(q^2)$. The constant $c$ equals $4$ when $l=1$ and $6$ when $l=2$, which generalizes Scott's bound (2004) for $l=0$. 2. Second, when $n$ is sufficiently large, we show that there exists a constant $θ<1/2$ for each $q \le 9$, such that $k$-uniform states in $(\mathbb{C}^q)^{\otimes n}$ exist only when $k\leq θn$. In particular, this provides the first bound (to the best of our knowledge) of $k$ for $4\leq q\leq 9$ and confirms a conjecture posed by Shi et al. (2023) when $q=5$ in a stronger form. 3. Finally, we improve the shadow bounds given by Shi et al. (2023) by a constant for $q = 3,4,5$ and small $n$. When $q=4$, our results can update some bounds listed in the code tables maintained by Grassl (2007--2024). - 6 February 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 134 (5) , 050201
Entanglement Detection Length of Multipartite Quantum States
Multipartite entanglement is a valuable resource for quantum technologies. However, detecting this resource can be challenging: for genuine multipartite entanglement, the detection may require global measurements that are hard to implement experimentally. Here we introduce the concept of entanglement detection length, defined as the minimum number of particles that have to be jointly measured in order to detect genuine multipartite entanglement. For symmetric states, we show that the entanglement detection length can be determined by testing separability of the marginal states. For general states, we provide an upper bound on the entanglement detection length based on semidefinite programming. We show that the entanglement detection length is generally smaller than the minimum observable length needed to uniquely determine a multipartite state, and we provide examples achieving the maximum gap between these two quantities.
- 6 February 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 134 (5) , 050201
Entanglement Detection Length of Multipartite Quantum States
Multipartite entanglement is a valuable resource for quantum technologies. However, detecting this resource can be challenging: for genuine multipartite entanglement, the detection may require global measurements that are hard to implement experimentally. Here we introduce the concept of entanglement detection length, defined as the minimum number of particles that have to be jointly measured in order to detect genuine multipartite entanglement. For symmetric states, we show that the entanglement detection length can be determined by testing separability of the marginal states. For general states, we provide an upper bound on the entanglement detection length based on semidefinite programming. We show that the entanglement detection length is generally smaller than the minimum observable length needed to uniquely determine a multipartite state, and we provide examples achieving the maximum gap between these two quantities.
- 1 November 2024
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 65 (11)
Unextendible and strongly uncompletable product bases
In 2003, DiVincenzo et al. put forward the question of whether there exists an unextendible product basis (UPB) that is an uncompletable product basis in every bipartition [DiVincenzo et al. Commun. Math. Phys. 238, 379–410 (2003)]. Recently, Shi et al. presented a UPB in tripartite systems that is also a strongly uncompletable product basis (SUCPB) in every bipartition [Shi et al. New J. Phys. 24, 113025 (2022)]. However, whether there exist UPBs that are SUCPBs in only one or two bipartitions remains unknown. We provide a sufficient condition for the existence of SUCPBs based on a quasi U-tile structure. We analyze all possible cases about the relationship between UPBs and SUCPBs in tripartite systems. In particular, we construct a UPB with smaller size d3 − 3d2 + 1 in Cd⊗Cd⊗Cd, which is an SUCPB in every bipartition and has a smaller cardinality than the existing one.
- 1 November 2024
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 65 (11)
Unextendible and strongly uncompletable product bases
In 2003, DiVincenzo et al. put forward the question of whether there exists an unextendible product basis (UPB) that is an uncompletable product basis in every bipartition [DiVincenzo et al. Commun. Math. Phys. 238, 379–410 (2003)]. Recently, Shi et al. presented a UPB in tripartite systems that is also a strongly uncompletable product basis (SUCPB) in every bipartition [Shi et al. New J. Phys. 24, 113025 (2022)]. However, whether there exist UPBs that are SUCPBs in only one or two bipartitions remains unknown. We provide a sufficient condition for the existence of SUCPBs based on a quasi U-tile structure. We analyze all possible cases about the relationship between UPBs and SUCPBs in tripartite systems. In particular, we construct a UPB with smaller size d3 − 3d2 + 1 in Cd⊗Cd⊗Cd, which is an SUCPB in every bipartition and has a smaller cardinality than the existing one.