Related papers: Quantum computation with surface-state electrons b…
A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g.…
NOON states play the important roles in quantum information processings and quantum metrology, but the fidelities of these states generated previously are limited typically by the practically-unavoidable decoherence and operational…
It is suggested to map the qubits into solid state NMR spin system collective states instead of the states of the individual spin. Such an approach introduces the stable computational basis without any additional actions and allows to…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Quantum state manipulation with gates based on geometric phases acquired during cyclic operations promises inherent fault-tolerance and resilience to local fluctuations in the control parameters. Here we create a general non-Abelian and…
The observation that concepts from quantum information has generated many alternative indicators of quantum phase transitions hints that quantum phase transitions possess operational significance with respect to the processing of quantum…
We propose an efficient approach for deterministically generating scalable cluster states with photons. This approach involves unitary transformations performed on atoms coupled to optical cavities. Its operation cost scales linearly with…
In this paper, we explore how to constructively manipulate qubits by rotating Bloch spheres. It is revealed that three-rotation and one-rotation Hamiltonian controls can be constructed to steer qubits when two tunable Hamiltonian controls…
The system of electrons trapped in vacuum above the liquid helium surface displays the highest mobilities known in condensed matter physics. We provide a brief summary of the experimental and theoretical results obtained for this system. We…
We describe in detail a set of ideas for implementing qubits, quantum gates and quantum gate networks in a semiconductor heterostructure device. Our proposal is based on an extension of the technology used for surface acoustic wave (SAW)…
A scenario for realization of a quantum computer is proposed consisting of spatially distributed q-bits fabricated in a host structure where nuclear spin-spin coupling is mediated by laser pulse controlled electron-nuclear transferred…
We describe how one may go about performing quantum computation with arbitrary "quantum stuff", as long as it has some basic physical properties. Imagine a long strip of stuff, equipped with regularly spaced wires to provide input settings…
High-fidelity qubit initialization is of significance for efficient error correction in fault tolerant quantum algorithms. Combining two best worlds, speed and robustness, to achieve high-fidelity state preparation and manipulation is…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…
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…
Quantum computing exploits the quantum-mechanical nature of matter to exist in multiple possible states simultaneously. This new approach promises to revolutionize the present form of computing. As an approach to quantum computing, we…
In the holonomic approach to quantum computation information is encoded in a degenerate eigenspace of a parametric family of Hamiltonians and manipulated by the associated holonomic gates. These are realized in terms of the non-abelian…
We propose a general scheme for dissipatively preparing arbitrary pure quantum states on a multipartite qubit register in a finite number of basic control blocks. Our "splitting-subspace" approach relies on control resources that are…
The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum…
Many claims of computational advantages have been made for quantum computing over classical, but they have not been demonstrated for practical problems. Here, we present algorithms for solving time-dependent PDEs, with particular reference…