arXiv subjects

Wan-Su Bao

Publications and source records attributed to Wan-Su Bao.

At least 37 records · Page 2Linked to original sources

arXiv2022

Parameter-Parallel Distributed Variational Quantum Algorithm

Variational quantum algorithms (VQAs) have emerged as a promising near-term technique to explore practical quantum advantage on noisy intermediate-scale quantum (NISQ) devices. However, the inefficient parameter training process due to the incompatibility with backpropagation and the cost of a large number of measurements, posing a great challenge to the large-scale development of VQAs. Here, we propose a parameter-parallel distributed variational quantum algorithm (PPD-VQA), to accelerate the training process by parameter-parallel training with multiple quantum processors. To maintain the high performance of PPD-VQA in the realistic noise scenarios, a alternate training strategy is proposed to alleviate the acceleration attenuation caused by noise differences among multiple quantum processors, which is an unavoidable common problem of distributed VQA. Besides, the gradient compression is also employed to overcome the potential communication bottlenecks. The achieved results suggest that the PPD-VQA could provide a practical solution for coordinating multiple quantum processors to handle large-scale real-word applications.

quant-ph↗

arXiv2021

Parallel-Electromagnetically-Induced-Transparency Near Ground-State Cooling of a Trapped-ion Crystal

We theoretically propose and experimentally demonstrate a parallel-electromagnetically-induced transparency (parallel-EIT) cooling technique for ion crystals in the Paul trap. It has less stringent requirements on the cooling resonance condition than the standard electromagnetically-induced transparency (EIT) cooling, thus allowing, in principle, to simultaneously cool the motional mode spectrum with an arbitrary range. A proof-of-principle validation for this cooling scheme is experimentally demonstrated with up to 4 trapped 40Ca+ ions. We observe simultaneous near-ground-state cooling for all motional modes with best average phonon number about 0.2. By tuning the trap frequency in a large range to imitate a broadband motional mode spectrum, we can still reach almost the same cooling limit for all the modes while standard EIT cooling shows limited cooling range. Our method has a simple experimental configuration, requiring only appropriate modulation of the probe beam of standard EIT cooling, and can be applied to various types of ions (e.g., 171Yb+, 40Ca+). This cooling scheme provides a powerful tool for the initialization of the trapped-ion quantum computers and simulators.

quant-ph↗

arXiv2021

Steady state phonon occupation of EIT cooling: higher order calculations

Electromagnetically induced transparency (EIT) cooling has established itself as one of the most widely used cooling schemes for trapped ions during the past twenty years. Compared to its alternatives, EIT cooling possesses important advantages such as a tunable effective linewidth, a very low steady state phonon occupation, and applicability for multiple ions. However, existing analytic expression for the steady state phonon occupation of EIT cooling is limited to the zeroth order of the Lamb-Dicke parameter. Here we extend such calculations and present the explicit expression to the second order of the Lamb-Dicke parameter. We discuss several implications of our refined formula and are able to resolve certain difficulties in existing results.

quant-ph↗

arXiv2021

Strong quantum computational advantage using a superconducting quantum processor

Scaling up to a large number of qubits with high-precision control is essential in the demonstrations of quantum computational advantage to exponentially outpace the classical hardware and algorithmic improvements. Here, we develop a two-dimensional programmable superconducting quantum processor, \textit{Zuchongzhi}, which is composed of 66 functional qubits in a tunable coupling architecture. To characterize the performance of the whole system, we perform random quantum circuits sampling for benchmarking, up to a system size of 56 qubits and 20 cycles. The computational cost of the classical simulation of this task is estimated to be 2-3 orders of magnitude higher than the previous work on 53-qubit Sycamore processor [Nature \textbf{574}, 505 (2019)]. We estimate that the sampling task finished by \textit{Zuchongzhi} in about 1.2 hours will take the most powerful supercomputer at least 8 years. Our work establishes an unambiguous quantum computational advantage that is infeasible for classical computation in a reasonable amount of time. The high-precision and programmable quantum computing platform opens a new door to explore novel many-body phenomena and implement complex quantum algorithms.

quant-ph↗

arXiv2021

Sending or not sending twin-field quantum key distribution with distinguishable decoy states

