arXiv subjects

Xiang-Bin Wang

Publications and source records attributed to Xiang-Bin Wang.

At least 37 records · Page 2Linked to original sources

arXiv2023

Twin-field quantum key distribution with local frequency reference

Twin-field quantum key distribution (TF-QKD) overcomes the linear rate-loss limit, which promises a boost of secure key rate over long distance. However, the complexity of eliminating the frequency differences between the independent laser sources hinders its practical application. Here, taking the saturated absorption spectroscopy of acetylene as an absolute reference, we propose and demonstrate a simple and practical approach to realize TF-QKD without requiring relative frequency control of the independent laser sources. Adopting the 4-intensity sending-or-not-sending TF-QKD protocol, we experimentally demonstrate the TF-QKD over 502 km, 301 km and 201 km ultra-low loss optical fiber respectively. We expect this high-performance scheme will find widespread usage in future intercity and free-space quantum communication networks.

quant-ph↗

arXiv2023

Twin-field quantum key distribution without phase locking

Twin-field quantum key distribution (TF-QKD) has emerged as a promising solution for practical quantum communication over long-haul fiber. However, previous demonstrations on TF-QKD require the phase locking technique to coherently control the twin light fields, inevitably complicating the system with extra fiber channels and peripheral hardware. Here we propose and demonstrate an approach to recover the single-photon interference pattern and realize TF-QKD \emph{without} phase locking. Our approach separates the communication time into reference frames and quantum frames, where the reference frames serve as a flexible scheme for establishing the global phase reference. To do so, we develop a tailored algorithm based on fast Fourier transform to efficiently reconcile the phase reference via data post-processing. We demonstrate no-phase-locking TF-QKD from short to long distances over standard optical fibers. At 50-km standard fiber, we produce a high secret key rate (SKR) of 1.27 Mbit/s, while at 504-km standard fiber, we obtain the repeater-like key rate scaling with a SKR of 34 times higher than the repeaterless secret key capacity. Our work provides a scalable and practical solution to TF-QKD, thus representing an important step towards its wide applications.

quant-ph↗

arXiv2023

Quantum Advantage of Noisy Grover's Algorithm

Quantum advantage is the core of quantum computing. Grover's search algorithm is the only quantum algorithm with proven advantage to any possible classical search algorithm. However, realizing this quantum advantage in practice is quite challenging since Grover's algorithm is very sensitive to noise. Here we present a noise-tolerant method that exponentially improves the noise threshold of Grover's algorithm. We present a lower bound for average fidelity of any quantum circuit with O(log D log D) cost under time-independent noise, where D is the dimension of Hilbert space. According to this bound value, we determine the number of iterates which will be applied in Grover's algorithm. Numerical simulation shows that the noise threshold of quantum advantage of Grover's algorithm by our noise-tolerant method is improved by an exponential factor with qubit amount rise.

quant-ph↗

arXiv2023

Modifying $n$-qubit controlled-$ZX$ gate to be $n$-qubit Toffoli gate

The decomposition for controlled-$ZX$ gate in [Phys. Rev. A, 87, 062318 (2013)] has a shallow circuit depth $8n-20$ with no ancilla. Here we modify this decomposition to decompose $n$-qubit Toffoli gate with only $2n-3$ additional single-qubit gates. The circuit depth is unchanged and no ancilla is needed. We explicitly show that the circuit after decomposition can be easily constructed in present physical systems.

quant-ph↗

arXiv2023

Side-channel-secure quantum key distribution

We present a result of side-channel-secure (SCS) quantum key distribution (QKD) under fully realistic conditions. Our result is not only measurement-device independent but also effective with imperfect (and unstable) source devices including imperfect vacuum and imperfect coherent-state source. Applying the virtual mapping idea, we present a general security proof under whatever out-side-lab attack, including whatever side-channel coherent attack. As a byproduct, we also present an improved method for SCS protocols which can raise the key rate by 1-2 orders of magnitude. Using these results, we obtain a non-asymptotic key rate which is instantly useful with full realistic conditions.

quant-ph↗

arXiv2023

