Related papers: Weighing matrices and optical quantum computing
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…
It has been over ten years since Kane's influential proposal for a silicon-based nuclear spin quantum computer using phosphorous donors. Since then, silicon-based architectures have been refined as the experimental challenges associated…
In this survey the possible approaches to the description of the evolution of states of quantum many-particle systems by means of the possible modifications of the density operator which kernel known as density matrix are considered. In…
Several physical architectures allow for measurement-based quantum computing using sequential preparation of cluster states by means of probabilistic quantum gates. In such an approach, the order in which partial resources are combined to…
We show that quantum computation circuits using coherent states as the logical qubits can be constructed from simple linear networks, conditional photon measurements and "small" coherent superposition resource states.
We interpret quantum computing as a geometric evolution process by reformulating finite quantum systems via Connes' noncommutative geometry. In this formulation, quantum states are represented as noncommutative connections, while gauge…
In these notes we explore a variety of models comprising a large number of constituents. An emphasis is placed on integrals over large Hermitian matrices, as well as quantum mechanical models whose degrees of freedom are organised in a…
We discuss the question of the existence of quantum one-way permutations. First, we prove the equivalence between inverting a permutation and that of constructing a polynomial size network for reflecting about a given quantum state. Next,…
Understanding the computational overheads imposed by classical control systems on quantum computing platforms becomes critically important as these quantum machines grow in scale and complexity. In this work, we calculate the overheads…
Quantum computing is concerned with computer technology based on the principles of quantum mechanics, with operations performed at the quantum level. Quantum computational models make it possible to analyze the resources required for…
We study the equivalence of mixed states under local unitary transformations. First we express quantum states in Bloch representation. Then based on the coefficient matrices, some invariants are constructed. This method and results can be…
Measurement-based quantum computation is a framework of quantum computation, where entanglement is used as a resource and local measurements on qubits are used to drive the computation. It originates from the one-way quantum computer of…
One way quantum computing uses single qubit projective measurements performed on a cluster state (a highly entangled state of multiple qubits) in order to enact quantum gates. The model is promising due to its potential scalability; the…
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…
Quantum state tomography, the ability to deduce the density matrix of a quantum system from measured data, is of fundamental importance for the verification of present and future quantum devices. It has been realized in systems with few…
The construction of large-scale quantum computers will require modular architectures that allow physical resources to be localized in easy-to-manage packages. In this work, we examine the impact of different graph structures on the…
Graph states (or cluster states) are the entanglement resource that enables one-way quantum computing. They can be grown by projective measurements on the component qubits. Such measurements typically carry a significant failure…
Coalgebras generalize various kinds of dynamical systems occuring in mathematics and computer science. Examples of systems that can be modeled as coalgebras include automata and Markov chains. We will present a coalgebraic representation of…
We introduce the notion of quantum computational webs: These are quantum states universal for measurement-based computation which can be built up from a collection of simple primitives. The primitive elements - reminiscent of building…
We describe how one may go about performing quantum computation with arbitrary "quantum stuff", as long as it has some basic physical properties. Imagine a long strip of stuff, equipped with regularly spaced wires to provide input settings…