Quantum computation with Turaev-Viro codes

For a 3-manifold with triangulated boundary, the Turaev-Viro topological invariant can be interpreted as a quantum error-correcting code. The code has local stabilizers, identified by Levin and Wen, on a qudit lattice. Kitaev’s toric code arises as a special case. The toric code corresponds to an abelian anyon model, and therefore requires out-of-code operations to obtain universal quantum computation. In contrast, for many categories, such as the Fibonacci category, the Turaev-Viro code realizes a non-abelian anyon model. A universal set of fault-tolerant operations can be implemented by deforming the code with local gates, in order to implement anyon braiding. We identify the anyons in the code space, and present schemes for initialization, computation and measurement. This provides a family of constructions for fault-tolerant quantum computation that are closely related to topological quantum computation, but for which the fault tolerance is implemented in software rather than coming from a physical medium.     

Quantum computation in continuous time using dynamic invariants

We introduce an approach for quantum computing in continuous time based on the Lewis-Riesenfeld dynamic invariants. This approach allows, under certain conditions, for the design of quantum algorithms running on a nonadiabatic regime. We show that the relaxation of adiabaticity can be achieved by processing information in the eigenlevels of a time dependent observable, namely, the dynamic invariant operator. Moreover, we derive the conditions for which the computation can be implemented by time independent as well as by adiabatically varying Hamiltonians. We illustrate our results by providing the implementation of both Deutsch-Jozsa and Grover algorithms via dynamic invariants.     

Quantum computational gates with radiation free couplings

We examine a generic three level mechanism of quantum computation in which all fundamental single and double qubit quantum logic gates are operating under the effect of adiabatically controllable static (radiation free) bias couplings between the states. Under the time evolution imposed by these bias couplings the quantum state cycles between the two degenerate levels in the ground state and the quantum gates are realized by changing Hamiltonian at certain time intervals when the system collapses to a two state subspace. We propose a physical implementation of the mechanism using Aharonov-Bohm persistent-current loops in crossed electric and magnetic fields, with the output of the loop read out by using a quantum Hall effect aided mechanism. Received 26 March 2002 / Received in final form 8 July 2002 Published online 19 November 2002     

Duality Quantum Computers and Quantum Operations

We present a mathematical theory for a new type of quantum computer called a duality quantum computer that is similar to one that has recently been proposed. We discuss the nonunitarity of certain circuits of a duality quantum computer. We then discuss the relevance of this work to quantum operations and their convexity theory. This discussion is based upon isomorphism theorems for completely positive maps.     

Quantum Interference Computation

Quantum speed-up has been conjectured but not proven for a general computation. Quantum interference computation (QUIC) provides a general speed-up. It is a form of ground-mode computation that reinforces the ground mode in a beam of mostly non-ground modes by quantum superposition. It solves the general Boolean problem in the square root of the number of operations that a classical computer would need for the same problem. For example a typical 80-bit problem would take about 10²⁴ cycles (10⁷ years at 1 GHz) of classical computation and about 10¹² cycles (20 minutes at 1 GHz) of QUIC.     

Quantum Computational Logics and Possible Applications

In quantum computational logics meanings of formulas are identified with quantum information quantities: systems of qubits or, more generally, mixtures of systems of qubits. We consider two kinds of quantum computational semantics: (1) a compositional semantics, where the meaning of a compound formula is determined by the meanings of its parts; (2) a holistic semantics, which makes essential use of the characteristic “holistic” features of the quantum-theoretic formalism. The compositional and the holistic semantics turn out to characterize the same logic. In this framework, one can introduce the notion of quantum-classical truth table, which corresponds to the most natural way for a quantum computer to calculate classical tautologies. Quantum computational logics can be applied to investigate different kinds of semantic phenomena where holistic, contextual and gestaltic patterns play an essential role (from natural languages to musical compositions).     

Quantum heat switch with multiple qubits

We further elaborate on the device proposed by Karimi et al. [15], in which coupled superconducting qubits can play the role of a quantum heat switch. In the present paper we analyze the performances of the switch if the number of qubits increases considering in details the cases of three and four qubits. To this aim we study the effect of the number of qubits on the transmitted power between baths. As the number of qubits increases, the transmitted power between baths increases as well.     

Blind quantum computation with identity authentication

Blind quantum computation (BQC) allows a client with relatively few quantum resources or poor quantum technologies to delegate his computational problem to a quantum server such that the client's input, output, and algorithm are kept private. However, all existing BQC protocols focus on correctness verification of quantum computation but neglect authentication of participants' identity which probably leads to man-in-the-middle attacks or denial-of-service attacks. In this work, we use quantum identification to overcome such two kinds of attack for BQC, which will be called QI-BQC. We propose two QI-BQC protocols based on a typical single-server BQC protocol and a double-server BQC protocol. The two protocols can ensure both data integrity and mutual identification between participants with the help of a third trusted party (TTP). In addition, an unjammable public channel between a client and a server which is indispensable in previous BQC protocols is unnecessary, although it is required between TTP and each participant at some instant. Furthermore, the method to achieve identity verification in the presented protocols is general and it can be applied to other similar BQC protocols.     

Precision of single-qubit gates based on Raman transitions

