Recent advances on quantum computing hardware have pushed quantum computing to the verge of quantum supremacy. Here, we bring together many-body quantum physics and quantum computing by using a method for strongly interacting two-dimensional systems, the projected entangled-pair states, to realize an effective general-purpose simulator of quantum algorithms. The classical computing complexity of this simulator is directly related to the entanglement generation of the underlying quantum circuit rather than the number of qubits or gate operations. We apply our method to study random quantum circuits, which allows us to quantify precisely the memory usage and the time requirements of random quantum circuits. We demonstrate our method by computing one amplitude for a lattice of qubits with depth () on the Tianhe-2 supercomputer.
Trapped ion in the Lamb–Dicke (LD) regime with the LD parameter η ≪ 1 can be cooled down to its motional ground state using sideband cooling. Standard sideband cooling works in the weak sideband coupling (WSC) 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 (SSC) 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 WSC limit. We demonstrate with numerical simulations that our analytic expressions faithfully recover the exact dynamics in the SSC regime.
2 February 2023 in Science China Physics, Mechanics & Astronomy
Measurement-device-independent quantum key distribution (MDI-QKD) is immune to detector side channel attacks, which is a notorious security loophole problem in QKD. Importantly, both finite-key effects and intensity fluctuations of the practical photon sources are nonnegligible in a full key rate analysis of practical QKD. In this paper, for the case with finite-key effects and without intensity fluctuations, we present a way to estimate the phase error rate for MDI-QKD and compare performances of the parameter estimation based on Hoeffding’s inequality and the Chernoff bound. By using Azuma’s inequality, we also present the finite-key analysis with composable security against general attacks for a biased decoy-state MDI-QKD protocol with intensity fluctuations. Our simulation results show that the effect of our phase error rate estimation is almost the same as the results in Phys. Rev. A 91, 022313 (2015) [CrossRef] , and the parameter estimation using the Chernoff bound is tighter than that using Hoeffding’s inequality. In addition, the influence of intensity fluctuations is more obvious when the data size of total transmitting signals is small. Our results highlight that it is important to keep the stability of the intensity modulator and estimate accurately the emitted pulse’s intensity for practical implementations.
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.