相关论文: Quantum-Statistical Computation

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…

It is proposed to map the quantum information qubit not to individual spin 1/2 states, but to the collective spin states being eigenfunctions of the Hamiltonian including spin-spin interactions, which may be not small. Such an approach…

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…

Measurement-based quantum computation is different from other approaches for quantum computation, in that everything needs to be done is only local measurement on a certain entangled state. It thus uses entanglement as the resource that…

The universal quantum computation is obtained when there exists asymmetric anisotropic exchange between electron spins in coupled semiconductor quantum dots. The asymmetric Heisenberg model can be transformed into the isotropic model…

An electron inside liquid helium forms a bubble of 17 \AA in radius. In an external magnetic field, the two-level system of a spin 1/2 electron is ideal for the implementation of a qubit for quantum computing. The electron spin is well…

The Hubbard model has occupied the minds of condensed matter physicists for most part of the last century. This model provides insight into a range of phenomena in correlated electron systems. We wish to examine the paradigm of quantum…

Quantum computers have the potential to solve certain interesting problems significantly faster than classical computers. To exploit the power of a quantum computation it is necessary to perform inter-qubit operations and generate entangled…

We prove that universal quantum computation is possible using only (i) the physically natural measurement on two qubits which distinguishes the singlet from the triplet subspace, and (ii) qubits prepared in almost any three different…

Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…

The possibility to save and process information in fundamentally indistinguishable states is the quantum mechanical resource that is not encountered in classical computing. I demonstrate that, if energy constraints are imposed, this…

These lecture notes introduce quantum spin systems and several computational methods for studying their ground-state and finite-temperature properties. Symmetry-breaking and critical phenomena are first discussed in the simpler setting of…

It is proposed the scheme of quantum mechanics, in which a Hilbert space and the linear operators are not primary elements of the theory. Instead of it certain variant of the algebraic approach is considered. The elements of noncommutative…

It is widely accepted that the selection of measurement bases can affect the efficiency of quantum state estimation methods, precision of estimating an unknown state can be improved significantly by simply introduce a set of symmetrical…

We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic quantum computation using a one-dimensional quantum system (with…

We present a model for quantum computation using n steady 3-level atoms or 3-level quantum dots, kept inside a quantum electro-dynamics (QED) cavity. Our model allows one-qubit operations and the two-qubit controlled-NOT gate as required…

The principle of teleportation can be used to perform a quantum computation even before its quantum input is defined. The basic idea is to perform the quantum computation at some earlier time with qubits which are part of an entangled…

Quantum computation is a novel way of information processing which allows, for certain classes of problems, exponential speedups over classical computation. Various models of quantum computation exist, such as the adiabatic, circuit and…

Quantum simulation with adiabatic annealing can provide insight into difficult problems that are impossible to study with classical computers. However, it deteriorates when the systems scale up due to the shrinkage of the excitation gap and…

Coherent states offer a promising path for near-term quantum computing due to their inherent protection against bit-flip noise. However, their large photon numbers can be challenging for numerical simulation. This paper introduces an…