The exhaustive search for optimum minimum peak sidelobe binary sequences

The problem of designing binary sequences with the minimum sidelobe level of the aperiodic autocorrelation function is considered. The results from searching for the optimum minimum peak sidelobe binary sequences in the range of lengths N = [83;84] are presented. Examples of binary sequences with sidelobe level PSL = 5 having the higher value of the MF coefficient are presented for lengths N = [83;88].     

The theory of the quantum kernel-based binary classifier

Binary classification is a fundamental problem in machine learning. Recent development of quantum similarity-based binary classifiers and kernel method that exploit quantum interference and feature quantum Hilbert space opened up tremendous opportunities for quantum-enhanced machine learning. To lay the fundamental ground for its further advancement, this work extends the general theory of quantum kernel-based classifiers. Existing quantum kernel-based classifiers are compared and the connection among them is analyzed. Focusing on the squared overlap between quantum states as a similarity measure, the essential and minimal ingredients for the quantum binary classification are examined. The classifier is also extended concerning various aspects, such as data type, measurement, and ensemble learning. The validity of the Hilbert-Schmidt inner product, which becomes the squared overlap for pure states, as a positive definite and symmetric kernel is explicitly shown, thereby connecting the quantum binary classifier and kernel methods.     

Binary tree approach to scaling in unimodal maps

Ge, Rusjan, and Zweifel introduced a binary tree which represents all the periodic windows in the chaotic regime of iterated one-dimensional unimodal maps. We consider the scaling behavior in a modified tree which takes into account the self-similarity of the window structure. A nonuniversal geometric convergence of the associated superstable parameter values towards a Misiurewicz point is observed for almost all binary sequences with periodic tails. For these sequences the window period grows arithmetically down the binary tree. There are an infinite number of exceptional sequences, however, for which the growth of the window period is faster. Numerical studies with a quadratic maximum suggest more rapid than geometric scaling of the superstable parameter values for such sequences.     

A specialized fast cross-correlation for acoustical measurements using coded sequences

In acoustics applications, binary maximal-length sequences and related sequences are increasingly used for acoustics system identification tasks. A number of coded sequences, such as binary maximal-length related sequences and ternary sequences possess two-valued or pulselike autocorrelation functions. It is this correlation property that is exploited in most of acoustical applications. However, the length of some of these sequences is not directly suitable for FFT-based cross-correlation algorithms. This paper explores using standard FFTs to calculate the cross-correlation between two periodic finite-length sequences of equal length, where the lengths of the sequences are not a power of 2. We apply our specialized correlation algorithm to analyze data collected in a room-acoustic environment to simultaneously obtain impulse responses between multiple sources and multiple receivers.     

Quantum Circuit Optimization for Solving Discrete Logarithm of Binary Elliptic Curves Obeying the Nearest-Neighbor Constrained

In this paper, we consider the optimization of the quantum circuit for discrete logarithm of binary elliptic curves under a constrained connectivity, focusing on the resource expenditure and the optimal design for quantum operations such as the addition, binary shift, multiplication, squaring, inversion, and division included in the point addition on binary elliptic curves. Based on the space-efficient quantum Karatsuba multiplication, the number of CNOTs in the circuits of inversion and division has been reduced with the help of the Steiner tree problem reduction. The optimized size of the CNOTs is related to the minimum degree of the connected graph.     

Brǖschweiler量子搜索算法的改进及其实验实现

量子计算与经典计算相比 ,能够极大地提高运算速度 ,解决一些经典计算不能解决或很难解决的问题 .对于在无序数据库中进行搜索这类问题 ,可以用量子算法 ,如Br櫣ｓｃｈｗｅｉｌｅｒ量子搜索算法来解决 .与经典算法相比 ,Br櫣ｓｃｈｗｅｉｌｅｒ量子算法能够指数次地提高搜索速度 .在Br櫣ｓｃｈｗｅｉｌｅｒ提出的算法中 ,数据量子位和观测量子位 (辅助量子位 )是分开的 ,属于不同的量子位 .通过研究 ,对Br櫣ｓｃｈｗｅｉｌｅｒ算法作了改进 ,使之不需要用辅助量子位 ,就可以达到指数次提高搜索速度的目的 .改进后的Br櫣ｓｃｈｗｅｉｌｅｒ量子算法有利于简化实验的设计和实现过程 .同时还利用核磁共振实验 ,演示了改进后的Br櫣ｓｃｈｗｅｉｌｅｒ量子算法的实现. In recent years, quantum computing research has made big progress, which exploit quantum mechanical laws, such as interference, superposition and parallelism, to perform computing tasks. The most inducing thing is that the quantum computing can provide large rise to the speedup in quantum algorithm. Quantum computing can solve some problems, which are impossible or difficult for the classical computing. The problem of searching for a specific item in an unsorted database can be...     

