arXiv subjects

Liang-Zhu Mu

Publications and source records attributed to Liang-Zhu Mu.

At least 19 recordsLinked to original sources

arXiv2019

Diagonal Entropy and Topological Phase Transitions in Extended Kitaev Chains

We investigate the diagonal entropy for ground states of the extended Kitaev chains with extensive pairing and hopping terms. The systems contain rich topological phases equivalently represented by topological invariant winding numbers and Majorana zero modes. Both the finite size scaling law and block scaling law of the diagonal entropy are studied, which indicates that the diagonal entropy demonstrates volume effect. The parameter of volume term is regarded as the diagonal entropy density, which can identify the critical points of symmetry-protected topological phase transitions efficiently in the studied models, even for those with higher winding numbers. The formulation of block scaling law and the capability of diagonal entropy density in detecting topological phase transitions are independent of the chosen bases. In order to manifest the advantage of diagonal entropy, we also calculate the global entanglement, which can not show clear signatures of the topological phase transitions. This work provides a new quantum-informatic approach to characterize the feature of the topologically ordered states and may motivate a deep understanding of the quantum coherence and diagonal entropy in various condensed matter systems.

quant-ph↗

arXiv2018

Approximate quantum state reconstruction without a quantum channel

We investigate the optimal quantum state reconstruction from cloud to many spatially separated users by measure-broadcast-prepare scheme without the availability of quantum channel. The quantum state equally distributed from cloud to arbitrary number of users is generated at each port by ensemble of known quantum states with assistance of classical information of measurement outcomes by broadcasting. The obtained quantum state for each user is optimal in the sense that the fidelity universally achieves the upper bound. We present the universal quantum state distribution by providing physical realizable measurement bases in the cloud as well as the reconstruction method for each user. The quantum state reconstruction scheme works for arbitrary many identical pure input states in general dimensional system.

quant-ph↗

arXiv2018

Scalable Quantum Tomography with Fidelity Estimation

We propose a quantum tomography scheme for pure qudit systems which adopts random base measurements and generative learning methods, along with a built-in fidelity estimation approach to assess the reliability of the tomographic states. We prove the validity of the scheme theoretically, and we perform numerically simulated experiments on several target states including three typical quantum information states and randomly initiated states, demonstrating its efficiency and robustness. The number of replicas required by a certain convergence criterion grows in the manner of low-degree polynomial when the system scales, thus the scheme achieves high scalability that is crucial for practical quantum state tomography.

quant-ph↗

arXiv2018

Complementary relation of quantum coherence and quantum correlations in multiple measurements

Quantum coherence and quantum correlations lie in the center of quantum information science, since they both are considered as fundamental reasons for significant features of quantum mechanics different from classical mechanics. We present a group of complementary relations for quantum coherence and quantum correlations; specifically, we focus on thermal discord and conditional information in scenarios of multiple measurements. We show that the summation of quantum coherence quantified in different bases has a lower bound, resulting from entropic uncertainty relations with multiple measurements. Similar results are also obtained for thermal discord and for post-measurement conditional information with multiple measurements in a multipartite system. These results indicate the general applications of the uncertainty principle to various concepts of quantum information.

quant-ph↗

arXiv2018

A Universal Quantum Computing Virtual Machine

A medium-scale quantum computer with full universal quantum computing capability is necessary for various practical aims and testing applications. Here we report a 34-qubit quantum virtual machine (QtVM) based on a medium server. Our QtVM can run quantum assembly language with graphic interfaces. The QtVM is implemented with single qubit rotation gate, single to multiple controlled NOT gates to realize the universal quantum computation. Remarkably, it can realize a series of basic functions, such as, the "if" conditional programming language based on single-shot projective measurement results, "for" iteration programming language, build in arithmetic calculation. The measurement can be single-shot and arbitrary number of multi-shot types. In addition, there is in principle no limitation on number of logic gates implemented for quantum computation. By using QtVM, we demonstrate the simulation of dynamical quantum phase transition of transverse field Ising model by quantum circuits, where 34 qubits with one million gates are realized. We also show the realization of programmable Shor algorithm for factoring 15 and 35.

quant-ph↗

arXiv2017

Investigating disordered many-body system with entanglement in momentum space

We study the entanglement in momentum space of the ground state of a disordered one-dimensional fermion lattice model with attractive interaction. We observe two components in the entanglement spectrum, one of which is related to paired-fermion entanglement and contributes to the long-range correlation in position space. The vanishing point of it indicates the localization phenomenon in the ground state of this model. Additionally, by method of entanglement spectrum, we provide a new evidence to show the transition of two phases induced by interaction, and fnd that this phase transition is not infuenced by the disorder. Our result show key characteristics in entanglement for different phases in the system, and provide a novel perspective to understand localization phenomena.

cond-mat.dis-nn↗

arXiv2016

