Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2506.19809 · Quantum

Universal and Efficient Quantum State Verification via Schmidt Decomposition and Mutually Unbiased Bases

Yunting Li, Huangjun Zhu

Published Mar 4, 2026• 0 citations
arXivHTMLPDF

Abstract

Efficient verification of multipartite quantum states is crucial to many applications in quantum information processing. By virtue of Schmidt decomposition and mutually unbiased bases, here we propose a universal protocol to verify arbitrary multipartite pure quantum states using adaptive local projective measurements. Moreover, we establish a universal upper bound on the sample complexity that is independent of the local dimensions. Numerical calculations further indicate that Haar-random pure states can be verified with a constant sample cost, irrespective of the qudit number and local dimensions, even in the adversarial scenario in which the source cannot be trusted. As alternatives, we provide several simpler variants that can achieve similar high efficiencies without using Schmidt decomposition. The simplest variant consists of only two distinct tests.

DOI
10.22331/q-2026-03-04-2011

Related papers

Efficient verification of bipartite pure states

Zihao Li, Yun-Guang Han, Huangjun Zhu

We propose practical and efficient protocols for verifying bipartite pure states for any finite dimension, which can also be applied to fidelity estimation. Our protocols are based on adaptive local projective measurements with either one-way or two-way communications, which are very easy to implement in practice. They can extract the key information much more efficiently than known protocols based on tomography or direct fidelity estimation, and their efficiencies are comparable to the best protocols based on entangling measurements. These protocols highlight the significance of mutually unbiased bases and complex projective 2-designs in quantum state verification and fidelity estimation. Moreover, our protocols can be applied to the adversarial scenario, in which states are controlled by a malicious adversary. In this case, surprisingly, one of our protocols based on local measurements is even optimal among protocols without locality restriction.

arXiv:1901.09783•Physical Review A•Sep 10, 2019•55 citations

Efficient Verification of Pure Quantum States in the Adversarial Scenario

Huangjun Zhu, Masahito Hayashi

Efficient verification of pure quantum states in the adversarial scenario is crucial to many applications in quantum information processing, such as blind measurement-based quantum computation and quantum networks. However, little is known about this topic so far. Here, we establish a general framework for verifying pure quantum states in the adversarial scenario and clarify the resource cost. Moreover, we propose a simple and general recipe to constructing efficient verification protocols for the adversarial scenario from protocols for the nonadversarial scenario. With this recipe, arbitrary pure states can be verified in the adversarial scenario with almost the same efficiency as in the nonadversarial scenario. Many important quantum states can be verified in the adversarial scenario using local projective measurements with unprecedented high efficiencies.

arXiv:1909.01900•Physical Review Letters•Dec 27, 2019•85 citations

General framework for verifying pure quantum states in the adversarial scenario

Huangjun Zhu, Masahito Hayashi

Bipartite and multipartite entangled states are of central interest in quantum information processing and foundational studies. Efficient verification of these states, especially in the adversarial scenario, is a key to various applications, including quantum computation, quantum simulation, and quantum networks. However, little is known about this topic in the adversarial scenario. Here we initiate a systematic study of pure-state verification in the adversarial scenario. In particular, we introduce a general method for determining the minimal number of tests required by a given strategy to achieve a given precision. In the case of homogeneous strategies, we can even derive an analytical formula. Furthermore, we propose a general recipe to verifying pure quantum states in the adversarial scenario by virtue of protocols for the nonadversarial scenario. Thanks to this recipe, the resource cost for verifying an arbitrary pure state in the adversarial scenario is comparable to the counterpart for the nonadversarial scenario, and the overhead is at most three times for high-precision verification. Our recipe can readily be applied to efficiently verify bipartite pure states, stabilizer states, hypergraph states, weighted graph states, and Dicke states in the adversarial scenario, even if only local projective measurements are accessible. This paper is an extended version of the companion paper Zhu and Hayashi, Phys. Rev. Lett. 123, 260504 (2019).

arXiv:1909.01943•Physical Review A•Dec 27, 2019•66 citations

Certifying unknown-basis pure-state entanglement dimensionality with few measurement settings

Changhao Yi