量子算法的NMR实现方法

量子计算机是一种以量子耦合方式进行信息处理的装置[1 ] 。原则上 ,它能利用量子相干干涉方法以比传统计算机更快的速度进行诸如大数的因式分解、未排序数据库中的数据搜索等工作[2 ] 。建造大型量子计算机的主要困难是噪音、去耦和制造工艺。一方面 ,虽然离子陷阱和光学腔实验方法大有希望 ,但这些方法都还没有成功实现过量子计算。另一方面 ,因为隔离于自然环境 ,核自旋可以成为很好的“量子比特” ,可能以非传统方式使用核磁共振 (NMR)技术实现量子计算。本文介绍一种用NMR方法实现量子计算的方法 ,该方法能够用比传统方法少的步骤解决一个纯数学问题。基于该方法的简单量子计算机使用比传统计算机使用更少的函数“调用”判断一未知函数的类别。     

Quantum watermarking based on threshold segmentation using quantum informational entropy

We propose a new quantum watermarking scheme based on threshold selection using informational entropy of quantum image. The core idea of this scheme is to embed information into object and background of cover image in different ways. First, a threshold method adopting the quantum informational entropy is employed to determine a threshold value. The threshold value can then be further used for segmenting the cover image to a binary image, which is an authentication key for embedding and extraction information. By a careful analysis of the quantum circuits of the scheme, that is, translating into the basic gate sequences which show the low complexity of the scheme. One of the simulation-based experimental results is entropy difference which measures the similarity of two images by calculating the difference in quantum image informational entropy between watermarked image and cover image. Furthermore, the analyses of peak signal-to-noise ratio, histogram and capacity of the scheme are also provided.     

Grover量子搜索算法及改进

简单地介绍了量子搜索算法中的相位匹配条件、 改进的成功率为100%的量子搜索算法和量子搜索算法中的主要误差等. We briefly introduced some of our recent work related to the phase matching condition in quantum searching algorithms and the improved Grover algorithm. When one replaces the two phase inversions in the Grover algorithm with arbitrary phase rotations, the modified algorithm usually fails in searching the marked state unless a phase matching condition is satisfied between the two phases. The Grover algorithm is not 100% in success rate, an improved Grover algorithm with zero failure rate is given by replacing the phase inversions with angles that depends on the size of the database. Other aspects of the Grover algorithm such as the SO(3) picture of quantum searching, the dominant gate imperfections in the Grover algorithm are also mentioned.     

A mathematical characterization of the physical structure of observers

It is proposed that the physical structure of an observer in quantum mechanics is constituted by a pattern of elementary localized switching events. A key preliminary step in giving mathematical expression to this proposal is the introduction of an equivalence relation on sequences of spacetime sets which relates a sequence to any other sequence to which it can be deformed without change of causal arrangement. This allows an individual observer to be associated with a finite structure. The identification of suitable switching events in the human brain is discussed. A definition is given for the sets of sequences of quantum states which such an observer could occupy. Finally, by providing an a priori probability for such sets, the definitions are incorporated into a complete mathematical framework for a many-worlds interpretation. At a less ambitious level, the paper can be read as an exploration of some of the technical and conceptual difficulties involved in constructing such a framework.     

Fault-tolerant quantum dynamical decoupling

Dynamical decoupling pulse sequences have been used to extend coherence times in quantum systems ever since the discovery of the spin-echo effect. Here we introduce a method of recursively concatenated dynamical decoupling pulses, designed to overcome both decoherence and operational errors. This is important for coherent control of quantum systems such as quantum computers. For bounded-strength, non-Markovian environments, such as for the spin-bath that arises in electron- and nuclear-spin based solid-state quantum computer proposals, we show that it is strictly advantageous to use concatenated pulses, as opposed to standard periodic dynamical decoupling pulse sequences. Namely, the concatenated scheme is both fault tolerant and superpolynomially more efficient, at equal cost. We derive a condition on the pulse noise level below which concatenation is guaranteed to reduce decoherence.     

Quantum anonymous voting systems based on entangled state

Based on quantum entanglement, secure anonymous ballot systems are introduced to realize voting among numerous candidates in this paper. By searching individuals, each voter may cast a vote for his desired candidates of which number may be more than one. Therefore, the system based on the proposed algorithm may be applied voting among many candidates, such as a network ballot with the development of a quantum network. Finally, the security of the present scheme is investigated.     

