Quantum Pattern Search with Closed Match

This paper we proposed a quantum pattern search algorithm based on Grover’s algorithm with closed match. Compared to QuAM proposed by Dan Ventura and QuAM with distributed queries proposed by Ezhov, our algorithm could not only resolve completion problem but also retrieved the full information of the query pattern which only known partial information with non-negligible probability. The algorithm took advantage of the encoding for the pattern set. Moreover we transformed the encoding of each pattern in set to encode all the pattern match cases in order to reduce the cost of encoding. Thus, the nontrivial initial state brought a new method to realize quantum pattern search with a series of proper unitary operations. The simulation result of experiments was also proved that our algorithm was useful and efficient.     

Effects of Quantum Noise on Quantum Approximate Optimization Algorithm

The quantum-classical hybrid algorithm is a promising algorithm with respect to demonstrating the quantum advantage in noisy-intermediate-scale quantum(NISQ) devices. When running such algorithms, effects due to quantum noise are inevitable. In our work, we consider a well-known hybrid algorithm, the quantum approximate optimization algorithm(QAOA). We study the effects on QAOA from typical quantum noise channels, and produce several numerical results. Our research indicates that the output state fidelity, i.e., the cost function obtained from QAOA, decreases exponentially with respect to the number of gates and noise strength. Moreover,we find that when noise is not serious, the optimized parameters will not deviate from their ideal values. Our result provides evidence for the effectiveness of hybrid algorithms running on NISQ devices.     

An analytical approach for studying the resonant states in mesoscopic devices using the phase coherence of electron waves

Based on the phase coherence of electron waves, an analytical method has been proposed to approach the resonant states in mesoscopic devices. The proposed method has been demonstrated that it is valid in the studies of the resonant states in quantum well structures and the ballistic transport in ultrathin MOS devices. The resonant states in mesoscopic devices calculated from the proposed method agree well with those from the quantum mechanical method. The results show that the proposed method is valid in simplifying some quantum issues in mesoscopic devices.     

Topological surface States in three-dimensional magnetic insulators

An electron moving in a magnetically ordered background feels an effective magnetic field that can be both stronger and more rapidly varying than typical externally applied fields. One consequence is that insulating magnetic materials in three dimensions can have topologically nontrivial properties of the effective band structure. For the simplest case of two bands, these "Hopf insulators" are characterized by a topological invariant as in quantum Hall states and Z2 topological insulators, but instead of a Chern number or parity, the underlying invariant is the Hopf invariant that classifies maps from the three-sphere to the two-sphere. This Letter gives an efficient algorithm to compute whether a given magnetic band structure has nontrivial Hopf invariant, a double-exchange-like tight-binding model that realizes the nontrivial case, and a numerical study of the surface states of this model.     

Variational quantum support vector machine based on Hadamard test

Classical machine learning algorithms seem to be totally incapable of processing tremendous amounts of data, while quantum machine learning algorithms could deal with big data with ease and provide exponential acceleration over classical counterparts. Meanwhile, variational quantum algorithms are widely proposed to solve relevant computational problems on noisy, intermediate-scale quantum devices. In this paper, we apply variational quantum algorithms to quantum support vector machines and demonstrate a proof-of-principle numerical experiment of this algorithm. In addition, in the classification stage, fewer qubits, shorter circuit depth, and simpler measurement requirements show its superiority over the former algorithms.     

Security Analysis of an Arbitrated Quantum Signature Scheme with Bell States

Recently, to resist attacks using the anticommutativity of nontrivial Pauli operators, an arbitrated quantum signature scheme with Bell states (Int. J. Theor. Phys. 53(5), 1569–1579 2014) was proposed. The scheme randomly adds Hadamard operations to strengthen the quantum one-time pad encryption. Based on this, it claimed that the scheme could resist the receiver’s existential forgery and no party had chances to change the message without being discovered. This paper introduces two security issues of the scheme: It can’t resist the signer’s disavowal and the receiver’s existential forgery. Furthermore, we show that the scheme is still vulnerable to the receiver’s existential forgery even if the Hadamard operation in the encryption algorithm is replaced with any 2nd-order unitary operation.     

From quantum cellular automata to quantum lattice gases

