Related papers: Comment on "Towards universal quantum computation …
Loop Quantum Gravity is a theory that attempts to describe the quantum mechanics of the gravitational field based on the canonical quantization of General Relativity. According to Loop Quantum Gravity, in a gravitational field, geometric…
A practical scheme is proposed for creation of continuous variable entangled cluster states of four distinct atomic ensembles located inside a high-finesse ring cavity. The scheme does not require a set of external input squeezed fields, a…
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…
A conception of virtual quantum information bit - virtual qubit - is introduced. It is shown by means of virtual qubit representation that four states of a single quantum particle is enough for implementation of full set of the gates, which…
Measurement-based quantum computing enables universal quantum computing with only adaptive single-qubit measurements on certain many-qubit states, such as the graph state, the Affleck-Kennedy-Lieb-Tasaki (AKLT) state, and several…
We present a method to generate qubits of the vibrational motion of an ion. The method is developed in the non-rotating wave approximation regime, therefore we consider regimes where the dynamics has not been studied. Because the solutions…
Quantum technologies exploit entanglement to enhance various tasks beyond their classical limits including computation, communication and measurements. Quantum metrology aims to increase the precision of a measured quantity that is…
We explore the main processes involved in the evolution of general quantum systems by means of Diagrams of States, a novel method to graphically represent and analyze how quantum information is elaborated during computations performed by…
The possibility of using strongly and continuously interacting spins for quantum computation has recently been discussed. Here we present a simple optical scheme that achieves this goal while avoiding the drawbacks of earlier proposals. We…
Relational Quantum Mechanics (RQM) is an interpretation of quantum theory based on the idea of abolishing the notion of absolute states of systems, in favor of states of systems relative to other systems. Such a move is claimed to solve the…
Following the B. Hiley belief that unresolved problems of conventional quantum mechanics could be the result of a wrong mathematical structure, an alternative basic structure is suggested. Critical part of the structure is modification of…
Quantum computation is the suitable orthogonal encoding of possibly holistic functional properties into state vectors, followed by a projective measurement.
Quantum computing relies on processing information within a quantum system with many continuous degrees of freedom. The practical implementation of this idea requires complete control over all of the 2^n independent amplitudes of a…
We introduce the idea of using adiabatic rotation to generate superpositions of a large class of quantum states. For quantum computing this is an interesting alternative to the well-studied "straight line" adiabatic evolution. In ways that…
A geometrical approach to quantum computation is presented, where a non-abelian connection is introduced in order to rewrite the evolution operator of an energy degenerate system as a holonomic unitary. For a simple geometrical model we…
We show how to efficiently generate pseudo-random states suitable for quantum information processing via cluster-state quantum computation. By reformulating pseudo-random algorithms in the cluster-state picture, we identify a strategy for…
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…
It is often argued that entanglement is at the root of the speedup for quantum compared to classical computation, and that one needs a sufficient amount of entanglement for this speedup to be manifest. In measurement-based quantum computing…
We show the following: a randomly chosen pure state as a resource for measurement-based quantum computation, is - with overwhelming probability - of no greater help to a polynomially bounded classical control computer, than a string of…
It is suggested to map the qubits into solid state NMR spin system collective states instead of the states of the individual spin. Such an approach introduces the stable computational basis without any additional actions and allows to…