Entanglement Spectrum of Su-Schrieffer-Heeger-Hubbard Model

We investigate the entanglement spectrum of the ground state of Su-Schrieffer-Heeger-Hubbard model. The topological phases of the model can be identified by degeneracy of the largest eigenvalues of entanglement spectrum. The study of the periodic boundary condition is enough to obtain the phase diagram of the model, without the consideration of the open boundary condition case. Physical interpretation about the bulk-edge correspondence in the entanglement spectrum is presented. The method of the entanglement spectrum can be applicable in studying other topological phases of matter.

quant-ph↗

arXiv2016

Entanglement Rényi $α$-entropy

We study the entanglement Rényi $α$-entropy (ER$α$E) as the measure of entanglement. Instead of a single quantity in standard entanglement quantification for a quantum state by using the von Neumann entropy for the well-accepted entanglement of formation (EoF), the ER$α$E gives a continuous spectrum parametrized by variable $α$ as the entanglement measure, and it reduces to the standard EoF in the special case $α\rightarrow 1$. The ER$α$E provides more information in entanglement quantification, and can be used such as in determining the convertibility of entangled states by local operations and classical communication. A series of new results are obtained: (i) we can show that ER$α$E of two states, which can be mixed or pure, may be incomparable, in contrast to the fact that there always exists an order for EoF of two states; (ii) similar as the case of EoF, we study in a fully analytical way the ER$α$E for arbitrary two-qubit states, the Werner states and isotropic states in general d-dimension; (iii) we provide a proof of the previous conjecture for the analytical functional form of EoF of isotropic states in arbitrary d-dimension.

quant-ph↗

arXiv2014

Entropic uncertainty relations for multiple measurements

We present the entropic uncertainty relations for multiple measurement settings in quantum mechanics. Those uncertainty relations are obtained for both cases with and without the presence of quantum memory. They take concise forms which can be proven in a unified method and easy to calculate. Our results recover the well known entropic uncertainty relations for two observables, which show the uncertainties about the outcomes of two incompatible measurements. Those uncertainty relations are applicable in both foundations of quantum theory and the security of many quantum cryptographic protocols.

quant-ph↗

arXiv2014

Classification of no-signaling correlations and the guess your neighbor's input game

We formulate a series of non-trivial equalities which are satisfied by all no-signaling correlations, meaning that no faster-than-light communication is allowed with the resource of these correlations. All quantum and classical correlations satisfy these equalities since they are no-signaling. By applying these equalities, we provide a general framework for solving the multipartite "guess your neighbor's input" (GYNI) game, which is naturally no-signaling but shows conversely that general no-signaling correlations are actually more non-local than those allowed by quantum mechanics. We confirm the validity of our method for number of players from 3 up to 19, thus providing convincing evidence that it works for the general case. In addition, we solve analytically the tripartite GYNI and obtain a computable measure of supra-quantum correlations. This result simplifies the defined optimization procedure to an analytic formula, thus characterizing explicitly the boundary between quantum and supra-quantum correlations. In addition, we show that the gap between quantum and no-signaling boundaries containing supra-quantum correlations can be closed by local orthogonality conditions in the tripartite case. Our results provide a computable classification of no-signaling correlations.

quant-ph↗

arXiv2014

Quantum Cloning Machines and the Applications

No-cloning theorem is fundamental for quantum mechanics and for quantum information science that states an unknown quantum state cannot be cloned perfectly. However, we can try to clone a quantum state approximately with the optimal fidelity, or instead, we can try to clone it perfectly with the largest probability. Thus various quantum cloning machines have been designed for different quantum information protocols. Specifically, quantum cloning machines can be designed to analyze the security of quantum key distribution protocols such as BB84 protocol, six-state protocol, B92 protocol and their generalizations. Some well-known quantum cloning machines include universal quantum cloning machine, phase-covariant cloning machine, the asymmetric quantum cloning machine and the probabilistic quantum cloning machine etc. In the past years, much progress has been made in studying quantum cloning machines and their applications and implementations, both theoretically and experimentally. In this review, we will give a complete description of those important developments about quantum cloning and some related topics. On the other hand, this review is self-consistent, and in particular, we try to present some detailed formulations so that further study can be taken based on those results.

quant-ph↗

arXiv2014

Exclusive quantum channels in quantum networks

Quantum state can be teleported to a remote site by only local measurement and classical communication if the prior Einstein-Podolsky-Rosen quantum channel is available between the sender and the receiver. Those quantum channels shared by multiple nodes can constitute a quantum network. Yet, studies on the efficiency of quantum communication between nodes of quantum networks remain limited, which differs from classical case in that the quantum channel will be consumed if teleportation is performed. Here, we introduce the exclusive quantum channels (EQC) as the measure of efficiency of quantum information transmission. It quantifies the amount of quantum information which can be teleported between nodes in a quantum network. We show that different types of EQC are local quantities with effective circles. Significantly, capacity of quantum communication of quantum networks quantified by EQC is independent of distance for the communicating nodes. Thus, the quantum network can be dealt as the isotropic medium where quantum communication is no-decaying. EQC are studied by both analytical and numerical methods. The EQC can be enhanced by transformations of lattices of quantum network via entanglement swapping. Our result opens the avenue in studying the quantum communication of the quantum networks.

