arXiv subjects

Zhu Cao

Publications and source records attributed to Zhu Cao.

At least 37 records · Page 2Linked to original sources

arXiv2023

Deep Ising Born Machine

A quantum neural network (QNN) is a method to find patterns in quantum data and has a wide range of applications including quantum chemistry, quantum computation, quantum metrology, and quantum simulation. Efficiency and universality are two desirable properties of a QNN but are unfortunately contradictory. In this work, we examine a deep Ising Born machine (DIBoM), and show it has a good balance between efficiency and universality. More precisely, the DIBoM has a flexible number of parameters to be efficient, and achieves provable universality with sufficient parameters. The architecture of the DIBoM is based on generalized controlled-Z gates, conditional gates, and some other ingredients. To compare the universality of the DIBoM with other QNNs, we propose a fidelity-based expressivity measure, which may be of independent interest. Extensive empirical evaluations corroborate that the DIBoM is both efficient and expressive.

quant-ph↗

arXiv2021

Detection loophole in quantum causality and its countermeasures

Quantum causality violates classical intuitions of cause and effect and is a unique quantum feature different from other quantum phenomena such as entanglement and quantum nonlocality. In order to avoid the detection loophole in quantum causality, we initiate the study of the detection efficiency requirement for observing quantum causality. We first show that previous classical causal inequalities require detection efficiency at least 95.97% (89.44%) to show violation with quantum (nonsignaling) correlations. Next we derive a classical causal inequality I_{222} and show that it requires lower detection efficiency to be violated, 92.39% for quantum correlations and 81.65% for nonsignaling correlations, hence substantially reducing the requirement on detection. Then we extend this causal inequality to the case of multiple measurement settings and analyze the corresponding detection efficiency. After that, we show that previous quantum causal inequalities require detection efficiency at least 94.29% to violate with nonsignaling correlations. We subsequently derive a quantum causal bound J_{222} that has a lower detection efficiency requirement of 91.02% for violation with nonsignaling correlations. Our work paves the way towards an experimental demonstration of quantum causality and shows that causal inequalities significantly differ from Bell inequalities in terms of the detection efficiency requirement.

quant-ph↗

arXiv2020

Constant-round Multi-party Quantum Computation for Constant Parties

One of the central themes in classical cryptography is multi-party computation, which performs joint computation on multiple participants' data while maintaining data privacy. The extension to the quantum regime was proposed in 2002, but despite two decades of research, the current state-of-the-art multi-party quantum computation protocol for a fixed number of parties (even 2 parties) requires unbounded rounds of communication, which greatly limit its practical usage. In this work, we propose the first constant-round multi-party quantum computation protocol for a fixed number of parties against specious adversaries, thereby significantly reducing the required number of rounds. Our work constitutes a key step towards practical implementation of secure multi-party quantum computation, and opens the door for practitioners to be involved in this exciting field. The result of our work has wide implications to quantum fidelity evaluation, quantum machine learning, quantum voting, and distributed quantum information processing.

quant-ph↗

arXiv2020

Counterfactual universal quantum computation

Universal quantum computation is usually associated with interaction among two-level quantum subsystems, as this interaction is commonly viewed as a necessity to achieve universal quantum computation. In this work, we show that, contrary to this intuition, universal quantum computation can be achieved without interaction among initially independent two-level quantum subsystems. We call it counterfactual universal quantum computation. As special cases, we show how to achieve counterfactual communication of quantum states, counterfactual quantum swapping, and counterfactual quantum erasure codes. To ease practical implementation, we analyze counterfactual universal quantum computation with realistic devices, including the effects of finite execution time, photon loss, and atom missing. Besides the theoretical interest of illustrating the mysterious and counterintuitive nature of quantum physics, our work has practical applications to color imaging of ancient arts, upon which light is forbidden to shine.

quant-ph↗

arXiv2020

Verification of Group Non-membership by Shallow Quantum Circuits

