arXiv subjects

Huangjun Zhu

Publications and source records attributed to Huangjun Zhu.

At least 37 records · Page 2Linked to original sources

arXiv2023

Robust and efficient verification of graph states in blind measurement-based quantum computation

Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. Measurement-based quantum computation (MBQC) is a promising approach for realizing BQC. To obtain reliable results in blind MBQC, it is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. However, previous verification protocols for this task are too resource consuming or noise susceptible to be applied in practice. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension in the adversarial scenario, which leads to a robust and efficient protocol for verifying the resource state in blind MBQC. Our protocol requires only local Pauli measurements and is thus easy to realize with current technologies. Nevertheless, it can achieve the optimal scaling behaviors with respect to the system size and the target precision as quantified by the infidelity and significance level, which has never been achieved before. Notably, our protocol can exponentially enhance the scaling behavior with the significance level.

quant-ph↗

arXiv2023

Experimental Demonstration of Inequivalent Mutually Unbiased Bases

Quantum measurements based on mutually unbiased bases (MUB) play crucial roles in foundational studies and quantum information processing. It is known that there exist inequivalent MUB, but little is known about their operational distinctions, not to say experimental demonstration. In this work, by virtue of a simple estimation problem we experimentally demonstrate the operational distinctions between inequivalent triples of MUB in dimension 4 based on high-precision photonic systems. The experimental estimation fidelities coincide well with the theoretical predictions with only 0.16$\%$ average deviation, which is 25 times less than the difference (4.1$\%$) between the maximum estimation fidelity and the minimum estimation fidelity. Our experiments clearly demonstrate that inequivalent MUB have different information extraction capabilities and different merits for quantum information processing.

quant-ph↗

arXiv2023

Information Theoretic Significance of Projective Measurements

Projective measurements in quantum theory have a very simple algebraic definition, but their information theoretic significance is quite elusive. Here we introduce a simple order relation based on the concentration of Fisher information, which complements the familiar data-processing order. Under this order relation, the information theoretic significance of projective measurements stands out immediately. Notably, projective measurements are exactly those quantum measurements whose extracted Fisher information is as concentrated as possible, which we call Fisher-sharp measurements. We also introduce the concept of sharpness index and show that it is completely determined by the finest projective measurement among the coarse graining of a given measurement.

quant-ph↗

arXiv2022

Significance improvement by randomized test in random sampling without replacement

This paper studies one-sided hypothesis testing under random sampling without replacement. That is, when $n+1$ binary random variables $X_1,\ldots, X_{n+1}$ are subject to a permutation invariant distribution and $n$ binary random variables $X_1,\ldots, X_{n}$ are observed, we have proposed randomized tests with a randomization parameter for the upper confidence limit of the expectation of the $(n+1)$th random variable $X_{n+1}$ under a given significance level $δ>0$. Our proposed randomized test significantly improves over deterministic test unlike random sampling with replacement.

math.ST↗

arXiv2022

Nearly tight universal bounds for the binomial tail probabilities

We derive simple but nearly tight upper and lower bounds for the binomial lower tail probability (with straightforward generalization to the upper tail probability) that apply to the whole parameter regime. These bounds are easy to compute and are tight within a constant factor of $89/44$. Moreover, they are asymptotically tight in the regimes of large deviation and moderate deviation. By virtue of a surprising connection with Ramanujan's equation, we also provide strong evidences suggesting that the lower bound is tight within a factor of $1.26434$. It may even be regarded as the natural lower bound, given its simplicity and appealing properties. Our bounds significantly outperform the familiar Chernoff bound and reverse Chernoff bounds known in the literature and may find applications in various research areas.

math.PR↗

arXiv2022

Quantum Measurements in the Light of Quantum State Estimation

Starting from a simple estimation problem, here we propose a general approach for decoding quantum measurements from the perspective of information extraction. By virtue of the estimation fidelity only, we provide surprisingly simple characterizations of rank-1 projective measurements, mutually unbiased measurements, and symmetric informationally complete measurements. Notably, our conclusions do not rely on any assumption on the rank, purity, or the number of measurement outcomes, and we do not need bases to start with. Our work demonstrates that all these elementary quantum measurements are uniquely determined by their information-extraction capabilities, which are not even anticipated before. In addition, we offer a new perspective for understanding noncommutativity and incompatibility from tomographic performances, which also leads to a universal criterion for detecting quantum incompatibility. Furthermore, we show that the estimation fidelity can be used to distinguish inequivalent mutually unbiased bases and symmetric informationally complete measurements. In the course of study, we introduce the concept of (weighted complex projective) $1/2$-designs and show that all $1/2$-designs are tied to symmetric informationally complete measurements, and vice versa.

quant-ph↗

arXiv2022

Efficient verification of Affleck-Kennedy-Lieb-Tasaki states

