Related papers: Quantum ground-mode computation with static gates
Quantum computation using electron spins in three coupled dot with different size is proposed. By using the energy selectivity of both photon assisted tunneling and spin rotation of electrons, logic gates are realized by static and…
Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…
Realizing error-corrected logical qubits is a central goal for the current development of digital quantum computers. Neutral atoms offer the opportunity to coherently shuttle atoms for realizing efficient quantum error correction based on…
We show that universal quantum computation can be performed within the ground state of a topologically ordered quantum system, which is a naturally protected quantum memory. In particular, we show how this can be achieved using brane-net…
We propose a method for implementation of a quantum computer using artificial molecules. The artificial molecule consists of two coupled quantum dots stacked along z direction and one single electron. One-qubit and two-qubit gates are…
Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…
In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically…
We examine the ability of gate-based continuous-variable quantum computers to outperform qubit or discrete-variable quantum computers. Gate-based continuous-variable operations refer to operations constructed using a polynomial sequence of…
We present a multi-step quantum algorithm for solving the $3$-bit exact cover problem, which is one of the NP-complete problems. Unlike the brute force methods have been tried before, in this algorithm, we showed that by applying the…
Quantum computers have long been expected to efficiently solve complex classical differential equations. Most digital, fault-tolerant approaches use Carleman linearization to map nonlinear systems to linear ones and then apply quantum…
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…
A computational problem fed into a gate-model quantum computer identifies an objective function with a particular computational pathway (objective function connectivity). The solution of the computational problem involves identifying a…
The computational efficiency of quantum mechanics can be defined in terms of the qubit circuit model, which is characterized by a few simple properties: each computational gate is a reversible transformation in a connected matrix group;…
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other…
We show how to realize, by means of non-abelian quantum holonomies, a set of universal quantum gates acting on decoherence-free subspaces and subsystems. In this manner we bring together the quantum coherence stabilization virtues of…
Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…
A geometrical approach to quantum computation is presented, where a non-abelian connection is introduced in order to rewrite the evolution operator of an energy degenerate system as a holonomic unitary. For a simple geometrical model we…
We present a new approach to quantum computation involving the geometric phase. In this approach, an entire computation is performed by adiabatically evolving a suitably chosen quantum system in a closed circuit in parameter space. The…
Quantum computing allows for the manipulation of highly correlated states whose properties quickly go beyond the capacity of any classical method to calculate. Thus one natural problem which could lend itself to quantum advantage is the…
Boolean networks have been used successfully in modeling biological networks and provide a good framework for theoretical analysis. However, the analysis of large networks is not trivial. In order to simplify the analysis of such networks,…