Li Yu
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
Research Interests
Li Yu has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Lin Chen
Beihang University
6 shared publications - Chui-Ping Yang
Hangzhou Normal University
5 shared publications Lin Chen
School of Mathematics and Systems Science, Beihang University, Beijing, China
3 shared publicationsQi-Ping Su
Hangzhou Normal University
3 shared publications- Yi-Hao Kang
School of Physics, Hangzhou Normal University, Hangzhou, China
3 shared publications - Qi-Ping Su
Hangzhou Normal University
2 shared publications
Latest Publications
- 14 January 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (2)
Transfer of arbitrary quantum states from one input cavity to multiple output cavities via a superconducting-qudit switch
- 14 January 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (2)
Transfer of arbitrary quantum states from one input cavity to multiple output cavities via a superconducting-qudit switch
- Open Access
- 29 November 2025
- Published by Elsevier in Chinese Journal of Physics
- Vol. 99, 266-282
Implementation of a hybrid controlled-SUM gate with one superconducting qutrit simultaneously controlling multiple-target cat-state qutrits
- 29 November 2025
- Published by Elsevier in Chinese Journal of Physics
- Vol. 99, 266-282
Open AccessImplementation of a hybrid controlled-SUM gate with one superconducting qutrit simultaneously controlling multiple-target cat-state qutrits
- 2 September 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (3)
Proposal for implementing quantum walks on multidimensional networks
- 2 September 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (3)
Proposal for implementing quantum walks on multidimensional networks
- 14 May 2025
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 23 (5)
Efficient preparation of high-dimensional hybrid entangled states in circuit quantum electrodynamics
- 14 May 2025
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 23 (5)
Efficient preparation of high-dimensional hybrid entangled states in circuit quantum electrodynamics
- Open Access
A framework for quantum homomorphic encryption with experimental demonstration
Quantum homomorphic encryption (QHE) is an encryption method that allows quantum computation to be performed on one party's private data with the program provided by another party, without revealing much information about the data nor the program to the opposite party. We propose a framework for (interactive) QHE based on the universal circuit approach. It contains a subprocedure of calculating a classical linear polynomial, which can be implemented with quantum or classical methods; apart from the subprocedure, the framework has low requirement on the quantum capabilities of the party who provides the circuit. We illustrate the subprocedure using a quite simple classical protocol with some privacy tradeoff. For a special case of such protocol, we obtain a scheme similar to blind quantum computation but with the output on a different party. Another way of implementing the subprocedure is to use a recently studied quantum check-based protocol, which has low requirement on the quantum capabilities of both parties. The subprocedure could also be implemented with a classical additive homomorphic encryption scheme. We demonstrate some key steps of the outer part of the framework in a quantum optics experiment.
Open AccessA framework for quantum homomorphic encryption with experimental demonstration
Quantum homomorphic encryption (QHE) is an encryption method that allows quantum computation to be performed on one party's private data with the program provided by another party, without revealing much information about the data nor the program to the opposite party. We propose a framework for (interactive) QHE based on the universal circuit approach. It contains a subprocedure of calculating a classical linear polynomial, which can be implemented with quantum or classical methods; apart from the subprocedure, the framework has low requirement on the quantum capabilities of the party who provides the circuit. We illustrate the subprocedure using a quite simple classical protocol with some privacy tradeoff. For a special case of such protocol, we obtain a scheme similar to blind quantum computation but with the output on a different party. Another way of implementing the subprocedure is to use a recently studied quantum check-based protocol, which has low requirement on the quantum capabilities of both parties. The subprocedure could also be implemented with a classical additive homomorphic encryption scheme. We demonstrate some key steps of the outer part of the framework in a quantum optics experiment.
- Open Access
A quantum homomorphic encryption scheme for polynomial-sized circuits
Quantum homomorphic encryption (QHE) is an encryption method that allows quantum computation to be performed on one party's private data with the program provided by another party, without revealing much information about the data nor about the program to the opposite party. It is known that information-theoretically-secure QHE for circuits of unrestricted size would require exponential resources, and efficient computationally-secure QHE schemes for polynomial-sized quantum circuits have been constructed. In this paper we first propose a QHE scheme for a type of circuits of polynomial depth, based on the rebit quantum computation formalism. The scheme keeps the restricted type of data perfectly secure. We then propose a QHE scheme for a larger class of polynomial-depth quantum circuits, which has partial data privacy. Both schemes have good circuit privacy. We also propose an interactive QHE scheme with asymptotic data privacy, however, the circuit privacy is not good, in the sense that the party who provides the data could cheat and learn about the circuit. We show that such cheating would generally affect the correctness of the evaluation or cause deviation from the protocol. Hence the cheating can be caught by the opposite party in an interactive scheme with embedded verifications. Such scheme with verification has a minor drawback in data privacy. Finally, we show some methods which achieve some nontrivial level of data privacy and circuit privacy without resorting to allowing early terminations, in both the QHE problem and in secure evaluation of classical functions. The entanglement and classical communication costs in these schemes are polynomial in the circuit size and the security parameter (if any).
Open AccessA quantum homomorphic encryption scheme for polynomial-sized circuits
Quantum homomorphic encryption (QHE) is an encryption method that allows quantum computation to be performed on one party's private data with the program provided by another party, without revealing much information about the data nor about the program to the opposite party. It is known that information-theoretically-secure QHE for circuits of unrestricted size would require exponential resources, and efficient computationally-secure QHE schemes for polynomial-sized quantum circuits have been constructed. In this paper we first propose a QHE scheme for a type of circuits of polynomial depth, based on the rebit quantum computation formalism. The scheme keeps the restricted type of data perfectly secure. We then propose a QHE scheme for a larger class of polynomial-depth quantum circuits, which has partial data privacy. Both schemes have good circuit privacy. We also propose an interactive QHE scheme with asymptotic data privacy, however, the circuit privacy is not good, in the sense that the party who provides the data could cheat and learn about the circuit. We show that such cheating would generally affect the correctness of the evaluation or cause deviation from the protocol. Hence the cheating can be caught by the opposite party in an interactive scheme with embedded verifications. Such scheme with verification has a minor drawback in data privacy. Finally, we show some methods which achieve some nontrivial level of data privacy and circuit privacy without resorting to allowing early terminations, in both the QHE problem and in secure evaluation of classical functions. The entanglement and classical communication costs in these schemes are polynomial in the circuit size and the security parameter (if any).
- 28 June 2018
- Published by Springer Nature in Quantum Information Processing
- Vol. 17 (8) , 198
Mutually unbiased bases in dimension six containing a product-vector basis
- 28 June 2018
- Published by Springer Nature in Quantum Information Processing
- Vol. 17 (8) , 198
Mutually unbiased bases in dimension six containing a product-vector basis
- Open Access
Product states and Schmidt rank of mutually unbiased bases in dimension six
We show that if a set of four mutually unbiased bases (MUBs) in $\mathbb{C}^6$ exists and contains the identity, then any other basis in the set contains at most two product states and at the same time has Schmidt rank at least three. Here both the product states and the Schmidt rank are defined over the bipartite space $\mathbb{C}^2\otimes\mathbb{C}^3$. We also investigate the connection of the Sinkhorn normal form of unitary matrices to the fact that there is at least one vector unbiased to any two orthonormal bases in any dimension.Open AccessProduct states and Schmidt rank of mutually unbiased bases in dimension six
We show that if a set of four mutually unbiased bases (MUBs) in $\mathbb{C}^6$ exists and contains the identity, then any other basis in the set contains at most two product states and at the same time has Schmidt rank at least three. Here both the product states and the Schmidt rank are defined over the bipartite space $\mathbb{C}^2\otimes\mathbb{C}^3$. We also investigate the connection of the Sinkhorn normal form of unitary matrices to the fact that there is at least one vector unbiased to any two orthonormal bases in any dimension. - 28 September 2017
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 50 (47) , 475304
Product states and Schmidt rank of mutually unbiased bases in dimension six
We show that if a set of four mutually unbiased bases (MUBs) in $\mathbb{C}^6$ contains the identity, then any other basis in the set contains at most two product states and at the same time has Schmidt rank at least three. Here both the product states and the Schmidt rank are defined over the bipartite space $\mathbb{C}^2\otimes\mathbb{C}^3$. We also investigate the connection of the Sinkhorn normal form of unitary matrices to the fact that there is at least one vector unbiased to any two orthonormal bases in any dimension.- 28 September 2017
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 50 (47) , 475304
Product states and Schmidt rank of mutually unbiased bases in dimension six
We show that if a set of four mutually unbiased bases (MUBs) in $\mathbb{C}^6$ contains the identity, then any other basis in the set contains at most two product states and at the same time has Schmidt rank at least three. Here both the product states and the Schmidt rank are defined over the bipartite space $\mathbb{C}^2\otimes\mathbb{C}^3$. We also investigate the connection of the Sinkhorn normal form of unitary matrices to the fact that there is at least one vector unbiased to any two orthonormal bases in any dimension.- Open Access
Mutually unbiased bases in dimension six containing a product-vector basis
Excluding the existence of four MUBs in $\bbC^6$ is an open problem in quantum information. We investigate the number of product vectors in the set of four mutually unbiased bases (MUBs) in dimension six, by assuming that the set exists and contains a product-vector basis. We show that in most cases the number of product vectors in each of the remaining three MUBs is at most two. We further construct the exceptional case in which the three MUBs respectively contain at most three, two and two product vectors. We also investigate the number of vectors mutually unbiased to an orthonormal basis.Open AccessMutually unbiased bases in dimension six containing a product-vector basis
Excluding the existence of four MUBs in $\bbC^6$ is an open problem in quantum information. We investigate the number of product vectors in the set of four mutually unbiased bases (MUBs) in dimension six, by assuming that the set exists and contains a product-vector basis. We show that in most cases the number of product vectors in each of the remaining three MUBs is at most two. We further construct the exceptional case in which the three MUBs respectively contain at most three, two and two product vectors. We also investigate the number of vectors mutually unbiased to an orthonormal basis.