arXiv subjects

Man-Hong Yung

Publications and source records attributed to Man-Hong Yung.

At least 73 records · Page 4Linked to original sources

arXiv2021

Superrobust Geometric Control of a Superconducting Circuit

Geometric phases accompanying adiabatic quantum evolutions can be used to construct robust quantum control for quantum information processing due to their noise-resilient feature. A significant development along this line is to construct geometric gates using nonadiabatic quantum evolutions to reduce errors due to decoherence. However, it has been shown that nonadiabatic geometric gates are not necessarily more robust than dynamical ones, in contrast to an intuitive expectation. Here we experimentally investigate this issue for the case of nonadiabatic holonomic quantum computation~(NHQC) and show that conventional NHQC schemes cannot guarantee the expected robustness due to a cross coupling to the states outside the computational space. We implement a different set of constraints for gate construction in order to suppress such cross coupling to achieve an enhanced robustness. Using a superconducting quantum circuit, we demonstrate high-fidelity holonomic gates whose infidelity against quasi-static transverse errors can be suppressed up to the fourth order, instead of the second order in conventional NHQC and dynamical gates. In addition, we explicitly measure the accumulated dynamical phase due to the above mentioned cross coupling and verify that it is indeed much reduced in our NHQC scheme. We further demonstrate a protocol for constructing two-qubit NHQC gates also with an enhanced robustness.

quant-ph↗

arXiv2021

Strong quantum nonlocality from hypercubes

A set of multipartite orthogonal product states is strongly nonlocal if it is locally irreducible in every bipartition. Most known constructions of strongly nonlocal orthogonal product set (OPS) are limited to tripartite systems, and they are lack of intuitive structures. In this work, based on the decomposition for the outermost layer of an $n$-dimensional hypercube for $n= 3,4,5$, we successfully construct strongly nonlocal OPSs in any possible three, four and five-partite systems, which answers an open question given by Halder et al. [Phys. Rev. Lett.122, 040403 (2019)] and Yuan et al. [Phys. Rev. A102, 042228 (2020)] for any possible three, four and five-partite systems. Our results build the connection between hypercubes and strongly nonlocal OPSs, and exhibit the phenomenon of strong quantum nonlocality without entanglement in multipartite systems.

quant-ph↗

arXiv2021

Super-robust nonadiabatic geometric quantum control

Nonadiabatic geometric quantum computation (NGQC) and nonadiabatic holonomic quantum computation (NHQC) have been proposed to reduce the run time of geometric quantum gates. However, in terms of robustness against experimental control errors, the existing NGQC and NHQC scenarios have no advantage over standard dynamical gates in most cases. Here, we give the reasons why nonadiabatic geometric gates are sensitive to the control errors and, further, we propose a scheme of super-robust nonadiabatic geometric quantum control, in which the super-robust condition can guarantee both high speed and robustness of the geometric gate. To illustrate the working mechanism of super-robust geometric quantum gates, we give two simple examples of SR-NGQC and SR-NHQC for two- and three-level quantum systems, respectively. Theoretical and numerical results with the experimental parameters indicate that our scheme can significantly improve the gate performance compared to the previous NGQC, NHQC, and standard dynamical schemes. Super-robust geometric quantum computation can be applied to various physical platforms such as superconducting qubits, quantum dots, and trapped ions. All of these sufficiently show that our scheme provides a promising way towards robust geometric quantum computation.

quant-ph↗

arXiv2021

Low-depth Quantum State Preparation

A crucial subroutine in quantum computing is to load the classical data of $N$ complex numbers into the amplitude of a superposed $n=\lceil \log_2N\rceil$-qubit state. It has been proven that any algorithm universally implementing this subroutine would need at least $\mathcal O(N)$ constant weight operations. However, the proof assumes that only $n$ qubits are used, whereas the circuit depth could be reduced by extending the space and allowing ancillary qubits. Here we investigate this space-time tradeoff in quantum state preparation with classical data. We propose quantum algorithms with $\mathcal O(n^2)$ circuit depth to encode any $N$ complex numbers using only single-, two-qubit gates and local measurements with ancillary qubits. Different variances of the algorithm are proposed with different space and runtime. In particular, we present a scheme with $\mathcal O(N^2)$ ancillary qubits, $\mathcal O(n^2)$ circuit depth, and $\mathcal O(n^2)$ average runtime, which exponentially improves the conventional bound. While the algorithm requires more ancillary qubits, it consists of quantum circuit blocks that only simultaneously act on a constant number of qubits and at most $\mathcal O(n)$ qubits are entangled. We also prove a fundamental lower bound $\mitΩ(n)$ for the minimum circuit depth and runtime with arbitrary number of ancillary qubits, aligning with our scheme with $\mathcal O(n^2)$. The algorithms are expected to have wide applications in both near-term and universal quantum computing.

