相关论文: Fast Quantum Computing with Buckyballs

Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally…

A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of…

A quantum computer consists of a set of quantum bits upon which operations called gates are applied to perform computations. In order to perform quantum algorithms, physicists would like to design arbitrary gates to apply to quantum bits.…

Much recent work on distributed quantum computing have focused on the use of entangled pairs and distributed two qubit gates. But there has also been work on efficient schemes for achieving multipartite entanglement between nodes in a…

Heisenberg spin chains can act as quantum wires transferring quantum states either perfectly or with high fidelity. Gaussian packets of excitations passing through dual rails can encode the two states of a logical qubit, depending on which…

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…

By analyzing the key properties of black holes from the point of view of quantum information, we derive a model-independent picture of black hole quantum computing. It has been noticed that this picture exhibits striking similarities with…

Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme…

Efficient quantum-state transfer is achieved in a uniformly coupled spin-1/2 chain, with open boundaries, by application of local magnetic fields on the second and last-but-one spins, respectively. These effective \textit{barriers} induce…

A new method for quantum computation in the presence of detected spontaneous emission is proposed. The method combines strong and fast (dynamical decoupling) pulses and a quantum error correcting code that encodes $n$ logical qubits into…

Quantum devices are preparing increasingly more complex entangled quantum states. How can one effectively study these states in light of their increasing dimensions? Phase spaces such as Wigner functions provide a suitable framework. We…

Geometric phases induced in quantum evolutions have built-in noise-resilient characters, and thus can find applications in many robust quantum manipulation tasks. Here, we propose a feasible and fast scheme for universal quantum computation…

Continuous-variable cluster states offer a potentially promising method of implementing a quantum computer. This paper extends and further refines theoretical foundations and protocols for experimental implementation. We give a…

We first consider the basic requirements for a quantum computer, arguing for the attractiveness of nuclear spins as information-bearing entities, and light for the coupling which allows quantum gates. We then survey the strengths of and…

We discuss the realization of a universal set of ultrafast single- and two-qubit operations with superconducting quantum circuits and investigate the most relevant physical and technical limitations that arise when pushing for faster and…

We present efficient circuits that can be used for the phase space tomography of quantum states. The circuits evaluate individual values or selected averages of the Wigner, Kirkwood and Husimi distributions. These quantum gate arrays can be…

A potential quantum information processor is proposed using a fullerene peapod, i.e., an array of the endohedral fullerenes 15N@C60 or 31P@C60 contained in a single walled carbon nanotube (SWCNT). The qubits are encoded in the nuclear spins…

We propose a scalable quantum-computing architecture based on cold atoms confined to sites of a tight optical lattice. The lattice is placed in a non-uniform magnetic field and the resulting Zeeman sublevels define qubit states. Microwave…

An architecture for a quantum computer is presented in which spins associated with donors in silicon function as qubits. Quantum operations on the spins are performed using a combination of voltages applied to gates adjacent to the spins…

Feynman's circuit-to-Hamiltonian construction enables the mapping of a quantum circuit to a time-independent Hamiltonian. This model introduces a Hilbert space made from an ancillary clock register tracking the progress of the computation.…