Improving D2p Grover's algorithm to reach performance upper bound under phase noise

The original Grover's algorithm has a success probability to output a correct solution, while deterministic Grover's algorithms improve the success probability to 100%. However, the success probability of deterministic Grover's algorithm decreases in noisy environment. Here we improve the deterministic two-parameter (D2p) Grover's algorithm to reach the upper bound for success probability under phase noise. We prove that it is not possible to design any deterministic Grover's algorithm whose success probability is higher than our improved D2p protocol's under phase noise.

quant-ph↗

arXiv2023

Solution of SAT Problems with the Adaptive-Bias Quantum Approximate Optimization Algorithm

The quantum approximate optimization algorithm (QAOA) is a promising method for solving certain classical combinatorial optimization problems on near-term quantum devices. When employing the QAOA to 3-SAT and Max-3-SAT problems, the quantum cost exhibits an easy-hard-easy or easy-hard pattern respectively as the clause density is changed. The quantum resources needed in the hard-region problems are out of reach for current NISQ devices. We show by numerical simulations with up to 14 variables and analytical arguments that the adaptive-bias QAOA (ab-QAOA) greatly improves performance in the hard region of the 3-SAT problems and hard region of the Max-3-SAT problems. For similar accuracy, on average, ab-QAOA needs 3 levels for 10-variable 3-SAT problems as compared to 22 for QAOA. For 10-variable Max-3-SAT problems, the numbers are 7 levels and 62 levels. The improvement comes from a more targeted and more limited generation of entanglement during the evolution. We demonstrate that classical optimization is not strictly necessary in the ab-QAOA since local fields are used to guide the evolution. This leads us to propose an optimization-free ab-QAOA that can solve the hard-region 3-SAT and Max-3-SAT problems effectively with significantly fewer quantum gates as compared to the original ab-QAOA. Our work paves the way for realizing quantum advantages for optimization problems on NISQ devices.

quant-ph↗

arXiv2023

Sending-or-Not-Sending Twin-Field Quantum Key Distribution with Redundant Space

We propose to adopt redundant space such as polarization mode in the sending-or-not-sending Twin-Field quantum key distribution (TF-QKD) in the Fock space. With the help of redundant space such as photon polarization, we can post-select events according to the outcome of the observation to the additional quantity. This compresses the bit-flip error rate in the post-selected events of the SNS protocol. The calculation shows that the method using redundant space can greatly improve the performance in practical TF-QKD, especially when the total number of pulses is small.

quant-ph↗

arXiv2023

Experimental Twin-Field Quantum Key Distribution Over 1000 km Fiber Distance

Quantum key distribution (QKD) aims to generate secure private keys shared by two remote parties. With its security being protected by principles of quantum mechanics, some technology challenges remain towards practical application of QKD. The major one is the distance limit, which is caused by the fact that a quantum signal cannot be amplified while the channel loss is exponential with the distance for photon transmission in optical fiber. Here using the 3-intensity sending-or-not-sending protocol with the actively-odd-parity-pairing method, we demonstrate a fiber-based twin-field QKD over 1002 km. In our experiment, we developed a dual-band phase estimation and ultra-low noise superconducting nanowire single-photon detectors to suppress the system noise to around 0.02 Hz. The secure key rate is $9.53\times10^{-12}$ per pulse through 1002 km fiber in the asymptotic regime, and $8.75\times10^{-12}$ per pulse at 952 km considering the finite size effect. Our work constitutes a critical step towards the future large-scale quantum network.

quant-ph↗

arXiv2022

Post-selection in noisy Gaussian boson sampling: part is better than whole

Gaussian boson sampling is originally proposed to show quantum advantage with quantum linear optical elements. Recently, several experimental breakthroughs based on Gaussian boson sampling pointing to quantum computing supremacy have been presented. However, due to technical limitations, the outcomes of Gaussian boson sampling devices are influenced severely by photon loss. Here, we present an efficient and practical method to reduce the negative effect caused by photon loss. With no hardware modifications, our method takes the data post-selection process that discards low-quality data according to our criterion to improve the performance of the final computational results, say part is better than whole. As an example, we show that the post-selection method can turn a GBS experiment that would otherwise fail in a ``non-classical test" into one that can pass that test. Besides improving the robustness of computation results of current GBS devices, this photon loss mitigation method may also benefit the further development of GBS-based quantum algorithms.

