Searcharxiv⌕ Search

arXiv subjects

Li Xiao

Publications and source records attributed to Li Xiao.

At least 109 records · Page 6Linked to original sources
arXiv2016

Towards Robustness in Residue Number Systems

The problem of robustly reconstructing a large number from its erroneous remainders with respect to several moduli, namely the robust remaindering problem, may occur in many applications including phase unwrapping, frequency detection from several undersampled waveforms, wireless sensor networks, etc. Assuming that the dynamic range of the large number is the maximal possible one, i.e., the least common multiple (lcm) of all the moduli, a method called robust Chinese remainder theorem (CRT) for solving the robust remaindering problem has been recently proposed. In this paper, by relaxing the assumption that the dynamic range is fixed to be the lcm of all the moduli, a trade-off between the dynamic range and the robustness bound for two-modular systems is studied. It basically says that a decrease in the dynamic range may lead to an increase of the robustness bound. We first obtain a general condition on the remainder errors and derive the exact dynamic range with a closed-form formula for the robustness to hold. We then propose simple closed-form reconstruction algorithms. Furthermore, the newly obtained two-modular results are applied to the robust reconstruction for multi-modular systems and generalized to real numbers. Finally, some simulations are carried out to verify our proposed theoretical results.

cs.IT↗
arXiv2014

Error Correction in Polynomial Remainder Codes with Non-Pairwise Coprime Moduli and Robust Chinese Remainder Theorem for Polynomials

This paper investigates polynomial remainder codes with non-pairwise coprime moduli. We first consider a robust reconstruction problem for polynomials from erroneous residues when the degrees of all residue errors are assumed small, namely robust Chinese Remainder Theorem (CRT) for polynomials. It basically says that a polynomial can be reconstructed from erroneous residues such that the degree of the reconstruction error is upper bounded by $τ$ whenever the degrees of all residue errors are upper bounded by $τ$, where a sufficient condition for $τ$ and a reconstruction algorithm are obtained. By releasing the constraint that all residue errors have small degrees, another robust reconstruction is then presented when there are multiple unrestricted errors and an arbitrary number of errors with small degrees in the residues. By making full use of redundancy in moduli, we obtain a stronger residue error correction capability in the sense that apart from the number of errors that can be corrected in the previous existing result, some errors with small degrees can be also corrected in the residues. With this newly obtained result, improvements in uncorrected error probability and burst error correction capability in a data transmission are illustrated.

cs.IT↗
arXiv2014

Experimental Heat-Bath Cooling of Spins

Algorithmic cooling (AC) is a method to purify quantum systems, such as ensembles of nuclear spins, or cold atoms in an optical lattice. When applied to spins, AC produces ensembles of highly polarized spins, which enhance the signal strength in nuclear magnetic resonance (NMR). According to this cooling approach, spin-half nuclei in a constant magnetic field are considered as bits, or more precisely, quantum bits, in a known probability distribution. Algorithmic steps on these bits are then translated into specially designed NMR pulse sequences using common NMR quantum computation tools. The $algorithmic$ cooling of spins is achieved by alternately combining reversible, entropy-preserving manipulations (borrowed from data compression algorithms) with $selective$ $reset$, the transfer of entropy from selected spins to the environment. In theory, applying algorithmic cooling to sufficiently large spin systems may produce polarizations far beyond the limits due to conservation of Shannon entropy. Here, only selective reset steps are performed, hence we prefer to call this process "heat-bath" cooling, rather than algorithmic cooling. We experimentally implement here two consecutive steps of selective reset that transfer entropy from two selected spins to the environment. We performed such cooling experiments with commercially-available labeled molecules, on standard liquid-state NMR spectrometers. Our experiments yielded polarizations that $bypass$ $Shannon's$ $entropy$-$conservation$ $bound$, so that the entire spin-system was cooled. This paper was initially submitted in 2005, first to Science and then to PNAS, and includes additional results from subsequent years (e.g. for resubmission in 2007). The Postscriptum includes more details.

quant-ph↗
arXiv2014

Design and performance of LLRF system for CSNS/RCS

The rapid cycling synchrotron (RCS) is part of China Spallation Neutron Source (CSNS). The RCS provides 1.6GeV protons with a repetition rate of 25Hz. The RF system in RCS is mainly composed of a ferrite loaded RF cavity, a high power tetrode amplifier, a bias supply of 3300A and a digital low level RF (LLRF) system based on FPGA. The major challenge of the LLRF system is to solve problems caused by rapid frequency sweeping and heavy beam loading effect. This paper will present the design and structure of the LLRF system, and show results of performance tests.

physics.acc-ph↗
arXiv2013

Multi-Stage Robust Chinese Remainder Theorem

