Abstract: Among the numerous types of architecture being explored for quantum computers are systems utilizing ion traps, in which quantum bits (qubits) are formed from the electronic states of trapped ions and coupled through the Coulomb interaction. Although the elementary requirements for quantum computation have been demonstrated in this system, there exist theoretical and technical obstacles to scaling up the approach to large numbers of qubits. Therefore, recent efforts have been concentrated on using quantum communication to link a number of small ion-trap quantum systems. Developing the array-based approach, we show how to achieve massively parallel gate operation in a large-scale quantum computer, based on techniques already demonstrated for manipulating small quantum registers. The use of decoherence-free subspaces significantly reduces decoherence during ion transport, and removes the requirement of clock synchronization between the interaction regions.

Abstract: 1 Ferromagnetic III-V Semiconductors and Their Heterostructures.- 2 Spin Injection and Transport in Micro- and Nanoscale Devices.- 3 Electrical Spin Injection: Spin-Polarized Transport from Magnetic into Non-Magnetic Semiconductors.- 4 Spin Dynamics in Semiconductors.- 5 Optical Manipulation, Transport and Storage of Spin Coherence in Semiconductors.- 6 Spin Condensates in Semiconductor Microcavities.- 7 Spins for Quantum Information Processing.- 8 Electron Spins in Quantum Dots as Qubits for Quantum Information Processing.- 9 Regulated Single Photons and Entangled Photons From a Quantum Dot Microcavity.

Abstract: We analyze surface codes, the topological quantum error-correcting codes introduced by Kitaev. In these codes, qubits are arranged in a two-dimensional array on a surface of nontrivial topology, and encoded quantum operations are associated with nontrivial homology cycles of the surface. We formulate protocols for error recovery, and study the efficacy of these protocols. An order-disorder phase transition occurs in this system at a nonzero critical value of the error rate; if the error rate is below the critical value (the accuracy threshold), encoded information can be protected arbitrarily well in the limit of a large code block. This phase transition can be accurately modeled by a three-dimensional Z(2) lattice gauge theory with quenched disorder. We estimate the accuracy threshold, assuming that all quantum gates are local, that qubits can be measured rapidly, and that polynomial-size classical computations can be executed instantaneously. We also devise a robust recovery procedure that does not require measurement or fast classical processing; however, for this procedure the quantum gates are local only if the qubits are arranged in four or more spatial dimensions. We discuss procedures for encoding, measurement, and performing fault-tolerant universal quantum computation with surface codes, and argue that these codes provide a promising framework for quantum computing architectures.

Abstract: Introduction Classical computation Quantum computation Solutions Elementary number theory Bibliography Index.

Abstract: This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principles of quantum computing, such as a quantum bit and superposition of states. Like other evolutionary algorithms, QEA is also characterized by the representation of the individual, evaluation function, and population dynamics. However, instead of binary, numeric, or symbolic representation, QEA uses a Q-bit, defined as the smallest unit of information, for the probabilistic representation and a Q-bit individual as a string of Q-bits. A Q-gate is introduced as a variation operator to drive the individuals toward better solutions. To demonstrate its effectiveness and applicability, experiments were carried out on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that QEA performs well, even with a small population, without premature convergence as compared to the conventional genetic algorithm.

Abstract: We propose a novel physical realization of a quantum computer. The qubits are electric dipole moments of ultracold diatomic molecules, oriented along or against an external electric field. Individual molecules are held in a 1D trap array, with an electric field gradient allowing spectroscopic addressing of each site. Bits are coupled via the electric dipole-dipole interaction. Using technologies similar to those already demonstrated, this design can plausibly lead to a quantum computer with $\ensuremath{\gtrsim}{10}^{4}$ qubits, which can perform $\ensuremath{\sim}{10}^{5}$ CNOT gates in the anticipated decoherence time of $\ensuremath{\sim}5\mathrm{s}$.

Abstract: Various present and future specialized applications of magnets require monodisperse, small magnetic particles, and the discovery of molecules that can function as nanoscale magnets was an important development in this regard. These molecules act as single-domain magnetic particles that, below their blocking temperature, exhibit magnetization hysteresis, a classical property of macroscopic magnets. Such 'single-molecule magnets' (SMMs) straddle the interface between classical and quantum mechanical behaviour because they also display quantum tunnelling of magnetization and quantum phase interference. Quantum tunnelling of magnetization can be advantageous for some potential applications of SMMs, for example, in providing the quantum superposition of states required for quantum computing. However, it is a disadvantage in other applications, such as information storage, where it would lead to information loss. Thus it is important to both understand and control the quantum properties of SMMs. Here we report a supramolecular SMM dimer in which antiferromagnetic coupling between the two components results in quantum behaviour different from that of the individual SMMs. Our experimental observations and theoretical analysis suggest a means of tuning the quantum tunnelling of magnetization in SMMs. This system may also prove useful for studying quantum tunnelling of relevance to mesoscopic antiferromagnets.