Decision problems are the problems whose answer is either YES or NO. As the quantum analogue of $\mathsf{NP}$ (nondeterministic polynomial time), the class $\mathsf{QMA}$ (quantum Merlin-Arthur) contains the decision problems whose YES instance can be verified efficiently with a quantum computer. The problem of deciding the group non-membership (GNM) of a group element is known to be in $\mathsf{QMA}$. Previous works on the verification of GNM required a quantum circuit with $O(n^5)$ group oracle calls. Here we propose an efficient way to verify GNM problems, reducing the circuit depth to $O(1)$ and the number of qubits by half. We further experimentally demonstrate the scheme, in which two-element subgroups in a four-element group are employed for the verification task. A significant completeness-soundness gap is observed in the experiment.

quant-ph↗

arXiv2020

Quantum Go Machine

Go has long been considered as a testbed for artificial intelligence. By introducing certain quantum features, such as superposition and collapse of wavefunction, we experimentally demonstrate a quantum version of Go by using correlated photon pairs entangled in polarization degree of freedom. The total dimension of Hilbert space of the generated states grows exponentially as two players take turns to place the stones in time series. As nondeterministic and imperfect information games are more difficult to solve using nowadays technology, we excitedly find that the inherent randomness in quantum physics can bring the game nondeterministic trait, which does not exist in the classical counterpart. Some quantum resources, like coherence or entanglement, can also be encoded to represent the state of quantum stones. Adjusting the quantum resource may vary the average imperfect information (as comparison classical Go is a perfect information game) of a single game. We further verify its non-deterministic feature by showing the unpredictability of the time series data obtained from different classes of quantum state. Finally, by comparing quantum Go with a few typical games that are widely studied in artificial intelligence, we find that quantum Go can cover a wide range of game difficulties rather than a single point. Our results establish a paradigm of inventing new games with quantum-enabled difficulties by harnessing inherent quantum features and resources, and provide a versatile platform for the test of new algorithms to both classical and quantum machine learning.

quant-ph↗

arXiv2020

Discrete-phase-randomized measurement-device-independent quantum key distribution

Measurement-device-independent quantum key distribution removes all detector-side attacks in quantum cryptography, and in the meantime doubles the secure distance. The source side, however, is still vulnerable to various attacks. In particular, the continuous phase randomization assumption on the source side is normally not fulfilled in experimental implementation and may potentially open a loophole. In this work, we first show that indeed there are loopholes for imperfect phase randomization in measurement-device-independent quantum key distribution by providing a concrete attack. Then we propose a discrete-phase-randomized measurement-device-independent quantum key distribution protocol as a solution to close this source-side loophole.

quant-ph↗

arXiv2020

Experimental Test of Tracking the King Problem

In quantum theory, the retrodiction problem is not as clear as its classical counterpart because of the uncertainty principle of quantum mechanics. In classical physics, the measurement outcomes of the present state can be used directly for predicting the future events and inferring the past events which is known as retrodiction. However, as a probabilistic theory, quantum-mechanical retrodiction is a nontrivial problem that has been investigated for a long time, of which the Mean King Problem is one of the most extensively studied issues. Here, we present the first experimental test of a variant of the Mean King Problem, which has a more stringent regulation and is termed "Tracking the King". We demonstrate that Alice, by harnessing the shared entanglement and controlled-not gate, can successfully retrodict the choice of King's measurement without knowing any measurement outcome. Our results also provide a counterintuitive quantum communication to deliver information hidden in the choice of measurement.

quant-ph↗

arXiv2017

Uncertainty conservation relations: theory and experiment

As a very fundamental principle in quantum physics, uncertainty principle has been studied intensively via various uncertainty inequalities. Based on the information measure introduced by Brukner and Zeilinger in [Phys. Rev. Lett. 83, 3354 (1999)], we derive an uncertainty conservation relation in the presence of quantum memory. We show that the sum of measurement uncertainties over a complete set of mutually unbiased bases on a subsystem is equal to a total uncertainty determined by the initial bipartite state. Hence for a given bipartite system the uncertainty is conserved and the uncertainty relation is given by an equality. When the total uncertainty vanishes, all the uncertainties related to every mutually unbiased base measurement are zero, which is substantially different from the uncertainty relation given by Berta et. al. [Nat. Phys. 6, 659 (2010)] where an uncertainty inequality is presented. By directly measuring the corresponding quantum mechanical observables on a 5-qubit spin system, we experimentally verify the uncertainty conservation relation in the presence of quantum memory without quantum state tomography.

