Quantum Computing with Trapped Ion Hyperfine Qubits

We discuss the basic aspects of quantum information processing with trapped ions, including the principles of ion trapping, preparation and detection of hyperfine qubits, single-qubit operations and multi-qubit entanglement protocols. Recent experimental advances and future research directions are outlined. PACS: 03.67.Lx, 32.80.Pj, 32.80.Qk, 42.50.Vk     

Parametrizing Quantum States and Channels

This work describes one parametrization of quantum states and channels and several of its possible applications. This parametrization works in any dimension and there is an explicit algorithm which produces it. Included in the list of applications are a simple characterization of pure states, an explicit formula for one additive entropic quantity which does not require knowledge of eigenvalues, and an algorithm which finds one Kraus operator representation for a quantum operation without recourse to eigenvalue and eigenvector calculations. PACS: 03.67a, 03.67-Hk, 03.67-Lx     

On a Parametrization of Purifications of a Qubit

This work provides, constructively, explicit one–one parametrizations of all purifications of a mixed state in dimension 2 and all joint purifications, if any, of two mixed states in the same dimension. The former is parametrized by SO(3, R), while the latter is parametrized by SO(2, R), except when the state being purified is already pure. These parametrizations are derived without any passage to the spectral decompositions of the state(s) being purified. Using this, we show how to calculate certain measures of quantum information. The appendix considers an alternative one–one parametrization of mixed states in C² C², which provides a different explicit construction of joint purifications. PACS: 03.67-a; 03.67-Hk; 03.67-Lx     

Geometric Approach to Digital Quantum Information

We present geometric methods for uniformly discretizing the continuous N-qubit Hilbert space H_N. When considered as the vertices of a geometrical figure, the resulting states form the equivalent of a Platonic solid. The discretization technique inherently describes a class of /2 rotations that connect neighboring states in the set, i.e., that leave the geometrical figures invariant. These rotations are shown to generate the Clifford group, a general group of discrete transformations on N qubits. Discretizing H_N allows us to define its digital quantum information content, and we show that this information content grows as N². While we believe the discrete sets are interesting because they allow extra-classical behavior—such as quantum entanglement and quantum parallelism—to be explored while circumventing the continuity of Hilbert space, we also show how they may be a useful tool for problems in traditional quantum computation. We describe in detail the discrete sets for one and two qubits.PACS: 03.67.Lx; 03.67.pp; 03.67.-a; 03.67.Mn.PACS: 03.67.Lx; 03.67.pp; 03.67.-a; 03.67.Mn.     

Quantum Information Processing in Cavity-QED

We give a brief overview of cavity-QED and its roles in quantum information science. In particular, we discuss setups in optical cavity-QED, where either atoms serve as stationary qubits, or photons serve as flying qubits. PACS: 42.50.Pq, 03.67.Lx, 03.67.Hk, 32.80.Pj     

An Example of the Difference Between Quantum and Classical Random Walks

In this note, we discuss a general definition of quantum random walks on graphs and illustrate with a simple graph the possibility of very different behavior between a classical random walk and its quantum analog. In this graph, propagation between a particular pair of nodes is exponentially faster in the quantum case. PACS: 03.67.Hk     

Spin-Based Quantum Dot Quantum Computing in Silicon

The spins of localized electrons in silicon are strong candidates for quantum information processing because of their extremely long coherence times and the integrability of Si within the present microelectronics infrastructure. This paper reviews a strategy for fabricating single electron spin qubits in gated quantum dots in Si/SiGe heterostructures. We discuss the pros and cons of using silicon, present recent advances, and outline challenges. PACS: 03.67.Pp, 03.67.Lx, 85.35.Be, 73.21.La     

Approximate Quantum Error Correction

The errors that arise in a quantum channel can be corrected perfectly if and only if the channel does not decrease the coherent information of the input state. We show that, if the loss of coherent information is small, then approximate quantum error correction is possible. PACS: 03.67.H, 03.65.U     

Towards Scalable Linear-Optical Quantum Computers

Scalable quantum computation with linear optics was considered to be impossible due to the lack of efficient two-qubit logic gates, despite the ease of implementation of one-qubit gates. Two-qubit gates necessarily need a non-linear interaction between the two photons, and the efficiency of this non-linear interaction is typically very small in bulk materials. However, it has recently been shown that this barrier can be circumvented with effective non-linearities produced by projective measurements, and with this work linear-optical quantum computing becomes a new avenue towards scalable quantum computation. We review several issues concerning the principles and requirements of this scheme. PACS: 03.67.Lx, 03.67.Pp, 42.50.Dv, 42.65.Lm     

Progress in Quantum Algorithms

We discuss the progress (or lack of it) that has been made in discovering algorithms for computation on a quantum computer. Some possible reasons are given for the paucity of quantum algorithms so far discovered, and a short survey is given of the state of the field. PACS: 03.67.Lx     

Data Compression Limit for an Information Source of Interacting Qubits

A system of interacting qubits can be viewed as a non-i.i.d quantum information source. A possible model of such a source is provided by a quantum spin system, in which spin-1/2 particles located at sites of a lattice interact with each other. We establish the limit for the compression of information from such a source and show that asymptotically it is given by the von Neumann entropy rate. Our result can be viewed as a quantum ana-logue of Shannon's noiseless coding theorem for a class of non-i.i.d. quantum informa-tion sources. From the probabilistic point of view it is an analog of the Shannon-McMillan-Breiman theorem considered as a cornerstone of modern Information Theory. PACS: 03.67-a; 03.67.Lx     

