Quantum generative adversarial networks based on a readout error mitigation method with fault tolerant mechanism

Readout errors caused by measurement noise are a significant source of errors in quantum circuits,which severely affect the output results and are an urgent problem to be solved in noisy-intermediate scale quantum(NISQ)computing.In this paper,we use the bit-flip averaging(BFA)method to mitigate frequent readout errors in quantum generative adversarial networks(QGAN)for image generation,which simplifies the response matrix structure by averaging the qubits for each random bit-flip in advance,successfully solving problems with high cost of measurement for traditional error mitigation methods.Our experiments were simulated in Qiskit using the handwritten digit image recognition dataset under the BFA-based method,the Kullback-Leibler(KL)divergence of the generated images converges to 0.04,0.05,and 0.1 for readout error probabilities of p=0.01,p=0.05,and p=0.1,respectively.Additionally,by evaluating the fidelity of the quantum states representing the images,we observe average fidelity values of 0.97,0.96,and 0.95 for the three readout error probabilities,respectively.These results demonstrate the robustness of the model in mitigating readout errors and provide a highly fault tolerant mechanism for image generation models.

Efficient error estimation in quantum key distribution

In a quantum key distribution（QKD） system, the error rate needs to be estimated for determining the joint probability distribution between legitimate parties, and for improving the performance of key reconciliation. We propose an efficient error estimation scheme for QKD, which is called parity comparison method（PCM）. In the proposed method, the parity of a group of sifted keys is practically analysed to estimate the quantum bit error rate instead of using the traditional key sampling. From the simulation results, the proposed method evidently improves the accuracy and decreases revealed information in most realistic application situations.

Quantum computation and error correction based on continuous variable cluster states

Measurement-based quantum computation with continuous variables,which realizes computation by performing measurement and feedforward of measurement results on a large scale Gaussian cluster state,provides a feasible way to implement quantum computation.Quantum error correction is an essential procedure to protect quantum information in quantum computation and quantum communication.In this review,we briefly introduce the progress of measurement-based quantum computation and quantum error correction with continuous variables based on Gaussian cluster states.We also discuss the challenges in the fault-tolerant measurement-based quantum computation with continuous variables.

Determination of quantum toric error correction code threshold using convolutional neural network decoders

Quantum error correction technology is an important solution to solve the noise interference generated during the operation of quantum computers.In order to find the best syndrome of the stabilizer code in quantum error correction,we need to find a fast and close to the optimal threshold decoder.In this work,we build a convolutional neural network(CNN)decoder to correct errors in the toric code based on the system research of machine learning.We analyze and optimize various conditions that affect CNN,and use the RestNet network architecture to reduce the running time.It is shortened by 30%-40%,and we finally design an optimized algorithm for CNN decoder.In this way,the threshold accuracy of the neural network decoder is made to reach 10.8%,which is closer to the optimal threshold of about 11%.The previous threshold of 8.9%-10.3%has been slightly improved,and there is no need to verify the basic noise.

Error-detected single-photon quantum routing using a quantum dot and a double-sided microcavity system

Based on a hybrid system consisting of a quantum dot coupled with a double-sided micropillar cavity, we investigate the implementation of an error-detected photonic quantum routing controlled by the other photon. The computational errors from unexpected experimental imperfections are heralded by single photon detections, resulting in a unit fidelity for the present scheme, so that this scheme is intrinsically robust. We discuss the performance of the scheme with currently achievable experimental parameters. Our results show that the present scheme is efficient. Furthermore, our scheme could provide a promising building block for quantum networks and distributed quantum information processing in the future.

Effects of systematic phase errors on optimized quantum random-walk search algorithm

This study investigates the effects of systematic errors in phase inversions on the success rate and number of iterations in the optimized quantum random-walk search algorithm. Using the geometric description of this algorithm, a model of the algorithm with phase errors is established, and the relationship between the success rate of the algorithm, the database size, the number of iterations, and the phase error is determined. For a given database size, we obtain both the maximum success rate of the algorithm and the required number of iterations when phase errors are present in the algorithm. Analyses and numerical simulations show that the optimized quantum random-walk search algorithm is more robust against phase errors than Grover＇s algorithm.

