Searcharxiv⌕ Search

arXiv subjects

Zhi Ma

Publications and source records attributed to Zhi Ma.

At least 37 records · Page 2Linked to original sources

Applying hybrid clustering in pulsar candidate sifting with multi-modality for FAST survey

Pulsar search is always the basis of pulsar navigation, gravitational wave detection and other research topics. Currently, the volume of pulsar candidates collected by Five-hundred-meter Aperture Spherical radio Telescope (FAST) shows an explosive growth rate that has brought challenges for its pulsar candidate filtering System. Particularly, the multi-view heterogeneous data and class imbalance between true pulsars and non-pulsar candidates have negative effects on traditional single-modal supervised classification methods. In this study, a multi-modal and semi-supervised learning based pulsar candidate sifting algorithm is presented, which adopts a hybrid ensemble clustering scheme of density-based and partition-based methods combined with a feature-level fusion strategy for input data and a data partition strategy for parallelization. Experiments on both HTRU (The High Time Resolution Universe Survey) 2 and FAST actual observation data demonstrate that the proposed algorithm could excellently identify the pulsars: On HTRU2, the precision and recall rates of its parallel mode reach 0.981 and 0.988. On FAST data, those of its parallel mode reach 0.891 and 0.961, meanwhile, the running time also significantly decrease with the increment of parallel nodes within limits. So, we can get the conclusion that our algorithm could be a feasible idea for large scale pulsar candidate sifting of FAST drift scan observation.

astro-ph.IM↗

On Euclidean, Hermitian and symplectic quasi-cyclic complementary dual codes

Linear complementary dual codes (LCD) intersect trivially with their dual. In this paper, we develop a new characterization for LCD codes, which allows us to judge the complementary duality of linear codes from the codeword level. Further, we determine the sufficient and necessary conditions for one-generator quasi-cyclic codes to be LCD codes involving Euclidean, Hermitian, and symplectic inner products. Finally, we constructed many Euclidean, Hermitian and symmetric LCD codes with excellent parameters, some improving the results in the literature. Remarkably, we construct a symplectic LCD $[28,6]_2$ code with symplectic distance $10$, which corresponds to an trace Hermitian additive complementary dual $(14,3,10)_4$ code that outperforms the optimal quaternary Hermitian LCD $[14,3,9]_4$ code.

cs.IT↗

Some quaternary additive codes outperform linear counterparts

The additive codes may have better parameters than linear codes. However, it is still a challenging problem to efficiently construct additive codes that outperform linear codes, especially those with greater distances than linear codes of the same lengths and dimensions. This paper focuses on constructing additive codes that outperform linear codes based on quasi-cyclic codes and combinatorial methods. Firstly, we propose a lower bound on the symplectic distance of 1-generator quasi-cyclic codes of index even. Secondly, we get many binary quasi-cyclic codes with large symplectic distances utilizing computer-supported combination and search methods, all of which correspond to good quaternary additive codes. Notably, some additive codes have greater distances than best-known quaternary linear codes in Grassl's code table (bounds on the minimum distance of quaternary linear codes http://www.codetables.de) for the same lengths and dimensions. Moreover, employing a combinatorial approach, we partially determine the parameters of optimal quaternary additive 3.5-dimensional codes with lengths from $28$ to $254$. Finally, as an extension, we also construct some good additive complementary dual codes with larger distances than the best-known quaternary linear complementary dual codes in the literature.

cs.IT↗

Factoring integers with sublinear resources on a superconducting quantum processor

Shor's algorithm has seriously challenged information security based on public key cryptosystems. However, to break the widely used RSA-2048 scheme, one needs millions of physical qubits, which is far beyond current technical capabilities. Here, we report a universal quantum algorithm for integer factorization by combining the classical lattice reduction with a quantum approximate optimization algorithm (QAOA). The number of qubits required is O(logN/loglog N), which is sublinear in the bit length of the integer $N$, making it the most qubit-saving factorization algorithm to date. We demonstrate the algorithm experimentally by factoring integers up to 48 bits with 10 superconducting qubits, the largest integer factored on a quantum device. We estimate that a quantum circuit with 372 physical qubits and a depth of thousands is necessary to challenge RSA-2048 using our algorithm. Our study shows great promise in expediting the application of current noisy quantum computers, and paves the way to factor large integers of realistic cryptographic significance.

quant-ph↗

Novel magnetic and ferroelectric behaviors observed in alpha Fe2O3 particles

Alpha Fe2O3 powders have been prepared by the reduction reaction method with NaHB4 as reducing agent and followed a conventional sintering process. The XRD pattern with Rietveld refinement profile reveal that the prepared Fe2O3 with corundum structure (hematite). VSM loop exhibits obvious room-temperature weak ferromagnetism, a pinched hysteresis loop may introduced by the shape anisotropy effect. The simultaneous ferroelectric behavior of α-Fe2O3 with "five-fold" ferroelectric hysteresis loops approves that this structured Fe2O3 can be known as a novel multiferroic material.

