Related papers: Universal quantum computing and three-manifolds
Measurement-based quantum computing (MBQC) is a universal model for quantum computation. The combinatorial characterisation of determinism in this model, powered by measurements, and hence, fundamentally probabilistic, is the cornerstone of…
Starting with the first-order singular Lagrangian, the canonical structures of the noncommutative quantum system on a submanifold embedded in the higher-dimensional Euclidean space are investigated with the projection operator method (POM)…
This is a study of orbifold-quotients of quantum groups (quantum orbifolds $\Theta \rightrightarrows G_q$). These structures have been studied extensively in the case of the quantum $SU_2$ group. I will introduce a generalized mechanism…
It is a well-known fact that the optimal POVM for quantum state tomography is the symmetric, informationally complete, positive operator valued measure (SIC-POVM). We investigate the same problem only in the case when there are some a…
Generalized flag manifolds endowed with the Bruhat-Poisson bracket are compact Poisson homogeneous spaces, whose decompositions in symplectic leaves coincide with their stratifications in Schubert cells. In this note it is proved that the…
The Bloch Sphere visualization of the possible states of a single qubit has proved a useful pedagogical and conceptual tool as a one-to-one map between qubit states and points in a 3-D space. However, understanding many important concepts…
We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed,…
In topological quantum computation, quantum information is stored in states which are intrinsically protected from decoherence, and quantum gates are carried out by dragging particle-like excitations (quasiparticles) around one another in…
Quantum state tomography seeks to reconstruct an unknown state from measurement statistics. A finite measurement (POVM) is \emph{pure-state informationally complete} (PSI-Complete) if the outcome probabilities determine any pure state up to…
A medium-scale quantum computer with full universal quantum computing capability is necessary for various practical aims and testing applications. Here we report a 34-qubit quantum virtual machine (QtVM) based on a medium server. Our QtVM…
It is shown that there exists a mapping between the fermions of the Standard Model (SM) represented as braids in the Bilson-Thompson model, and a set of gates which can perform Universal Quantum Computation (UQC). This leads us to…
The conventional paradigm of quantum computing is discrete: it utilizes discrete sets of gates to realize bitstring-to-bitstring mappings, some of them arguably intractable for classical computers. In parameterized quantum approaches, the…
Deutsch, Feynman, and Manin viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a…
We present a finite set of projective measurements that, together with quantum memory and preparation of the |0> state, suffice for universal quantum computation. This extends work of Nielsen [quant-ph/0108020], who proposed a scheme in…
One of the fundamental conditions for one-way quantum computation (1WQC) is the ability to make sequential measurements on isolated qubits that comprise the highly entangled resource for 1WQC, the cluster state. This has been a significant…
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…
Let $\mathfrak{g}$ be a semi-simple Lie algebra with fixed root system, and $U_q(\mathfrak{g})$ the quantization of its universal enveloping algebra. Let $\mathcal{S}$ be a subset of the simple roots of $\mathfrak{g}$. We show that the…
Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates…
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…
Quantum computing is rapidly gaining popularity, necessitating intuitive visualization tools for complex quantum states. While the Bloch Sphere effectively visualizes single-qubit states, it fundamentally lacks scalability for multi-qubit…