Twin-field quantum key distribution (TF-QKD) and its variants can overcome the fundamental rate-distance limit of QKD which has been demonstrated in the laboratory and field while their physical implementations with side channels remains to be further researched. We find the external modulation of different intensity states through the test, required in those TF-QKD with post-phase compensation, shows a side channel in frequency domain. Based on this, we propose a complete and undetected eavesdropping attack, named passive frequency shift attack, on sending or not-sending (SNS) TF-QKD protocol given any difference between signal and decoy states in frequency domain which can be extended to other imperfections with distinguishable decoy states. We analyze this attack by giving the formula of upper bound of real secure key rate and comparing it with lower bound of secret key rate under Alice and Bob's estimation with the consideration of actively odd-parity pairing (AOPP) method and finite key effects. The simulation results show that Eve can get full information about the secret key bits without being detected at long distance. Our results emphasize the importance of practical security at source and might provide a valuable reference for the practical implementation of TF-QKD.

quant-ph↗

arXiv2020

Fast Cooling of Trapped Ion in Strong Sideband Coupling Regime

Trapped ion in the Lamb-Dicke regime with the Lamb-Dicke parameter $η\ll1$ can be cooled down to its motional ground state using sideband cooling. Standard sideband cooling works in the weak sideband coupling limit, where the sideband coupling strength is small compared to the natural linewidth $γ$ of the internal excited state, with a cooling rate much less than $γ$. Here we consider cooling schemes in the strong sideband coupling regime, where the sideband coupling strength is comparable or even greater than $γ$. We derive analytic expressions for the cooling rate and the average occupation of the motional steady state in this regime, based on which we show that one can reach a cooling rate which is proportional to $γ$, while at the same time the steady state occupation increases by a correction term proportional to $η^{2}$ compared to the weak sideband coupling limit. We demonstrate with numerical simulations that our analytic expressions faithfully recover the exact dynamics in the strong sideband coupling regime.

quant-ph↗

arXiv2019

Quantum search for unknown number of target items hybridizing the fixed-point method with the trail-and-error method

For the unsorted database quantum search with the unknown fraction $λ$ of target items, there are mainly two kinds of methods, i.e., fixed-point or trail-and-error. (i) In terms of the fixed-point method, Yoder et al. [Phys. Rev. Lett. 113, 210501 (2014)] claimed that the quadratic speedup over classical algorithms has been achieved. However, in this paper, we point out that this is not the case, because the query complexity of Yoder's algorithm is actually in $O(1/\sqrt{λ_0})$ rather than $O(1/\sqrtλ)$, where $λ_0$ is a known lower bound of $λ$. (ii) In terms of the trail-and-error method, currently the algorithm without randomness has to take more than 1 times queries or iterations than the algorithm with randomly selected parameters. For the above problems, we provide the first hybrid quantum search algorithm based on the fixed-point and trail-and-error methods, where the matched multiphase Grover operations are trialed multiple times and the number of iterations increases exponentially along with the number of trials. The upper bound of expected queries as well as the optimal parameters are derived. Compared with Yoder's algorithm, the query complexity of our algorithm indeed achieves the optimal scaling in $λ$ for quantum search, which reconfirms the practicality of the fixed-point method. In addition, our algorithm also does not contain randomness, and compared with the existing deterministic algorithm, the query complexity can be reduced by about 1/3. Our work provides an new idea for the research on fixed-point and trial-and-error quantum search.

quant-ph↗

arXiv2019

General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier

Recent advances on quantum computing hardware have pushed quantum computing to the verge of quantum supremacy. Random quantum circuits are outstanding candidates to demonstrate quantum supremacy, which could be implemented on a quantum device that supports nearest-neighbour gate operations on a two-dimensional configuration. Here we show that using the Projected Entangled-Pair States algorithm, a tool to study two-dimensional strongly interacting many-body quantum systems, we can realize an effective general-purpose simulator of quantum algorithms. This technique allows to quantify precisely the memory usage and the time requirements of random quantum circuits, thus showing the frontier of quantum supremacy. With this approach we can compute the full wave-function of the system, from which single amplitudes can be sampled with unit fidelity. Applying this general quantum circuit simulator we measured amplitudes for a $7\times 7$ lattice of qubits with depth $1+40+1$ and double-precision numbers in 31 minutes using less than $93$ TB memory on the Tianhe-2 supercomputer.

quant-ph↗

arXiv2019

Finite-key analysis for a practical decoy-state twin-field quantum key distribution