quant-ph↗

arXiv2021

Experimental Quantum Target Detection Approaching the Fundamental Helstrom Limit

Quantum target detection is an emerging application that utilizes entanglement to enhance the sensing of the presence of an object. Although several experimental demonstrations for certain situations have been reported recently, the single-shot detection limit imposed by the Helstrom limit has not been reached because of the unknown optimum measurements. Here we report an experimental demonstration of quantum target detection, also known as quantum illumination, in the single-photon limit. In our experiment, one photon of the maximally entangled photon pair is employed as the probe signal and the corresponding optimum measurement is implemented at the receiver. We explore the detection problem in different regions of the parameter space and verify that the quantum advantage exists even in a forbidden region of the conventional illumination, where all classical schemes become useless. Our results indicate that quantum illumination breaks the classical limit for up to 40%, while approaching the quantum limit imposed by the Helstrom limit. These results not only demonstrate the advantage of quantum illumination, but also manifest its valuable potential of target detection.

quant-ph↗

arXiv2021

Provable superior accuracy in machine learned quantum models

In modelling complex processes, the potential past data that influence future expectations are immense. Models that track all this data are not only computationally wasteful but also shed little light on what past data most influence the future. There is thus enormous interest in dimensional reduction-finding automated means to reduce the memory dimension of our models while minimizing its impact on its predictive accuracy. Here we construct dimensionally reduced quantum models by machine learning methods that can achieve greater accuracy than provably optimal classical counterparts. We demonstrate this advantage on present-day quantum computing hardware. Our algorithm works directly off classical time-series data and can thus be deployed in real-world settings. These techniques illustrate the immediate relevance of quantum technologies to time-series analysis and offer a rare instance where the resulting quantum advantage can be provably established.

quant-ph↗

arXiv2021

Generic detection-based error-mitigation using quantum autoencoders

Efficient error-mitigation techniques demanding minimal resources is key to quantum information processing. We propose a generic protocol to mitigate quantum errors using detection-based quantum autoencoders. In our protocol, the quantum data are compressed into a latent subspace while leaving errors outside, the latter of which is then removed by a measurement and post-selection. Compared to previously developed methods, our protocol on the one hand requires no extra qubits, and on the other hand has a near-optimal denoising power, in which under reasonable requirements all errors detected outside of the latent subspace can be removed, while those inside the subspace cannot be removed by any means. Our detection-based quantum autoencoders are therefore particularly useful for near-term quantum devices in which controllable qubits are limited while noise reduction is important.

quant-ph↗

arXiv2021

Graph connectivity based strong quantum nonlocality with genuine entanglement

Strong nonlocality based on local distinguishability is a stronger form of quantum nonlocality recently introduced in multipartite quantum systems: an orthogonal set of multipartite quantum states is said to be of strong nonlocality if it is locally irreducible for every bipartition of the subsystems. Most of the known results are limited to sets with product states. Shi et al. presented the first result of strongly nonlocal entangled sets in [Phys. Rev. A 102, 042202 (2020)] and there they questioned the existence of strongly nonlocal set with genuine entanglement. In this work, we relate the strong nonlocality of some speical set of genuine entanglement to the connectivities of some graphs. Using this relation, we successfully construct sets of genuinely entangled states with strong nonlocality. As a consequence, our constructions give a negative answer to Shi et al.'s question, which also provide another answer to the open problem raised by Halder et al. [Phys. Rev. Lett. 122, 040403 (2019)]. This work associates a physical quantity named strong nonlocality with a mathematical quantity called graph connectivity.

quant-ph↗

arXiv2021

Robust stimulated Raman shortcut-to-adiabatic passage by invariant-based optimal control

The stimulated Raman adiabatic passage (STIRAP) shows an efficient technique that accurately transfers population between two discrete quantum states with the same parity, in three-level quantum systems based on adiabatic evolution. This technique has widely theoretical and experimental applications in many fields of physics, chemistry, and beyond. Here, we present a generally robust approach to speed up STIRAP with invariant-based shortcut to adiabaticity. By controlling the dynamical process, we inversely design a family of Hamiltonians that can realize fast and accurate population transfer from the first to the third level, while the systematic error is largely suppressed in general. Furthermore, a detailed trade-off relation between the population of the intermediate state and the amplitudes of Rabi frequencies in the transfer process is illustrated. These results provide an optimal route toward manipulating the evolution of three-level quantum systems in future quantum information processing.

