Narrow Results

Quantum logic gates can perform calculations much more efficiently than their classical counterparts. However, the level of control needed to obtain a reliable quantum operation is correspondingly higher. In order to evaluate the performance of experimental quantum gates, it is therefore necessary to identify the essential features that indicate quantum coherent operation. In this paper, we show that an efficient characterization of an experimental device can be obtained by investigating the classical logic operations on a pair of complementary basis sets. It is then possible to obtain reliable predictions about the quantum coherent operations of the gate such as entanglement generation and Bell state discrimination even without performing these operations directly.

Holonomic quantum computation makes use of non-abelian geometric phases, associated to the evolution of a subspace of quantum states, to encode logical gates. We identify a special class of subspaces, for which a sequence of rotations results in a non-abelian holonomy of a topological nature, so that it is invariant under any SO(3)-perturbation. Making use of a Majorana-like stellar representation for subspaces, we give explicit examples of topological-holonomic (or toponomic) NOT and CNOT gates.

In this work, a gauge approach to quantum computing is considered. It is assumed that there exists a classical procedure for placing certain classical system in a state described by a holomorphic vector bundle with connection with logarithmic singularities. This bundle and its connection are constructed with the aid of unitary operators realizing the given algorithm using methods of the monodromic Riemann–Hilbert problem. Universality is understood in the sense that for any collection of unitary matrices there exists a connection with logarithmic singularities whose monodromy representation involves these matrices.

The notion of quantum instruments is formalized as statistical equivalence classes of all the possible quantum measurements and mathematically characterized as normalized completely positive map valued measures under naturally acceptable axioms. Recently, universally valid uncertainty relations have been established to set a precision limit for any instruments given a disturbance constraint in a form more general than the one originally proposed by Heisenberg. One of them leads to a quantitative generalization of the Wigner–Araki–Yanase theorem on the precision limit of measurements under conservation laws. Applying this, a rigorous lower bound is obtained for the gate error probability of physical implementations of Hadamard gates on a standard qubit of a spin 1/2 system by interactions with control fields or ancilla systems obeying the angular momentum conservation law.

We show how quantum optimal control theory can help achieve high-fidelity quantum gates in real experimental settings. We discuss several optimization methods (from iterative algorithms to optimization by interference and to impulsive control) and different physical scenarios (from optical lattices to atom chips and to Rydberg atoms).

The theory of logical gates in quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quantum information quantity, represented by a quregister (a system of qudits) or, more generally, by a mixture of quregisters (called qumix), whose dimension depends on the logical complexity of the sentence. At the same time, the logical connectives are interpreted as logical operations defined in terms of quantum logical gates. Physical models of quantum computational logics can be built by means of Mach-Zehnder interferometers.

We construct quantum gates entanglers for different classes of multipartite states. In particular, we construct entangler operators for W and GHZ classes of multipartite states based on the construction of the concurrence classes. We also discuss in detail these two classes of the quantum gates entanglers for three-partite states.

We construct a generalized controlled phased gate entangler for a multi-qubit state based on the geometrical structure of quantum systems. We also investigate the relation between the generalized controlled phase construction of a quantum gate entangler and graph state for two-qubit and three-qubit states.

Quantum and reversible logic circuits have found emerging attentions in nanotechnology, optical computing, quantum computing, and low power CMOS design. In this paper, we propose some new quantum and reversible compressors using our new genetic algorithm-based simulator, analyzer, and synthesizer software. The proposed quantum 4:2 and 6:2 compressor circuits are compared with the existing counterparts in terms of number of constant inputs, number of garbage outputs, delay and the quantum cost (QC). We have also designed quantum 7:2 compressor for the first time. The proposed quantum compressors are optimized in terms of QC and delay. The proposed designs can be used as a basic block in complex systems like multipliers, and can execute complicated operations better than the existing designs in literature.

A general scheme is presented to decompose a d-by-d unitary matrix as the product of two-level unitary matrices with additional structure and prescribed determinants. In particular, the decomposition can be done by using two-level matrices in d - 1 classes, where each class is isomorphic to the group of 2 × 2 unitary matrices. The proposed scheme is easy to apply, and useful in treating problems with the additional structural restrictions. A Matlab program is written to implement the scheme, and the result is used to deduce the fact that every quantum gate acting on n-qubit registers can be expressed as no more than 2^n-1(2ⁿ-1) fully controlled single-qubit gates chosen from 2ⁿ-1 classes, where the quantum gates in each class share the same n - 1 control qubits. Moreover, it is shown that one can easily adjust the proposed decomposition scheme to take advantage of additional structure evolving in the process.

