Related papers: Universal quantum computing and three-manifolds
To each local field (including the real or complex numbers) we associate a quantum dilogarithm and show that it satisfies a pentagon identity and some symmetries. Using an angled version of these quantum dilogarithms, we construct three…
Complex projective t-designs, particularly SICs and full sets of MUBs, play an important role in quantum information. We introduce a generalization which we call conical t-designs. They include arbitrary rank symmetric informationally…
The attempted classification of regular algebras of global dimension four, so-called quantum $\mathbb P^3$s, has been a driving force for modern research in noncommutative algebra. Inspired by the work of Artin, Tate, and Van den Bergh,…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
We explore a way of universal quantum computation with particles which cannot occupy the same position simultaneously and are symmetric under exchange of particle labels. Therefore the associated creation and annihilation operators are…
The general method of Reshetikhin and Turaev is followed to develop topological invariants of closed, connected, orientable 3-manifolds from a new class of algebras called pseudo-modular Hopf algebras. Pseudo-modular Hopf algebras are a…
Hilbert space operators may be mapped onto a space of ordinary functions (operator symbols) equipped with an associative (but noncommutative) star-product. A unified framework for such maps is reviewed. Because of its clear probabilistic…
In this paper we shall introduce the mathematical framework for the description of measurements of quantum processes. Using this framework the process estimation problems can be treated in the similar way as the state estimation problems,…
We introduce the monoidal closed category qCPO of quantum cpos, whose objects are "quantized" analogs of omega-complete partial orders (cpos). The category qCPO is enriched over the category CPO of cpos, and contains both CPO, and the…
A modern computer system, based on the von Neumann architecture, is a complicated system with several interactive modular parts. Quantum computing, as the most generic usage of quantum information, follows a hybrid architecture so far,…
A generalized Bloch sphere, in which the states of a quantum entity of arbitrary dimension are geometrically represented, is investigated and further extended, to also incorporate the measurements. This extended representation constitutes a…
The quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingredients of QFT are formed by the Walsh-Hadamard transform H and phase shifts P(.), both of which are 2x2 unitary matrices as operators on the…
Qubits are a great way to build a quantum computer, but a limited way to program one. We replace the usual "states and gates" formalism with a "props and ops" (propositions and operators) model in which (a) the C*-algebra of observables…
In the field of quantum information science and technology, the representation and visualization of quantum states and related processes are essential for both research and education. In this context, a focus especially lies on ensembles of…
We consider the existence in arbitrary finite dimensions d of a POVM comprised of d^2 rank-one operators all of whose operator inner products are equal. Such a set is called a ``symmetric, informationally complete'' POVM (SIC-POVM) and is…
A quantum measurement, often referred to as positive operator-valued measurement (POVM), is a set of positive operators $P_j=P_j^\dag\geq 0$ summing to identity, $\sum_jP_j=\mathbb{1}$. This can be seen as a generalization of a probability…
The authors previously found a model of universal quantum computation by making use of the coset structure of subgroups of a free group $G$ with relations. A valid subgroup $H$ of index $d$ in $G$ leads to a 'magic' state…
We propose a scheme for scalable and universal quantum computation using diatomic bits with conditional dipole-dipole interaction, trapped within an optical lattice. The qubit states are encoded by the scattering state and the bound…
This is a comprehensive review on fault-tolerant topological quantum computation with the surface codes. The basic concepts and useful tools underlying fault-tolerant quantum computation, such as universal quantum computation, stabilizer…
The one-way quantum computer (QCc) is a universal scheme of quantum computation consisting only of one-qubit measurements on a particular entangled multi-qubit state, the cluster state. The computational model underlying the QCc is…