Abstract: The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state, which tends to the solution. We apply this time-dependent Hamiltonian approach to Grover's problem, i.e., searching a marked item in an unstructured database. We find that by adjusting the evolution rate of the Hamiltonian so as to keep the evolution adiabatic on each infinitesimal time interval, the total running time is of order $\sqrt{N},$ where N is the number of items in the database. We thus recover the advantage of Grover's standard algorithm as compared to a classical search, scaling as N. This is in contrast with the constant-rate adiabatic approach of Farhi et al. (e-print quant-ph/0001106), where the requirement of adiabaticity is expressed only globally, resulting in a time of order N.

Abstract: We show that the topological modular functor from Witten-Chern-Simons theory is universal for quantum computation in the sense that a quantum circuit com- putation can be efficiently approximated by an intertwining action of a braid on the functor's state space. A computational model based on Chern-Simons theory at a fifth root of unity is defined and shown to be polynomially equivalent to the quantum circuit model. The chief technical advance: the density of the irreducible sectors of the Jones representation has topological implications which will be considered elsewhere.

Abstract: 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

Abstract: We define a polynomial measure of multiparticle entanglement which is scalable, i.e., which applies to any number of spin-12 particles. By evaluating it for three particle states, for eigenstates of the one dimensional Heisenberg antiferromagnet and on quantum error correcting code subspaces, we illustrate the extent to which it quantifies global entanglement. We also apply it to track the evolution of entanglement during a quantum computation.

Abstract: An efficient and intuitive framework for universal quantum computation is presented that uses pairs of spin-1/2 particles to form logical qubits and a single physical interaction, Heisenberg exchange, to produce all gate operations. Only two Heisenberg gate operations are required to produce a controlled $\ensuremath{\pi}$-phase shift, compared to nineteen for exchange-only proposals employing three spins. Evolved from well-studied decoherence-free subspaces, this architecture inherits immunity from collective decoherence mechanisms. The simplicity and adaptability of this approach should make it attractive for spin-based quantum computing architectures.

Abstract: We expand on our work on quantum data hiding - hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell (1964) states, and we derive upper and lower bounds on the secrecy of the hiding scheme. We provide an explicit bound showing that multiple bits can be hidden bitwise with our scheme. We give a preparation of the hiding states as an efficient quantum computation that uses at most one ebit of entanglement. A candidate data-hiding scheme that does not use entanglement is presented. We show how our scheme for quantum data hiding can be used in a conditionally secure quantum bit commitment scheme.

Abstract: The general principle for a quantum-signature scheme is proposed and investigated based on ideas from classical signature schemes and quantum cryptography. The suggested algorithm is implemented by a symmetrical quantum key cryptosystem and Greenberger-Horne-Zeilinger (GHZ) triplet states and relies on the availability of an arbitrator. We can guarantee the unconditional security of the algorithm, mostly due to the correlation of the GHZ triplet states and the use of quantum one-time pads.

Abstract: Physical systems, characterized by an ensemble of interacting constituents, can be represented and studied by different algebras of operators (observables). For example, a fully polarized electronic system can be studied by means of the algebra generated by the usual fermionic creation and annihilation operators or by the algebra of Pauli (spin-1/2) operators. The Jordan-Wigner isomorphism gives the correspondence between the two algebras. As we previously noted, similar isomorphisms enable one to represent any physical system in a quantum computer. In this paper we evolve and exploit this fundamental observation to simulate generic physical phenomena by quantum networks. We give quantum circuits useful for the efficient evaluation of the physical properties (e.g., the spectrum of observables or relevant correlation functions) of an arbitrary system with Hamiltonian H.

Abstract: We study universal quantum computation using optical coherent states. A teleportation scheme for a coherent-state qubit is developed and applied to gate operations. This scheme is shown to be robust to detection inefficiency.