cond-mat.mtrl-sci↗

Two New Families of Quantum Synchronizable Codes

In this paper, we present two new ways of quantum synchronization coding based on the $(\bm{u}+\bm{v}|\bm{u}-\bm{v})$ construction and the product construction respectively, and greatly enrich the varieties of available quantum synchronizable codes. The circumstances where the maximum synchronization error tolerance can be reached are explained for both constructions. Furthermore, repeated-root cyclic codes derived from the $(\bm{u}+\bm{v}|\bm{u}-\bm{v})$ construction are shown to be able to provide better Pauli error-correcting capability than BCH codes.

quant-ph↗

Anisotropy engineering edge magnetism in zigzag honeycomb nanoribbons

It have been demonstrated that the zigzag honeycomb nanoribbons exhibit an intriguing edge magnetism. Here the effect of the anisotropy on the edge magnetism in zigzag honeycomb nanoribbons is investigated by using two kinds of large-scale quantum Monte Carlo simulations. The anisotropy in zigzag honeycomb nanoribbons is characterized by the ratios of nearest-neighboring hopping integrals $t_{1}$ in one direction and $t_{2}$ in another direction. Considering the electron-electron correlation, it is shown that the edge ferromagnetism could be enhanced greatly as $t_{2}/|t_{1}|$ increase from $1$ to $3$, which not only presenting the avenue for the control of this magnetism, but also being useful for exploring further novel magnetism in new nano-scale materials.

cond-mat.str-el↗

Bioadhesive Graft-Antenna for Stimulation and Repair of Peripheral Nerves

Peripheral nerve injuries are difficult to treat due to limited axon regeneration; brief electrical stimulation of injured nerves is an emerging therapy that can relieve pain and enhance regeneration. We report an original wireless stimulator based on a metal loop (diameter ~1 mm) that is powered by a transcranial magnetic stimulator (TMS). The loop can be integrated in a chitosan scaffold that functions as a graft when applied onto transected nerves (graft-antenna). The graft-antenna was bonded to rat sciatic nerves by a laser without sutures; it did not migrate after implantation and was able to trigger steady compound muscle action potentials for 12 weeks (CMAP ~1.3 mV). Eight weeks post-operatively, axon regeneration was facilitated in transected nerves that were repaired with the graft-antenna and stimulated by the TMS for 1 hour/week. The graft-antenna is an innovative and minimally-invasive device that functions concurrently as a wireless stimulator and adhesive scaffold for nerve repair.

physics.med-ph↗

Strong light illumination on gain-switched semiconductor lasers helps the eavesdropper in practical quantum key distribution systems

The temperature of the semiconductor diode increases under strong light illumination whether thermoelectric cooler is installed or not, which changes the output wavelength of the laser (Lee M. S. et al., 2017). However, other characteristics also vary as temperature increases. These variations may help the eavesdropper in practical quantum key distribution systems. We study the effects of temperature increase on gain-switched semiconductor lasers by simulating temperature dependent rate equations. The results show that temperature increase may cause large intensity fluctuation, decrease the output intensity and lead the signal state and decoy state distinguishable. We also propose a modified photon number splitting attack by exploiting the effects of temperature increase. Countermeasures are also proposed.

quant-ph↗

Fair Efficiency Comparisons of Decoy-state Quantum Key Distribution Protocols

Secure key rate of decoy-state quantum key distribution protocols has been improved with biased basis choice, however, the security standards and parameters of current protocols are different. As a result, we cannot give an accurate key rate comparison between different kinds of protocols. Taking the schemes based on different formula of secure key rate as examples, we give a fair comparison between typical protocols under universal composable security standard. Through analyzing the relationship of security parameters in post-processing stage and final secure key, we achieve the unified quantification between protocols based on Gottesman-Lo-Lutkenhaus-Preskill formula and the ones under universal composable security. Based on the above research, the impact of different sending length and secure parameters on secure key rate is investigated, meanwhile, we give the dependent relationship between secure key rate and sending length under different secure parameters. Besides, we analyze the importance and conditions of fair comparison. For the first time we give a fair comparison between the protocols based on GLLP formula and smooth entropy, and taking Raymond protocol and Toshiba protocol as examples, we analyze the way for improving secure key rate in the light intensity choice and the single bit error rate estimation method.

quant-ph↗

Quantum man-in-the-middle attack on the calibration process of quantum key distribution