We analyze the achievable precision for single-qubit gates that are based on off-resonant Raman transitions between two near-degenerate ground states via a virtually excited state. In particular, we study the errors due to non-perfect adiabaticity and due to spontaneous emission from the excited state. For the case of non-adiabaticity, we calculate the error as a function of the dimensionless parameter χ=Δτ, where Δ is the detuning of the Raman beams and τ is the gate time. For the case of spontaneous emission, we give an analytical argument that the gate errors are approximately equal to Λ γ/Δ, where Λ is the rotation angle of the one-qubit gate and γ is the spontaneous decay rate, and we show numerically that this estimate holds to good approximation.     

Quantum computation in algebraic number theory: Hallgren’s efficient quantum algorithm for solving Pell’s equation

Pell’s equation is x²−dy²=1, where d is a square-free integer and we seek positive integer solutions x,y>0. Let (x₀,y₀) be the smallest solution (i.e., having smallest ). Lagrange showed that every solution can easily be constructed from A so given d it suffices to compute A. It is known that A can be exponentially large in d so just to write down A we need exponential time in the input size . Hence we introduce the regulator R=lnA and ask for the value of R to n decimal places. The best known classical algorithm has sub-exponential running time . Hallgren’s quantum algorithm gives the result in polynomial time with probability . The idea of the algorithm falls into two parts: using the formalism of algebraic number theory we convert the problem of solving Pell’s equation into the problem of determining R as the period of a function on the real numbers. Then we generalise the quantum Fourier transform period finding algorithm to work in this situation of an irrational period on the (not finitely generated) abelian group of real numbers. This paper is intended to be accessible to a reader having no prior acquaintance with algebraic number theory; we give a self-contained account of all the necessary concepts and we give elementary proofs of all the results needed. Then we go on to describe Hallgren’s generalisation of the quantum period finding algorithm, which provides the efficient computational solution of Pell’s equation in the above sense.     

Quantum computation with two-dimensional graphene quantum dots

We study an array of graphene nano sheets that form a two-dimensional S=1/2 Kagome spin lattice used for quantum computation.The edge states of the graphene nano sheets are used to form quantum dots to confine electrons and perform the computation.We propose two schemes of bang-bang control to combat decoherence and realize gate operations on this array of quantum dots.It is shown that both schemes contain a great amount of information for quantum computation.The corresponding gate operations are also proposed.     

The Algebraic Structure of an Approximately Universal System of Quantum Computational Gates

Shi and Aharonov have shown that the Toffoli gate and the Hadamard gate give rise to an approximately universal set of quantum computational gates. We study the basic algebraic properties of this system by introducing the notion of Shi-Aharonov quantum computational structure. We show that the quotient of this structure is isomorphic to a structure based on a particular set of complex numbers (the closed disc with center and radius ). Dedicated to Pekka Lahti.     

Quantum computation with ions in microscopic traps

We discuss a possible experimental realization of fast quantum gates with high fidelity with ions confined in microscopic traps. The original proposal of this physical system for quantum computation comes from Cirac and Zoller (Nature 404, 579 (2000)). In this paper we analyse a sensitivity of the ion-trap quantum gate on various experimental parameters which was omitted in the original proposal. We address imprecision of laser pulses, impact of photon scattering, nonzero temperature effects and influence of laser intensity fluctuations on the total fidelity of the two-qubit phase gate.     

Cyclic groups and quantum logic gates

We present a formula for an infinite number of universal quantum logic gates, which are 4$4$ by 4$4$ unitary solutions to the Yang–Baxter (Y–B) equation. We obtain this family from a certain representation of the cyclic group of order n$n$. We then show that this discrete   family, parametrized by integers n$n$, is in fact, a small sub-class of a larger continuous   family, parametrized by real numbers θ$\theta$, of universal quantum gates. We discuss the corresponding Yang-Baxterization and related symmetries in the concomitant Hamiltonian.     

Quantum computation with surface-state electrons by rapid population passages

Quantum computation requires coherently controlling the evolutions of qubits.Usually,these manipulations are implemented by precisely designing the durations(such as theπ-pulses)of the Rabi oscillations and tunable interbit coupling.Relaxing this requirement,herein we show that the desired population transfers between the logic states can be deterministically realized(and thus quantum computation could be implemented)both adiabatically and non-adiabatically,by performing the duration-insensitive quantum manipulations.Our proposal is specifically demonstrated with the surface-state of electrons floating on the liquid helium,but could also be applied to the other artificially controllable systems for quantum computing.     

A proposal for the realization of universal quantum gates via superconducting qubits inside a cavity

A family of quantum logic gates is proposed via superconducting (SC) qubits coupled to a SC-cavity. The Hamiltonian for SC-charge qubits inside a single mode cavity is considered. Three- and two-qubit operations are generated by applying a classical magnetic field with the flux. Therefore, a number of quantum logic gates are realized. Numerical simulations and calculation of the fidelity are used to prove the success of these operations for these gates.     

Quantum Gates and Quantum Algorithms with Clifford Algebra Technique

We use the Clifford algebra technique (J. Math. Phys. 43:5782, 2002; J. Math. Phys. 44:4817, 2003), that is nilpotents and projectors which are binomials of the Clifford algebra objects γ ^a with the property {γ ^a ,γ ^b }₊=2η ^ab , for representing quantum gates and quantum algorithms needed in quantum computers in a simple and an elegant way. We identify n-qubits with the spinor representations of the group SO(1,3) for a system of n spinors. Representations are expressed in terms of products of projectors and nilpotents; we pay attention also on the nonrelativistic limit. An algorithm for extracting a particular information out of a general superposition of 2 ⁿ qubit states is presented. It reproduces for a particular choice of the initial state the Grover’s algorithm (Proc. 28th Annual ACM Symp. Theory Comput. 212, 1996).