Abstract: The Penrose-Hameroff orchestrated objective reduction ~orch. OR! model assigns a cognitive role to quantum computations in microtubules within the neurons of the brain. Despite an apparently ‘‘warm, wet, and noisy’’ intracellular milieu, the proposal suggests that microtubules avoid environmental decoherence long enough to reach threshold for ‘‘self-collapse’’ ~objective reduction! by a quantum gravity mechanism put forth by Penrose. The model has been criticized as regards the issue of environmental decoherence, and a recent report by Tegmark finds that microtubules can maintain quantum coherence for only 10 213 s, far too short to be neurophysiologically relevant. Here, we critically examine the decoherence mechanisms likely to dominate in a biological setting and find that ~1! Tegmark’s commentary is not aimed at an existing model in the literature but rather at a hybrid that replaces the superposed protein conformations of the orch. OR theory with a soliton in superposition along the microtubule; ~2! recalculation after correcting for differences between the model on which Tegmark bases his calculations and the orch. OR model ~superposition separation, charge vs dipole, dielectric constant! lengthens the decoherence time to 10 25 ‐10 24 s; ~3! decoherence times on this order invalidate the assumptions of the derivation and determine the approximation regime considered by Tegmark to be inappropriate to the orch. OR superposition; ~4! Tegmark’s formulation yields decoherence times that increase with temperature contrary to well-established physical intuitions and the observed behavior of quantum coherent states; ~5! incoherent metabolic energy supplied to the collective dynamics ordering water in the vicinity of microtubules at a rate exceeding that of decoherence can counter decoherence effects ~in the same way that lasers avoid decoherence at room temperature!; ~6! microtubules are surrounded by a Debye layer of counterions, which can screen thermal fluctuations, and by an actin gel that might enhance the ordering of water in bundles of microtubules, further increasing the decoherence-free zone by an order of magnitude and, if the dependence on the distance between environmental ion and superposed state is accurately reflected in Tegmark’s calculation, extending decoherence times by three orders of magnitude; ~7! topological quantum computation in microtubules may be error correcting, resistant to decoherence; and ~8! the decohering effect of radiative scatterers on microtubule quantum states is negligible. These considerations bring microtubule decoherence into a regime in which quantum gravity could interact with neurophysiology.

Abstract: We show that a class of quantum computations that was recently shown to be efficiently simulatable on a classical computer by Valiant [in Proceedings of the 33rd ACM Symposium on the Theory of Computing (2001), p. 114] corresponds to a physical model of noninteracting fermions in one dimension. We give an alternative proof of his result using the language of fermions and extend the result to noninteracting fermions with arbitrary pairwise interactions, where gates can be conditioned on outcomes of complete von Neumann measurements in the computational basis on other fermionic modes in the circuit. This last result is in remarkable contrast with the case of noninteracting bosons where universal quantum computation can be achieved by allowing gates to be conditioned on classical bits [E. Knill, R. Laflamme, and G. Milburn, Nature (London) 409, 46 (2001)].

Abstract: Quantum computation is based on implementing selected unitary transformations representing algorithms. A generalized optimal control theory is used to find the driving field that generates a prespecified unitary transformation. The approach is independent of the physical implementation of the quantum computer and it is illustrated for one and two qubit gates in model molecular systems, where only part of the Hilbert space is used for computation.

Abstract: A model of quantum computation based on unitary matrix operations was introduced by Feynman and Deutsch. It has been asked whether the power of this model exceeds that of classical Turing machines. We show here that a significant class of these quantum computations can be simulated classically in polynomial time. In particular we show that two-bit operations characterized by 4 × 4 matrices in which the sixteen entries obey a set of five polynomial relations can be composed according to certain rules to yield a class of circuits that can be simulated classically in polynomial time. This contrasts with the known universality of two-bit operations and demonstrates that efficient quantum computation of restricted classes is reconcilable with the Polynomial Time Turing Hypothesis. Therefore, it is possible that, The techniques introduced bring the quantum computational model within the realm of algebraic complexity theory. In a manner consistent with one view of quantum physics, the wave function is simulated deterministically, and randomization arises only in the course of making measurements. The results generalize the quantum model in that they do not require the matrices to be unitary. In a different direction these techniques also yield deterministic polynomial time algorithms for the decision and parity problems for certain classes of read-twice Boolean formulae. All our results are based on the use of gates that are defined in terms of their graph matching properties.

Abstract: We propose an experimentally feasible scheme to achieve quantum computation based on nonadiabatic geometric phase shifts, in which a cyclic geometric phase is used to realize a set of universal quantum gates. Physical implementation of this set of gates is designed for Josephson junctions and for NMR systems. Interestingly, we find that the nonadiabatic phase shift may be independent of the operation time under appropriate controllable conditions. A remarkable feature of the present nonadiabatic geometric gates is that there is no intrinsic limitation on the operation time.