A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, we begin an investigation of exactly unitary cellular automata. After proving that there can be no nontrivial, homogeneous, local, unitary, scalar cellular automaton in one dimension, we weaken the homogeneity condition and show that there are nontrivial, exactly unitary, partitioning cellular automata. We find a one-parameter family of evolution rules which are best interpreted as those for a one-particle quantum automaton. This model is naturally reformulated as a two component cellular automaton which we demonstrate to limit to the Dirac equation. We describe two generalizations of this automaton, the second, of which, to multiple interacting particles, is the correct definition of a quantum lattice gas.     

An Arbitrated Quantum Signature Scheme without Entanglement

Several quantum signature schemes are recently proposed to realize secure signatures of quantum or classical messages. Arbitrated quantum signature as one nontrivial scheme has attracted great interests because of its usefulness and efficiency. Unfortunately, previous schemes cannot against Trojan horse attack and Do S attack and lack of the unforgeability and the non-repudiation. In this paper, we propose an improved arbitrated quantum signature to address these secure issues with the honesty arbitrator. Our scheme takes use of qubit states not entanglements. More importantly, the qubit scheme can achieve the unforgeability and the non-repudiation. Our scheme is also secure for other known quantum attacks.     

W-State Generation and Manipulation for Ion-Trap-Based Quantum-Information Processing

We propose an ion-trap scheme for one-step generation of a special configuration of W-class state which has recently been shown to be better than canonical W states for several quantum-information processing tasks. We also present a method for one-step realization of a nontrivial collective operation which can transform a canonical W state into a fully separable state. Such a transformation plays a key role in recently proposed quantum protocols. The operation speed in our schemes increases with the number of qubits. This is contrary to usual entanglement generation and quantum manipulation schemes which take more and more time with the increase of the number of qubits.     

Implementation of Deutsch-Jozsa Algorithm with Superconducting Quantum-Interference Devices via Raman Transition

In this paper, a theoretical scheme is proposed to implement the Deutsch-Jozsa algorithm with SQUIDs (superconducting quantum-interference devices) in cavity via Raman transition. The scheme only requires a quantized cavity field and classical microwave pulses. In this scheme, no transfer of quantum information between the SQUIDs and the cavity is required, the cavity field is only virtually excited and thus the cavity decay is suppressed.     

Quantum speedup in adaptive boosting of binary classification

In classical machine learning,a set of weak classifiers can be adaptively combined for improving the overall performance,a technique called adaptive boosting(or AdaBoost).However,constructing a combined classifier for a large data set is typically resource consuming.Here we propose a quantum extension of AdaBoost,demonstrating a quantum algorithm that can output the optimal strong classifier with a quadratic speedup in the number of queries of the weak classifiers.Our results also include a generalization of the standard AdaBoost to the cases where the output of each classifier may be probabilistic.We prove that the query complexity of the non-deterministic classifiers is the same as those of deterministic classifiers,which may be of independent interest to the classical machine-learning community.Additionally,once the optimal classifier is determined by our quantum algorithm,no quantum resources are further required.This fact may lead to applications on near term quantum devices.     

An Arbitrated Quantum Signature with Bell States

Entanglement is the main resource in quantum communication. The main aims of the arbitrated quantum signature (AQS) scheme are to present an application of the entanglement in cryptology and to prove the possibility of the quantum signature. More specifically, the main function of quantum entangled states in the existing AQS schemes is to assist the signatory to transfer quantum states to the receiver. However, teleportation and the Leung quantum one-time pad (L-QOTP) algorithm are not enough to design a secure AQS scheme. For example, Pauli operations commute or anticommute with each other, which makes the implementation of attacks easily from the aspects of forgery and disavowal. To conquer this shortcoming, we construct an improved AQS scheme using a new QOTP algorithm. This scheme has three advantages: it randomly uses the Hadamard operation in the new QOTP to resist attacks by using the anticommutativity of nontrivial Pauli operators and it preserves almost all merits in the existing AQS schemes; even in the process of handling disputes, no party has chance to change the message and its signature without being discovered; the receiver can verify the integrity of the signature and discover the disavow of the signatory even in the last step of verification.     

Is quantum computing with solid state devices possible?

Experiments with a few qubits, the basic elements of a quantum computer, using the methods of nuclear magnetic resonance (NMR) have demonstrated that quantum computing is possible. A useful quantum computer would need to use many qubits, while it appears that NMR with molecules is limited to about ten qubits. The easiest way to assemble a large number of qubits would be to use the existing solid state technology. However, the accuracy with which large numbers of solid state devices can be fabricated does not match the high-precision methods that have made quantum computing with magnetic resonance possible. Quantum computing with solid state devices must expect to encounter a new set of problems posed by differences between nominally identical devices. The difficulties are illustrated with examples of proposed qubits. Specific questions that must be addressed in attempts to use solid state devices for quantum computing are suggested. Received: 25 July 2002 / Accepted: 31 July 2002 / Published online: 4 December 2002 RID="*" ID="*"Corresponding author. Fax: +1-914/945-2141, E-mail: rkeyes@us.ibm.com     