It is well-known that the traditional Chinese remainder theorem (CRT) is not robust in the sense that a small error in a remainder may cause a large error in the reconstruction solution. A robust CRT was recently proposed for a special case when the greatest common divisor (gcd) of all the moduli is more than 1 and the remaining integers factorized by the gcd of all the moduli are co-prime. In this special case, a closed-form reconstruction from erroneous remainders was proposed and a necessary and sufficient condition on the remainder errors was obtained. It basically says that the reconstruction error is upper bounded by the remainder error level $τ$ if $τ$ is smaller than a quarter of the gcd of all the moduli. In this paper, we consider the robust reconstruction problem for a general set of moduli. We first present a necessary and sufficient condition for the remainder errors for a robust reconstruction from erroneous remainders with a general set of muduli and also a corresponding robust reconstruction method. This can be thought of as a single stage robust CRT. We then propose a two-stage robust CRT by grouping the moduli into several groups as follows. First, the single stage robust CRT is applied to each group. Then, with these robust reconstructions from all the groups, the single stage robust CRT is applied again across the groups. This is then easily generalized to multi-stage robust CRT. Interestingly, with this two-stage robust CRT, the robust reconstruction holds even when the remainder error level $τ$ is above the quarter of the gcd of all the moduli. In this paper, we also propose an algorithm on how to group a set of moduli for a better reconstruction robustness of the two-stage robust CRT in some special cases.

cs.IT↗
arXiv2012

Transitivity of Varietal Hypercube Networks

The varietal hypercube $VQ_n$ is a variant of the hypercube $Q_n$ and has better properties than $Q_n$ with the same number of edges and vertices. This paper proves that $VQ_n$ is vertex-transitive. This property shows that when $VQ_n$ is used to model an interconnection network, it is high symmetrical and obviously superior to other variants of the hypercube such as the crossed cube.

math.CO↗
arXiv2012

Non-relativistic quantum theory at finite temperature

We propose the non-relativistic finite temperature quantum wave equations for a single particle and multiple particles. We give the relation between energy eigenvalues, eigenfunctions, transition frequency and temperature, and obtain some results: (1) when the degeneracies of two energy levels are same, the transition frequency between the two energy levels is unchanged when the temperature is changed. (2) When the degeneracies of two energy levels are different, the variance of transition frequency at two energy levels is direct proportion to temperature difference.

quant-ph↗
arXiv2012

Light field distribution of general function photonic crystals

In this paper, We have presented a new general function photonic crystals (GFPCs), which refractive indexes are line functions of space position in two mediums $A$ and $B$, and obtain new results: (1) when the line function of refractive indexes is up or down, the transmissivity can be far larger or smaller than 1. (2) when the refractive indexes function increase or decrease along the direction of incident light, the light intensity should be magnified or weaken, which can be made optical magnifier or attenuator. (3) The GFPCs can be made optical diode when the light positive and negative incident the GFPCs.

physics.optics↗
arXiv2012

Cycles and Paths Embedded in Varietal Hypercubes

The varietal hypercube $VQ_n$ is a variant of the hypercube $Q_n$ and has better properties than $Q_n$ with the same number of edges and vertices. This paper shows that every edge of $VQ_n$ is contained in cycles of every length from 4 to $2^n$ except 5, and every pair of vertices with distance $d$ is connected by paths of every length from $d$ to $2^n-1$ except 2 and 4 if $d=1$.

math.CO↗
arXiv2006

NMR analogues of the quantum Zeno effect

We describe Nuclear Magnetic Resonance (NMR) demonstrations of the quantum Zeno effect, and discuss briefly how these are related to similar phenomena in more conventional NMR experiments.

quant-ph↗
arXiv2006

Quantum Information Processing with Delocalized Qubits under Global Control

Any technology for quantum information processing (QIP) must embody within it quantum bits (qubits) and maintain control of their key quantum properties of superposition and entanglement. Typical QIP schemes envisage an array of physical systems, such as electrons or nuclei, with each system representing a given qubit. For adequate control, systems must be distinguishable either by physical separation or unique frequencies, and their mutual interactions must be individually manipulable. These difficult requirements exclude many nanoscale technologies where systems are densely packed and continuously interacting. Here we demonstrate a new paradigm: restricting ourselves to global control pulses we permit systems to interact freely and continuously, with the consequence that qubits can become delocalized over the entire device. We realize this using NMR studies of three carbon-13 nuclei in alanine, demonstrating all the key aspects including a quantum mirror, one- and two-qubit gates, permutation of densely packed qubits and Deutsch algorithms.

quant-ph↗
arXiv2006

Robust Logic Gates and Realistic Quantum Computation

