Related papers: Integrable Quantum Computation
The commonly used circuit model of quantum computing leaves out the problems of imprecision in the initial state preparation, particle statistics (indistinguishability of particles belonging to the same quantum state), and error correction…
We present a concise but complete conceptual treatment of quantum computing implemented with Cavity Quantum Electrodynamics (CQED. The paper is intended as a brief overview for professionals who are coming over to the field from other areas…
Variational quantum algorithms dominate contemporary gate-based quantum enhanced optimisation, eigenvalue estimation and machine learning. Here we establish the quantum computational universality of variational quantum computation by…
For every quantized Lie algebra there exists a map from the tensor square of the algebra to itself, which by construction satisfies the set-theoretic Yang-Baxter equation. This map allows one to define an integrable discrete quantum…
The paradigm of measurement-based quantum computation opens new experimental avenues to realize a quantum computer and deepens our understanding of quantum physics. Measurement-based quantum computation starts from a highly entangled…
We show that quantum computation circuits with coherent states as the logical qubits can be constructed using very simple linear networks, conditional measurements and coherent superposition resource states.
Formulating quantum integrability for nonultralocal models (NM) parallel to the familiar approach of inverse scattering method is a long standing problem. After reviewing our result regarding algebraic structures of ultralocal models, we…
We consider an example of a quantum algorithm from the point of view of the de Broglie-Bohm formulation of quantum mechanics. For concreteness we look at two particular implementations: one using spin-1/2 particles as described by a simple…
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…
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…
The number of qubits in current quantum computers is a major restriction on their wider application. To address this issue, Ying conceived of using two or more small-capacity quantum computers to produce a larger-capacity quantum computing…
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…
In certain approaches to quantum computing the operations between qubits are non-deterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components;…
Blind quantum computation is a new quantum secure protocol, which enables Alice who does not have enough quantum technology to delegate her computation to Bob who has a fully-fledged quantum power without revealing her input, output and…
Quantum computing is usually associated with discrete quantum states and physical quantities possessing discrete eigenvalue spectrum. However, quantum computing in general is any computation accomplished by the exploitation of quantum…
We propose a complete, quantitative quantum computing system which satisfies the five DiVincenzo criteria. The model is based on magnetic clusters with uniaxial anisotropy, where standard, two-state qubits are formed utilizing the two…
Quantum information theory, particularly its entropic formulations, has made remarkable strides in characterizing quantum systems and tasks. However, a critical dimension remains underexplored: computational efficiency. While classical…
The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum…
We discuss the notion of integrability in quantum mechanics. Starting from a review of some definitions commonly used in the literature, we propose a different set of criteria, leading to a classification of models in terms of different…
Quantum computation in solid state quantum dots faces two significant challenges: Decoherence from interactions with the environment and the difficulty of generating local magnetic fields for the single qubit rotations. This paper presents…