Twin-field quantum key distribution (TF-QKD), which is immune to all possible detector side channel attacks, enables two remote legitimate users to perform secure communications without quantum repeaters. With the help of a central node, TF-QKD is expected to overcome the linear key-rate constraint using current technologies. However, the security of the former TF-QKD protocols relies on the hypothesis of infinite-key and stable sources. In this paper, we present the finite-key analysis of a practical decoy-state twin-field quantum key distribution with variant statistical fluctuation models. We examine the composable security of the protocol with intensity fluctuations of unstable sources employing Azuma's inequality. Our simulation results indicate that the secret key rate is able to surpass the linear key-rate bound with limited signal pulses and intensity fluctuations. In addition, the effect of intensity fluctuations is extremely significant for small size of total signals.

quant-ph↗

arXiv2019

Simulating the Dynamics of Single Photons in BosonSampling Devices with Matrix Product States

BosonSampling is a well-defined scheme for demonstrating quantum supremacy with photons in near term. Although relying only on multi-photon interference in nonadaptive linear-optical networks, it is hard to simulate classically. Here we study BosonSampling using matrix product states, a powerful method from quantum many-body physics. This method stores the instantaneous quantum state during the evolution of photons in the optical quantum circuit, which allows us to reveal the dynamical features of single photons in BosonSampling devices, such as entanglement entropy growth. We show the flexiblility of this method by also applying it to dissipative optical quantum circuits, as well as circuits with fermionic particles. Our work shows that matrix product states is a powerful platform to simulate optical quantum circuits. And it is readily extended to study quantum dynamics in multi-particle quantum walks beyond BosonSampling.

quant-ph↗

arXiv2019

Exact quantum search based on analytical multiphase matching for known number of target items and the experimental demonstration on IBM Q

In [Phys. Rev. Lett. 113, 210501 (2014)], to achieve the optimal fixed-point quantum search in the case of unknown fraction (denoted by $λ$) of target items, the analytical multiphase matching (AMPM) condition has been proposed. In this paper, we find out that the AMPM condition can also be used to design the exact quantum search algorithm in the case of known $λ$, and the minimum number of iterations reaches the optimal level of existing exact algorithms. Experiments are performed to demonstrate the proposed algorithm on IBM's quantum computer. In addition, we theoretically find two coincidental phases with equal absolute value in our algorithm based on the AMPM condition and that algorithm based on single-phase matching. Our work confirms the practicability of the AMPM condition in the case of known $λ$, and is helpful to understand the mechanism of this condition.

quant-ph↗

arXiv2019

Security bound of continuous-variable measurement-device-independent quantum key distribution with imperfect phase reference calibration

Phase reference calibration is a necessary procedure in practical continuous-variable measurement-device-independent quantum key distribution (CV-MDI-QKD) for the need of Bell-State Measurement (BSM). However, the phase reference calibration may become imperfect in practical applications. We explored the practical security of CV-MDI-QKD with imperfect phase reference calibration under realistic conditions of lossy and noisy quantum channel. Specifically, a comprehensive framework is developed to model and characterize the imperfection of practical phase reference calibration operation, which is mainly caused by the non-synchronization of two remote lasers in senders. Security analysis shows that the imperfect phase reference calibration has significant side effects on the performance and security of the CV-MDI-QKD protocol. A tight security bound to excess noise introduced by imperfect phase reference calibration is derived for reverse reconciliation against arbitrary collective attacks in the asymptotic limit, and the tolerance of the CV-MDI-QKD protocol to this excess noise is also obtained. This security analysis framework can eliminate the security hazards caused by imperfect phase reference calibration without changing the existing CV-MDI-QKD system structure.

quant-ph↗

arXiv2018

Long-distance continuous-variable measurement-device-independent quantum key distribution with discrete modulation

We propose a long-distance continuous-variable measurement-device-independent quantum key distribution (CV-MDI-QKD) protocol with discrete modulation. This kind of discrete-modulated schemes have good compatibility with efficient error correction code, which lead to higher reconciliation efficiency even at low signal-to-noise ratio (SNR). Security analysis shows that the proposed protocol is secure against arbitrary collective attacks in the asymptotic limit with proper use of decoy states. And with the using of discrete modulation, the proposed CV-MDI-QKD protocol has simpler implementation and outperform previous protocols in terms of achievable maximal transmission distance, which precisely solve the bottleneck of the original Gaussian-modulated CV-MDI-QKD protocol.

quant-ph↗

arXiv2018

Complementary-multiphase quantum search for all numbers of target items