quant-ph↗

arXiv2021

Brachistochrone Non-Adiabatic Holonomic Quantum Control

In quantum control, geometrical operations could provide an extra layer of robustness against control errors. However, the conventional non-adiabatic holonomic quantum computation (NHQC) is limited by the fact that all of the operations require exactly the same amount of evolution time, even for a small-angle rotation. Furthermore, NHQC confines the driving part of the Hamiltonian to strictly cover a fixed pulse area, making it sensitive to control errors. Here we present an unconventional approach of NHQC, termed brachistochronic NHQC, for bypassing these limitations. Specifically, with B-NHQC, non-Abelian geometric gates can be time-optimized by following the brachistochrone curve, minimizing the impact from the environmental decoherence. Additionally, we demonstrate that B-NHQC is compatible with composed pulses, which can further enhance the robustness against pulse errors. For benchmarking, we provide a thorough analysis on the performance of B-NHQC under experimental conditions; we found that the gate error can be reduced by as much as 64% compared with NHQC.

quant-ph↗

arXiv2021

Error-Resilient Floquet Geometric Quantum Computation

We proposed a new geometric quantum computation (GQC) scheme, called Floquet GQC (FGQC), where error-resilient geometric gates based on periodically driven two-level systems can be constructed via a new non-Abelian geometric phase proposed in a recent study [V. Noviĉenko \textit{et al}, Phys. Rev. A 100, 012127 (2019) ]. Based on Rydberg atoms, we gave possible implementations of universal single-qubit gates and a nontrivial two-qubit gate for FGQC. By using numerical simulation, we evaluated the performance of the FGQC Z and X gates in the presence of both decoherence and a certain kind of systematic control error. The gate fidelities of the Z and X gates are $F_{X,\text{gate}}\approx F_{Z,\text{gate}}\approx 0.9992$. The numerical results provide evidence that FGQC gates can achieve fairly high gate fidelities even in the presence of noise and control imperfection. In addition, we found FGQC is robust against global control error, both analytical demonstration and numerical evidence were given. Consequently, this study makes an important step towards robust geometric quantum computation.

quant-ph↗

arXiv2021

Coherent Control with User-Defined Passage

Stimulated Raman adiabatic passage (STIRAP) is a standard technique to combat experimental imperfections and can be used to realize robust quantum state control, which has many applications in physics, chemistry, and beyond. However, STIRAP is susceptible to decoherence since it requires long evolution time. To overcome this problem, stimulated Raman user-defined passage (STIRUP) is proposed, which allows users to design the passages unlike the STIRAP but fast and robust against both decoherence and experimental imperfections. Here, we further develop a more general STIRUP method. Comparing with shortcut to adiabaticity and its' variants, the generalized STIRUP is more simpler and compatible with more complex energy-level structure and manybody systems. Furthermore, the generalized STIRUP has many important applications such as geometric phase measurement, coherent population transfer, and quantum state preparation. Specifically, as examples, we show how to realize the high-fidelity quantum state transfer and entangled state generation in a robust way via STIRUP with the state-of-the-art experimental superconducting circuits.

quant-ph↗

arXiv2020

Local distinguishability based genuinely quantum nonlocality without entanglement

Recently, Halder \emph{et al.} [Phys. Rev. Lett. \textbf{122}, 040403 (2019)] proposed the concept strong nonlocality without entanglement: an orthogonal set of fully product states in multipartite quantum systems that is locally irreducible for every bipartition of the subsystems. As the difficulty of the problem, most of the results are restricted to tripartite systems. Here we consider a weaker form of nonlocality called local distinguishability based genuine nonlocality. A set of orthogonal multipartite quantum states is said to be genuinely nonlocal if it is locally indistinguishable for every bipartition of the subsystems. In this work, we tend to study the latter form of nonlocality. First, we present an elegant set of product states in bipartite systems that is locally indistinguishable. After that, based on a simple observation, we present a general method to construct genuinely nonlocal sets of multipartite product states by using those sets that are genuinely nonlocal but with less parties. As a consequence, we obtain that genuinely nonlocal sets of fully product states exist for all possible multipartite quantum systems.

quant-ph↗

arXiv2020

