Related papers: Quantum Computation with Harmonic Oscillators
This note presents a simple and unified formulation of the most fundamental structures used in quantum information with qubits, arbitrary dimension qudits, and quantum continuous variables. This \emph{general quantum variables} construction…
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…
The main ideas of quantum error correction are introduced. These are encoding, extraction of syndromes, error operators, and code construction. It is shown that general noise and relaxation of a set of 2-state quantum systems can always be…
Compilation optimizes quantum algorithms performances on real-world quantum computers. To date, it is performed via classical optimization strategies. We introduce a class of quantum algorithms to perform compilation via quantum computers,…
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…
We propose a scheme for realizing the scalable quantum computation based on nonidentical quantum dots trapped in a single-mode waveguide. In this system, the quantum dots simultaneously interact with a large detuned waveguide and classical…
We introduce a scheme to perform universal quantum computation in quantum cellular automata (QCA) fashion in arbitrary subsystem dimension (not necessarily finite). The scheme is developed over a one spatial dimension $N$-element array,…
We obtain sufficient conditions for the efficient simulation of a continuous variable quantum algorithm or process on a classical computer. The resulting theorem is an extension of the Gottesman-Knill theorem to continuous variable quantum…
We provide a theoretical framework for encoding arbitrary logical states of a quantum bit (qubit) into a continuous-variable quantum mode through quantum walks. Starting with a squeezed-vacuum state of the quantum mode, we show that quantum…
We show how to use relativistic motion and local phase shifts to generate continuous variable Gaussian cluster states within cavity modes. Our results can be demonstrated experimentally using superconducting circuits where tuneable boundary…
In this brief review we describe the idea of holonomic quantum computation. The idea of geometric phase and holonomy is introduced in a general way and we provide few examples that should help the reader understand the issues involved.
Holonomic Quantum Computation (HQC) is an all-geometrical approach to quantum information processing. In the HQC strategy information is encoded in degenerate eigen-spaces of a parametric family of Hamiltonians. The computational network of…
Both discrete and continuous systems can be used to encode quantum information. Most quantum computation schemes propose encoding qubits in two-level systems, such as a two-level atom or an electron spin. Others exploit the use of an…
Natural frequencies and normal modes are basic properties of a structure which play important roles in analyses of its vibrational characteristics. As their computation reduces to solving eigenvalue problems, it is a natural arena for…
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 novel strategy, based on the use of modular variables, to encode and deterministically process quantum information using states described by continuous variables. Our formalism leads to a general recipe to adapt existing…
Quantum computers are expected to be able to solve mathematical problems that cannot be solved using conventional computers. Many of these problems are of practical importance, especially in the areas of cryptography and secure…
Computation is an input-output process, where a program encoding a problem to be solved is inserted into a machine that outputs a solution. Quantum computation conventionally relies on classical, external control outside the quantum…
We show that quantum computation can be performed in a system at thermal equilibrium if a spontaneous symmetry breaking occurs. The computing process is associated to the time evolution of the statistical average of the qubit coherence…
A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition. Here we…