Related papers: Experimental One-Way Quantum Computing
We propose an experimental design for universal continuous-variable quantum computation that incorporates recent innovations in linear-optics-based continuous-variable cluster state generation and cubic-phase gate teleportation. The first…
We show how to perform measurement-based quantum computing on qudits (high-dimensional quantum systems) using alternative resource states beyond the cluster state. Estimating overheads for gate decomposition, we find that generalizing…
Quantum process tomography (QPT) methods aim at identifying a given quantum process. The present paper focuses on the estimation of a unitary process. This class is of particular interest because quantum mechanics postulates that the…
The key obstacle to the realization of a scalable quantum computer is overcoming environmental and control errors. Topological quantum computation has attracted great attention because it has emerged as one of the most promising approaches…
The von Neumann and quantum R\'enyi entropies characterize fundamental properties of quantum systems and lead to theoretical and practical applications in many fields. Quantum algorithms for estimating quantum entropies, using a quantum…
Universal set of quantum gates are realized from the conduction-band electron spin qubits of quantum dots embedded in a microcavity via two-channel Raman interaction. All of the gate operations are independent of the cavity mode states,…
A quantum computer is a multi-particle interferometer that comprises beam splitters at both ends and arms, where the n two-level particles undergo the interactions among them. The arms are designed so that relevant functions required to…
Quantum process tomography is an experimental technique to fully characterize an unknown quantum process. Standard quantum process tomography suffers from exponentially scaling of the number of measurements with the increasing system size.…
Implementing quantum algorithms is essential for quantum computation. We study the implementation of three quantum algorithms by performing homodyne measurements on a two-dimensional temporal continuous-variable cluster state. We first…
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…
Quantum computation in the one-way model requires the preparation of certain resource states known as cluster states. We describe how the construction of continuous-variable cluster states for optical quantum computing relate to the…
We study how heralded qubit losses during the preparation of a two-dimensional cluster state, a universal resource state for one-way quantum computation, affect its computational power. Above the percolation threshold we present a…
In this paper we argue that one-way quantum computation can be seen as a form of phase transition with the available information about the solution of the computation being the order parameter. We draw a number of striking analogies between…
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…
An algebraic analysis of Grover's quantum search algorithm is presented for the case in which the initial state is an arbitrary pure quantum state of n qubits. This approach reveals the geometrical structure of the quantum search process,…
We consider a unitary transformation which maps any given state of an $n$-qubit quantum register into another one. This transformation has applications in the initialization of a quantum computer, and also in some quantum algorithms.…
In measurement-based quantum computation, quantum algorithms are implemented via sequences of measurements. We describe a translationally invariant finite-range interaction on a one-dimensional qudit chain and prove that a single-shot…
Quantum algorithms are known for presenting more efficient solutions to certain computational tasks than any corresponding classical algorithm. It has been thought that the origin of the power of quantum computation has its roots in…
The essential operations of a quantum computer can be accomplished using solely optical elements, with different polarization or spatial modes representing the individual qubits. We present a simple all-optical implementation of Grover's…
We propose a scalable and robust architecture for one-way quantum computation using coupled networks of superconducting transmission line resonators. In our protocol, quantum information is encoded into the long-lived photon states of the…