Quantum key distribution (QKD) protocol has been proved to provide unconditionally secure key between two remote legitimate users in theory. Key distribution signals are transmitted in a quantum channel which is established by the calibration process to meet the requirement of high count rate and low error rate. All QKD security proofs implicitly assume that the quantum channel has been established securely. However, the eavesdropper may attack the calibration process to break the security assumption of QKD and provide precondition to steal information about the final key successfully. Inspired by N. Jain et al., Phys. Rev. Lett.107,110501(2011), we reveal the security risk of the calibration process of a passive-basis-choice BB84 QKD system by launching a quantum man-in-the-middle attack which intercepts all calibration signals and resends faked ones. Large temporal bit-dependent or basis-dependent detector efficiency mismatch can be induced. Then we propose a basis-dependent detector efficiency mismatch (BEM) based faked states attack on a single photon BB84 QKD to stress the threat of BEM. Moreover, the security of single photon QKD systems with BEM is studied simply and intuitively. Two effective countermeasures are suggested to remove the general security risk of the calibration process.

quant-ph↗

Modeling of hysteresis loop and its applications in ferroelectric materials

In order to understand the physical hysteresis loops clearly, we constructed a novel model, which is combined with the electric field, the temperature, and the stress as one synthetically parameter. This model revealed the shape of hysteresis loop was determined by few variables in ferroelectric materials: the saturation of polarization, the coercive field, the electric susceptibility and the equivalent field. Comparison with experimental results revealed the model can retrace polarization versus electric field and temperature. As a applications of this model, the calculate formula of energy storage efficiency, the electrocaloric effect, and the P(E,T) function have also been included in this article.

cond-mat.mtrl-sci↗

Quantum Generic Attacks on Feistel Schemes

The Feistel scheme is an important structure in the block ciphers. The security of the Feistel scheme is related to distinguishability with a random permutation. In this paper, efficient quantum algorithms for distinguishing classical 3,4-round and unbalanced Feistel scheme with contracting functions from random permutation are proposed. Our algorithms realize an exponential speed-up over classical algorithms for these problems. Furthermore, the method presented in this paper can also be used to consider unbalanced Feistel schemes with expanding functions.

quant-ph↗

Mathematical modeling of hysteresis loops in ferroelectric materials

In published papers, the Gibbs free energy of ferroelectric materials has usually been quantified by the retention of 6th or 8th order polarization terms. In this paper, a newly analytical model of Gibbs free energy, thereout, a new model of polarization-electric field hysteresis loops in ferroelectric materials has been derived mathematically. As a model validation, four patterns of polarization-electric field hysteresis loops of ferroelectric materials have been depicted by using the model. The calculated results indicated that the self-similar model can characterize the various patterns of hysteresis loops in ferroelectric materials through adjusting the external excitation or the synthetically parameter (e.g., electric, temperature, and stress, etc.) employed in the model.

cond-mat.mtrl-sci↗

Universally-composable finite-key analysis for efficient four-intensity decoy-state quantum key distribution

We propose an efficient four-intensity decoy-state BB84 protocol and derive concise security bounds for this protocol with the universally composable finite-key analysis method. Comparing with the efficient three-intensity protocol, we find that our efficient four-intensity protocol can increase the secret key rate by at least $30\%$. Particularly, this increasing rate of secret key rate will be raised as the transmission distance increases. At a large transmission distance, our efficient four-intensity protocol can improve the performance of quantum key distribution profoundly.

quant-ph↗

Stringent Statistical Fluctuation Analysis for Quantum Key Distribution Considering After-pulse Contributions

Statistical fluctuation problems are faced by all quantum key distribution (QKD) protocols under finite-key condition. Most of the current statistical fluctuation analysis methods work based on independent random samples, however, the precondition cannot be always satisfied on account of different choice of samples and actual parameters. As a result, proper statistical fluctuation methods are required to figure out this problem. Taking the after-pulse contributions into consideration, we give the expression of secure key rate and the mathematical model for statistical fluctuations, focusing on a decoy-state QKD protocol (Sci Rep. 3, 2453, 2013) with biased basis choice. On this basis, a classified analysis of statistical fluctuation is represented according to the mutual relationship between random samples. First for independent identical relations, we make a deviation comparison between law of large numbers and standard error analysis. Secondly, we give a sufficient condition that Chernoff bound achieves a better result than Hoeffding's inequality based on independent relations only. Thirdly, by constructing the proper martingale, for the first time we represent a stringent way to deal with statistical fluctuation issues upon dependent ones through making use of Azuma's inequality. In numerical optimization, we show the impact on secure key rate, the ones and respective deviations under various kinds of statistical fluctuation analyses.

quant-ph↗

A global estimation of the lower bound of the privacy amplification term for decoy-state quantum key distribution

The privacy amplification term, of which the lower bound needs to be estimated with the decoy-state method, plays a positive role in the secure key rate formula for decoy-state quantum key distribution. In previous work, the yield and the bit error rate of single-photon state are estimated separately to gain this lower bound. In this work, we for the first time take the privacy amplification term as a whole to consider this lower bound. The mathematical description for the correlation between the yield and the bit error rate of single-photon state is given with just two unknown variables. Based on this, we obtain the global estimation of this lower bound for both BB84 protocol and measurement-device-independent protocol. The results of numerical simulation show that the global estimation can significantly improve the performance of quantum key distribution.

quant-ph↗