Abstract: A new physical implementation for quantum computation is proposed. The vibrational modes of molecules are used to encode qubit systems. Global quantum logic gates are realized using shaped femtosecond laser pulses which are calculated applying optimal control theory. The scaling of the system is favorable; sources for decoherence can be eliminated. A complete set of one- and two-quantum gates is presented for a specific molecule. Detailed analysis regarding experimental realization shows that the structural resolution of today's pulse shapers is easily sufficient for pulse formation.

Abstract: We analyse the quantum walk in higher spatial dimensions and compare classical and quantum spreading as a function of time. Tensor products of Hadamard transformations and the discrete Fourier transform arise as natural extensions of the 'quantum coin toss' in the one-dimensional walk simulation, and other illustrative transformations are also investigated. We find that entanglement between the dimensions serves to reduce the rate of spread of the quantum walk. The classical limit is obtained by introducing a random phase variable.

Abstract: We describe a protocol for continuously protecting unknown quantum states from decoherence that incorporates design principles from both quantum error correction and quantum feedback control. Our protocol uses continuous measurements and Hamiltonian operations, which are weaker control tools than are typically assumed for quantum error correction. We develop a cost function appropriate for unknown quantum states and use it to optimize our state-estimate feedback. Using Monte Carlo simulations, we study our protocol for the three-qubit bit-flip code in detail and demonstrate that it can improve the fidelity of quantum states beyond what is achievable using quantum error correction when the time between quantum error-correction cycles is limited.

Abstract: Radio-frequency pulses are used in nuclear-magnetic-resonance spectroscopy to produce unitary transfer of states. Pulse sequences that accomplish a desired transfer should be as short as possible in order to minimize the effects of relaxation, and to optimize the sensitivity of the experiments. Many coherence-transfer experiments in NMR, involving a network of coupled spins, use temporary spin decoupling to produce desired effective Hamiltonians. In this paper, we demonstrate that significant time can be saved in producing an effective Hamiltonian if spin decoupling is avoided. We provide time-optimal pulse sequences for producing an important class of effective Hamiltonians in three-spin networks. These effective Hamiltonians are useful for coherence-transfer experiments in three-spin systems and implementation of indirect swap and ${\ensuremath{\Lambda}}_{2}(U)$ gates in the context of NMR quantum computing. It is shown that computing these time-optimal pulses can be reduced to geometric problems that involve computing sub-Riemannian geodesics. Using these geometric ideas, explicit expressions for the minimum time required for producing these effective Hamiltonians, transfer of coherence, and implementation of indirect swap gates, in a three-spin network are derived (Theorems 1 and 2). It is demonstrated that geometric control techniques provide a systematic way of finding time-optimal pulse sequences for transferring coherence and synthesizing unitary transformations in quantum networks, with considerable time savings (e.g., 42.3% for constructing indirect swap gates).

Abstract: Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical secret key want to exchange a classical message with the guarantee that the message has not been modified or replaced by a dishonest party with control of the communication line. In this paper we study the authentication of messages composed of quantum states. We give a formal definition of authentication in the quantum setting. Assuming A and B have access to an insecure quantum channel and share a secret, classical random key, we provide a non-interactive scheme that enables A to both encrypt and authenticate an m qubit message by encoding it into m+s qubits, where the error probability decreases exponentially in the security parameter s. The scheme requires a secret key of size 2m+O(s). To achieve this, we give a highly efficient protocol for testing the purity of shared EPR pairs. It has long been known that learning information about a general quantum state will necessarily disturb it. We refine this result to show that such a disturbance can be done with few side effects, allowing it to circumvent cryptographic protections. Consequently, any scheme to authenticate quantum messages must also encrypt them. In contrast, no such constraint exists classically. This reasoning has two important consequences: It allows us to give a lower bound of 2m key bits for authenticating m qubits, which makes our protocol asymptotically optimal. Moreover, we use it to show that digitally signing quantum states is impossible.

Abstract: From the Publisher: Among the most exciting developments in science today is the design and construction of the quantum computer. Its realization will be the result of multidisciplinary efforts, but ultimately, it is mathematics that lies at the heart of theoretical quantum computer science.Mathematics of Quantum Computation brings together leading computer scientists, mathematicians, and physicists to provide the first interdisciplinary but mathematically focused exploration of the field's foundations and state of the art. Each section of the book addresses an area of major research, and does so with introductory material that brings newcomers quickly up to speed. Chapters that are more advanced include recent developments not yet published in the open literature.Information technology will inevitably enter into the realm of quantum mechanics, and, more than all the atomic, molecular, optical, and nanotechnology advances, it is the device-independent mathematics that is the foundation of quantum computer and information science. Mathematics of Quantum Computation offers the first up-to-date coverage that has the technical depth and breadth needed by those interested in the challenges being confronted at the frontiers of research.