Nonordered quantum logic and its YES-NO representation

It is shown that an orthomodular lattice is an ortholattice in which aunique operation of bi-implication corresponds to the equality relation and that the ordering relation in the binary formulation of quantum logic as well as the operation of implication (conditional) in quantum logic are completely irrelevant for their axiomatization. The soundness and completeness theorems for the corresponding algebraic unified quantum logic are proved. A proper semantics, i.e., a representation of quantum logic, is given by means of a new YES-NO relation which might enable a proof of the finite model property and the decidability of quantum logic. A statistical YES-NO physical interpretation of the quantum logical propositions is provided.     

Process tomography of ion trap quantum gates

A crucial building block for quantum information processing with trapped ions is a controlled-NOT quantum gate. In this Letter, two different sequences of laser pulses implementing such a gate operation are analyzed using quantum process tomography. Fidelities of up to 92.6(6)% are achieved for single-gate operations and up to 83.4(8)% for two concatenated gate operations. By process tomography we assess the performance of the gates for different experimental realizations and demonstrate the advantage of amplitude-shaped laser pulses over simple square pulses. We also investigate whether the performance of concatenated gates can be inferred from the analysis of the single gates.     

A Parallel Quantum Algorithm for the Satisfiability Problem

In this paper we present a classical parallel quantum algorithm for the satisfiability problem. We have exploited the classical parallelism of quantum algorithms developed in [G.L. Long and L. Xiao, Phys. Rev. A 69 （2004） 052303], so that additional acceleration can be gained by using classical parallelism. The quantum algorithm first estimates the number of solutions using the quantum counting algorithm, and then by using the quantum searching algorithm, the explicit solutions are found.     

Toward an architecture for quantum programming

It is becoming increasingly clear that, if a useful device for quantum computation will ever be built, it will be embodied by a classical computing machine with control over a truly quantum subsystem, this apparatus performing a mixture of classical and quantum computation. This paper investigates a possible approach to the problem of programming such machines: a template high level quantum language is presented which complements a generic general purpose classical language with a set of quantum primitives. The underlying scheme involves a run-time environment which calculates the byte-code for the quantum operations and pipes it to a quantum device controller or to a simulator. This language can compactly express existing quantum algorithms and reduce them to sequences of elementary operations; it also easily lends itself to automatic, hardware independent, circuit simplification. A publicly available preliminary implementation of the proposed ideas has been realised using the language.Received: 25 June 2002, Published online: 30 July 2003PACS: 03.67.Lx Quantum computation     

Creating decoherence-free subspaces using strong and fast pulses

A decoherence-free subspace (DFS) isolates quantum information from deleterious environmental interactions. We give explicit sequences of strong and fast ["bang-bang" (BB)] pulses that create the conditions allowing for the existence of DFSs that support scalable, universal quantum computation. One such example is the creation of the conditions for collective decoherence, wherein all system particles are coupled in an identical manner to their environment. The BB pulses needed for this are generated using only the Heisenberg exchange interaction. In conjunction with previous results, this shows that Heisenberg exchange is by itself an enabler of universal fault-tolerant quantum computation on DFSs.     

Local distribution approach to disordered binary alloys

We study the electronic structure of the binary alloy and (quantum) percolation model. Our study is based on a self-consistent scheme for the distribution of local Green functions. We obtain detailed results for the density of states, from which the phase diagram of the binary alloy model is constructed, and discuss the existence of a quantum percolation threshold.     

A realizable quantum encryption algorithm for qubits

A realizable quantum encryption algorithm for qubits is presented by employing bit-wise quantum computation. System extension and bit-swapping are introduced into the encryption process, which makes the ciphertext space expanded greatly. The security of the proposed algorithm is analysed in detail and the schematic physical implementation is also provided. It is shown that the algorithm, which can prevent quantum attack strategy as well as classical attack strategy, is effective to protect qubits. Finally, we extend our algorithm to encrypt classical binary bits and quantum entanglements.     

Towards optimization of quantum circuits

Any unitary operation in quantum information processing can be implemented via a sequence of simpler steps — quantum gates. However, actual implementation of a quantum gate is always imperfect and takes a finite time. Therefore, searching for a short sequence of gates — efficient quantum circuit for a given operation, is an important task. We contribute to this issue by proposing optimization of the well-known universal procedure proposed by Barenco et al. [Phys. Rev. A 52, 3457 (1995)]. We also created a computer program which realizes both Barenco’s decomposition and the proposed optimization. Furthermore, our optimization can be applied to any quantum circuit containing generalized Toffoli gates, including basic quantum gate circuits.