Absolutely entangled set of pure states

Quite recently, Cai et al. [arXiv:2006.07165v1] proposed a new concept "absolutely entangled set" for bipartite quantum systems: for any possible choice of global basis, at least one state of the set is entangled. There they presented a minimum example with a set of four states in two qubit systems and they proposed a quantitative measure for the absolute set entanglement. In this work, we derive two necessity conditions for a set of states to be an absolutely entangled set. In addition, we give a series constructions of absolutely entangled bases on $\mathbb{C}^{d_1}\otimes \mathbb{C}^{d_2}$ for any nonprime dimension $d=d_1\times d_2$. Moreover, based on the structure of the orthogonal product basis in $\mathbb{C}^2\otimes \mathbb{C}^n$, we obtain another construction of absolutely entangled set with $2n+1$ elements in $\mathbb{C}^2\otimes \mathbb{C}^n$.

quant-ph↗

arXiv2020

Nonadiabatic noncyclic geometric quantum computation in Rydberg atoms

Nonadiabatic geometric quantum computation (NGQC) has been developed to realize fast and robust geometric gate. However, the conventional NGQC is that all of the gates are performed with exactly the sameamount of time, whether the geometric rotation angle is large or small, due to the limitation of cyclic condition. Here, we propose an unconventional scheme, called nonadiabatic noncyclic geometric quantum computation(NNGQC), that arbitrary single- and two-qubit geometric gate can be constructed via noncyclic non-Abeliangeometric phase. Consequently, this scheme makes it possible to accelerate the implemented geometric gatesagainst the effects from the environmental decoherence. Furthermore, this extensible scheme can be applied invarious quantum platforms, such as superconducting qubit and Rydberg atoms. Specifically, for single-qubit gate,we make simulations with practical parameters in neutral atom system to show the robustness of NNGQC and also compare with NGQC using the recent experimental parameters to show that the NNGQC can significantly suppress the decoherence error. In addition, we also demonstrate that nontrivial two-qubit geometric gate can berealized via unconventional Rydberg blockade regime within current experimental technologies. Therefore, ourscheme provides a promising way for fast and robust neutral-atom-based quantum computation.

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

Leakage Suppression for Holonomic Quantum Gates

Non-Abelian geometric phases acquired in cyclic quantum evolution can be utilized as natural resources for constructing robust holonomic gates for quantum information processing. Recently, an extensible holonomic quantum computation (HQC) was proposed and demonstrated in a recent superconducting experiment [T. Yan et al., Phys. Rev. Lett. 122, 080501 (2019)]. However, for the weakly anharmonic system, this HQC was given of low gate fidelity due to leakage to states outside of the computational subspace. Here, we propose a scheme that to construct nonadiabatic holonomic gates via dynamical invariant using resonant interaction of three-level superconducting quantum systems. Furthermore, the proposed scheme can be compatible with optimal control technology for maximizing the gate fidelity against leakage error. For benchmarking, we provide a thorough analysis on the performance of our scheme under experimental conditions, which shows that the gate error can be reduced by as much as 91.7\% compared with the conventional HQC. Moreover, the leakage rates can be reduced to $10^{-3}$ level by numerically choosing suitable control parameter. Therefore, our scheme provides a promising way towards fault-tolerant quantum computation in a weakly anharmonic solid-state system.

quant-ph↗

arXiv2020

Observation of exceptional point in a PT broken non-Hermitian system simulated using a quantum circuit

Exceptional points (EPs), the degeneracy point of non-Hermitian systems, have recently attracted great attention after its ability to greatly enhance the sensitivity of micro-cavities is demonstrated experimentally. Unlike the usual degeneracies in Hermitian systems, at EPs, both the eigenenergies and eigenvectors coalesce. Although some of the exotic properties and potential applications of EPs are explored, the range of EPs studied is largely limited by the experimental capability. Some of the systems, e.g. with higher-order EPs, are hard to achieve with conventional simulations. Here we propose an extendable method to simulate non-Hermitian systems on the quantum circuits, where a wide range of EPs can be studied. The system is inherently parity-time (PT) broken due to the non-symmetric controlling effects and post-selection. A sample circuit is implemented in a quantum programming framework, and the phase transition at EP is demonstrated. Considering the scalable and flexible nature of quantum circuits, our model is capable of simulating large scale systems with higher-order EPs. We believe this work may lead to broader applications of quantum computers and provide a tool to the studies for non-Hermitian systems and the associated EPs.

quant-ph↗