Related papers: Lorentz Quantum Computer
A proposal for a scalable, solid-state implementation of a quantum computer is presented. Qubits are fluorine nuclear spins in a solid crystal of fluorapatite [Ca_5 F(PO_4)_3] with resonant frequencies separated by a large field gradient.…
A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results…
We elaborate the idea of quantum computation through measuring the correlation of a gapped ground state, while the bulk Hamiltonian is utilized to stabilize the resource. A simple computational primitive, by pulling out a single spin…
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons…
Computational methods are the most effective tools we have besides scientific experiments to explore the properties of complex biological systems. Progress is slowing because digital silicon computers have reached their limits in terms of…
The essential operations of a quantum computer can be accomplished using solely optical elements, with different polarization or spatial modes representing the individual qubits. We present a simple all-optical implementation of Grover's…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
Quantum computation is based on implementing selected unitary transformations which represent algorithms. A generalized optimal control theory is used to find the driving field that generates a prespecified unitary transformation. The…
We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed,…
We propose an effective realization of the universal set of elementary quantum gates in solid state quantum computer based on macroscopic (or mesoscopic) resonance systems - multi-atomic coherent ensembles, squids or quantum dots in quantum…
Processing quantum information using quantum three-level systems or qutrits as the fundamental unit is an alternative to contemporary qubit-based architectures with the potential to provide significant computational advantages. We…
We show that universal quantum logic can be achieved using only linear optics and a quantum shutter device. With these elements, we design a quantum memory for any number of qubits and a CNOT gate which are the basis of a universal quantum…
The mathematical model of orthodox quantum mechanics has been critically examined and some deficiencies have been summarized. The model based on the extended Hilbert space and free of these shortages has been proposed; parameters being…
Typically, quantum mechanics is thought of as a linear theory with unitary evolution governed by the Schr\"odinger equation. While this is technically true and useful for a physicist, with regards to computation it is an unfortunately…
A new method for simulation of a binary homogeneous Markov process using a quantum computer was proposed. This new method allows using the distinguished properties of the quantum mechanical systems -- superposition, entanglement and…
A quantum computer has a clear advantage over a classical computer for exhaustive search. The quantum mechanical algorithm for exhaustive search was originally derived by using subtle properties of a particular quantum mechanical operation…
A modern computer system, based on the von Neumann architecture, is a complicated system with several interactive modular parts. Quantum computing, as the most generic usage of quantum information, follows a hybrid architecture so far,…
The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It can be understood from the early invented quantum algorithms such as…
The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about computation. It provides a computational model equivalent to the Turing machine, and continues to be of…
The field of linear optical quantum computation (LOQC) will soon need a repertoire of experimental milestones. We make progress in this direction by describing several experiments based on Grover's algorithm. These experiments range from a…