Related papers: Universal quantum computation and simulation using…
The physics of quantum mechanics is the inspiration for, and underlies, quantum computation. As such, one expects physical intuition to be highly influential in the understanding and design of many quantum algorithms, particularly…
We present a scheme to efficiently simulate, with a classical computer, the dynamics of multipartite quantum systems on which the amount of entanglement (or of correlations in the case of mixed-state dynamics) is conveniently restricted.…
Simple constructions and protocols are demonstrated to allow the implementation of universal quantum computation on an arbitrarily large quantum system by controlling a fixed number of spins, vastly reducing the engineering requirements in…
Universal quantum computation encoded over continuous variables can be achieved via Gaussian measurements acting on entangled non-Gaussian states. However, due to the weakness of available nonlinearities, generally these states can only be…
Simulation of quantum systems is notoriously challenging for classical computers, while quantum hardware is naturally well-suited for this task. However, the imperfections of contemporary quantum systems poses a considerable challenge in…
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…
We revisit the question of universality in quantum computing and propose a new paradigm. Instead of forcing a physical system to enact a predetermined set of universal gates (e.g., single-qubit operations and CNOT), we focus on the…
We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
We study the quantum computational power of a generic class of anisotropic solid state Hamiltonians. A universal set of encoded logic operations are found which do away with difficult-to-implement single-qubit gates in a number of quantum…
We discuss classical and quantum computations in terms of corresponding Hamiltonian dynamics. This allows us to introduce quantum computations which involve parallel processing of both: the data and programme instructions. Using mixed…
Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…
Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations.…
We consider the simulation of the dynamics of one nonlocal Hamiltonian by another, allowing arbitrary local resources but no entanglement nor classical communication. We characterize notions of simulation, and proceed to focus on…
We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the…
It is shown that if one can perform a restricted set of fast manipulations on a quantum system, one can implement a large class of dynamical evolutions by effectively removing or introducing selected Hamiltonians. The procedure can be used…
We propose a protocol to realize quantum simulation and computation in spin systems with long-range interactions. Our approach relies on the local addressing of single spins with external fields parametrized by Walsh functions. This enables…
We characterise a model of universal quantum computation where the register (computational) qubits are controlled by ancillary qubits, using only a single fixed interaction between register and ancillary qubits. No additional access is…
We present a novel method to simulate the Lindblad equation, drawing on the relationship between Lindblad dynamics, stochastic differential equations, and Hamiltonian simulations. We derive a sequence of unitary dynamics in an enlarged…
While quantum simulation is one of the most promising applications of modern quantum devices, accessible simulation times are fundamentally limited by finite coherence times due to omnipresent noise. Based on the ideas of relational…