Related papers: Toponomic Quantum Computation
A causal set C can describe a discrete spacetime, but this discrete spacetime is not quantum, because C is endowed with Boolean logic, as it does not allow cycles. In a quasi-ordered set Q, cycles are allowed. In this paper, we consider a…
Quantum computation with quantum data that can traverse closed timelike curves represents a new physical model of computation. We argue that a model of quantum computation in the presence of closed timelike curves can be formulated which…
We study the construction of both universal quantum computation and multi-partite entangled states in the topological diagrammatical approach to quantum teleportation. Our results show that the teleportation-based quantum circuit model…
The rotation of subspaces by a chosen angle is a fundamental quantum computing operation, with applications in error correction and quantum algorithms such as the Quantum Approximate Optimization Algorithm, the Variational Quantum…
Logical gates studied in quantum computation suggest a natural logical abstraction that gives rise to a new form of unsharp quantum logic. We study the logical connectives corresponding to the following gates: the Toffoli gate, the NOT and…
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 study the evolution of quantum eigenstates in the presence of level crossing under adiabatic cyclic change of environmental parameters. We find that exotic holonomies, indicated by exchange of the eigenstates after a single cyclic…
Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows…
Quantum computation using electron spins in three coupled dot with different size is proposed. By using the energy selectivity of both photon assisted tunneling and spin rotation of electrons, logic gates are realized by static and…
Nonadiabatic holonomic quantum computation has robust feature in suppressing control errors because of its holonomic feature. However, this kind of robust feature is challenged since the usual way of realizing nonadiabatic holonomic gates…
The controlled-NOT gate of qubit quantum circuits is shown to be described in terms of a Hopf algebra. Accordingly, any qubit quantum circuit can be expressed as the Hopf algebraic computations and unitary transformations on one qubit.
There are well-known protocols for performing CNOT quantum logic with qubits coupled by particular high-symmetry (Ising or Heisenberg) interactions. However, many architectures being considered for quantum computation involve qubits or…
A quantum computer can perform exponentially faster than its classical counterpart. It works on the principle of superposition. But due to the decoherence effect, the superposition of a quantum state gets destroyed by the interaction with…
We describe how continuous-variable abelian anyons, created on the surface of a continuous-variable analogue of Kitaev's lattice model can be utilized for quantum computation. In particular, we derive protocols for the implementation of…
We show that a topological quantum computer based on the evaluation of a Witten-Reshetikhin-Turaev TQFT invariant of knots can always be arranged so that the knot diagrams with which one computes are diagrams of hyperbolic knots. The…
We propose a spin manipulation technique based entirely on electric fields applied to acceptor states in $p$-type semiconductors with spin-orbit coupling. While interesting in its own right, the technique can also be used to implement…
Models for topological quantum computation are based on braiding and fusing anyons (quasiparticles of fractional statistics) in (2+1)-D. The anyons that can exist in a physical theory are determined by the symmetry group of the Hamiltonian.…
This article surveys the state of the art in quantum computer algorithms, including both black-box and non-black-box results. It is infeasible to detail all the known quantum algorithms, so a representative sample is given. This includes a…
We remove the need to physically transport computational anyons around each other from the implementation of computational gates in topological quantum computing. By using an anyonic analog of quantum state teleportation, we show how the…
A unifying framework for the control of quantum systems with non-Abelian holonomy is presented. It is shown that, from a control theoretic point of view, holonomic quantum computation can be treated as a control system evolving on a…