Noiseless Subsystems and the Structure of the Commutant in Quantum Error Correction

The effect of noise on a quantum system can be described by a set of operators obtained from the interaction Hamiltonian. Recently it has been shown that generalized quantum error correcting codes can be derived by studying the algebra of this set of operators. This led to the discovery of noiseless subsystems. They are described by a set of operators obtained from the commutant of the noise generators. In this paper we derive a general method to compute the structure of this commutant in the case of unital noise. PACS: 03.67.–a, 03.67.Pp     

Quantum Comparison Machines with One-Sided Error

It is always possible to decide, with one-sided error, whether two quantum states are the same under a specific unitary transformation. However we show here that it is impossible to do so if the transformation is anti-linear and non-singular. This result implies that unitary and anti-unitary operations exist on an unequal footing in quantum information theory. PACS: 03.67.-a     

Experimental Concatenation of Quantum Error Correction with Decoupling

We experimentally explore the reduction of decoherence via concatenating quantum error correction (QEC) with decoupling in liquid-state NMR quantum information processing. Decoupling provides an efficient means of suppressing decoherence from noise sources with long correlation times, and then QEC can be used more profitably for the remaining noise sources. PACS: 03.67.Lx, 03.65.Bz     

Visualization of the Quantum Fourier Transform Using a Quantum Computer Simulator

The quantum Fourier transform (QFT) is a key subroutine of quantum algorithms for factoring and simulation and is the heart of the hidden-subgroup problem, the solution of which is expected to lead to the development of new quantum algorithms. The QFT acts on the Hilbert space and alters the quantum mechanical phases and probability amplitudes. Unlike its classical counterpart its schematic representation and visualization are very dif.cult. The aim of this work is to develop a schematic representation and visualization of the QFT by running it on a quantum computer simulator which has been constructed in the framework of this research. Base states, superpositions of base states and entangled states are transformed and the corresponding schematic representations are presented. The visualization of the QFT presented here and the quantum computer simulator developed for this purpose may become a useful tool for introducing the QFT to students and researches without a strong background in quantum mechanics or Fourier analysis. PACS: 03.67.-a, 03.67.Lx     

Controlling Spin Qubits in Quantum Dots

We review progress on the spintronics proposal for quantum computing where the quantum bits (qubits) are implemented with electron spins. We calculate the exchange interaction of coupled quantum dots and present experiments, where the exchange coupling is measured via transport. Then, experiments on single spins on dots are described, where long spin relaxation times, on the order of a millisecond, are observed. We consider spin-orbit interaction as sources of spin decoherence and find theoretically that also long decoherence times are expected. Further, we describe the concept of spin filtering using quantum dots and show data of successful experiments. We also show an implementation of a read out scheme for spin qubits and define how qubits can be measured with high precision. Then, we propose new experiments, where the spin decoherence time and the Rabi oscillations of single electrons can be measured via charge transport through quantum dots. Finally, all these achievements have promising applications both in conventional and quantum information processing. PACS: 03.67.Lx, 03.67.Mn, 73.23.Hk, 85.35.Be     

Scaling and Renormalization in Fault-Tolerant Quantum Computers

This work is concerned with phrasing the concepts of fault-tolerant quantum computation within the framework of disordered systems, Bernoulli site percolation in particular. We show how the so-called threshold theorems on the possibility of fault-tolerant quantum computation with constant error rate can be cast as a renormalization (coarse-graining) of the site percolation process describing the occurrence of errors during computation. We also use percolation techniques to derive a trade-off between the complexity overhead of the fault-tolerant circuit and the threshold error rate. PACS: 03.67.Pp; 03.67.Lx     

One-Dimensional Continuous-Time Quantum Walks

We survey the equations of continuous-time quantum walks on simple one-dimensional lattices, which include the finite and infinite lines and the finite cycle, and compare them with the classical continuous-time Markov chains. The focus of our expository article is on analyzing these processes using the Laplace transform on the stochastic recurrences. The resulting time evolution equations, classical vs. quantum, are strikingly similar in form, although dissimilar in behavior. We also provide comparisons with analyses performed using spectral methods. PACS: 03.67.Lx     

Implementing a Quantum Algorithm with Exchange-Coupled Quantum Dots: A Feasibility Study

We present Monte Carlo wavefunction simulations for quantum computations employing an exchange-coupled array of quantum dots. Employing a combination of experimentally and theoretically available parameters, we find that gate fidelities greater than 98% may be obtained with current experimental and technological capabilities. Application to an encoded 3 qubit (nine physical qubits) Deutsch-Josza computation indicates that the algorithmic fidelity is more a question of the total time to implement the gates than of the physical complexity of those gates. PACS: 81.07.Ta, 02.70.Ss, 03.67.Lx, 03.65.Yz     

On the Generation of Sequential Unitary Gates from Continuous Time Schrödinger Equations Driven by External Fields

In most of the proposals for quantum computers, a common feature is that the quantum circuits are expected to be made of cascades of unitary transformations acting on the quantum states. Such unitary gates are normally assumed to belong to a given discrete set of transformations. However, arbitrary superposition of quantum states may be achieved by utilizing a fixed number of transformations, each depending on a parameter. A framework is proposed to dynamically express these parameters directly in terms of the control inputs entering into the continuous time forced Schrouml;dinger equation. PACS: 03.67.Lx; 03.65.Fd; 02.30.Mv; 02.30.Xy