quant-ph↗

arXiv2014

Fitting magnetic field gradient with Heisenberg-scaling accuracy

We propose a quantum fitting scheme to estimate the magnetic field gradient with $N$-atom spins preparing in W state, which attains the Heisenberg-scaling accuracy. Our scheme combines the quantum multi-parameter estimation and the least square linear fitting method to achieve the quantum Cramér-Rao bound (QCRB). We show that the estimated quantity achieves the Heisenberg-scaling accuracy. In single parameter estimation with assumption that the magnetic field is strictly linear, two optimal measurements can achieve the identical Heisenberg-scaling accuracy. Proper interpretation of the super-Heisenberg-scaling accuracy is presented. The scheme of quantum metrology combined with data fitting provides a new method in fast high precision measurements.

quant-ph↗

arXiv2013

Measurement-based Quantum Computation Under Different Types of Noises

Measurement based quantum computation (MBQC) is an effective paradigm for universal quantum computation. In this scheme, the universal set of quantum gates are realized by only local measurements on the prior prepared cluster states. The inevitable decoherence is harmful to the realization of those quantum gates. Here, we investigate the performance of the quantum gates exposed to different type of noises. We find that some errors may not influence the success of the quantum gates, in contrast, some others may destroy their realization. We show that there is a controlling pattern that can protect quantum gates from certain types of noises and thus can improve the success probability of the gates implementation.

quant-ph↗

arXiv2013

Criterion on remote clocks synchronization within a Heisenberg scaling accuracy

We propose a quantum method to judge whether two spatially separated clocks have been synchronized within a specific accuracy $σ$. If the measurement result of the experiment is obviously a nonzero value, the time difference between two clocks is smaller than $σ$; otherwise the difference is beyond $σ$. On sharing the 2$N$-qubit bipartite maximally entangled state in this scheme, the accuracy of judgement can be enhanced to $σ\simπ/{(ω(N+1))}$. This criterion is consistent with Heisenberg scaling that can be considered as beating standard quantum limit, moreover, the unbiased estimation condition is not necessary.

quant-ph↗

arXiv2013

Quantum key distribution based on a quantum retrodiction protocol

This paper is withdrawn. We study the quantum key distribution (QKD) protocol based on a quantum retrodiction protocol, namely the so-called mean king problem. The security is analyzed by considering the eavesdropping on both the preparation of the entangled pair and the transmission of the quantum state. This QKD protocol can generate efficiently a bit of raw key in every single run. We find that, for qubit system, it is more secure than the QKD Bennett-Brassard 1984 protocol and the six-state protocol. This QKD protocol works also for higher dimensional system.

quant-ph↗

arXiv2012

Quantum network teleportation for quantum information distribution and concentration

We investigate the schemes of quantum network teleportation for quantum information distribution and concentration which are essential in quantum cloud computation and quantum internet. In those schemes, the cloud can send simultaneously identical unknown quantum states to clients located in different places by a network like teleportation with a prior shared multipartite entangled state resource. The cloud first perform the quantum operation, each client can recover their quantum state locally by using the classical information announced by the cloud about the measurement result. The number of clients can be beyond the number of identical quantum states intentionally being sent, this quantum network teleportation can make sure that the retrieved quantum state is optimal. Furthermore, we present a scheme to realize its reverse process, which concentrates the states from the clients to reconstruct the original state of the cloud. These schemes facilitate the quantum information distribution and concentration in quantum networks in the framework of quantum cloud computation. Potential applications in time synchronization are discussed.

quant-ph↗

arXiv2012

Minimal sets determining universal and phase-covariant quantum cloning

We study the minimal input sets which can determine completely the universal and the phase-covariant quantum cloning machines. We find that the universal quantum cloning machine, which can copy arbitrary input qubit equally well, however can be determined completely by only four input states located at the four vertices of a tetrahedron. The phase-covariant quantum cloning machine, which can copy all qubits located on the equator of the Bloch sphere, can be determined by three equatorial qubits with equal angular distance. These results sharpen further the well-known results that BB84 states and six-states used in quantum cryptography can determine completely the phase-covariant and universal quantum cloning machines. This concludes the study of the power of universal and phase-covariant quantum cloning, i.e., from minimal input sets necessarily to full input sets by definition. This can simplify dramatically the testing of whether the quantum clone machines are successful or not, we only need to check that the minimal input sets can be cloned optimally.

quant-ph↗