Affleck-Kennedy-Lieb-Tasaki (AKLT) states are an important class of many-body quantum states that are useful in quantum information processing, including measurement-based quantum computation in particular. Here we propose a general approach for constructing efficient verification protocols for AKLT states on arbitrary graphs with local spin measurements. Our verification protocols build on bond verification protocols and matching covers (including edge coloring) of the underlying graphs, which have a simple geometric and graphic picture. We also provide rigorous performance guarantee that is required for practical applications. With our approach, most AKLT states of wide interest, including those defined on 1D and 2D lattices, can be verified with a constant sample cost, which is independent of the system size and is dramatically more efficient than all previous approaches. As an illustration, we construct concrete verification protocols for AKLT states on various lattices and on arbitrary graphs up to five vertices.

quant-ph↗

arXiv2021

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

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.

quant-ph↗

arXiv2021

Optimal Verification of the Bell State and Greenberger-Horne-Zeilinger States in Untrusted Quantum Networks

Bipartite and multipartite entangled states are basic ingredients for constructing quantum networks and their accurate verification is crucial to the functioning of the networks, especially for untrusted networks. Here we propose a simple approach for verifying the Bell state in an untrusted quantum network in which one party is not honest. Only local projective measurements are required for the honest party. It turns out each verification protocol is tied to a probability distribution on the Bloch sphere and its performance has an intuitive geometric meaning. This geometric picture enables us to construct the optimal and simplest verification protocols, which are also very useful to detecting entanglement in the untrusted network. Moreover, we show that our verification protocols can achieve almost the same sample efficiencies as protocols tailored to standard quantum state verification. Furthermore, we establish an intimate connection between the verification of Greenberger-Horne-Zeilinger states and the verification of the Bell state. By virtue of this connection we construct the optimal protocol for verifying Greenberger-Horne-Zeilinger states and for detecting genuine multipartite entanglement.

quant-ph↗

arXiv2021

Hiding and masking quantum information in complex and real quantum mechanics

Classical information can be completely hidden in the correlations of bipartite quantum systems. However, it is impossible to hide or mask all quantum information according to the no-hiding and no-masking theorems derived recently. Here we show that any set of informationally complete quantum states is neither hidable nor maskable, thereby strengthening the no-hiding and no-masking theorems known before. Then, by virtue of Hurwitz-Radon matrices (representations of the Clifford algebra), we show that information about real quantum states can be completely hidden in the correlations, although the minimum dimension of the composite Hilbert space required increases exponentially with the dimension of the original Hilbert space. Moreover, the set of real quantum states is a maximal maskable set within quantum theory and has a surprising connection with maximally entangled states. These results offer valuable insight on the potential and limit of hiding and masking quantum information, which are of intrinsic interest to a number of active research areas.

quant-ph↗

arXiv2021

Zero Uncertainty States in the Presence of Quantum Memory

The uncertainty principle imposes a fundamental limit on predicting the measurement outcomes of incompatible observables even if complete classical information of the system state is known. The situation is different if one can build a quantum memory entangled with the system. Zero uncertainty states (in contrast with minimum uncertainty states) are peculiar quantum states that can eliminate uncertainties of incompatible von Neumann observables once assisted by suitable measurements on the memory. Here we determine all zero uncertainty states of any given set of nondegenerate observables and determine the minimum entanglement required. It turns out all zero uncertainty states are maximally entangled in a generic case, and vice versa, even if these observables are only weakly incompatible. Our work establishes a simple and precise connection between zero uncertainty and maximum entanglement, which is of interest to foundational studies and practical applications, including quantum certification and verification.

quant-ph↗

arXiv2021

Experimental Masking of Real Quantum States

Masking of quantum information is a way of hiding information in correlations such that no information is accessible to any local observer. Although the set of all quantum states as a whole cannot be masked into bipartite correlations according to the no-masking theorem, the set of real states is maskable and is a maximal maskable set. In this work, we experimentally realize a masking protocol of the real ququart by virtue of a photonic quantum walk. Our experiment clearly demonstrates that quantum information of the real ququart can be completely hidden in bipartite correlations of two-qubit hybrid entangled states, which are encoded in two different degrees of freedom of a single photon. The hidden information is not accessible from each qubit alone, but can be faithfully retrieved with a fidelity of about 99% from correlation measurements. By contrast, any superset of the set of real density matrices cannot be masked.

quant-ph↗

arXiv2021

Efficient Experimental Verification of Quantum Gates with Local Operations

Verifying the correct functioning of quantum gates is a crucial step towards reliable quantum information processing, but it becomes an overwhelming challenge as the system size grows due to the dimensionality curse. Recent theoretical breakthroughs show that it is possible to verify various important quantum gates with the optimal sample complexity of $O(1/ε)$ using local operations only, where $ε$ is the estimation precision. In this work, we propose a variant of quantum gate verification (QGV) which is robust to practical gate imperfections, and experimentally realize efficient QGV on a two-qubit controlled-not gate and a three-qubit Toffoli gate using only local state preparations and measurements. The experimental results show that, by using only 1600 and 2600 measurements on average, we can verify with 95% confidence level that the implemented controlled-not gate and Toffoli gate have fidelities at least 99% and 97%, respectively. Demonstrating the superior low sample complexity and experimental feasibility of QGV, our work promises a solution to the dimensionality curse in verifying large quantum devices in the quantum era.