The composite rotation approach has been used to develop a range of robust quantum logic gates, including single qubit gates and two qubit gates, which are resistant to systematic errors in their implementation. Single qubit gates based on the BB1 family of composite rotations have been experimentally demonstrated in a variety of systems, but little study has been made of their application in extended computations, and there has been no experimental study of the corresponding robust two qubit gates to date. Here we describe an application of robust gates to Nuclear Magnetic Resonance (NMR) studies of approximate quantum counting. We find that the BB1 family of robust gates is indeed useful, but that the related NB1, PB1, B4 and P4 families of tailored logic gates are less useful than initially expected.

quant-ph↗
arXiv2005

Experimental Heat-Bath Cooling of Spins

Algorithmic cooling is a novel technique to generate ensembles of highly polarized spins, which could significantly improve the signal strength in Nuclear Magnetic Resonance (NMR) spectroscopy. It combines reversible (entropy-preserving) manipulations and irreversible controlled interactions with the environment, using simple quantum computing techniques to increase spin polarization far beyond the Shannon entropy-conservation bound. Notably, thermalization is beneficially employed as an integral part of the cooling scheme, contrary to its ordinary destructive implications. We report the first cooling experiments bypassing Shannon's entropy-conservation bound, performed on a standard liquid-state NMR spectrometer. We believe that this experimental success could pave the way for the first near-future application of quantum computing devices.

quant-ph↗
arXiv2005

Error tolerance in an NMR Implementation of Grover's Fixed-Point Quantum Search Algorithm

We describe an implementation of Grover's fixed-point quantum search algorithm on a nuclear magnetic resonance (NMR) quantum computer, searching for either one or two matching items in an unsorted database of four items. In this new algorithm the target state (an equally weighted superposition of the matching states) is a fixed point of the recursive search operator, and so the algorithm always moves towards the desired state. The effects of systematic errors in the implementation are briefly explored.

quant-ph↗
arXiv2004

Efficient Multi-Party Quantum Secret Sharing Schemes

In this work, we generalize the quantum secret sharing scheme of Hillary, Bužek and Berthiaume[Phys. Rev. A59, 1829(1999)] into arbitrary multi-parties. Explicit expressions for the shared secret bit is given. It is shown that in the Hillery-Bužek-Berthiaume quantum secret sharing scheme the secret information is shared in the parity of binary strings formed by the measured outcomes of the participants. In addition, we have increased the efficiency of the quantum secret sharing scheme by generalizing two techniques from quantum key distribution. The favored-measuring-basis Quantum secret sharing scheme is developed from the Lo-Chau-Ardehali technique[H. K. Lo, H. F. Chau and M. Ardehali, quant-ph/0011056] where all the participants choose their measuring-basis asymmetrically, and the measuring-basis-encrypted Quantum secret sharing scheme is developed from the Hwang-Koh-Han technique [W. Y. Hwang, I. G. Koh and Y. D. Han, Phys. Lett. A244, 489 (1998)] where all participants choose their measuring-basis according to a control key. Both schemes are asymptotically 100% in efficiency, hence nearly all the GHZ-states in a quantum secret sharing process are used to generate shared secret information.

quant-ph↗
arXiv2003

Parallel Quantum Computing in a Single Ensemble Quantum Computer

We propose a parallel quantum computing mode for ensemble quantum computer. In this mode, some qubits can be in pure states while other qubits in mixed states. It enables a single ensemble quantum computer to perform $"$single-instruction-multi-data" type of parallel computation. In Grover's algorithm and Shor's algorithm, parallel quantum computing can provide additional speedup. In addition, it also makes a fuller use of qubit resources in an ensemble quantum computer. As a result, some qubits discarded in the preparation of an effective pure state in the Schulman-Varizani, and the Cleve-DiVincenzo algorithms can be re-utilized.

quant-ph↗
arXiv2002

Experimental Realization of Brüschweiler's exponentially fast search algorithm in a homo-nuclear system

Compared with classical search algorithms, Grover quantum algorithm [ Phys. Rev. Lett., 79, 325(1997)] achieves quadratic speedup and Bruschweiler hybrid quantum algorithm [Phys. Rev. Lett., 85, 4815(2000)] achieves an exponential speedup. In this paper, we report the experimental realization of the Bruschweiler$ algorithm in a 3-qubit NMR ensemble system. The pulse sequences are used for the algorithms and the measurement method used here is improved on that used by Bruschweiler, namely, instead of quantitatively measuring the spin projection of the ancilla bit, we utilize the shape of the ancilla bit spectrum. By simply judging the downwardness or upwardness of the corresponding peaks in an ancilla bit spectrum, the bit value of the marked state can be read out, especially, the geometric nature of this read-out can make the results more robust against errors.

quant-ph↗