Secure deterministic communication in a quantum loss channel using quantum error correction code

The loss of a quantum channel leads to an irretrievable particle loss as well as information. In this paper, the loss of quantum channel is analysed and a method is put forward to recover the particle and information loss effectively using universal quantum error correction. Then a secure direct communication scheme is proposed, such that in a loss channel the information that an eavesdropper can obtain would be limited to arbitrarily small when the code is properly chosen and the correction operation is properly arranged.

Decoy-state reference-frame-independent quantum key distribution with both source errors and statistical fluctuations

Reference-frame-independent quantum key distribution （RFI QKD） can generate secret keys without the alignment of reference frames, which is very robust in real-life implementations of QKD systems. However, the performance of decoy-state RFI QKD with both source errors and statistical fluctuations is still missing until now. In this paper, we investigate the performance of decoy-state RFI QKD in practical scenarios with two kinds of light sources, the heralded single photon source （HSPS） and the weak coherent source （WCS）, and also give clear comparison results of decoy-state RFI QKD with WCS and HSPS. Simulation results show that the secret key rates of decoy-state RFI QKD with WCS are higher than those with HSPS in short distance range, but the secret key rates of RFI QKD with HSPS outperform those with WCS in long distance range.

An overview of quantum error mitigation formulas

Minimizing the effect of noise is essential for quantum computers.The conventional method to protect qubits against noise is through quantum error correction.However,for current quantum hardware in the so-called noisy intermediate-scale quantum(NISQ)era,noise presents in these systems and is too high for error correction to be beneficial.Quantum error mitigation is a set of alternative methods for minimizing errors,including error extrapolation,probabilistic error cancella-tion,measurement error mitigation,subspace expansion,symmetry verification,virtual distillation,etc.The requirement for these methods is usually less demanding than error correction.Quantum error mitigation is a promising way of reduc-ing errors on NISQ quantum computers.This paper gives a comprehensive introduction to quantum error mitigation.The state-of-art error mitigation methods are covered and formulated in a general form,which provides a basis for comparing,combining and optimizing different methods in future work.

Low-overhead fault-tolerant error correction scheme based on quantum stabilizer codes

Fault-tolerant error-correction(FTEC)circuit is the foundation for achieving reliable quantum computation and remote communication.However,designing a fault-tolerant error correction scheme with a solid error-correction ability and low overhead remains a significant challenge.In this paper,a low-overhead fault-tolerant error correction scheme is proposed for quantum communication systems.Firstly,syndrome ancillas are prepared into Bell states to detect errors caused by channel noise.We propose a detection approach that reduces the propagation path of quantum gate fault and reduces the circuit depth by splitting the stabilizer generator into X-type and Z-type.Additionally,a syndrome extraction circuit is equipped with two flag qubits to detect quantum gate faults,which may also introduce errors into the code block during the error detection process.Finally,analytical results are provided to demonstrate the fault-tolerant performance of the proposed FTEC scheme with the lower overhead of the ancillary qubits and circuit depth.

Feedback control and quantum error correction assisted quantum multi-parameter estimation

Quantum metrology provides a fundamental limit on the precision of multi-parameter estimation,called the Heisenberg limit,which has been achieved in noiseless quantum systems.However,for systems subject to noises,it is hard to achieve this limit since noises are inclined to destroy quantum coherence and entanglement.In this paper,a combined control scheme with feedback and quantum error correction(QEC)is proposed to achieve the Heisenberg limit in the presence of spontaneous emission,where the feedback control is used to protect a stabilizer code space containing an optimal probe state and an additional control is applied to eliminate the measurement incompatibility among three parameters.Although an ancilla system is necessary for the preparation of the optimal probe state,our scheme does not require the ancilla system to be noiseless.In addition,the control scheme in this paper has a low-dimensional code space.For the three components of a magnetic field,it can achieve the highest estimation precision with only a 2-dimensional code space,while at least a4-dimensional code space is required in the common optimal error correction protocols.

Quantum Bit Error Avoidance

Qubit errors might be avoided by using the quantum Zeno effect to inhibit evolution.

Quantum Codes Do Not Increase Fidelity against Isotropic Errors