Grover's algorithm achieves a quadratic speedup over classical algorithms, but it is considered necessary to know the value of $λ$ exactly [Phys. Rev. Lett. 95, 150501 (2005); Phys. Rev. Lett. 113, 210501 (2014)], where $λ$ is the fraction of target items in the database. In this paper, we find out that the Grover algorithm can actually apply to the case where one can identify the range that $λ$ belongs to from a given series of disjoint ranges. However, Grover's algorithm still cannot maintain high success probability when there exist multiple target items. For this problem, we proposed a complementary-multiphase quantum search algorithm, %with general iterations, in which multiple phases complement each other so that the overall high success probability can be maintained. Compared to the existing algorithms, in the case defined above, for the first time our algorithm achieves the following three goals simultaneously: (1) the success probability can be no less than any given value between 0 and 1, (2) the algorithm is applicable to the entire range of $λ$, and (3) the number of iterations is almost the same as that of Grover's algorithm. Especially compared to the optimal fixed-point algorithm [Phys. Rev. Lett. 113, 210501 (2014)], our algorithm uses fewer iterations to achieve success probability greater than 82.71\%, e.g., when the minimum success probability is required to be 99.25\%, the number of iterations can be reduced by 50\%.

quant-ph↗

arXiv2018

Continuous-variable measurement-device-independent quantum key distribution with photon subtraction

It has been found that non-Gaussian operations can be applied to increase and distill entanglement between Gaussian entangled states. We show the successful use of the non-Gaussian operation, in particular, photon subtraction operation, on the continuous-variable measurement-device-independent quantum key distribution (CV-MDI-QKD) protocol. The proposed method can be implemented based on existing technologies. Security analysis shows that the photon subtraction operation can remarkably increase the maximal transmission distance of the CV-MDI-QKD protocol, which precisely make up for the shortcoming of the original CV-MDI-QKD protocol, and 1-photon subtraction operation has the best performance. Moreover, the proposed protocol provides a feasible method for the experimental implementation of the CV-MDI-QKD protocol.

quant-ph↗

arXiv2018

Demonstration of the Essentiality of Entanglement in a Deutsch-like Quantum Algorithm

Quantum algorithms could efficiently solve certain classically intractable problems by exploiting quantum parallelism. To date, whether the quantum entanglement is useful or not for quantum computing is still a question of debate. Here, we present a new quantum algorithm to show that entanglement could help to gain advantage over classical algorithm and even the quantum algorithm without entanglement. Furthermore, we implement experiments to demonstrate our proposed algorithm using superconducting qubits. Our results show the viability of the algorithm and suggest that entanglement is essential in getting quantum speedup for certain problems in quantum computing, which provide a reliable and clear guidance for developing useful quantum algorithms in future.

quant-ph↗

arXiv2017

Ground state cooling in a hybrid optomechanical system with a three-level atomic ensemble

Cooling mechanical resonators is of great importance for both fundamental study and applied science. We investigate the hybrid optomechanical cooling with a three-level atomic ensemble fixed in a strong excited optical cavity. By using the quantum noise approach, we find the upper bound of the noise spectrum and further present three optimal parameter conditions, which can yield a small heating coefficient, a large cooling coefficient, and thus a small final phonon number. Moreover, through the covariance matrix approach, results of numerical simulation are obtained, which are consistent with the theoretical expectations. It is demonstrated that our scheme can achieve ground state cooling in the highly unresolved sideband regime, within the current experimental technologies. Compared with the previous cooling methods, in our scheme, there are fewer constraints on the drive strength of atomic ensemble and number of atoms in the ensemble. In addition, the tolerable ranges of parameters for ground state cooling are extended. As a result, our scheme is very suitable for experiments and can be a guideline for the research of hybrid optomechanical cooling.

quant-ph↗

arXiv2017

Homomorphic Encryption Experiments on IBM's Cloud Quantum Computing Platform

Quantum computing has undergone rapid development in recent years. Owing to limitations on scalability, personal quantum computers still seem slightly unrealistic in the near future. The first practical quantum computer for ordinary users is likely to be on the cloud. However, the adoption of cloud computing is possible only if security is ensured. Homomorphic encryption is a cryptographic protocol that allows computation to be performed on encrypted data without decrypting them, so it is well suited to cloud computing. Here, we first applied homomorphic encryption on IBM's cloud quantum computer platform. In our experiments, we successfully implemented a quantum algorithm for linear equations while protecting our privacy. This demonstration opens a feasible path to the next stage of development of cloud quantum information technology.

cs.CR↗