We introduce a basis-independent algorithm that only uses single-copy measurements to certify the Schmidt number of $2n$-qubit bipartite pure states. Assuming the local system dimension is $d = 2^n$, the Schmidt number $χ$ is $O(1)$, and the non-zero Schmidt coefficients are bounded below by $Ω(1)$, our protocol achieves a total sample complexity of $\widetilde{O}(d^2χ^2)$ with only $\widetilde{O}(χ^4)$ measurement settings. This work establishes a measurement-setting-efficient approach to high-dimensional entanglement certification.

quant-pharXiv:2601.11040•Jan 19, 2026•0 citations

Minimum number of experimental settings required to verify bipartite pure states and unitaries

Yunting Li, Haoyu Zhang, Zihao Li +1 more

Efficient verification of quantum states and gates is crucial to the development of quantum technologies. Although the sample complexities of quantum state verification and quantum gate verification have been studied by many researchers, the number of experimental settings has received little attention and is poorly understood. In this work we study systematically quantum state verification and quantum gate verification with a focus on the number of experimental settings. We show that any bipartite pure state can be verified by only two measurement settings based on local projective measurements. Any bipartite unitary in dimension $d$ can be verified by $2d$ experimental settings based on local operations. In addition, we introduce the concept of entanglement-free verification and clarify its connection with minimal-setting verification. Finally, we show that any two-qubit unitary can be verified with at most five experimental settings; moreover, a generic two-qubit unitary (except for a set of measure zero) can be verified by an entanglement-free protocol based on four settings. In the course of study we clarify the properties of Schmidt coefficients of two-qubit unitaries, which are of independent interest.

arXiv:2112.13638•Physical Review A•Dec 27, 2021•6 citations

Optimal verification and fidelity estimation of maximally entangled states

Huangjun Zhu, Masahito Hayashi

We study the verification of maximally entangled states by virtue of the simplest measurement settings: local projective measurements without adaption. We show that optimal protocols are in one-to-one correspondence with complex projective 2-designs constructed from orthonormal bases. Optimal protocols with minimal measurement settings are in one-to-one correspondence with complete sets of mutually unbiased bases. Based on this observation, optimal protocols are constructed explicitly for any local dimension, which can also be applied to estimating the fidelity with the target state and to detecting entanglement. In addition, we show that incomplete sets of mutually unbiased bases are optimal for verifying maximally entangled states when the number of measurement settings is restricted. Moreover, we construct optimal protocols for the adversarial scenario in which state preparation is not trusted. The number of tests has the same scaling behavior as the counterpart for the nonadversarial scenario; the overhead is no more than three times. We also show that the entanglement of the maximally entangled state can be certified with any given significance level using only one test as long as the local dimension is large enough.