Many proposals for quantum devices are based on qubits that are physically realized by the spin magnetic moment of some quantum object. In this case, one of the most often adopted strategies for manipulating qubits is that of using external magnetic fields. However, selectively applying a field just to one qubit may be a practically unattainable goal, as it is, for instance, in most solid-state based setups. In this work, we present a proposal for using nonlinear excitations of solitonic type to accomplish the above task. Our scheme entails the generation of a dynamical soliton in a classical spin-chain which is locally coupled with one qubit: as the soliton runs through, the qubit behaves, due to its interaction with the chain, as if it were subject to a magnetic field with a time dependence that follows from the soliton's features. We here present results for the time evolution of the qubit density-matrix induced by the overall dynamics of the above scheme.

Quantum computation strongly relies on the realization, manipulation, and control of qubits. A central method for realizing qubits is by creating a double-well potential system with a significant gap between the first two eigenvalues and the rest. In this work, we first revisit the theoretical grounds underlying the double-well qubit dynamics, then proceed to suggest novel extensions of these principles to a triple-well qutrit with periodic boundary conditions, followed by a general $d$-well analysis of qudits. These analyses are based on representations of the special unitary groups SU$(d)$ which expose the systems’ symmetry and employ them for performing computations. We conclude with a few notes on coherence and scalability of $d$-well systems.

We investigate the possibility to restore genuine tripartite entanglement under local amplitude damping. We show that it is possible to protect genuine entanglement using CNOT and Hadamard gates. We analyze several ordering of such recovery operations. We find that for recovery operations applied after exposing qubits to decoherence, there is no enhancement in lifetime of genuine entanglement. Actual retrieval of entanglement is only possible when reversal scheme is applied before and after the decoherence process. We find that retrieval of entanglement for mixture of $|\tilde{W}〉$ state with white noise is more evident than the respective mixture of $|W〉$ state. We also find the retrieval of entanglement for similar mixture of $|\mathrm{\text{GHZ}}〉$ state as well.

Fundamental quantum gates can be implemented effectively using adiabatic quantum computation or circuit model. Recently, Hen combined the two approaches to introduce a new model called controlled adiabatic evolutions [I. Hen, Phys. Rev. A, 91(2) (2015) 022309]. This model was specifically designed to implement one and two-qubit controlled gates. Later, Santos extended Hen’s work to implement $n$-qubit controlled gates [A. C. Santos and M. S. Sarandy, Sci. Rep., 5 (2015) 15775]. In this paper, we discuss the implementation of each of the usual quantum gates, as well as demonstrate the possibility of preparing Bell’s states using the controlled adiabatic evolutions approach. We conclude by presenting the fidelity results of implementing single quantum gates and Bell’s states in open systems.

We investigate the counterparts of random walks in universal quantum computing and their implementation using standard quantum circuits. Quantum walks have been recently well investigated for traversing graphs with certain oracles. We focus our study on traversing a 1D graph, namely a circle, and show how to implement a discrete-time quantum walk in quantum circuits built with universal CNOT and single qubit gates. We review elementary quantum gates and circuit decomposition techniques and propose a generalized version of all CNOT-based circuits of the quantum walk. We simulated these circuits on five different qubits IBM-Q quantum devices. This quantum computer has nonperfect gates based on superconducting qubits, and, therefore, we analyzed the impact of the CNOT errors and CNOT-depth on the fidelity of the circuit.

Elements of quantum computing and quantum infromation processing are introduced for nonspecialists. Subjects inclulde quantum physics, qubits, quantum gates, quantum algorithms, decoherece, quantum error correcting codes and physical realizations. Presentations of these subjects are as pedagogical as possible. Some sections are meant to be brief introductions to contributions by other lecturers.

We can use a physical system for information processing and computing. If a quantum system is employed for these purposes, we are able to use powerful tools, which are beyond our imagination cultivated in the macroscopic world. Subjects introduced in this overview include qubits, quantum gates, quantum algorithms and physical realizations.