quant-ph↗

arXiv2022

Robust twin-field quantum key distribution through sending-or-not-sending

The sending-or-not-sending (SNS) protocol is one of the most major variants of the twin-field (TF) quantum key distribution (QKD) protocol and has been realized in a 511 km field fiber, the farthest field experiment to date. In practice, however, all decoy-state methods have unavoidable source errors, and the source errors may be non-random, which compromises the security condition of the existing TF-QKD protocols. In this study, we present a general approach for efficiently calculating the SNS protocol's secure key rate with source errors, by establishing the equivalent protocols through virtual attenuation and tagged model. This makes the first result for TF-QKD in practice where source intensity cannot be controlled exactly. Our method can be combined with the two-way classical communication method such as active odd-parity pairing to further improve the key rate. The numerical results show that if the intensity error is within a few percent, the key rate and secure distance only decrease marginally. The key rate of the recent SNS experiment in the 511 km field fiber is still positive using our method presented here, even if there is $\pm 9.5\%$ intensity fluctuation. This shows that the SNS protocol is robust against source errors.

quant-ph↗

arXiv2022

Quantum Approximate Optimization Algorithm with Adaptive Bias Fields

The quantum approximate optimization algorithm (QAOA) transforms a simple many-qubit wavefunction into one which encodes a solution to a difficult classical optimization problem. It does this by optimizing the schedule according to which two unitary operators are alternately applied to the qubits. In this paper, the QAOA is modified by updating the operators themselves to include local fields, using information from the measured wavefunction at the end of one iteration step to improve the operators at later steps. It is shown by numerical simulation on MaxCut problems that, for a fixed accuracy, this procedure decreases the runtime of QAOA very substantially. This improvement appears to increase with the problem size. Our method requires essentially the same number of quantum gates per optimization step as the standard QAOA, and no additional measurements. This modified algorithm enhances the prospects for quantum advantage for certain optimization problems.

quant-ph↗

arXiv2022

Side-channel-free quantum key distribution with practical devices

Based on the idea that there is no side channel in the vacuum state, the side-channel-free quantum key distribution (SCFQKD) protocol was proposed, which is immune to all attacks in the source side-channel space and all attacks in the detectors. In the original SCFQKD protocol, an important assumption is that Alice and Bob can produce the perfect vacuum pulses. But due to the finite extinction ratio of the intensity modulators, the perfect vacuum pulse is impossible in practice. In this paper, we solve this problem and make the quantum key distribution side-channel secure with real source device which does not emit perfect vacuum pulses. Our conclusion only depends on the upper bounds of the intensities of the sources. No other assumptions such as stable sources and stable side channels are needed. The numerical results show that, comparing with the results of SCFQKD protocol with perfect vacuum sources, the key rates and secure distance are only slightly decreased if the upper bound of the intensity of the imperfect vacuum source is less than $10^{-8}$ which can be achieved in experiment by two-stage intensity modulator. We also show that the two-way classical communication can be used to the data post-processing of SCFQKD protocol to improve the key rate. Specially, the active odd-parity pairing method can improve the key rates in all distances by about two times and the secure distance by about 40 km. Give that the side channel security based on imperfect vacuum, this work makes it possible to realize side channel secure QKD with real devices.

quant-ph↗

arXiv2022

Universal approach to sending-or-not-sending twin field quantum key distribution

We present the method of decoy-state analysis after bit-flip error correction and using confidential observed numbers. Taking this tool we then construct a universal approach to sending-or-not-sending (SNS) protocol of twin-field quantum key distribution. In this improved protocol, the code bits are not limited to heralded events in time windows participated by pulses of intensity $μ_z$ and vacuum. All kinds of heralded events can be used for code bits to distill the final keys. The number of intensities (3 or 4) and the kinds of heralded events for code bits are automatically chosen by the key rate optimization itself. Numerical simulation shows that the key rate rises drastically in typical settings, up to 80\% improvement compared with the prior results. Also, larger intensity value can be used for decoy pulses. This makes the protocol more robust in practical experiments.