In this article, we study the ability of error-correcting quantum codes to increase the fidelity of quantum states throughout a quantum computation. We analyze arbitrary quantum codes that encode all qubits involved in the computation, and we study the evolution of n-qubit fidelity from the end of one application of the correcting circuit to the end of the next application. We assume that the correcting circuit does not introduce new errors, that it does not increase the execution time (i.e. its application takes zero seconds) and that quantum errors are isotropic. We show that the quantum code increases the fidelity of the states perturbed by quantum errors but that this improvement is not enough to justify the use of quantum codes. Namely, we prove that, taking into account that the time interval between the application of the two corrections is multiplied (at least) by the number of qubits n (due to the coding), the best option is not to use quantum codes, since the fidelity of the uncoded state over a time interval n times smaller is greater than that of the state resulting from the quantum code correction.

Isotropic Double Index for Quantum Errors in One Qubit

This article describes a proposal for a double index to estimate the isotropic components of unitary errors in a quantum computation circuit. In the context of this work the error is considered isotropic if it has spherical symmetry about the state of interest. The theoretical definition is given, as well the numerical approximation for practical purposes. The index is tested in some simple examples and the geometric distortion of the propagated error is studied for an inaccurate Shor 9-qubits correcting code.

Quantum secret sharing based on quantum error-correcting codes

Quantum secret sharing（QSS） is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k- 1, 1, k] quantum error-correcting code （QECC） to implement a quantum （k, 2k-1） threshold scheme. It also takes advantage of classical enhancement of the [2k-1, 1, k] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously. Because information is encoded into QECC, these schemes can prevent intercept-resend attacks and be implemented on some noisy channels.

Toward Constructing a Continuous Logical Operator for Error-Corrected Quantum Sensing

Error correction has long been suggested to extend the sensitivity of quantum sensors into the Heisenberg Limit. However, operations on logical qubits are only performed through universal gate sets consisting of finite-sized gates such as Clifford + T. Although these logical gate sets allow for universal quantum computation, the finite gate sizes present a problem for quantum sensing, since in sensing protocols, such as the Ramsey measurement protocol, the signal must act continuously. The difficulty in constructing a continuous logical op-erator comes from the Eastin-Knill theorem, which prevents a continuous sig-nal from being both fault-tolerant to local errors and transverse. Since error correction is needed to approach the Heisenberg Limit in a noisy environment, it is important to explore how to construct fault-tolerant continuous operators. In this paper, a protocol to design continuous logical z-rotations is proposed and applied to the Steane Code. The fault tolerance of the designed operator is investigated using the Knill-Laflamme conditions. The Knill-Laflamme condi-tions indicate that the diagonal unitary operator constructed cannot be fault tolerant solely due to the possibilities of X errors on the middle qubit. The ap-proach demonstrated throughout this paper may, however, find success in codes with more qubits such as the Shor code, distance 3 surface code, [15, 1, 3] code, or codes with a larger distance such as the [11, 1, 5] code.

Quantum search for unknown number of target items by hybridizing fixed-point method with 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 and 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/λ01/2)rather than O(1/λ1/2), 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 a new idea for the research on fixed-point and trial-and-error quantum search.

Eavesdropping on Quantum Secure Direct Communication with W State in Noisy Channel

Security of the quantum secure direct communication protocol （i.e., the C-S QSDC protocol） recently proposed by Cao and Song [Chin. Phys. Lett. 23 （2006） 290] is analyzed in the case of considerable quantum channel noise. The eavesdropping scheme is presented, which reveals that the C-S QSDC protocol is not secure if the quantum bit error rate （QBER） caused by quantum channel noise is higher than 4.17%. Our eavesdropping scheme induces about 4.17% QBER for those check qubits. However, such QBER can be hidden in the counterpart induced by the noisy quantum channel if the eavesdropper Eve replaces the original noisy channel by an ideal one. Furthermore, if the QBER induced by quantum channel noise is lower than 4.17%, then in the eavesdropping scheme Eve still can eavesdrop part of the secret messages by safely attacking a fraction of the transmitted qubits. Finally, an improvement on the C-S QSDC protocol is put forward.