quant-ph↗

arXiv2017

Operational one-to-one mapping between coherence and entanglement measures

We establish a general operational one-to-one mapping between coherence measures and entanglement measures: Any entanglement measure of bipartite pure states is the minimum of a suitable coherence measure over product bases. Any coherence measure of pure states, with extension to mixed states by convex roof, is the maximum entanglement generated by incoherent operations acting on the system and an incoherent ancilla. Remarkably, the generalized CNOT gate is the universal optimal incoherent operation. In this way, all convex-roof coherence measures, including the coherence of formation, are endowed with (additional) operational interpretations. By virtue of this connection, many results on entanglement can be translated to the coherence setting, and vice versa. As applications, we provide tight observable lower bounds for generalized entanglement concurrence and coherence concurrence, which enable experimentalists to quantify entanglement and coherence of the maximal dimension in real experiments.

quant-ph↗

arXiv2017

Direct Counterfactual Communication with Single Photons

Intuition from our everyday lives gives rise to the belief that information exchanged between remote parties is carried by physical particles. Surprisingly, in a recent theoretical study [Salih H, Li ZH, Al-Amri M, Zubairy MS (2013) Phys Rev Lett 110:170502], quantum mechanics was found to allow for communication, even without the actual transmission of physical particles. From the viewpoint of communication, this mystery stems from a (nonintuitive) fundamental concept in quantum mechanics wave-particle duality. All particles can be described fully by wave functions. To determine whether light appears in a channel, one refers to the amplitude of its wave function. However, in counterfactual communication, information is carried by the phase part of the wave function. Using a single-photon source, we experimentally demonstrate the counterfactual communication and successfully transfer a monochrome bitmap from one location to another by using a nested version of the quantum Zeno effect.

quant-ph↗

arXiv2017

Practical round-robin differential-phase-shift quantum key distribution

The security of quantum key distribution (QKD) relies on the Heisenberg uncertainty principle, with which legitimate users are able to estimate information leakage by monitoring the disturbance of the transmitted quantum signals. Normally, the disturbance is reflected as bit flip errors in the sifted key; thus, privacy amplification, which removes any leaked information from the key, generally depends on the bit error rate. Recently, a round-robin differential-phase-shift QKD protocol for which privacy amplification does not rely on the bit error rate [Nature 509, 475 (2014)] was proposed. The amount of leaked information can be bounded by the sender during the state-preparation stage and hence, is independent of the behaviour of the unreliable quantum channel. In our work, we apply the tagging technique to the protocol and present a tight bound on the key rate and employ a decoy-state method. The effects of background noise and misalignment are taken into account under practical conditions. Our simulation results show that the protocol can tolerate channel error rates close to 50% within a typical experiment setting. That is, there is a negligible restriction on the error rate in practice.

quant-ph↗

arXiv2017

Intrinsic randomness as a measure of quantum coherence

Based on the theory of quantum mechanics, intrinsic randomness in measurement distinguishes quantum effects from classical ones. From the perspective of states, this quantum feature can be summarized as coherence or superposition in a specific (classical) computational basis. Recently, by regarding coherence as a physical resource, Baumgratz et al.~present a comprehensive framework for coherence measures. Here, we propose a quantum coherence measure essentially using the intrinsic randomness of measurement. The proposed coherence measure provides an answer to the open question in completing the resource theory of coherence. Meanwhile, we show that the coherence distillation process can be treated as quantum extraction, which can be regarded as an equivalent process of classical random number extraction. From this viewpoint, the proposed coherence measure also clarifies the operational aspect of quantum coherence. Finally, our results indicate a strong similarity between two types of quantumness --- coherence and entanglement.

quant-ph↗

arXiv2016

Tight detection efficiency bounds of Bell tests in no-signaling theories