quant-ph↗

arXiv2021

Verification of phased Dicke states

Dicke states are typical examples of quantum states with genuine multipartite entanglement. They are valuable resources in many quantum information processing tasks, including multiparty quantum communication and quantum metrology. Phased Dicke states are a generalization of Dicke states and include antisymmetric basis states as a special example. These states are useful in atomic and molecular physics besides quantum information processing. Here we propose practical and efficient protocols based on adaptive local projective measurements for verifying all phased Dicke states, including $W$ states and qudit Dicke states. To verify any $n$-partite phased Dicke state within infidelity $ε$ and significance level $δ$, the number of tests required is only $O(nε^{-1}\lnδ^{-1})$, which is linear in $n$ and is exponentially more efficient than traditional tomographic approaches. In the case of $W$ states, the number of tests can be further reduced to $O(\sqrt{n}\,ε^{-1}\lnδ^{-1})$. Moreover, we construct an optimal protocol for any antisymmetric basis state; the number of tests required decreases (rather than increases) monotonically with $n$. This is the only optimal protocol known for multipartite nonstabilizer states.

quant-ph↗

arXiv2020

Optimal verification of stabilizer states

Statistical verification of a quantum state aims to certify whether a given unknown state is close to the target state with confidence. So far, sample-optimal verification protocols based on local measurements have been found only for disparate groups of states: bipartite pure states, GHZ states, and antisymmetric basis states. In this work, we investigate systematically optimal verification of entangled stabilizer states using Pauli measurements. First, we provide a lower bound on the sample complexity of any verification protocol based on separable measurements, which is independent of the number of qubits and the specific stabilizer state. Then we propose a simple algorithm for constructing optimal protocols based on Pauli measurements. Our calculations suggest that optimal protocols based on Pauli measurements can saturate the above bound for all entangled stabilizer states, and this claim is verified explicitly for states up to seven qubits. Similar results are derived when each party can choose only two measurement settings, say X and Z. Furthermore, by virtue of the chromatic number, we provide an upper bound for the minimum number of settings required to verify any graph state, which is expected to be tight. For experimentalists, optimal protocols and protocols with the minimum number of settings are explicitly provided for all equivalent classes of stabilizer states up to seven qubits. For theorists, general results on stabilizer states (including graph states in particular) and related structures derived here may be of independent interest beyond quantum state verification.

quant-ph↗

arXiv2020

Optimal Verification of Greenberger-Horne-Zeilinger States

We construct optimal protocols for verifying qubit and qudit GHZ states using local projective measurements. When the local dimension is a prime, an optimal protocol is constructed from Pauli measurements only. Our protocols provide a highly efficient way for estimating the fidelity and certifying genuine multipartite entanglement. In particular, they enable the certification of genuine multipartite entanglement using only one test when the local dimension is sufficiently large. By virtue of adaptive local projective measurements, we then construct protocols for verifying GHZ-like states that are optimal over all protocols based on one-way communication. The efficiency can be improved further if additional communications are allowed. Finally, we construct optimal protocols for verifying GHZ states and nearly optimal protocols for GHZ-like states in the adversarial scenario.

quant-ph↗

arXiv2020

Efficient verification of quantum gates with local operations

Efficient verification of the functioning of quantum devices is a key to the development of quantum technologies, but is a daunting task as the system size increases. Here we propose a simple and general framework for verifying unitary transformations that can be applied to both individual quantum gates and gate sets, including quantum circuits. This framework enables efficient verification of many important unitary transformations, including but not limited to all bipartite unitaries, Clifford unitaries, generalized controlled-$Z$ gates, generalized controlled-NOT gates, the controlled-SWAP gate, and permutation transformations. For all these unitaries, the sample complexity increases at most linearly with the system size and is often independent of the system size. Moreover, little overhead is incurred even if one can only prepare Pauli eigenstates and perform local measurements. Our approach is applicable in many scenarios in which randomized benchmarking (RB) does not apply and is thus instrumental to quantum computation and many other applications in quantum information processing.

quant-ph↗

arXiv2020

Experimental optimal orienteering via parallel and antiparallel spins

Antiparallel spins are superior in orienteering to parallel spins. This intriguing phenomenon is tied to entanglement associated with quantum measurements rather than quantum states. Using photonic systems, we experimentally realize the optimal orienteering protocols based on parallel spins and antiparallel spins, respectively. The optimal entangling measurements for decoding the direction information from parallel spins and antiparallel spins are realized using photonic quantum walks, which is a useful idea that is of wide interest in quantum information processing and foundational studies. Our experiments clearly demonstrate the advantage of antiparallel spins over parallel spins in orienteering. In addition, entangling measurements can extract more information than local measurements even if no entanglement is present in the quantum states.

quant-ph↗