Related papers: Non-Hermitian Computers Need No Complex Numbers
Quantum computation based on geometric phase is generally believed to be more robust against certain errors or noises than the conventional dynamical strategy. However, the gate error caused by the decoherence effect is inevitable, and thus…
We introduce a generalized method of holonomic quantum computation (HQC) based on encoding in subsystems. As an application, we propose a scheme for applying holonomic gates to unencoded qubits by the use of a noisy ancillary qubit. This…
Geometric manipulation of a quantum system offers a method for fast, universal, and robust quantum information processing. Here, we propose a scheme for universal all-geometric quantum computation using non-adiabatic quantum holonomies. We…
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.…
Experimental implementations of quantum computer architectures are now being investigated in many different physical settings. The full set of requirements that must be met to make quantum computing a reality in the laboratory [1] is…
An approach to the solution of NP-complete problems based on quantum computing and chaotic dynamics is proposed. We consider the satisfiability problem and argue that the problem, in principle, can be solved in polynomial time if we combine…
Non-adiabatic holonomic quantum computation in decoherence-free subspaces protects quantum information from control imprecisions and decoherence. For the non-collective decoherence that each qubit has its own bath, we show the…
In conventional quantum mechanics, quantum no-deleting and no-cloning theorems indicate that two different and nonorthogonal states cannot be perfectly and deterministically deleted and cloned, respectively. Here, we investigate the quantum…
Unitary operations are the building blocks of quantum programs. Our task is to design effcient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given n-qubit system. The most common…
The nonadiabatic holonomic quantum computation based on three-level systems has wide applicability experimentally due to its simpler energy level structure requirement and inherent robustness from the geometric phase. However, in previous…
In this paper, we firstly briefly review the duality quantum computer. Distinctly, the generalized quantum gates, the basic evolution operators in a duality quantum computer are no longer unitary, and they can be expressed in terms of…
We present a nonlocal construction of universal gates by means of holonomic (geometric) quantum teleportation. The effect of the errors from imperfect control of the classical parameters, the looping variation of which builds up holonomic…
Quantum mechanics features a variety of distinct properties such as coherence and entanglement, which could be explored to showcase potential advantages over classical counterparts in information processing. In general, legitimate quantum…
Universal quantum computers are the only general purpose quantum computers known that can be implemented as of today. These computers consist of a classical memory component which controls the quantum memory. In this paper, the space…
It is not a problem to complement a classical bit, i.e. to change the value of a bit, a 0 to a 1 and vice versa. This is accomplished by a NOT gate. Complementing a qubit in an unknown state, however, is another matter. We show that this…
In theory, quantum computers can efficiently simulate quantum physics, factor large numbers and estimate integrals, thus solving otherwise intractable computational problems. In practice, quantum computers must operate with noisy devices…
Holonomic quantum computation exploits a quantum state's non-trivial, matrix-valued geometric phase (holonomy) to perform fault-tolerant computation. Holonomies arising from systems where the Hamiltonian traces a continuous path through…
We introduce a model of computation based on quaternions, which is inspired on the quantum computing model. Pure states are vectors of a suitable linear space over the quaternions. Other aspects of the theory are the same as in quantum…
Efficient verification of the functioning of quantum devices is a key to the development of quantum technologies, but is a daunting task as the system size increases. Here we propose a simple and general framework for verifying unitary…
It is known that if the quantum gates in a proposed quantum computer are so noisy that they are incapable of generating entanglement, then the device can be efficiently simulated classically. If the measurements and single particle…