No-signaling theories, which can contain nonlocal correlations stronger than classical correlations but limited by the no-signaling condition, have deepened our understanding of the quantum theory. In principle, the nonlocality of these theories can be verified via Bell tests. In practice, however, inefficient detectors may make Bell tests unreliable, which is called the detection efficiency loophole. In this work, we show almost tight lower and upper bounds of the detector efficiency requirement for demonstrating the nonlocality of no-signaling theories, by designing a general class of Bell tests. In particular, we show tight bounds for two scenarios: the bipartite case and the multipartite case with a large number of parties. To some extent, these tight efficiency bounds quantify the nonlocality of no-signaling theories. Furthermore, our result shows that the detector efficiency can be arbitrarily low even for Bell tests with two parties, by increasing the number of measurement settings. Our work also sheds light on the detector efficiency requirement for showing the nonlocality of the quantum theory.

quant-ph↗

arXiv2016

Experimental quantum data locking

Classical correlation can be locked via quantum means--quantum data locking. With a short secret key, one can lock an exponentially large amount of information, in order to make it inaccessible to unauthorized users without the key. Quantum data locking presents a resource-efficient alternative to one-time pad encryption which requires a key no shorter than the message. We report experimental demonstrations of quantum data locking scheme originally proposed by DiVincenzo et al. [Phys. Rev. Lett. 92, 067902 (2004)] and a loss-tolerant scheme developed by Fawzi, Hayde, and Sen [J. ACM. 60, 44 (2013)]. We observe that the unlocked amount of information is larger than the key size in both experiments, exhibiting strong violation of the incremental proportionality property of classical information theory. As an application example, we show the successful transmission of a photo over a lossy channel with quantum data (un)locking and error correction.

quant-ph↗

arXiv2016

Quantum random number generation

Quantum physics can be exploited to generate true random numbers, which play important roles in many applications, especially in cryptography. Genuine randomness from the measurement of a quantum system reveals the inherent nature of quantumness --- coherence, an important feature that differentiates quantum mechanics from classical physics. The generation of genuine randomness is generally considered impossible with only classical means. Based on the degree of trustworthiness on devices, quantum random number generators (QRNGs) can be grouped into three categories. The first category, practical QRNG, is built on fully trusted and calibrated devices and typically can generate randomness at a high speed by properly modeling the devices. The second category is self-testing QRNG, where verifiable randomness can be generated without trusting the actual implementation. The third category, semi-self-testing QRNG, is an intermediate category which provides a tradeoff between the trustworthiness on the device and the random number generation speed.

quant-ph↗

arXiv2016

Source-independent quantum random number generation

Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics. In general, a physical generator contains two parts---a randomness source and its readout. The source is essential to the quality of the resulting random numbers; hence, it needs to be carefully calibrated and modeled to achieve information-theoretical provable randomness. However, in practice, the source is a complicated physical system, such as a light source or an atomic ensemble, and any deviations in the real-life implementation from the theoretical model may affect the randomness of the output. To close this gap, we propose a source-independent scheme for quantum random number generation in which output randomness can be certified, even when the source is uncharacterized and untrusted. In our randomness analysis, we make no assumptions about the dimension of the source. For instance, multiphoton emissions are allowed in optical implementations. Our analysis takes into account the finite-key effect with the composable security definition. In the limit of large data size, the length of the input random seed is exponentially small compared to that of the output random bit. In addition, by modifying a quantum key distribution system, we experimentally demonstrate our scheme and achieve a randomness generation rate of over $5\times 10^3$ bit/s.

quant-ph↗

arXiv2016

Trustworthiness of measurement devices in round-robin differential-phase-shift quantum key distribution

Round-robin differential-phase-shift quantum key distribution (RRDPS QKD) has been proposed to raise the noise tolerability of the channel. However, in practice, the measurement device in RRDPS QKD may be imperfect. Here, we show that, with these imperfections, the security of RRDPS may be damaged, by proposing two attacks for RRDPS systems with uncharacterized measurement devices. One is valid even for a system with unit total efficiency, while the other is valid even when a single photon state is sent. To prevent these attacks, either security arguments need to be fundamentally revised or further practical assumptions on the measurement device should be put.

quant-ph↗