Investigation of quantum phase transitions using multi-target DMRG methods

In this paper we examine how the predictions of conformal invariance can be widely exploited to overcome the difficulties of the density-matrix renormalization group near quantum critical points. The main idea is to match the set of low-lying energy levels of the lattice Hamiltonian, as a function of the systems size, with the spectrum expected for a given conformal field theory in two dimensions. As in previous studies this procedure requires an accurate targeting of various excited states. Here we discuss how this can be achieved within the DMRG algorithm by means of the recently proposed Thick-restart Lanczos method. As a nontrivial benchmark we use an anisotropic spin-1 Hamiltonian with special attention to the transitions from the Haldane phase. Nonetheless, we think that this procedure could be generally valid in the study of quantum critical phenomena.Received: 20 May 2004, Published online: 5 November 2004PACS: 75.40.Mg Numerical simulation studies - 05.10.Cc Renormalization group methods - 75.10.Pq Spin chain models     

A class of nontrivial weakly local massive wightman fields with interpolating properties

It is shown that in a quantum field theory satisfying Wightman's axioms with locality replaced by weak locality and cyclicity by a weak irreducibility, every unitary Poincaré invariant and CPT-invariant operator is a scattering operator (in the LSZ-sense). The proof is given by explicit construction of a corresponding class of nontrivial weakly local massive Wightman fields. This result implies Jost's conjecture that only locality leads to nontrivial restrictions for the scattering operator and extends corresponding results of Schneider.     

Quantum states far from the energy eigenstates of any local Hamiltonian

What quantum states are possible energy eigenstates of a many-body Hamiltonian? Suppose the Hamiltonian is nontrivial, i.e., not a multiple of the identity, and L local, in the sense of containing interaction terms involving at most L bodies, for some fixed L. We construct quantum states psi which are "far away" from all the eigenstates E of any nontrivial L-local Hamiltonian, in the sense that ||psi-E|| is greater than some constant lower bound, independent of the form of the Hamiltonian.     

Topological order at nonzero temperature

We propose a definition for topological order at nonzero temperature in analogy to the usual zero temperature definition that a state is topologically ordered, or "nontrivial", if it cannot be transformed into a product state (or a state close to a product state) using a local (or approximately local) quantum circuit. We prove that any two-dimensional Hamiltonian which is a sum of commuting local terms is not topologically ordered at T > 0. We show that such trivial states cannot be used to store quantum information using certain stringlike operators. This definition is not too restrictive, however, as the four dimensional toric code does have a nontrivial phase at nonzero temperature.     

Implementation of a Controlled-Phase Gate and Deutsch-Jozsa Algorithm with Superconducting Charge Qubits in a Cavity

Based on superconducting quantum interference devices （SQUIDs） coupled to a cavity, we propose a scheme for implementing a quantum controlled-phase gate （QPG） and Deutsch-Jozsa （D J） algorithm by a controllable interaction. In the present scheme, the SQUID works in the charge regime, and the cavity field is ultilized as quantum data-bus, which is sequentially coupled to only one qubit at a time. The interaction between the selected qubit and the data bus, such as resonant and dispersive interaction, can be realized by turning the gate capacitance of each SQUID. Especially, the bus is not excited and thus the cavity decay is suppressed during the implementation of DJ algorithm. For the QPG operation, the mode of the bus is unchanged in the end of the operation, although its mode is really excited during the operations. Finally, for typical experiment data, we analyze simply the experimental feasibility of the proposed scheme. Based on the simple operation, our scheme may be realized in this solid-state system, and our idea may be realized in other systems.     

Junctions of three quantum wires and the dissipative Hofstadter model

We study a junction of three quantum wires enclosing a magnetic flux. This is the simplest problem of a quantum junction between Tomonaga-Luttinger liquids in which Fermi statistics enter in a nontrivial way. We present a direct connection between this problem and the dissipative Hofstadter problem, or quantum Brownian motion in two dimensions in a periodic potential and an external magnetic field, which in turn is connected to open string theory in a background electromagnetic field. We find nontrivial fixed points corresponding to a chiral conductance tensor leading to an asymmetric flow of the current.