相关论文: Anyons from non-solvable finite groups are suffici…
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…
The surface code is currently the primary proposed method for performing quantum error correction. However, despite its many advantages, it has no native method to fault-tolerantly apply non-Clifford gates. Additional techniques are…
Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g.…
We construct a braided analogue of the quantum permutation group and show that it is the universal braided compact quantum group acting on a finite space in the category of $\mathbb{Z}/N\mathbb{Z}$-$\textrm{C}^*$-algebras with a twisted…
What additional gates are needed for a set of classical universal gates to do universal quantum computation? We answer this question by proving that any single-qubit real gate suffices, except those that preserve the computational basis.…
Any quantum computational network can be constructed with a sequence of the two-qubit diagonal quantum gates and one-qubit gates in two-state quantum systems. The universal construction of these quantum gates in the quantum systems and of…
Holonomic quantum computation exploits the geometric evolution of eigenspaces of a degenerate Hamiltonian to implement unitary evolution of computational states. In this work we introduce a framework for performing scalable quantum…
Most quantum computing architectures to date natively support multi-valued logic, albeit being typically operated in a binary fashion. Multi-valued, or qudit, quantum processors have access to much richer forms of quantum entanglement,…
We show that universal quantum logic can be achieved using only linear optics and a quantum shutter device. With these elements, we design a quantum memory for any number of qubits and a CNOT gate which are the basis of a universal quantum…
Topological quantum computers provide a fault-tolerant method for performing quantum computation. Topological quantum computers manipulate topological defects with exotic exchange statistics called anyons. The simplest anyon model for…
Fibonacci anyons are attractive for use in topological quantum computation because any unitary transformation of their state space can be approximated arbitrarily accurately by braiding. However there is no known braid that entangles two…
An efficient and intuitive framework for universal quantum computation is presented that uses pairs of spin-1/2 particles to form logical qubits and a single physical interaction, Heisenberg exchange, to produce all gate operations. Only…
A formulation of quantum mechanics based on replacing the general unitary group by finite groups is considered. To solve problems arising in the context of this formulation, we use computer algebra and computational group theory methods.
Geometric manipulation of a quantum system offers a method for fast, universal, and robust quantum information processing. Here, we propose a scheme for universal all-geometric quantum computation using non-adiabatic quantum holonomies. We…
This study presents a roadmap towards utilizing a single arbitrary gate for universal quantum computing. Since two decades ago, it has been widely accepted that almost any single arbitrary gate with qubit number $>2$ is universal. Utilizing…
Fault-tolerant quantum computation is a technique that is necessary to build a scalable quantum computer from noisy physical building blocks. Key for the implementation of fault-tolerant computations is the ability to perform a universal…
Measurement-based quantum computation (MBQC) is a universal platform to realize unitary gates, only using measurements which act on a pre-prepared entangled resource state. By deforming the measurement bases, as well as the geometry of the…
It is shown that a family of analytically solvable pulses can be used to obtain high fidelity quantum phase gates with surprising robustness against imperfections in the system or pulse parameters. Phase gates are important because they can…
We consider interactions that generate a universal set of quantum gates on logical qubits encoded in a collective-dephasing-free subspace, and discuss their implementations with trapped ions. This allows for the removal of the by-far…
This paper provides necessary and sufficient conditions for constructing a universal quantum computer over continuous variables. As an example, it is shown how a universal quantum computer for the amplitudes of the electromagnetic field…