arXiv:1901.09772•Physical Review A•May 28, 2019•60 citations
Efficient verification of multipartite quantum states is crucial to many applications in quantum information processing. By virtue of Schmidt decomposition and mutually unbiased bases, here we propose a universal protocol to verify arbitrary multipartite pure quantum states using adaptive local projective measurements. Moreover, we establish a universal upper bound on the sample complexity that is independent of the local dimensions. Numerical calculations further indicate that Haar-random pure states can be verified with a constant sample cost, irrespective of the qudit number and local dimensions, even in the adversarial scenario in which the source cannot be trusted. As alternatives, we provide several simpler variants that can achieve similar high efficiencies without using Schmidt decomposition. The simplest variant consists of only two distinct tests.
We propose practical and efficient protocols for verifying bipartite pure states for any finite dimension, which can also be applied to fidelity estimation. Our protocols are based on adaptive local projective measurements with either one-way or two-way communications, which are very easy to implement in practice. They can extract the key information much more efficiently than known protocols based on tomography or direct fidelity estimation, and their efficiencies are comparable to the best protocols based on entangling measurements. These protocols highlight the significance of mutually unbiased bases and complex projective 2-designs in quantum state verification and fidelity estimation. Moreover, our protocols can be applied to the adversarial scenario, in which states are controlled by a malicious adversary. In this case, surprisingly, one of our protocols based on local measurements is even optimal among protocols without locality restriction.
Efficient verification of pure quantum states in the adversarial scenario is crucial to many applications in quantum information processing, such as blind measurement-based quantum computation and quantum networks. However, little is known about this topic so far. Here, we establish a general framework for verifying pure quantum states in the adversarial scenario and clarify the resource cost. Moreover, we propose a simple and general recipe to constructing efficient verification protocols for the adversarial scenario from protocols for the nonadversarial scenario. With this recipe, arbitrary pure states can be verified in the adversarial scenario with almost the same efficiency as in the nonadversarial scenario. Many important quantum states can be verified in the adversarial scenario using local projective measurements with unprecedented high efficiencies.
Bipartite and multipartite entangled states are of central interest in quantum information processing and foundational studies. Efficient verification of these states, especially in the adversarial scenario, is a key to various applications, including quantum computation, quantum simulation, and quantum networks. However, little is known about this topic in the adversarial scenario. Here we initiate a systematic study of pure-state verification in the adversarial scenario. In particular, we introduce a general method for determining the minimal number of tests required by a given strategy to achieve a given precision. In the case of homogeneous strategies, we can even derive an analytical formula. Furthermore, we propose a general recipe to verifying pure quantum states in the adversarial scenario by virtue of protocols for the nonadversarial scenario. Thanks to this recipe, the resource cost for verifying an arbitrary pure state in the adversarial scenario is comparable to the counterpart for the nonadversarial scenario, and the overhead is at most three times for high-precision verification. Our recipe can readily be applied to efficiently verify bipartite pure states, stabilizer states, hypergraph states, weighted graph states, and Dicke states in the adversarial scenario, even if only local projective measurements are accessible. This paper is an extended version of the companion paper Zhu and Hayashi, Phys. Rev. Lett. 123, 260504 (2019).
We introduce a basis-independent algorithm that only uses single-copy measurements to certify the Schmidt number of 2n2n2n-qubit bipartite pure states. Assuming the local system dimension is d=2nd = 2^nd=2n, the Schmidt number χχχ is O(1)O(1)O(1), and the non-zero Schmidt coefficients are bounded below by Ω(1)Ω(1)Ω(1), our protocol achieves a total sample complexity of O~(d2χ2)\widetilde{O}(d^2χ^2)O(d2χ2) with only O~(χ4)\widetilde{O}(χ^4)O(χ4) measurement settings. This work establishes a measurement-setting-efficient approach to high-dimensional entanglement certification.
Efficient verification of quantum states and gates is crucial to the development of quantum technologies. Although the sample complexities of quantum state verification and quantum gate verification have been studied by many researchers, the number of experimental settings has received little attention and is poorly understood. In this work we study systematically quantum state verification and quantum gate verification with a focus on the number of experimental settings. We show that any bipartite pure state can be verified by only two measurement settings based on local projective measurements. Any bipartite unitary in dimension ddd can be verified by 2d2d2d experimental settings based on local operations. In addition, we introduce the concept of entanglement-free verification and clarify its connection with minimal-setting verification. Finally, we show that any two-qubit unitary can be verified with at most five experimental settings; moreover, a generic two-qubit unitary (except for a set of measure zero) can be verified by an entanglement-free protocol based on four settings. In the course of study we clarify the properties of Schmidt coefficients of two-qubit unitaries, which are of independent interest.
We study the verification of maximally entangled states by virtue of the simplest measurement settings: local projective measurements without adaption. We show that optimal protocols are in one-to-one correspondence with complex projective 2-designs constructed from orthonormal bases. Optimal protocols with minimal measurement settings are in one-to-one correspondence with complete sets of mutually unbiased bases. Based on this observation, optimal protocols are constructed explicitly for any local dimension, which can also be applied to estimating the fidelity with the target state and to detecting entanglement. In addition, we show that incomplete sets of mutually unbiased bases are optimal for verifying maximally entangled states when the number of measurement settings is restricted. Moreover, we construct optimal protocols for the adversarial scenario in which state preparation is not trusted. The number of tests has the same scaling behavior as the counterpart for the nonadversarial scenario; the overhead is no more than three times. We also show that the entanglement of the maximally entangled state can be certified with any given significance level using only one test as long as the local dimension is large enough.