quant-ph↗

arXiv2022

Quantum Digital Signatures with Random Pairing

Digital signatures can guarantee the unforgeability and transferability of the message. Different from classical digital signatures, whose security depends on computational complexity, quantum digital signatures (QDS) can provide information-theoretic security. We propose a general method of random pairing QDS (RP-QDS), which can drastically improve QDS efficiency. In a way, our random pairing method provide a tightened result of security level of QDS. In the method, the parity value of each pair is used for the outcome bit value. We present general formulas for fraction of untagged bits and error rates of the outcome bits. Random pairing can be applied as a fundamental method to improve the QDS efficiency for all existing quantum key distribution (QKD) protocols. We take sending-or-not-sending (SNS) QDS and side-channel-free (SCF) QDS as examples to demonstrate the advantage of random pairing through numerical simulation. Similar advantage with random pairing is also founded with decoy-state MDIQKD and also decoy-state BB84 protocol. We study the RP-SNS-QDS with finite data size through novel optimization. The numerical simulation results show that the signature rate can be increased by more than 100% under noisy channel using our random pairing method.

quant-ph↗

arXiv2021

Nuclear electric resonance

Nuclear-spin qubits have long coherence time and are desirably applied into quantum information processing. However, the existing methods either fail to address single nucleus (such as nuclear magnetic resonance), or severely affect nuclear coherence time (such as electrical nuclear manipulation based on hyperfine stark effect, ENMHSE). Here we propose an electrical nuclear manipulation called nuclear electric resonance which can on the one hand address the single nuclear qubit, and on the other keep the long coherence time. Applying this, we construct universal quantum gates with external electric field. These universal gates are practicable for arbitrary $S\ge 1$ spin nuclei. Given the much longer coherence time of nuclear electric resonance, we improve the number of single-qubit operations by three orders of magnitude compared with that of ENMHSE.

quant-ph↗

arXiv2021

Quantum key distribution over 658 km fiber with distributed vibration sensing

Twin-field quantum key distribution (TF-QKD) promises ultra-long secure key distribution which surpasses the rate distance limit and can reduce the number of the trusted nodes in long-haul quantum network. Tremendous efforts have been made towards implementation of TF-QKD, among which, the secure key with finite size analysis can distribute more than 500 km in the lab and in the field. Here, we demonstrate the sending-or-not-sending TF-QKD experimentally, achieving a secure key distribution with finite size analysis over 658 km ultra-low-loss optical fiber, improve the secure distance record by around 100 km. Meanwhile, in a TF-QKD system, any phase fluctuation due to temperature variation and ambient variation during the channel must be recorded and compensated, and all these phase information can then be utilized to sense the channel vibration perturbations. With our QKD system, we recovered the external vibrational perturbations on the fiber generated by an artificial vibroseis and successfully located the perturbation position with a resolution better than 1 km. Our results not only set a new distance record of QKD, but also demonstrate that the redundant information of TF-QKD can be used for remote sensing of the channel vibration, which can find applications in earthquake detection and landslide monitoring besides secure communication.

quant-ph↗

arXiv2021

Experimental Side-Channel-Free Quantum Key Distribution

Quantum key distribution can provide unconditionally secure key exchange for remote users in theory. In practice, however, in most quantum key distribution systems, quantum hackers might steal the secure keys by listening to the side channels in the source, such as the photon frequency spectrum, emission time, propagation direction, spatial angular momentum, and so on. It is hard to prevent such kinds of attacks because side channels may exist in any of the encoding space whether the designers take care of or not. Here we report an experimental realization of a side-channel-free quantum key distribution protocol which is not only measurement-device-independent, but also immune to all side-channel attacks in the source. We achieve a secure key rate of 4.80e-7 per pulse through 50 km fiber spools.

quant-ph↗