Related papers: Static Quantum Computation
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
Gate-model quantum computers can allow quantum computations in near-term implementations. The stabilization of an optimal quantum state of a quantum computer is a challenge, since it requires stable quantum evolutions via a precise…
We investigate the computational power of creating steady-states of quantum dissipative systems whose evolution is governed by time-independent and local couplings to a memoryless environment. We show that such a model allows for efficient…
One of the limitations to the quantum computing capability of a continuous-variable system is determined by our ability to cool it to the ground state, because pure logical states, in which we accurately encode quantum information, are…
This article is a short introduction to and review of the cluster-state model of quantum computation, in which coherent quantum information processing is accomplished via a sequence of single-qubit measurements applied to a fixed quantum…
The construction of a universal static quantum computer actually provides another proof of the NP-hardness of spin-glass problems.
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…
I provide an alternative way of seeing quantum computation. First, I describe an idealized classical problem solving machine that, thanks to a many body interaction, reversibly and nondeterministically produces the solution of the problem…
Continuous-variable quantum computing utilizes continuous parameters of a quantum system to encode information, promising efficient solutions to complex problems. Trapped-ion systems provide a robust platform with long coherence times and…
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…
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…
Preparing the ground state of a system of interacting classical particles is an NP-hard problem. Thus, there is in general no better algorithm to solve this problem than exhaustively going through all N configurations of the system to…
We develop a computation model for solving Boolean networks that implements wires through quantum ground-state computation and implements gates through identities following from angular momentum algebra and statistics. The gates are static…
The ability to perform a universal set of quantum operations based solely on static resources and measurements presents us with a strikingly novel viewpoint for thinking about quantum computation and its powers. We consider the two major…
Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time…
We describe a solid state implementation of a quantum computer using ballistic single electrons as flying qubits in 1D nanowires. We show how to implement all the steps required for universal quantum computation: preparation of the initial…
We develop a computation model for solving Boolean networks by implementing wires through quantum ground-mode computation and gates through identities following from angular momentum algebra and statistics. Gates are represented by…
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 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…
One-way quantum computing achieves the full power of quantum computation by performing single particle measurements on some many-body entangled state, known as the resource state. As single particle measurements are relatively easy to…